<!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 `map_model/src/objects/zone.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>zone.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="../../../light.css" id="themeStyle"><link rel="stylesheet" type="text/css" href="../../../dark.css" disabled ><link rel="stylesheet" type="text/css" href="../../../ayu.css" disabled ><script src="../../../storage.js"></script><noscript><link rel="stylesheet" href="../../../noscript.css"></noscript><link rel="shortcut icon" href="../../../favicon.ico"><style type="text/css">#crate-search{background-image:url("../../../down-arrow.svg");}</style></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='../../../map_model/index.html'><div class='logo-container rust-logo'><img src='../../../rust-logo.png' alt='logo'></div></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"><div class="search-container"><div><select id="crate-search"><option value="All crates">All crates</option></select><input class="search-input" name="search" disabled autocomplete="off" spellcheck="false" placeholder="Click or press ‘S’ to search, ‘?’ for more options…" type="search"></div><span class="help-button">?</span> <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> <span id="111">111</span> <span id="112">112</span> <span id="113">113</span> <span id="114">114</span> <span id="115">115</span> <span id="116">116</span> <span id="117">117</span> <span id="118">118</span> <span id="119">119</span> <span id="120">120</span> <span id="121">121</span> <span id="122">122</span> <span id="123">123</span> <span id="124">124</span> <span id="125">125</span> <span id="126">126</span> <span id="127">127</span> <span id="128">128</span> <span id="129">129</span> <span id="130">130</span> <span id="131">131</span> <span id="132">132</span> <span id="133">133</span> <span id="134">134</span> <span id="135">135</span> <span id="136">136</span> <span id="137">137</span> <span id="138">138</span> <span id="139">139</span> <span id="140">140</span> <span id="141">141</span> <span id="142">142</span> <span id="143">143</span> <span id="144">144</span> <span id="145">145</span> <span id="146">146</span> <span id="147">147</span> <span id="148">148</span> <span id="149">149</span> <span id="150">150</span> <span id="151">151</span> <span id="152">152</span> <span id="153">153</span> <span id="154">154</span> <span id="155">155</span> <span id="156">156</span> <span id="157">157</span> <span id="158">158</span> <span id="159">159</span> <span id="160">160</span> <span id="161">161</span> <span id="162">162</span> <span id="163">163</span> <span id="164">164</span> <span id="165">165</span> <span id="166">166</span> <span id="167">167</span> <span id="168">168</span> <span id="169">169</span> <span id="170">170</span> <span id="171">171</span> <span id="172">172</span> <span id="173">173</span> <span id="174">174</span> <span id="175">175</span> <span id="176">176</span> <span id="177">177</span> <span id="178">178</span> </pre><div class="example-wrap"><pre class="rust "> <span class="doccomment">//! Zones and AccessRestrictions are used to model things like:</span> <span class="doccomment">//! 1) gated communities, where only trips beginning or ending at a building in the neighborhood may</span> <span class="doccomment">//! use any of the private roads</span> <span class="doccomment">//! 2) Stay Healthy Streets, where most car traffic is banned, except for trips beginning/ending in</span> <span class="doccomment">//! the zone</span> <span class="doccomment">//! 3) Congestion capping, where only so many cars per hour can enter the zone</span> <span class="kw">use</span> <span class="ident">std</span>::<span class="ident">collections</span>::<span class="ident">BTreeSet</span>; <span class="kw">use</span> <span class="ident">enumset</span>::<span class="ident">EnumSet</span>; <span class="kw">use</span> <span class="ident">petgraph</span>::<span class="ident">graphmap</span>::<span class="ident">DiGraphMap</span>; <span class="kw">use</span> <span class="ident">serde</span>::{<span class="ident">Deserialize</span>, <span class="ident">Serialize</span>}; <span class="kw">use</span> <span class="kw">crate</span>::<span class="ident">pathfind</span>::{<span class="ident">driving_cost</span>, <span class="ident">walking_cost</span>, <span class="ident">WalkingNode</span>}; <span class="kw">use</span> <span class="kw">crate</span>::{ <span class="ident">IntersectionID</span>, <span class="ident">LaneID</span>, <span class="ident">Map</span>, <span class="ident">Path</span>, <span class="ident">PathConstraints</span>, <span class="ident">PathRequest</span>, <span class="ident">PathStep</span>, <span class="ident">RoadID</span>, <span class="ident">TurnID</span>, }; <span class="attribute">#[<span class="ident">derive</span>(<span class="ident">Serialize</span>, <span class="ident">Deserialize</span>, <span class="ident">Debug</span>, <span class="ident">PartialEq</span>, <span class="ident">Clone</span>)]</span> <span class="kw">pub</span> <span class="kw">struct</span> <span class="ident">AccessRestrictions</span> { <span class="kw">pub</span> <span class="ident">allow_through_traffic</span>: <span class="ident">EnumSet</span><span class="op"><</span><span class="ident">PathConstraints</span><span class="op">></span>, <span class="kw">pub</span> <span class="ident">cap_vehicles_per_hour</span>: <span class="prelude-ty">Option</span><span class="op"><</span><span class="ident">usize</span><span class="op">></span>, } <span class="kw">impl</span> <span class="ident">AccessRestrictions</span> { <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">new</span>() <span class="op">-></span> <span class="ident">AccessRestrictions</span> { <span class="ident">AccessRestrictions</span> { <span class="ident">allow_through_traffic</span>: <span class="ident">EnumSet</span>::<span class="ident">all</span>(), <span class="ident">cap_vehicles_per_hour</span>: <span class="prelude-val">None</span>, } } } <span class="doccomment">/// A contiguous set of roads with access restrictions. This is derived from all the map's roads and</span> <span class="doccomment">/// kept cached for performance.</span> <span class="attribute">#[<span class="ident">derive</span>(<span class="ident">Serialize</span>, <span class="ident">Deserialize</span>, <span class="ident">Debug</span>, <span class="ident">PartialEq</span>)]</span> <span class="kw">pub</span> <span class="kw">struct</span> <span class="ident">Zone</span> { <span class="kw">pub</span> <span class="ident">members</span>: <span class="ident">BTreeSet</span><span class="op"><</span><span class="ident">RoadID</span><span class="op">></span>, <span class="kw">pub</span> <span class="ident">borders</span>: <span class="ident">BTreeSet</span><span class="op"><</span><span class="ident">IntersectionID</span><span class="op">></span>, <span class="kw">pub</span> <span class="ident">restrictions</span>: <span class="ident">AccessRestrictions</span>, } <span class="kw">impl</span> <span class="ident">Zone</span> { <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">make_all</span>(<span class="ident">map</span>: <span class="kw-2">&</span><span class="ident">Map</span>) <span class="op">-></span> <span class="ident">Vec</span><span class="op"><</span><span class="ident">Zone</span><span class="op">></span> { <span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">queue</span> <span class="op">=</span> <span class="ident">Vec</span>::<span class="ident">new</span>(); <span class="kw">for</span> <span class="ident">r</span> <span class="kw">in</span> <span class="ident">map</span>.<span class="ident">all_roads</span>() { <span class="kw">if</span> <span class="ident">r</span>.<span class="ident">is_private</span>() { <span class="ident">queue</span>.<span class="ident">push</span>(<span class="ident">r</span>.<span class="ident">id</span>); } } <span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">zones</span> <span class="op">=</span> <span class="ident">Vec</span>::<span class="ident">new</span>(); <span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">seen</span> <span class="op">=</span> <span class="ident">BTreeSet</span>::<span class="ident">new</span>(); <span class="kw">while</span> <span class="op">!</span><span class="ident">queue</span>.<span class="ident">is_empty</span>() { <span class="kw">let</span> <span class="ident">start</span> <span class="op">=</span> <span class="ident">queue</span>.<span class="ident">pop</span>().<span class="ident">unwrap</span>(); <span class="kw">if</span> <span class="ident">seen</span>.<span class="ident">contains</span>(<span class="kw-2">&</span><span class="ident">start</span>) { <span class="kw">continue</span>; } <span class="kw">let</span> <span class="ident">zone</span> <span class="op">=</span> <span class="ident">floodfill</span>(<span class="ident">map</span>, <span class="ident">start</span>); <span class="ident">seen</span>.<span class="ident">extend</span>(<span class="ident">zone</span>.<span class="ident">members</span>.<span class="ident">clone</span>()); <span class="ident">zones</span>.<span class="ident">push</span>(<span class="ident">zone</span>); } <span class="ident">zones</span> } <span class="doccomment">/// Run slower Dijkstra's within the interior of a private zone. Don't go outside the borders.</span> <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">pathfind</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">req</span>: <span class="ident">PathRequest</span>, <span class="ident">map</span>: <span class="kw-2">&</span><span class="ident">Map</span>) <span class="op">-></span> <span class="prelude-ty">Option</span><span class="op"><</span><span class="ident">Path</span><span class="op">></span> { <span class="macro">assert_ne</span><span class="macro">!</span>(<span class="ident">req</span>.<span class="ident">constraints</span>, <span class="ident">PathConstraints</span>::<span class="ident">Pedestrian</span>); <span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">graph</span>: <span class="ident">DiGraphMap</span><span class="op"><</span><span class="ident">LaneID</span>, <span class="ident">TurnID</span><span class="op">></span> <span class="op">=</span> <span class="ident">DiGraphMap</span>::<span class="ident">new</span>(); <span class="kw">for</span> <span class="ident">r</span> <span class="kw">in</span> <span class="kw-2">&</span><span class="self">self</span>.<span class="ident">members</span> { <span class="kw">for</span> <span class="ident">l</span> <span class="kw">in</span> <span class="ident">map</span>.<span class="ident">get_r</span>(<span class="kw-2">*</span><span class="ident">r</span>).<span class="ident">all_lanes</span>() { <span class="kw">if</span> <span class="ident">req</span>.<span class="ident">constraints</span>.<span class="ident">can_use</span>(<span class="ident">map</span>.<span class="ident">get_l</span>(<span class="ident">l</span>), <span class="ident">map</span>) { <span class="kw">for</span> <span class="ident">turn</span> <span class="kw">in</span> <span class="ident">map</span>.<span class="ident">get_turns_for</span>(<span class="ident">l</span>, <span class="ident">req</span>.<span class="ident">constraints</span>) { <span class="kw">if</span> <span class="op">!</span><span class="self">self</span>.<span class="ident">borders</span>.<span class="ident">contains</span>(<span class="kw-2">&</span><span class="ident">turn</span>.<span class="ident">id</span>.<span class="ident">parent</span>) { <span class="ident">graph</span>.<span class="ident">add_edge</span>(<span class="ident">turn</span>.<span class="ident">id</span>.<span class="ident">src</span>, <span class="ident">turn</span>.<span class="ident">id</span>.<span class="ident">dst</span>, <span class="ident">turn</span>.<span class="ident">id</span>); } } } } } <span class="kw">let</span> (<span class="kw">_</span>, <span class="ident">path</span>) <span class="op">=</span> <span class="ident">petgraph</span>::<span class="ident">algo</span>::<span class="ident">astar</span>( <span class="kw-2">&</span><span class="ident">graph</span>, <span class="ident">req</span>.<span class="ident">start</span>.<span class="ident">lane</span>(), <span class="op">|</span><span class="ident">l</span><span class="op">|</span> <span class="ident">l</span> <span class="op">==</span> <span class="ident">req</span>.<span class="ident">end</span>.<span class="ident">lane</span>(), <span class="op">|</span>(<span class="kw">_</span>, <span class="kw">_</span>, <span class="ident">turn</span>)<span class="op">|</span> { <span class="ident">driving_cost</span>(<span class="ident">map</span>.<span class="ident">get_l</span>(<span class="ident">turn</span>.<span class="ident">src</span>), <span class="ident">map</span>.<span class="ident">get_t</span>(<span class="kw-2">*</span><span class="ident">turn</span>), <span class="ident">req</span>.<span class="ident">constraints</span>, <span class="ident">map</span>) }, <span class="op">|</span><span class="kw">_</span><span class="op">|</span> <span class="number">0.0</span>, )<span class="question-mark">?</span>; <span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">steps</span> <span class="op">=</span> <span class="ident">Vec</span>::<span class="ident">new</span>(); <span class="kw">for</span> <span class="ident">pair</span> <span class="kw">in</span> <span class="ident">path</span>.<span class="ident">windows</span>(<span class="number">2</span>) { <span class="ident">steps</span>.<span class="ident">push</span>(<span class="ident">PathStep</span>::<span class="ident">Lane</span>(<span class="ident">pair</span>[<span class="number">0</span>])); <span class="comment">// We don't need to look for this turn in the map; we know it exists.</span> <span class="ident">steps</span>.<span class="ident">push</span>(<span class="ident">PathStep</span>::<span class="ident">Turn</span>(<span class="ident">TurnID</span> { <span class="ident">parent</span>: <span class="ident">map</span>.<span class="ident">get_l</span>(<span class="ident">pair</span>[<span class="number">0</span>]).<span class="ident">dst_i</span>, <span class="ident">src</span>: <span class="ident">pair</span>[<span class="number">0</span>], <span class="ident">dst</span>: <span class="ident">pair</span>[<span class="number">1</span>], })); } <span class="ident">steps</span>.<span class="ident">push</span>(<span class="ident">PathStep</span>::<span class="ident">Lane</span>(<span class="ident">req</span>.<span class="ident">end</span>.<span class="ident">lane</span>())); <span class="macro">assert_eq</span><span class="macro">!</span>(<span class="ident">steps</span>[<span class="number">0</span>], <span class="ident">PathStep</span>::<span class="ident">Lane</span>(<span class="ident">req</span>.<span class="ident">start</span>.<span class="ident">lane</span>())); <span class="prelude-val">Some</span>(<span class="ident">Path</span>::<span class="ident">new</span>(<span class="ident">map</span>, <span class="ident">steps</span>, <span class="ident">req</span>.<span class="ident">end</span>.<span class="ident">dist_along</span>(), <span class="ident">Vec</span>::<span class="ident">new</span>())) } <span class="comment">// TODO Not happy this works so differently</span> <span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">pathfind_walking</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">req</span>: <span class="ident">PathRequest</span>, <span class="ident">map</span>: <span class="kw-2">&</span><span class="ident">Map</span>) <span class="op">-></span> <span class="prelude-ty">Option</span><span class="op"><</span><span class="ident">Vec</span><span class="op"><</span><span class="ident">WalkingNode</span><span class="op">>></span> { <span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">graph</span>: <span class="ident">DiGraphMap</span><span class="op"><</span><span class="ident">WalkingNode</span>, <span class="ident">usize</span><span class="op">></span> <span class="op">=</span> <span class="ident">DiGraphMap</span>::<span class="ident">new</span>(); <span class="kw">for</span> <span class="ident">r</span> <span class="kw">in</span> <span class="kw-2">&</span><span class="self">self</span>.<span class="ident">members</span> { <span class="kw">for</span> <span class="ident">l</span> <span class="kw">in</span> <span class="ident">map</span>.<span class="ident">get_r</span>(<span class="kw-2">*</span><span class="ident">r</span>).<span class="ident">all_lanes</span>() { <span class="kw">let</span> <span class="ident">l</span> <span class="op">=</span> <span class="ident">map</span>.<span class="ident">get_l</span>(<span class="ident">l</span>); <span class="kw">if</span> <span class="ident">l</span>.<span class="ident">is_walkable</span>() { <span class="kw">let</span> <span class="ident">cost</span> <span class="op">=</span> <span class="ident">walking_cost</span>(<span class="ident">l</span>.<span class="ident">length</span>()); <span class="kw">let</span> <span class="ident">n1</span> <span class="op">=</span> <span class="ident">WalkingNode</span>::<span class="ident">SidewalkEndpoint</span>(<span class="ident">l</span>.<span class="ident">id</span>, <span class="bool-val">true</span>); <span class="kw">let</span> <span class="ident">n2</span> <span class="op">=</span> <span class="ident">WalkingNode</span>::<span class="ident">SidewalkEndpoint</span>(<span class="ident">l</span>.<span class="ident">id</span>, <span class="bool-val">false</span>); <span class="ident">graph</span>.<span class="ident">add_edge</span>(<span class="ident">n1</span>, <span class="ident">n2</span>, <span class="ident">cost</span>); <span class="ident">graph</span>.<span class="ident">add_edge</span>(<span class="ident">n2</span>, <span class="ident">n1</span>, <span class="ident">cost</span>); <span class="kw">for</span> <span class="ident">turn</span> <span class="kw">in</span> <span class="ident">map</span>.<span class="ident">get_turns_for</span>(<span class="ident">l</span>.<span class="ident">id</span>, <span class="ident">PathConstraints</span>::<span class="ident">Pedestrian</span>) { <span class="kw">if</span> <span class="self">self</span>.<span class="ident">members</span>.<span class="ident">contains</span>(<span class="kw-2">&</span><span class="ident">map</span>.<span class="ident">get_l</span>(<span class="ident">turn</span>.<span class="ident">id</span>.<span class="ident">dst</span>).<span class="ident">parent</span>) { <span class="ident">graph</span>.<span class="ident">add_edge</span>( <span class="ident">WalkingNode</span>::<span class="ident">SidewalkEndpoint</span>(<span class="ident">l</span>.<span class="ident">id</span>, <span class="ident">l</span>.<span class="ident">dst_i</span> <span class="op">==</span> <span class="ident">turn</span>.<span class="ident">id</span>.<span class="ident">parent</span>), <span class="ident">WalkingNode</span>::<span class="ident">SidewalkEndpoint</span>( <span class="ident">turn</span>.<span class="ident">id</span>.<span class="ident">dst</span>, <span class="ident">map</span>.<span class="ident">get_l</span>(<span class="ident">turn</span>.<span class="ident">id</span>.<span class="ident">dst</span>).<span class="ident">dst_i</span> <span class="op">==</span> <span class="ident">turn</span>.<span class="ident">id</span>.<span class="ident">parent</span>, ), <span class="ident">walking_cost</span>(<span class="ident">turn</span>.<span class="ident">geom</span>.<span class="ident">length</span>()), ); } } } } } <span class="kw">let</span> <span class="ident">closest_start</span> <span class="op">=</span> <span class="ident">WalkingNode</span>::<span class="ident">closest</span>(<span class="ident">req</span>.<span class="ident">start</span>, <span class="ident">map</span>); <span class="kw">let</span> <span class="ident">closest_end</span> <span class="op">=</span> <span class="ident">WalkingNode</span>::<span class="ident">closest</span>(<span class="ident">req</span>.<span class="ident">end</span>, <span class="ident">map</span>); <span class="kw">let</span> (<span class="kw">_</span>, <span class="ident">path</span>) <span class="op">=</span> <span class="ident">petgraph</span>::<span class="ident">algo</span>::<span class="ident">astar</span>( <span class="kw-2">&</span><span class="ident">graph</span>, <span class="ident">closest_start</span>, <span class="op">|</span><span class="ident">end</span><span class="op">|</span> <span class="ident">end</span> <span class="op">==</span> <span class="ident">closest_end</span>, <span class="op">|</span>(<span class="kw">_</span>, <span class="kw">_</span>, <span class="ident">cost</span>)<span class="op">|</span> <span class="kw-2">*</span><span class="ident">cost</span>, <span class="op">|</span><span class="kw">_</span><span class="op">|</span> <span class="number">0</span>, )<span class="question-mark">?</span>; <span class="prelude-val">Some</span>(<span class="ident">path</span>) } } <span class="kw">fn</span> <span class="ident">floodfill</span>(<span class="ident">map</span>: <span class="kw-2">&</span><span class="ident">Map</span>, <span class="ident">start</span>: <span class="ident">RoadID</span>) <span class="op">-></span> <span class="ident">Zone</span> { <span class="kw">let</span> <span class="ident">match_constraints</span> <span class="op">=</span> <span class="ident">map</span>.<span class="ident">get_r</span>(<span class="ident">start</span>).<span class="ident">access_restrictions</span>.<span class="ident">clone</span>(); <span class="kw">let</span> <span class="ident">merge_zones</span> <span class="op">=</span> <span class="ident">map</span>.<span class="ident">get_edits</span>().<span class="ident">merge_zones</span>; <span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">queue</span> <span class="op">=</span> <span class="macro">vec</span><span class="macro">!</span>[<span class="ident">start</span>]; <span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">members</span> <span class="op">=</span> <span class="ident">BTreeSet</span>::<span class="ident">new</span>(); <span class="kw">let</span> <span class="kw-2">mut</span> <span class="ident">borders</span> <span class="op">=</span> <span class="ident">BTreeSet</span>::<span class="ident">new</span>(); <span class="kw">while</span> <span class="op">!</span><span class="ident">queue</span>.<span class="ident">is_empty</span>() { <span class="kw">let</span> <span class="ident">current</span> <span class="op">=</span> <span class="ident">queue</span>.<span class="ident">pop</span>().<span class="ident">unwrap</span>(); <span class="kw">if</span> <span class="ident">members</span>.<span class="ident">contains</span>(<span class="kw-2">&</span><span class="ident">current</span>) { <span class="kw">continue</span>; } <span class="ident">members</span>.<span class="ident">insert</span>(<span class="ident">current</span>); <span class="kw">for</span> <span class="ident">r</span> <span class="kw">in</span> <span class="ident">map</span>.<span class="ident">get_next_roads</span>(<span class="ident">current</span>) { <span class="kw">let</span> <span class="ident">r</span> <span class="op">=</span> <span class="ident">map</span>.<span class="ident">get_r</span>(<span class="ident">r</span>); <span class="kw">if</span> <span class="ident">r</span>.<span class="ident">access_restrictions</span> <span class="op">==</span> <span class="ident">match_constraints</span> <span class="op">&&</span> <span class="ident">merge_zones</span> { <span class="ident">queue</span>.<span class="ident">push</span>(<span class="ident">r</span>.<span class="ident">id</span>); } <span class="kw">else</span> { <span class="ident">borders</span>.<span class="ident">insert</span>(<span class="ident">map</span>.<span class="ident">get_r</span>(<span class="ident">current</span>).<span class="ident">common_endpt</span>(<span class="ident">r</span>)); } } } <span class="macro">assert</span><span class="macro">!</span>(<span class="op">!</span><span class="ident">members</span>.<span class="ident">is_empty</span>()); <span class="macro">assert</span><span class="macro">!</span>(<span class="op">!</span><span class="ident">borders</span>.<span class="ident">is_empty</span>()); <span class="ident">Zone</span> { <span class="ident">members</span>, <span class="ident">borders</span>, <span class="ident">restrictions</span>: <span class="ident">match_constraints</span>, } } </pre></div> </section><section id="search" class="content hidden"></section><section class="footer"></section><script>window.rootPath = "../../../";window.currentCrate = "map_model";</script><script src="../../../main.js"></script><script src="../../../source-script.js"></script><script src="../../../source-files.js"></script><script defer src="../../../search-index.js"></script></body></html>