<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source to the Rust file `libcore/future.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>future.rs.html -- source</title><link rel="stylesheet" type="text/css" href="../../normalize.css"><link rel="stylesheet" type="text/css" href="../../rustdoc.css" id="mainThemeStyle"><link rel="stylesheet" type="text/css" href="../../dark.css"><link rel="stylesheet" type="text/css" href="../../light.css" id="themeStyle"><script src="../../storage.js"></script><link rel="shortcut icon" href="https://doc.rust-lang.org/favicon.ico"></head><body class="rustdoc source"><!--[if lte IE 8]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="sidebar-menu">☰</div><a href='../../core/index.html'><img src='https://www.rust-lang.org/logos/rust-logo-128x128-blk-v2.png' alt='logo' width='100'></a></nav><div class="theme-picker"><button id="theme-picker" aria-label="Pick another theme!"><img src="../../brush.svg" width="18" alt="Pick another theme!"></button><div id="theme-choices"></div></div><script src="../../theme.js"></script><nav class="sub"><form class="search-form js-only"><div class="search-container"><input class="search-input" name="search" autocomplete="off" placeholder="Click or press ‘S’ to search, ‘?’ for more options…" type="search"><a id="settings-menu" href="../../settings.html"><img src="../../wheel.svg" width="18" alt="Change settings"></a></div></form></nav><section id="main" class="content"><pre class="line-numbers"><span id="1"> 1</span> <span id="2"> 2</span> <span id="3"> 3</span> <span id="4"> 4</span> <span id="5"> 5</span> <span id="6"> 6</span> <span id="7"> 7</span> <span id="8"> 8</span> <span id="9"> 9</span> <span id="10"> 10</span> <span id="11"> 11</span> <span id="12"> 12</span> <span id="13"> 13</span> <span id="14"> 14</span> <span id="15"> 15</span> <span id="16"> 16</span> <span id="17"> 17</span> <span id="18"> 18</span> <span id="19"> 19</span> <span id="20"> 20</span> <span id="21"> 21</span> <span id="22"> 22</span> <span id="23"> 23</span> <span id="24"> 24</span> <span id="25"> 25</span> <span id="26"> 26</span> <span id="27"> 27</span> <span id="28"> 28</span> <span id="29"> 29</span> <span id="30"> 30</span> <span id="31"> 31</span> <span id="32"> 32</span> <span id="33"> 33</span> <span id="34"> 34</span> <span id="35"> 35</span> <span id="36"> 36</span> <span id="37"> 37</span> <span id="38"> 38</span> <span id="39"> 39</span> <span id="40"> 40</span> <span id="41"> 41</span> <span id="42"> 42</span> <span id="43"> 43</span> <span id="44"> 44</span> <span id="45"> 45</span> <span id="46"> 46</span> <span id="47"> 47</span> <span id="48"> 48</span> <span id="49"> 49</span> <span id="50"> 50</span> <span id="51"> 51</span> <span id="52"> 52</span> <span id="53"> 53</span> <span id="54"> 54</span> <span id="55"> 55</span> <span id="56"> 56</span> <span id="57"> 57</span> <span id="58"> 58</span> <span id="59"> 59</span> <span id="60"> 60</span> <span id="61"> 61</span> <span id="62"> 62</span> <span id="63"> 63</span> <span id="64"> 64</span> <span id="65"> 65</span> <span id="66"> 66</span> <span id="67"> 67</span> <span id="68"> 68</span> <span id="69"> 69</span> <span id="70"> 70</span> <span id="71"> 71</span> <span id="72"> 72</span> <span id="73"> 73</span> <span id="74"> 74</span> <span id="75"> 75</span> <span id="76"> 76</span> <span id="77"> 77</span> <span id="78"> 78</span> <span id="79"> 79</span> <span id="80"> 80</span> <span id="81"> 81</span> <span id="82"> 82</span> <span id="83"> 83</span> <span id="84"> 84</span> <span id="85"> 85</span> <span id="86"> 86</span> <span id="87"> 87</span> <span id="88"> 88</span> <span id="89"> 89</span> <span id="90"> 90</span> <span id="91"> 91</span> <span id="92"> 92</span> <span id="93"> 93</span> <span id="94"> 94</span> <span id="95"> 95</span> <span id="96"> 96</span> <span id="97"> 97</span> <span id="98"> 98</span> <span id="99"> 99</span> <span id="100">100</span> <span id="101">101</span> <span id="102">102</span> <span id="103">103</span> <span id="104">104</span> <span id="105">105</span> <span id="106">106</span> <span id="107">107</span> <span id="108">108</span> <span id="109">109</span> <span id="110">110</span> </pre><pre class="rust "> <span class="comment">// Copyright 2018 The Rust Project Developers. See the COPYRIGHT</span> <span class="comment">// file at the top-level directory of this distribution and at</span> <span class="comment">// http://rust-lang.org/COPYRIGHT.</span> <span class="comment">//</span> <span class="comment">// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license</span> <span class="comment">// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your</span> <span class="comment">// option. This file may not be copied, modified, or distributed</span> <span class="comment">// except according to those terms.</span> <span class="attribute">#![<span class="ident">unstable</span>(<span class="ident">feature</span> <span class="op">=</span> <span class="string">"futures_api"</span>, <span class="ident">reason</span> <span class="op">=</span> <span class="string">"futures in libcore are unstable"</span>, <span class="ident">issue</span> <span class="op">=</span> <span class="string">"50547"</span>)]</span> <span class="doccomment">//! Asynchronous values.</span> <span class="kw">use</span> <span class="ident">mem</span>::<span class="ident">PinMut</span>; <span class="kw">use</span> <span class="ident">marker</span>::<span class="ident">Unpin</span>; <span class="kw">use</span> <span class="ident">task</span>::{<span class="self">self</span>, <span class="ident">Poll</span>}; <span class="doccomment">/// A future represents an asychronous computation.</span> <span class="doccomment">///</span> <span class="doccomment">/// A future is a value that may not have finished computing yet. This kind of</span> <span class="doccomment">/// "asynchronous value" makes it possible for a thread to continue doing useful</span> <span class="doccomment">/// work while it waits for the value to become available.</span> <span class="doccomment">///</span> <span class="doccomment">/// # The `poll` method</span> <span class="doccomment">///</span> <span class="doccomment">/// The core method of future, `poll`, *attempts* to resolve the future into a</span> <span class="doccomment">/// final value. This method does not block if the value is not ready. Instead,</span> <span class="doccomment">/// the current task is scheduled to be woken up when it's possible to make</span> <span class="doccomment">/// further progress by `poll`ing again. The wake up is performed using</span> <span class="doccomment">/// `cx.waker()`, a handle for waking up the current task.</span> <span class="doccomment">///</span> <span class="doccomment">/// When using a future, you generally won't call `poll` directly, but instead</span> <span class="doccomment">/// `await!` the value.</span> <span class="kw">pub</span> <span class="kw">trait</span> <span class="ident">Future</span> { <span class="doccomment">/// The result of the `Future`.</span> <span class="kw">type</span> <span class="ident">Output</span>; <span class="doccomment">/// Attempt to resolve the future to a final value, registering</span> <span class="doccomment">/// the current task for wakeup if the value is not yet available.</span> <span class="doccomment">///</span> <span class="doccomment">/// # Return value</span> <span class="doccomment">///</span> <span class="doccomment">/// This function returns:</span> <span class="doccomment">///</span> <span class="doccomment">/// - `Poll::Pending` if the future is not ready yet</span> <span class="doccomment">/// - `Poll::Ready(val)` with the result `val` of this future if it finished</span> <span class="doccomment">/// successfully.</span> <span class="doccomment">///</span> <span class="doccomment">/// Once a future has finished, clients should not `poll` it again.</span> <span class="doccomment">///</span> <span class="doccomment">/// When a future is not ready yet, `poll` returns</span> <span class="doccomment">/// [`Poll::Pending`](::task::Poll). The future will *also* register the</span> <span class="doccomment">/// interest of the current task in the value being produced. For example,</span> <span class="doccomment">/// if the future represents the availability of data on a socket, then the</span> <span class="doccomment">/// task is recorded so that when data arrives, it is woken up (via</span> <span class="doccomment">/// [`cx.waker()`](::task::Context::waker)). Once a task has been woken up,</span> <span class="doccomment">/// it should attempt to `poll` the future again, which may or may not</span> <span class="doccomment">/// produce a final value.</span> <span class="doccomment">///</span> <span class="doccomment">/// Note that if `Pending` is returned it only means that the *current* task</span> <span class="doccomment">/// (represented by the argument `cx`) will receive a notification. Tasks</span> <span class="doccomment">/// from previous calls to `poll` will *not* receive notifications.</span> <span class="doccomment">///</span> <span class="doccomment">/// # Runtime characteristics</span> <span class="doccomment">///</span> <span class="doccomment">/// Futures alone are *inert*; they must be *actively* `poll`ed to make</span> <span class="doccomment">/// progress, meaning that each time the current task is woken up, it should</span> <span class="doccomment">/// actively re-`poll` pending futures that it still has an interest in.</span> <span class="doccomment">///</span> <span class="doccomment">/// The `poll` function is not called repeatedly in a tight loop for</span> <span class="doccomment">/// futures, but only whenever the future itself is ready, as signaled via</span> <span class="doccomment">/// the `Waker` inside `task::Context`. If you're familiar with the</span> <span class="doccomment">/// `poll(2)` or `select(2)` syscalls on Unix it's worth noting that futures</span> <span class="doccomment">/// typically do *not* suffer the same problems of "all wakeups must poll</span> <span class="doccomment">/// all events"; they are more like `epoll(4)`.</span> <span class="doccomment">///</span> <span class="doccomment">/// An implementation of `poll` should strive to return quickly, and must</span> <span class="doccomment">/// *never* block. Returning quickly prevents unnecessarily clogging up</span> <span class="doccomment">/// threads or event loops. If it is known ahead of time that a call to</span> <span class="doccomment">/// `poll` may end up taking awhile, the work should be offloaded to a</span> <span class="doccomment">/// thread pool (or something similar) to ensure that `poll` can return</span> <span class="doccomment">/// quickly.</span> <span class="doccomment">///</span> <span class="doccomment">/// # Panics</span> <span class="doccomment">///</span> <span class="doccomment">/// Once a future has completed (returned `Ready` from `poll`),</span> <span class="doccomment">/// then any future calls to `poll` may panic, block forever, or otherwise</span> <span class="doccomment">/// cause bad behavior. The `Future` trait itself provides no guarantees</span> <span class="doccomment">/// about the behavior of `poll` after a future has completed.</span> <span class="kw">fn</span> <span class="ident">poll</span>(<span class="self">self</span>: <span class="ident">PinMut</span><span class="op"><</span><span class="self">Self</span><span class="op">></span>, <span class="ident">cx</span>: <span class="kw-2">&</span><span class="kw-2">mut</span> <span class="ident">task</span>::<span class="ident">Context</span>) <span class="op">-></span> <span class="ident">Poll</span><span class="op"><</span><span class="self">Self</span>::<span class="ident">Output</span><span class="op">></span>; } <span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">F</span>: <span class="question-mark">?</span><span class="ident">Sized</span> <span class="op">+</span> <span class="ident">Future</span> <span class="op">+</span> <span class="ident">Unpin</span><span class="op">></span> <span class="ident">Future</span> <span class="kw">for</span> <span class="kw-2">&</span><span class="lifetime">'a</span> <span class="kw-2">mut</span> <span class="ident">F</span> { <span class="kw">type</span> <span class="ident">Output</span> <span class="op">=</span> <span class="ident">F</span>::<span class="ident">Output</span>; <span class="kw">fn</span> <span class="ident">poll</span>(<span class="kw-2">mut</span> <span class="self">self</span>: <span class="ident">PinMut</span><span class="op"><</span><span class="self">Self</span><span class="op">></span>, <span class="ident">cx</span>: <span class="kw-2">&</span><span class="kw-2">mut</span> <span class="ident">task</span>::<span class="ident">Context</span>) <span class="op">-></span> <span class="ident">Poll</span><span class="op"><</span><span class="self">Self</span>::<span class="ident">Output</span><span class="op">></span> { <span class="ident">F</span>::<span class="ident">poll</span>(<span class="ident">PinMut</span>::<span class="ident">new</span>(<span class="kw-2">&</span><span class="kw-2">mut</span> <span class="kw-2">*</span><span class="kw-2">*</span><span class="self">self</span>), <span class="ident">cx</span>) } } <span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">F</span>: <span class="question-mark">?</span><span class="ident">Sized</span> <span class="op">+</span> <span class="ident">Future</span><span class="op">></span> <span class="ident">Future</span> <span class="kw">for</span> <span class="ident">PinMut</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">F</span><span class="op">></span> { <span class="kw">type</span> <span class="ident">Output</span> <span class="op">=</span> <span class="ident">F</span>::<span class="ident">Output</span>; <span class="kw">fn</span> <span class="ident">poll</span>(<span class="kw-2">mut</span> <span class="self">self</span>: <span class="ident">PinMut</span><span class="op"><</span><span class="self">Self</span><span class="op">></span>, <span class="ident">cx</span>: <span class="kw-2">&</span><span class="kw-2">mut</span> <span class="ident">task</span>::<span class="ident">Context</span>) <span class="op">-></span> <span class="ident">Poll</span><span class="op"><</span><span class="self">Self</span>::<span class="ident">Output</span><span class="op">></span> { <span class="ident">F</span>::<span class="ident">poll</span>((<span class="kw-2">*</span><span class="self">self</span>).<span class="ident">reborrow</span>(), <span class="ident">cx</span>) } } </pre> </section><section id="search" class="content hidden"></section><section class="footer"></section><aside id="help" class="hidden"><div><h1 class="hidden">Help</h1><div class="shortcuts"><h2>Keyboard Shortcuts</h2><dl><dt><kbd>?</kbd></dt><dd>Show this help dialog</dd><dt><kbd>S</kbd></dt><dd>Focus the search field</dd><dt><kbd>↑</kbd></dt><dd>Move up in search results</dd><dt><kbd>↓</kbd></dt><dd>Move down in search results</dd><dt><kbd>↹</kbd></dt><dd>Switch tab</dd><dt><kbd>⏎</kbd></dt><dd>Go to active search result</dd><dt><kbd>+</kbd></dt><dd>Expand all sections</dd><dt><kbd>-</kbd></dt><dd>Collapse all sections</dd></dl></div><div class="infos"><h2>Search Tricks</h2><p>Prefix searches with a type followed by a colon (e.g. <code>fn:</code>) to restrict the search to a given type.</p><p>Accepted types are: <code>fn</code>, <code>mod</code>, <code>struct</code>, <code>enum</code>, <code>trait</code>, <code>type</code>, <code>macro</code>, and <code>const</code>.</p><p>Search functions by type signature (e.g. <code>vec -> usize</code> or <code>* -> vec</code>)</p><p>Search multiple things at once by splitting your query with comma (e.g. <code>str,u8</code> or <code>String,struct:Vec,test</code>)</p></div></div></aside><script>window.rootPath = "../../";window.currentCrate = "core";</script><script src="../../aliases.js"></script><script src="../../main.js"></script><script defer src="../../search-index.js"></script></body></html>