72 lines
19 KiB
Plaintext
72 lines
19 KiB
Plaintext
|
!<arch>
|
|||
|
|
#1/12 0 0 0 0 28 `
|
|||
|
|
__.SYMDEF #1/12 0 0 0 644 17924 `
|
|||
|
|
lib.rmeta Ïúíþ ˜ ±D 8 ±D .rmeta __DWARF ±D 8 2 ðE ðE P rust
|
|||
|
|
)C #rustc 1.93.0 (254b59607 2026-01-19)Á³VOÐêùÿ²?ÑL¼�§Ì± -a7a40eb546f9e2b0Á futures_coreÁÍ[D¼ðˆŠIØÅßdt7 -c161af05ee5b6d8fÁ á\ƒ¦è3$|]åŒ[IÚ tæ -14b12edc9f8cd90bÁ ë&Gf·Ã ¬ëñq:¤»b -bb76018b1173caf6Á“õ…·fÊvŠ ¦%g- -c48c539199cbc88bÁ à 9m Ù„«ÐÒþá•c‘B; -030c5b0bba47cc8fÁ rustc_std_workspace_coreÁÛ¹þÓ7>H%¸ÚÉ’› -4b81d37a5530864dÁ üÃùs<Uß7VyóHr#QÏ -c66cc7807550ce25Á miniz_oxideÁõFÖˆÚ™ª‹"ÞXzLVª -62cbc7af83058505Á adler2Á—wÉD‘嵯�|6¨%Œ
|
|||
|
|
+ -2f171dd2394b4b62Á hashbrownÁ,ïcV¼¨ø¢:Ê\'È߈ -9571ba9e0f6c7a90Á rustc_std_workspace_allocÁ%¥Èxµù·¼5Ä3Bœ -aac566ad65903fa4Á
|
|||
|
|
std_detectÁMmáýZ^9õ Îà§e˜÷e -2edb296e590136d8Á rustc_demangleÁ@¼§VÉNb˜æ¨fHÌ+V3 -53b132e4a2fa6e26Á cfg_ifÁfÝv�.Å"ÒÜuPp¹ˆ¶ -f76b385d7d4d7f3eÁ addr2lineÁÕú-WiúQVÓ¬
|
|||
|
|
µT§�5 -fe25100bd73e48e4Á gimliÁ¹xLáÇí÷‘o ±Ñ8£Å -265ba9e6e4f70b3fÁ objectÁÔ³ÝzÓÿ¶ò°öM›¼òü` -9ae0d1f8ea52a318Á memchrÁRÎ÷׎™te~QÓ¿ØC\Ò -0bff3c8e8f4e489eÁ –©H�tGNÏ ·ˆ!á -d69228d077d46f36Á futures_utilÁGæÖ`8ÕÀ³ñõYXh© -8b227c2895cd14a9Á pin_utilsÁ0š/'ÑÖå-ºòÊ mèx -5acf1026789e9a52Á
|
|||
|
|
futures_macroÁ&ùœþ™ÊQmÒqÒŠ€j -9d00c69ae3282ecfÁ futures_taskÁБ�†ŸWôaÖ„g2KA„ -2109b5565a816e7aÁ futures_sinkÁí�©ÈÍ@_Eï°Ø¡ò -18b0577532018ae5Á pin_project_liteÁæÑ#;ËsÌ U}ÍV -40a9b17583c53e9bÁ futures_channelÁuuKû÷brÈüåàW -15bbaff2e3c92011Á slabÁyc›âÂþ?˜4–‡òé¯ -7865db4977a08dc6Á
|
|||
|
|
futures_ioÁ¢Ð0¾/ŠÓ½ƒÐIÀ}7¬L -76c95d1853d1eca9Á ¡lEÝ Ðxm�ÞiXbdQ -215c3907ef89a370Á futures_executorÁä¯'wœý£ Ú¯ ] -74c9e5dddafa7858Á .
|
|||
|
|
ThreadPoolÁT´< ¶<À; thread-poolÁlÊ; ¼À; . ThreadPoolBuilderÁŒÀ< ¶:Î -+- compatÁ4¬= ¶<Ý< �
|
|||
|
|
Dç< ”Ý< ³
|
|||
|
|
|
|||
|
|
! " # $ % & ' ( ) * + executorÁ . ........ â 8 888888888 8
|
|||
|
|
8 8 8
|
|||
|
|
88888888888888.8³ ¤4µ ®Ì TryFutureÁL½ ! FutureExtÁLú © TryFutureExtÁd…! Î StreamÁ4Æ! E
|
|||
|
|
TryStreamÁLÎ! b StreamExtÁL‹" ý
|
|||
|
|
TryStreamExtÁd–" ü SinkÁ$Î"
|
|||
|
|
SinkExtÁ<‚# “) AsyncBufReadÁdË# AsyncReadÁLÙ# AsyncSeekÁLä#
|
|||
|
|
AsyncWriteÁTï# AsyncBufReadExtÁ|½$ ½1 AsyncReadExtÁdÎ$ š1 AsyncSeekExtÁdÜ$ ¸1
|
|||
|
|
AsyncWriteExtÁlê$ «1 readyÁ,¤% „ pin_mutÁ<Ú% selectÁ4±& ç5 joinÁ$ð& ä5 pendingÁ<ö& & Ä $ÿ& !Ä !
|
|||
|
|
select_biasedÁl…' æ5 " try_joinÁD”' å5 #„4é' i %‘ ,ñ' ð) & sinkÁ$ø' Ã% ' streamÁ4þ' ¶
|
|||
|
|
( taskÁ$†( ¼) )
|
|||
|
|
stream_selectÁlÜ( : * channelÁ<°) + lockÁ$ø) Ô1 , ioÁ¼* ò) -ü µK ü . + Abstractions for asynchronous programming.Á / Ë ü3N K This crate provides a number of core abstractions for writing asynchronousÁ L‚ code:Á Œ Ë ü�E B - [Futures](crate::future) are single eventual values produced byÁ üÖM J asynchronous computations. Some programming languages (e.g. JavaScript)Á ü¤" call this concept "promise".Á üÇ; 8 - [Streams](crate::stream) represent a series of valuesÁ ôƒ produced asynchronously.Á ü¢F C - [Sinks](crate::sink) provide support for asynchronous writing ofÁ \é data.Á üõK H - [Executors](crate::executor) are responsible for running asynchronousÁ dÁ tasks.Á Î Ë üÒN K The crate also contains abstractions for [asynchronous I/O](crate::io) andÁ ü¡/ , [cross-task communication](crate::channel).Á Ñ Ë üÕO L Underlying all of this is the *task system*, which is a form of lightweightÁ ü¥J G threading. Large asynchronous computations are built up using futures,Á üðL I streams and sinks, and then spawned as independent tasks that are run toÁ ü½; 8 completion, but *do not block* the thread running them.Á ù Ë üýQ N The following example describes how the task system context is built and usedÁ üÏ8 5 within macros and keywords such as async and await!.Á ˆ Ë \Œ ```rustÁ ü˜ ! # use futures::channel::mpsc;Á üº _ \ # use futures::executor; ///standard executors to provide a context for futures and streamsÁ üš
|
|||
|
|
( % # use futures::executor::ThreadPool;Á ìÃ
|
|||
|
|
# use futures::StreamExt;Á ,á
|
|||
|
|
#Á |ç
|
|||
|
|
fn main() {Á \÷
|
|||
|
|
# {Á üƒ D A let pool = ThreadPool::new().expect("Failed to build pool");Á üÈ 0 - let (tx, rx) = mpsc::unbounded::<i32>();Á ù Ë üý O L // Create a future by an async block, where async is responsible for anÁ üÍ P M // implementation of Future. At this point no executor has been providedÁ üž
|
|||
|
|
5 2 // to this future, so it will not be running.Á üÔ
|
|||
|
|
let fut_values = async {Á üõ
|
|||
|
|
P M // Create another async block, again where the Future implementationÁ üÆS P // is generated by async. Since this is inside of a parent async block,Á üšX U // it will be provided with the executor of the parent block when the parentÁ üó! // block is executed.Á t• //Á ü¤S P // This executor chaining is done by Future::poll whose second argumentÁ üøT Q // is a std::task::Context. This represents our executor, and the FutureÁ üÍS P // implemented by this async block can be polled using the parent asyncÁ ü¡ // block's executor.Á üÂ, ) let fut_tx_result = async move {Á üï' $ (0..100).for_each(|v| {Á ü—B ? tx.unbounded_send(v).expect("Failed to send");Á ”Ú })Á tí };Á ü Ë ü€I F // Use the provided thread pool to spawn the generated futureÁ üÊ+ ( // responsible for transmissionÁ üö) & pool.spawn_ok(fut_tx_result);Á Ë ü¤ let fut_values = rxÁ üÄ .map(|v| v * 2)Á Üä .collect();Á € Ë ü„L I // Use the executor provided to this async block to wait for theÁ üÑ" // future to complete.Á äô fut_values.awaitÁ T‘ };Á œ Ë ü P M // Actually execute the above future, which will invoke Future::poll andÁ üñT Q // subsequently chain appropriate Future::poll and methods needing executorsÁ üÆT Q // to drive all futures. Eventually fut_values will be driven to completion.Á ü›> ; let values: Vec<i32> = executor::block_on(fut_values);Á Ú Ë üÞ( % println!("Values={:?}", values);Á \‡ # }Á ü“™ – # std::thread::sleep(std::time::Duration::from_millis(500)); // wait for background threads closed: https://github.com/rust-lang/miri/issues/1371Á , }Á <³ ```Á » Ë ü¿Q N The majority of examples and code snippets in this crate assume that they areÁ ü‘ + ( inside an async block as written above.Á¡ Ì Ï û 8à $Ð Ô ú 8¬ |Ú $ é 8Î $ï ó ø 8þ $ý � ² 8 warningsÁ D‚ $ Š 8 rust_2018_idiomsÁ „Œ $ œ 8 single_use_lifetimesÁ ¤ž $ ³ 8è ,½  ò 8á Là $ Ì 8 unused_assignmentsÁ ”Î $ à 8 unused_variablesÁ „â üÉ ´ .8³ ¤+ ®Ì »F ! Ô_ © î| Î ‹“ E
|
|||
|
|
¡¬ b ºÅ ý
|
|||
|
|
Ôâ ü ñ÷
|
|||
|
|
… “) �+ ¹D Ò] ëw …– ½1 ¥³ š1 ÂÐ ¸1 ßî «1 ý
|
|||
|
|
„ ”
|
|||
|
|
¬4
|
|||
|
|
ç5 ÄJ
|
|||
|
|
ä5 Úc
|
|||
|
|
& Ä t
|
|||
|
|
!Ä t
|
|||
|
|
!‘
|
|||
|
|
æ5 "°º
|
|||
|
|
å5 #„Ì
|
|||
|
|
i %‘ Ü
|
|||
|
|
ð) &ëñ
|
|||
|
|
Ã% '€ ¶
|
|||
|
|
(— ¼) )¬; : *ÊS +ág Ô1 ,öz ò) -üž ) ++FFüã / __||ü¯!) ““¬¬üô!/ ÅÅââ”À" ÷Üî" ü¾#< + + D D ] ] w w ü®$J – – ³ ³ Ð Ð î î œ–%
|
|||
|
|
¬Ì%
|
|||
|
|
¤£& 4
|
|||
|
|
üá&< J
|
|||
|
|
J
|
|||
|
|
c
|
|||
|
|
c
|
|||
|
|
t
|
|||
|
|
t
|
|||
|
|
|
|||
|
|
|
|||
|
|
º
|
|||
|
|
º
|
|||
|
|
üÚ'1 Ì
|
|||
|
|
Ì
|
|||
|
|
Ü
|
|||
|
|
Ü
|
|||
|
|
ñ
|
|||
|
|
ñ
|
|||
|
|
ÜÎ( ; |�) S ”ê) g „®* z „’+ » Ã* Æ* Û* 8¶ <Ç* Ï* 7ð TÑ* äÁ* ü©+) & Built-in executors and related tools.Á ×+ Ë üß+D A All asynchronous computation occurs within an executor, which isÁ ü¨,F C capable of spawning futures as tasks. This module provides severalÁ üó,? < built-in executors, as well as tools for building your own.Á ·- Ë ¿- Ë üÇ-E B This module is only available when the `executor` feature of thisÁ Ì‘. library is activated.Á ¯. Ë ü·./ , # Using a thread pool (M:N task scheduling)Á ë. Ë üó.M J Most of the time tasks should be executed on a [thread pool](ThreadPool).Á üÅ/N K A small set of worker threads can handle a very large set of spawned tasksÁ ü˜0M J (which are much lighter weight than threads). Tasks spawned onto the poolÁ üê0N K with the [`spawn_ok`](ThreadPool::spawn_ok) function will run ambiently onÁ Ľ1 the created threads.Á Ú1 Ë üâ1 # Spawning additional tasksÁ †2 Ë üŽ2K H Tasks can be spawned onto a spawner by calling its [`spawn_obj`] methodÁ üÞ2M J directly. In the case of `!Send` futures, [`spawn_local_obj`] can be usedÁ d°3 instead.Á Á3 Ë üÉ3 # Single-threaded executionÁ í3 Ë üõ3K H In addition to thread pools, it's possible to run a task (and the tasksÁ üÅ4N K it spawns) entirely within a single thread via the [`LocalPool`] executor.Á ü˜5N K Aside from cutting down on synchronization costs, this executor also makesÁ üë5G D it possible to spawn non-`Send` tasks, via [`spawn_local_obj`]. TheÁ ü·6O L [`LocalPool`] is best suited for running I/O-bound tasks that do relativelyÁ ü‹7' $ little work between I/O operations.Á ·7 Ë ü¿7J G There is also a convenience function [`block_on`] for simply running aÁ üŽ8/ , future to completion on the current thread.Á Â8 Ë üÊ8_ \ [`spawn_obj`]: https://docs.rs/futures/0.3/futures/task/trait.Spawn.html#tymethod.spawn_objÁ ü®9p m [`spawn_local_obj`]: https://docs.rs/futures/0.3/futures/task/trait.LocalSpawn.html#tymethod.spawn_local_objÁ Dš+ block_onÁDÈ: C 0 block_on_streamÁ|Ò: F 1 enterÁ,ã: o 2 BlockingStreamÁtê: Œ 3 EnterÁ,ú: f 4
|
|||
|
|
EnterErrorÁT�; h 5 LocalPoolÁL�; z 6 LocalSpawnerÁd ; 7ü¬:‡ Ê̯±ž „†rt\^GI/1|àA üöA5 2 A "prelude" for crates using the `futures` crate.Á °B Ë ü¸BL I This prelude is similar to the standard library's prelude in that you'llÁ ü‰CD A almost always want to import its entire contents, but unlike theÁ üÒC= : standard library's prelude you'll have to do so manually:Á ”D Ë <œD ›7 ô¨D # #[allow(unused_imports)]Á äËD use futures::prelude::*;Á <ìD ›7 øD Ë ü€EJ G The prelude may grow over time as additional items see ubiquitous use.Á <èA „$èE i : %¤4îE ®Ì ;»LöE ! <ë$œF Ã% > 'ñ$¢F
|
|||
|
|
?€$ÅF ¶
|
|||
|
|
A (‹4ËF E B¡LÓF b C�dºI L¹LÈI MÒLÓI NëTÞI O ½G © E ÐG Î F ŽH “) G îH ý I �I ü J ðJ ½1 Q ƒK š1 R –K ¸1 S ªK «1 TüØE( _4ßE SVGJÌŽF A$•F 47üµF( /4¼F "%ü G2 L°G ØdÀG ΤöG ÄüÑH2 LáH ¿dñH µü®I; ;>14'* üÈJj |ÝJ ÍdóJ Ãd†K ¹l™K ¯' crate::sinkÁ ExecutorsÁ crate::executorÁ . asynchronous I/OÁ crate::ioÁ cross-task communicationÁ FuturesÁ crate::channelÁ
|
|||
|
|
crate::futureÁ StreamsÁ
|
|||
|
|
crate::streamÁ ¶
|