117 lines
40 KiB
Plaintext
117 lines
40 KiB
Plaintext
|
rust
|
|||
|
|
\œ #rustc 1.96.0 (ac68faa20 2026-05-25)ÁíàÄTËŸ ÜJîÄ)'ß\¥! -3d1337db07d0b3aeÁ ¤²XctÔ'ÐÓ©z¨É½Ó -a4945860e1c53b00Á ¤°ð ¾ä-±($²ï=©Ã -7e98a21bfd32b0edÁÀ뉊 ]!ÜÛê(¹Þ—šên -5be7b69c3ff7b5b8Á –�òÖÀ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Á crossbeam_utilsÁшce¡ B.^ ~¶-ÕX -3fc97031a65be933Á í ¤ À array_queueÁ
|
|||
|
|
|
|||
|
|
SlotÁ ¥ stampÁ »
|
|||
|
|
ArrayQueueÁ ¥ headÁ tailÁ bufferÁ capÁ one_lapÁ !¥ #¥ %¥ '¥ )¥ )æ + ) push_or_elseÁ -— ) pushÁ / )
|
|||
|
|
force_pushÁ 1 ) popÁ ) capacityÁ ) is_emptyÁ ) is_fullÁ )‘ 8¥ 8ã ;¥ ;× >¥ >› > IntoIterÁ >ê C¥ C› Có seg_queueÁ G GGGGGGGGG G
|
|||
|
|
G G G
|
|||
|
|
GGGGGGGG WRITEÁ G READÁ G DESTROYÁ G LAPÁ G BLOCK_CAPÁ G SHIFTÁ G HAS_NEXTÁ Gí d¥ d» dº G h¥ h
|
|||
|
|
wait_writeÁ G BlockÁ k¥ kó k slotsÁ n Gp¥ p LAYOUTÁ pæ p wait_nextÁ p destroyÁ G PositionÁ v¥ vÖ v¸ G SegQueueÁ z¥ zª zµ z _markerÁ G¥ G�¥ Gƒ¥ G…¥ G‡¥ ‡æ ‡Á
|
|||
|
|
‡å
|
|||
|
|
‡þ
|
|||
|
|
‡‘ GŽ¥ Žã G‘¥ ‘× G ”¥ ”> G
|
|||
|
|
—¥ —› —Ø —ê G œ¥ œ› œó Ø £¥ £» ¦¥ ¦× GØ ©¥ ©» G ¬¥ ¬× -
|
|||
|
|
-
|
|||
|
|
/
|
|||
|
|
1
|
|||
|
|
3
|
|||
|
|
4
|
|||
|
|
5
|
|||
|
|
6
|
|||
|
|
7
|
|||
|
|
:
|
|||
|
|
=
|
|||
|
|
=
|
|||
|
|
=
|
|||
|
|
F
|
|||
|
|
j
|
|||
|
|
t
|
|||
|
|
Š
|
|||
|
|
‹
|
|||
|
|
Œ
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
“
|
|||
|
|
“
|
|||
|
|
“
|
|||
|
|
Ÿ
|
|||
|
|
¨
|
|||
|
|
¨
|
|||
|
|
¨
|
|||
|
|
®
|
|||
|
|
®
|
|||
|
|
®
|
|||
|
|
� ’ ª µ À Í × ”v |5:” ¥ Ìì† «½† ¬½† Œ"† ¿c† ÇL† ¿c £ £ Ø ¥» ÒF�æ8}ˆVØ ùM¤ Ìì z z ˆ |ª G }µ G ~¬ G 1e"ù!8Ø � æ «½æ ¬½æ Œ"æ ¿cæ ³ æ ÇLæ ¿c © © Ø «» G :g¬ ÌOØ ùMö ! � z# z% ƒ z' … z8 Ž z; ¦ £‘ z¬ ©> — zC £œ ©” z� mÌì «½
|
|||
|
|
¬½ Œ" ¿c ÇLùM ³
|
|||
|
|
1Á Ú 2Á Ú 4Á Ú 32Á<œ œ ` Ú ¢ Ú . 1 ` Ú/ Ú \ Ú üƒ! a Ú ,” Ú ” .” ` Úž ` Ú _Á Ú 1Á Ú 1ÁL¿
|
|||
|
|
a Ú o $ Ú / 6: a Ú BLOCK_CAPÁ 4Š
|
|||
|
|
¬“
|
|||
|
|
|
|||
|
|
œ“
|
|||
|
|
|
|||
|
|
Ë‚ k k ý
|
|||
|
|
mó G n— G ½Çͧ¢±Ø Z ø'²
|
|||
|
|
ӂ
|
|||
|
|
lÇ
|
|||
|
|
4Ç
|
|||
|
|
|
|||
|
|
#$Î
|
|||
|
|
|
|||
|
|
È‚ 1 4Î
|
|||
|
|
Ó
|
|||
|
|
W Ø
|
|||
|
|
Ú y $ '± '° 4» Æ üå ã m ù)�@# ù*ž"#
|
|||
|
|
ù<ž"#
|
|||
|
|
¶c üç
|
|||
|
|
@ > A P
|
|||
|
|
Wá)�#
|
|||
|
|
ÜW c u r � ü†
|
|||
|
|
Á èØèØ éØ™²‚ êØŸ²‚ ªë¥CHÈ 4ó Á ! ö à À Ú À Á à ù)Üì# äÈäÈ ArgumentsÁ æÈ templateÁ ` çÈÀ ` üöMõô]Td [ layoutÁ½ � _Á üÒ*Ž üã*| ü…+ |”+
|
|||
|
|
l”+
|
|||
|
|
²Ž * 7
|
|||
|
|
> t…+
|
|||
|
|
Ò]Ž N _ £+ œ½+
|
|||
|
|
„½+
|
|||
|
|
ŒÄ Î+ Ú > ¶ v Ø Þ+ ç
|
|||
|
|
î „Ò*
|
|||
|
|
¨ v v ä xÖ G y¸ G ¡ó]±/u}
|
|||
|
|
Ø 1 D ß+ üô+Ž ü…,| ü§, |¶,
|
|||
|
|
l¶, û! $ 1
|
|||
|
|
8 t§, ¢" B S Å, œß,
|
|||
|
|
|
|||
|
|
„ß, Ý" ð, Ú
|
|||
|
|
: ¦ v Ø
|
|||
|
|
€-
|
|||
|
|
×
|
|||
|
|
Þ „ô+ ¿# ç ù �- \™- • Ø üµ*ú z Ø ®- µ- ‰ ü‰*¬ æ \Ÿ* —— CachePaddedÁ ™»� (BP:®YöBÅ#
|
|||
|
|
Å# ¤]¤] V ¦]Á‚] üß3ø¤”& Ž 6 ˆ( 5 ¤]¤] V ¦]Á‚] üß3ø¤”&Ú ‘' = Å# ; Û' : ˆ( 9 š( ë • • – PhantomDataÁ Fu\»ŸØ ‘ 7 Gí ¤,‹ À · ’ T© ¡ˆDÀ z ¢ü Ê ´ Concurrent queues.Á ú üK H This crate provides concurrent queues that can be shared among threads:Á gú ükb _ * [`ArrayQueue`], a bounded MPMC queue that allocates a fixed-capacity buffer on construction.Á üÎ^ [ * [`SegQueue`], an unbounded MPMC queue that allocates small buffers, segments, on demand.Á üí ü—6|Ê Gíà ¤á Àà ’ ß ¡ˆÞ z ¢036”þ-„ª"|÷ »¤ŒÇóµ ÌÚüÆ.ü½9 \û £ BoxÁ Á �
|
|||
|
|
UnsafeCellÁTÖ î0 × ì ` í$� ë
|
|||
|
|
MaybeUninitÁ\‡ ÑÛ
|
|||
|
|
RefUnwindSafeÁl§ ¬½
|
|||
|
|
|
|||
|
|
UnwindSafeÁT¶ «½ atomicÁ$Ü ‚] AtomicUsizeÁ\â „Ä ®Dï ¼À BackoffÁ<‘ Á ›&\š — Œ³.´ÊLæ Lõ ûéë\™ÐÒ¶¸”Ǥ4ÓŒŽ|~|ÿikZ\tÀ $Ç ¥ ÍìØ Ì í ÿ » 5T÷WÏieØ 5T÷WÏie QS ”‚,‚ š(ü»!,» î0î0 Ù- ð0»Ì- ·}—KEüC£ÑÛÑÛ œ. ÓÛ uninitÁÝ ÔÛ»Ý Íõƒ«%9ØÄ’ üá2 / A bounded multi-producer multi-consumer queue.Á ”ú ü˜_ \ This queue allocates a fixed-capacity buffer on construction, which is used to store pushedÁ üø_ \ elements. The queue cannot hold more elements than the buffer allows. Attempting to push anÁ üØ\ Y element into a full queue will fail. Alternatively, [`force_push`] makes it possible forÁ üµ^ [ this queue to be used as a ring-buffer. Having a buffer allocated upfront makes this queueÁ ü” # a bit faster than [`SegQueue`].Á ¸ ú ü¼ * ' [`force_push`]: ArrayQueue::force_pushÁ üç ! [`SegQueue`]: super::SegQueueÁ ‰
|
|||
|
|
ú t�
|
|||
|
|
# ExamplesÁ œ
|
|||
|
|
ú <
|
|||
|
|
```Á ü¨
|
|||
|
|
$ ! use crossbeam_queue::ArrayQueue;Á Í
|
|||
|
|
ú üÑ
|
|||
|
|
let q = ArrayQueue::new(2);Á ñ
|
|||
|
|
ú üõ
|
|||
|
|
$ ! assert_eq!(q.push('a'), Ok(()));Á üš $ ! assert_eq!(q.push('b'), Ok(()));Á ü¿ & # assert_eq!(q.push('c'), Err('c'));Á üæ # assert_eq!(q.pop(), Some('a'));Á <Š ¬8 T� ¥ ã1 ¨ † ”v |5:” :"$ ôà$à —— ›& ™»� (BP:®YöBš(ô´$´ Ë<´û4û �� žÃ- ¡ˆˆ ¢‰ˆ l }.xÏ
|
|||
|
|
ò1çEçEèE GlobalÁ ¿±‡§í# T´ ´ Útÿ<ÿ Úü’+ ¥ " " ã1 ž ÌìØ $¡† üÁ+ ¥ $ $ ã1 Í ë>$І üñ$ ¥ & & ã1 ö† ü™' ¥ ( ( ã1 ž† ¬Å ¥ * * ã1 ʆ+-/134567 ü€' üá8 5 Creates a new bounded queue with the given capacity.Á žú d¦ # PanicsÁ ·ú ü¿# Panics if the capacity is zero.Á çú tï‰8 ‚ú <Š¬8 ü–$½8 ¿ú üÇ( % let q = ArrayQueue::<i32>::new(100);Á <ô¬8 ‡ Ú† ) )
|
|||
|
|
+ØÍ ‹ ’ + <closure_kind>Á , <closure_signature>Á , <upvars>Á , , + ,Ø Úò1 ö üî ‚dñ ° °† Ø—Ö¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
ö Ø )— . . � ) Íì�E þ ¯ �"�EØÚÚ ¯ò1 ü - ¯ �E¨F˜" Ö¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
ØØdã
|
|||
|
|
-Ø�E$‚ »,Œ ± – ¹» ü¯4- üÂ1/ , Attempts to push an element into the queue.Á ö1ú üþ1C @ If the queue is full, the element is returned back as an error.Á Æ2ú tÎ2‰8 á2ú <é2¬8 üõ2$½8 ž3ú ü¦3 let q = ArrayQueue::new(1);Á Ê3ú üÒ3# assert_eq!(q.push(10), Ok(()));Á üú3$ ! assert_eq!(q.push(20), Err(20));Á <£4¬8$¶4 ± ±† Ø•E ) »4 )
|
|||
|
|
/Ø$¼4»,Â4|€5 /ðB 0 ˆC 0 ¥C 0 0 / 0Ø ØÚÚ ò1 ÕF † üò;/ üÝ7P M Pushes an element into the queue, replacing the oldest element if necessary.Á ²8ú üº8F C If the queue is full, the oldest element is replaced and returned,Á ü…9! otherwise `None` is returned.Á «9ú t³9‰8 Æ9ú <Î9¬8 üÚ9$½8 ƒ:ú ü‹: ÷8 ¯:ú ü·:' $ assert_eq!(q.force_push(10), None);Á üã:' $ assert_eq!(q.force_push(20), None);Á ü�;+ ( assert_eq!(q.force_push(30), Some(10));Á ü¿;" assert_eq!(q.pop(), Some(20));Á <æ;¬8Tù; ² ²† Øۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙØ ) „< )
|
|||
|
|
1Ø$…<»,‹<ÌÅ< 1ðB 2 ˆC 2 ¥C 2 2 1 2ØûKþKšLôïE üöB. + Attempts to pop an element from the queue.Á ©Cú ü±C. + If the queue is empty, `None` is returned.Á äCú tìC‰8 ÿCú <‡D¬8 ü“D$½8 ¼Dú üÄD ÅH üèD#úH �Eú ü˜E" assert_eq!(q.pop(), Some(10));Á ü¿E assert!(q.pop().is_none());Á <ãE¬8 öE ³ ³† æP ) úE )
|
|||
|
|
3Ø$ûEü‚[ ü�Y& # Returns the capacity of the queue.Á ºYú tÂY‰8 ÕYú <ÝY¬8 üéY$½8 ’Zú üšZ(ãA ÇZú üÏZ" assert_eq!(q.capacity(), 100);Á <öZ¬8D‰[ ´ ´† Ú ) ’[ )
|
|||
|
|
4Ø$“[ôã] üÀ[) & Returns `true` if the queue is empty.Á î[ú tö[‰8 ‰\ú <‘\¬8 ü�\$½8 Æ\ú üÎ\! let q = ArrayQueue::new(100);Á ô\ú Ôü\ assert!(q.is_empty());Á ¼›] q.push(1).unwrap();Á Ü·] assert!(!q.is_empty());Á <×]¬8Dê] µ µ† ) ó] )
|
|||
|
|
5Ø$ô]ìÈc üªa( % Returns `true` if the queue is full.Á ×aú tßa‰8 òaú <úa¬8 ü†b$½8 ¯bú ü·b ÅH Ûbú Ôãb assert!(!q.is_full());Á ¼‚cËX Ìžc assert!(q.is_full());Á <¼c¬8<Ïc ¶ ¶† ) ×c )
|
|||
|
|
6Ø$ØcÔíi üüf0 - Returns the number of elements in the queue.Á ±g
|
|||
|
|
` £c bufÁ ` àB¤GS
|