75 lines
19 KiB
Plaintext
75 lines
19 KiB
Plaintext
|
!<arch>
|
|||
|
|
/ 0 0 0 0 8 `
|
|||
|
|
// 64 `
|
|||
|
|
futures-27e2cfae11c3b37a.futures.fd70aea862240939-cgu.0.rcgu.o/
|
|||
|
|
lib.rmeta/ 0 0 0 644 18064 `
|
|||
|
|
ELF · E @ @ GNU À rust
|
|||
|
|
ÍB #rustc 1.96.0 (ac68faa20 2026-05-25)ÁíàÄTËŸ ÜJîÄ)'ß\¥! -3d1337db07d0b3aeÁ futures_coreÁÔ #0€ŒlÏ/œ%áàæ! -54e00c79609f6de3Á ¤²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Á futures_utilÁ}h"g�œ«ì�j¾<G -a74bc5f08cd6c96fÁ
|
|||
|
|
futures_macroÁboÆ$¾É æðGô} -cbbe8d74ceaf6376Á futures_taskÁ+ÓÅfÐ4–Pú{-¸*1¨ -dcd8a3e2825c89abÁ futures_sinkÁݬwÞÚ7Žª _°à\ -005b1f0a7b5abe4aÁ pin_project_liteÁc:ž“èqPÔ² låî -fa08336265b0d278Á futures_channelÁ¿êû„ñ’ .ì�óÓ¹„ -89600126d4fe9190Á slabÁ˜ìòͺܓ$® %ãÕ6 -940e9d610b73c48bÁ
|
|||
|
|
futures_ioÁ�µ ] óŽe_a€FµwBM -52cc55b2510d5c5fÁ ¡46¯�¦ŒïõÅ’Z/¯ -a454f505f30bc1f2Á futures_executorÁ«ŠôÆ°âqφj¨Eøhý -a25816c8b7e66e5cÁ .
|
|||
|
|
ThreadPoolÁT´< » thread-poolÁ¼À; . ThreadPoolBuilderÁŒÀ< »˜ ') compatÁ4¬= »Ò ”Ý< í
|
|||
|
|
|
|||
|
|
! " # $ % & ' ( ) * + executorÁ . ........ ¥ 8 888888888 8
|
|||
|
|
8 8 8
|
|||
|
|
88888888888888.8í FutureÁ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Á<Ú% Ö5 selectÁ4±& â5 joinÁ$ð& ß5 pendingÁ<ö& % Š $ÿ& !Š !
|
|||
|
|
select_biasedÁl…' á5 " try_joinÁD”' à5 # futureÁ4é' h %â ,ñ' ù) & sinkÁ$ø' Ã% ' streamÁ4þ' ¶
|
|||
|
|
( taskÁ$†( Å) )
|
|||
|
|
stream_selectÁlÜ( 9 * 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.Á üý 6 ü½ 6 |Ú .8íÕ ãë ‚Ø û ! ” © ®< Î ËS E
|
|||
|
|
ál b ú… ý
|
|||
|
|
”¢ û ±·
|
|||
|
|
ÅÎ œ) Ýë ù ’ «7 ÅV Ä1 ås ¡1 ‚� ¿1 Ÿ® ²1 ½Ä „ ÔÝ Ö5 íõ â5 …
|
|||
|
|
ß5 ›$
|
|||
|
|
% Š 5
|
|||
|
|
!Š 5
|
|||
|
|
!Òa
|
|||
|
|
á5 "ñ{
|
|||
|
|
à5 #‹“
|
|||
|
|
h %â £
|
|||
|
|
ù) &²¸
|
|||
|
|
Ã% 'ÇÏ
|
|||
|
|
¶
|
|||
|
|
(Þä
|
|||
|
|
Å) )ó 9 *‘ +¨. Û1 ,½A û) -ÕÕÕ¤ž ëë¤ã <<¤¯! SSll¤ô! ……¢¢”À" ·Üî" ÎT¾# ëë 7 7 d®$ V V s s � � ® ® œ–% Ä ¬Ì% Ý ¤£& õ dá&
|
|||
|
|
|
|||
|
|
$
|
|||
|
|
$
|
|||
|
|
5
|
|||
|
|
5
|
|||
|
|
a
|
|||
|
|
a
|
|||
|
|
{
|
|||
|
|
{
|
|||
|
|
dÚ' “
|
|||
|
|
“
|
|||
|
|
£
|
|||
|
|
£
|
|||
|
|
¸
|
|||
|
|
¸
|
|||
|
|
Ï
|
|||
|
|
Ï
|
|||
|
|
ä
|
|||
|
|
ä
|
|||
|
|
ÜÎ( |�) ”ê) . „®* A „’+ ü©+) & 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„¬: Èʯœž‚„prZ\EG-/|à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 h :ã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 TlØE U4ßE LO@C\ŽF :$•F 03lµF *4¼F #l G L°G ÕdÀG ˤöG ÁlÑH LáH »dñH ±L®I 69,/"%LÈJ |ÝJ ÇdóJ ½d†K ³l™K ©' StreamsÁ
|
|||
|
|
crate::streamÁ SinksÁ crate::sinkÁ ExecutorsÁ crate::executorÁ . asynchronous I/OÁ crate::ioÁ FuturesÁ cross-task communicationÁ crate::channelÁ
|
|||
|
|
crate::futureÁ ‘Z �Z ¶
|
|||
|
|
¯Z ¹Z ÉZ ×Z ïZ ˆ[ û)¢[ –[ Ò[ ‘Z ¿[ �Z ¯Z ¹Z Ã%ÉZ ×Z ïZ ˆ[ ¢[ –[ Ò[ h¿[ spawn_objÁ 9https://docs.rs/futures/0.3/futures/task/trait.Spawn.htmlÁ spawn_local_objÁ >https://docs.rs/futures/0.3/futures/task/trait.LocalSpawn.htmlÁ µQ z‚ thread poolÁ spawn_okÁ ThreadPool::spawn_okÁ €] Ž] ›P Ì] à] µQ ±^ ‚ Á^ Î^ €] ›P CŽ] Ì] à] µQ ±^ ‚ Á^ ›P Î^ ‚Ø!©ÎEbýû
|