diff options
| author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2023-11-01 05:12:42 +0000 |
|---|---|---|
| committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2023-11-01 05:12:42 +0000 |
| commit | c51a9844b869fd7cd69e5cc7658d34f61a865185 (patch) | |
| tree | 55706c65ce7e19626aabf7ff4dde0e1a51b739db /docs/sqlglot/helper.html | |
| parent | Releasing debian version 18.17.0-1. (diff) | |
| download | sqlglot-c51a9844b869fd7cd69e5cc7658d34f61a865185.tar.xz sqlglot-c51a9844b869fd7cd69e5cc7658d34f61a865185.zip | |
Merging upstream version 19.0.1.
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'docs/sqlglot/helper.html')
| -rw-r--r-- | docs/sqlglot/helper.html | 1032 |
1 files changed, 514 insertions, 518 deletions
diff --git a/docs/sqlglot/helper.html b/docs/sqlglot/helper.html index 3968025..20d6bd6 100644 --- a/docs/sqlglot/helper.html +++ b/docs/sqlglot/helper.html @@ -320,287 +320,285 @@ </span><span id="L-184"><a href="#L-184"><span class="linenos">184</span></a> <span class="n">annotate_types</span><span class="p">(</span><span class="n">expression</span><span class="p">)</span> </span><span id="L-185"><a href="#L-185"><span class="linenos">185</span></a> <span class="k">if</span> <span class="n">t</span><span class="o">.</span><span class="n">cast</span><span class="p">(</span><span class="n">exp</span><span class="o">.</span><span class="n">DataType</span><span class="p">,</span> <span class="n">expression</span><span class="o">.</span><span class="n">type</span><span class="p">)</span><span class="o">.</span><span class="n">this</span> <span class="ow">in</span> <span class="n">exp</span><span class="o">.</span><span class="n">DataType</span><span class="o">.</span><span class="n">INTEGER_TYPES</span><span class="p">:</span> </span><span id="L-186"><a href="#L-186"><span class="linenos">186</span></a> <span class="n">logger</span><span class="o">.</span><span class="n">warning</span><span class="p">(</span><span class="s2">"Applying array index offset (</span><span class="si">%s</span><span class="s2">)"</span><span class="p">,</span> <span class="n">offset</span><span class="p">)</span> -</span><span id="L-187"><a href="#L-187"><span class="linenos">187</span></a> <span class="n">expression</span> <span class="o">=</span> <span class="n">simplify</span><span class="p">(</span> -</span><span id="L-188"><a href="#L-188"><span class="linenos">188</span></a> <span class="n">exp</span><span class="o">.</span><span class="n">Add</span><span class="p">(</span><span class="n">this</span><span class="o">=</span><span class="n">expression</span><span class="o">.</span><span class="n">copy</span><span class="p">(),</span> <span class="n">expression</span><span class="o">=</span><span class="n">exp</span><span class="o">.</span><span class="n">Literal</span><span class="o">.</span><span class="n">number</span><span class="p">(</span><span class="n">offset</span><span class="p">))</span> -</span><span id="L-189"><a href="#L-189"><span class="linenos">189</span></a> <span class="p">)</span> -</span><span id="L-190"><a href="#L-190"><span class="linenos">190</span></a> <span class="k">return</span> <span class="p">[</span><span class="n">expression</span><span class="p">]</span> +</span><span id="L-187"><a href="#L-187"><span class="linenos">187</span></a> <span class="n">expression</span> <span class="o">=</span> <span class="n">simplify</span><span class="p">(</span><span class="n">exp</span><span class="o">.</span><span class="n">Add</span><span class="p">(</span><span class="n">this</span><span class="o">=</span><span class="n">expression</span><span class="p">,</span> <span class="n">expression</span><span class="o">=</span><span class="n">exp</span><span class="o">.</span><span class="n">Literal</span><span class="o">.</span><span class="n">number</span><span class="p">(</span><span class="n">offset</span><span class="p">)))</span> +</span><span id="L-188"><a href="#L-188"><span class="linenos">188</span></a> <span class="k">return</span> <span class="p">[</span><span class="n">expression</span><span class="p">]</span> +</span><span id="L-189"><a href="#L-189"><span class="linenos">189</span></a> +</span><span id="L-190"><a href="#L-190"><span class="linenos">190</span></a> <span class="k">return</span> <span class="n">expressions</span> </span><span id="L-191"><a href="#L-191"><span class="linenos">191</span></a> -</span><span id="L-192"><a href="#L-192"><span class="linenos">192</span></a> <span class="k">return</span> <span class="n">expressions</span> -</span><span id="L-193"><a href="#L-193"><span class="linenos">193</span></a> -</span><span id="L-194"><a href="#L-194"><span class="linenos">194</span></a> -</span><span id="L-195"><a href="#L-195"><span class="linenos">195</span></a><span class="k">def</span> <span class="nf">camel_to_snake_case</span><span class="p">(</span><span class="n">name</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-></span> <span class="nb">str</span><span class="p">:</span> -</span><span id="L-196"><a href="#L-196"><span class="linenos">196</span></a><span class="w"> </span><span class="sd">"""Converts `name` from camelCase to snake_case and returns the result."""</span> -</span><span id="L-197"><a href="#L-197"><span class="linenos">197</span></a> <span class="k">return</span> <span class="n">CAMEL_CASE_PATTERN</span><span class="o">.</span><span class="n">sub</span><span class="p">(</span><span class="s2">"_"</span><span class="p">,</span> <span class="n">name</span><span class="p">)</span><span class="o">.</span><span class="n">upper</span><span class="p">()</span> -</span><span id="L-198"><a href="#L-198"><span class="linenos">198</span></a> -</span><span id="L-199"><a href="#L-199"><span class="linenos">199</span></a> -</span><span id="L-200"><a href="#L-200"><span class="linenos">200</span></a><span class="k">def</span> <span class="nf">while_changing</span><span class="p">(</span><span class="n">expression</span><span class="p">:</span> <span class="n">Expression</span><span class="p">,</span> <span class="n">func</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Callable</span><span class="p">[[</span><span class="n">Expression</span><span class="p">],</span> <span class="n">E</span><span class="p">])</span> <span class="o">-></span> <span class="n">E</span><span class="p">:</span> -</span><span id="L-201"><a href="#L-201"><span class="linenos">201</span></a><span class="w"> </span><span class="sd">"""</span> -</span><span id="L-202"><a href="#L-202"><span class="linenos">202</span></a><span class="sd"> Applies a transformation to a given expression until a fix point is reached.</span> -</span><span id="L-203"><a href="#L-203"><span class="linenos">203</span></a> -</span><span id="L-204"><a href="#L-204"><span class="linenos">204</span></a><span class="sd"> Args:</span> -</span><span id="L-205"><a href="#L-205"><span class="linenos">205</span></a><span class="sd"> expression: The expression to be transformed.</span> -</span><span id="L-206"><a href="#L-206"><span class="linenos">206</span></a><span class="sd"> func: The transformation to be applied.</span> -</span><span id="L-207"><a href="#L-207"><span class="linenos">207</span></a> -</span><span id="L-208"><a href="#L-208"><span class="linenos">208</span></a><span class="sd"> Returns:</span> -</span><span id="L-209"><a href="#L-209"><span class="linenos">209</span></a><span class="sd"> The transformed expression.</span> -</span><span id="L-210"><a href="#L-210"><span class="linenos">210</span></a><span class="sd"> """</span> -</span><span id="L-211"><a href="#L-211"><span class="linenos">211</span></a> <span class="k">while</span> <span class="kc">True</span><span class="p">:</span> -</span><span id="L-212"><a href="#L-212"><span class="linenos">212</span></a> <span class="k">for</span> <span class="n">n</span><span class="p">,</span> <span class="o">*</span><span class="n">_</span> <span class="ow">in</span> <span class="nb">reversed</span><span class="p">(</span><span class="nb">tuple</span><span class="p">(</span><span class="n">expression</span><span class="o">.</span><span class="n">walk</span><span class="p">())):</span> -</span><span id="L-213"><a href="#L-213"><span class="linenos">213</span></a> <span class="n">n</span><span class="o">.</span><span class="n">_hash</span> <span class="o">=</span> <span class="nb">hash</span><span class="p">(</span><span class="n">n</span><span class="p">)</span> -</span><span id="L-214"><a href="#L-214"><span class="linenos">214</span></a> -</span><span id="L-215"><a href="#L-215"><span class="linenos">215</span></a> <span class="n">start</span> <span class="o">=</span> <span class="nb">hash</span><span class="p">(</span><span class="n">expression</span><span class="p">)</span> -</span><span id="L-216"><a href="#L-216"><span class="linenos">216</span></a> <span class="n">expression</span> <span class="o">=</span> <span class="n">func</span><span class="p">(</span><span class="n">expression</span><span class="p">)</span> -</span><span id="L-217"><a href="#L-217"><span class="linenos">217</span></a> -</span><span id="L-218"><a href="#L-218"><span class="linenos">218</span></a> <span class="k">for</span> <span class="n">n</span><span class="p">,</span> <span class="o">*</span><span class="n">_</span> <span class="ow">in</span> <span class="n">expression</span><span class="o">.</span><span class="n">walk</span><span class="p">():</span> -</span><span id="L-219"><a href="#L-219"><span class="linenos">219</span></a> <span class="n">n</span><span class="o">.</span><span class="n">_hash</span> <span class="o">=</span> <span class="kc">None</span> -</span><span id="L-220"><a href="#L-220"><span class="linenos">220</span></a> <span class="k">if</span> <span class="n">start</span> <span class="o">==</span> <span class="nb">hash</span><span class="p">(</span><span class="n">expression</span><span class="p">):</span> -</span><span id="L-221"><a href="#L-221"><span class="linenos">221</span></a> <span class="k">break</span> +</span><span id="L-192"><a href="#L-192"><span class="linenos">192</span></a> +</span><span id="L-193"><a href="#L-193"><span class="linenos">193</span></a><span class="k">def</span> <span class="nf">camel_to_snake_case</span><span class="p">(</span><span class="n">name</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-></span> <span class="nb">str</span><span class="p">:</span> +</span><span id="L-194"><a href="#L-194"><span class="linenos">194</span></a><span class="w"> </span><span class="sd">"""Converts `name` from camelCase to snake_case and returns the result."""</span> +</span><span id="L-195"><a href="#L-195"><span class="linenos">195</span></a> <span class="k">return</span> <span class="n">CAMEL_CASE_PATTERN</span><span class="o">.</span><span class="n">sub</span><span class="p">(</span><span class="s2">"_"</span><span class="p">,</span> <span class="n">name</span><span class="p">)</span><span class="o">.</span><span class="n">upper</span><span class="p">()</span> +</span><span id="L-196"><a href="#L-196"><span class="linenos">196</span></a> +</span><span id="L-197"><a href="#L-197"><span class="linenos">197</span></a> +</span><span id="L-198"><a href="#L-198"><span class="linenos">198</span></a><span class="k">def</span> <span class="nf">while_changing</span><span class="p">(</span><span class="n">expression</span><span class="p">:</span> <span class="n">Expression</span><span class="p">,</span> <span class="n">func</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Callable</span><span class="p">[[</span><span class="n">Expression</span><span class="p">],</span> <span class="n">E</span><span class="p">])</span> <span class="o">-></span> <span class="n">E</span><span class="p">:</span> +</span><span id="L-199"><a href="#L-199"><span class="linenos">199</span></a><span class="w"> </span><span class="sd">"""</span> +</span><span id="L-200"><a href="#L-200"><span class="linenos">200</span></a><span class="sd"> Applies a transformation to a given expression until a fix point is reached.</span> +</span><span id="L-201"><a href="#L-201"><span class="linenos">201</span></a> +</span><span id="L-202"><a href="#L-202"><span class="linenos">202</span></a><span class="sd"> Args:</span> +</span><span id="L-203"><a href="#L-203"><span class="linenos">203</span></a><span class="sd"> expression: The expression to be transformed.</span> +</span><span id="L-204"><a href="#L-204"><span class="linenos">204</span></a><span class="sd"> func: The transformation to be applied.</span> +</span><span id="L-205"><a href="#L-205"><span class="linenos">205</span></a> +</span><span id="L-206"><a href="#L-206"><span class="linenos">206</span></a><span class="sd"> Returns:</span> +</span><span id="L-207"><a href="#L-207"><span class="linenos">207</span></a><span class="sd"> The transformed expression.</span> +</span><span id="L-208"><a href="#L-208"><span class="linenos">208</span></a><span class="sd"> """</span> +</span><span id="L-209"><a href="#L-209"><span class="linenos">209</span></a> <span class="k">while</span> <span class="kc">True</span><span class="p">:</span> +</span><span id="L-210"><a href="#L-210"><span class="linenos">210</span></a> <span class="k">for</span> <span class="n">n</span><span class="p">,</span> <span class="o">*</span><span class="n">_</span> <span class="ow">in</span> <span class="nb">reversed</span><span class="p">(</span><span class="nb">tuple</span><span class="p">(</span><span class="n">expression</span><span class="o">.</span><span class="n">walk</span><span class="p">())):</span> +</span><span id="L-211"><a href="#L-211"><span class="linenos">211</span></a> <span class="n">n</span><span class="o">.</span><span class="n">_hash</span> <span class="o">=</span> <span class="nb">hash</span><span class="p">(</span><span class="n">n</span><span class="p">)</span> +</span><span id="L-212"><a href="#L-212"><span class="linenos">212</span></a> +</span><span id="L-213"><a href="#L-213"><span class="linenos">213</span></a> <span class="n">start</span> <span class="o">=</span> <span class="nb">hash</span><span class="p">(</span><span class="n">expression</span><span class="p">)</span> +</span><span id="L-214"><a href="#L-214"><span class="linenos">214</span></a> <span class="n">expression</span> <span class="o">=</span> <span class="n">func</span><span class="p">(</span><span class="n">expression</span><span class="p">)</span> +</span><span id="L-215"><a href="#L-215"><span class="linenos">215</span></a> +</span><span id="L-216"><a href="#L-216"><span class="linenos">216</span></a> <span class="k">for</span> <span class="n">n</span><span class="p">,</span> <span class="o">*</span><span class="n">_</span> <span class="ow">in</span> <span class="n">expression</span><span class="o">.</span><span class="n">walk</span><span class="p">():</span> +</span><span id="L-217"><a href="#L-217"><span class="linenos">217</span></a> <span class="n">n</span><span class="o">.</span><span class="n">_hash</span> <span class="o">=</span> <span class="kc">None</span> +</span><span id="L-218"><a href="#L-218"><span class="linenos">218</span></a> <span class="k">if</span> <span class="n">start</span> <span class="o">==</span> <span class="nb">hash</span><span class="p">(</span><span class="n">expression</span><span class="p">):</span> +</span><span id="L-219"><a href="#L-219"><span class="linenos">219</span></a> <span class="k">break</span> +</span><span id="L-220"><a href="#L-220"><span class="linenos">220</span></a> +</span><span id="L-221"><a href="#L-221"><span class="linenos">221</span></a> <span class="k">return</span> <span class="n">expression</span> </span><span id="L-222"><a href="#L-222"><span class="linenos">222</span></a> -</span><span id="L-223"><a href="#L-223"><span class="linenos">223</span></a> <span class="k">return</span> <span class="n">expression</span> -</span><span id="L-224"><a href="#L-224"><span class="linenos">224</span></a> -</span><span id="L-225"><a href="#L-225"><span class="linenos">225</span></a> -</span><span id="L-226"><a href="#L-226"><span class="linenos">226</span></a><span class="k">def</span> <span class="nf">tsort</span><span class="p">(</span><span class="n">dag</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Dict</span><span class="p">[</span><span class="n">T</span><span class="p">,</span> <span class="n">t</span><span class="o">.</span><span class="n">Set</span><span class="p">[</span><span class="n">T</span><span class="p">]])</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">List</span><span class="p">[</span><span class="n">T</span><span class="p">]:</span> -</span><span id="L-227"><a href="#L-227"><span class="linenos">227</span></a><span class="w"> </span><span class="sd">"""</span> -</span><span id="L-228"><a href="#L-228"><span class="linenos">228</span></a><span class="sd"> Sorts a given directed acyclic graph in topological order.</span> -</span><span id="L-229"><a href="#L-229"><span class="linenos">229</span></a> -</span><span id="L-230"><a href="#L-230"><span class="linenos">230</span></a><span class="sd"> Args:</span> -</span><span id="L-231"><a href="#L-231"><span class="linenos">231</span></a><span class="sd"> dag: The graph to be sorted.</span> -</span><span id="L-232"><a href="#L-232"><span class="linenos">232</span></a> -</span><span id="L-233"><a href="#L-233"><span class="linenos">233</span></a><span class="sd"> Returns:</span> -</span><span id="L-234"><a href="#L-234"><span class="linenos">234</span></a><span class="sd"> A list that contains all of the graph's nodes in topological order.</span> -</span><span id="L-235"><a href="#L-235"><span class="linenos">235</span></a><span class="sd"> """</span> -</span><span id="L-236"><a href="#L-236"><span class="linenos">236</span></a> <span class="n">result</span> <span class="o">=</span> <span class="p">[]</span> -</span><span id="L-237"><a href="#L-237"><span class="linenos">237</span></a> -</span><span id="L-238"><a href="#L-238"><span class="linenos">238</span></a> <span class="k">for</span> <span class="n">node</span><span class="p">,</span> <span class="n">deps</span> <span class="ow">in</span> <span class="nb">tuple</span><span class="p">(</span><span class="n">dag</span><span class="o">.</span><span class="n">items</span><span class="p">()):</span> -</span><span id="L-239"><a href="#L-239"><span class="linenos">239</span></a> <span class="k">for</span> <span class="n">dep</span> <span class="ow">in</span> <span class="n">deps</span><span class="p">:</span> -</span><span id="L-240"><a href="#L-240"><span class="linenos">240</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="n">dep</span> <span class="ow">in</span> <span class="n">dag</span><span class="p">:</span> -</span><span id="L-241"><a href="#L-241"><span class="linenos">241</span></a> <span class="n">dag</span><span class="p">[</span><span class="n">dep</span><span class="p">]</span> <span class="o">=</span> <span class="nb">set</span><span class="p">()</span> -</span><span id="L-242"><a href="#L-242"><span class="linenos">242</span></a> -</span><span id="L-243"><a href="#L-243"><span class="linenos">243</span></a> <span class="k">while</span> <span class="n">dag</span><span class="p">:</span> -</span><span id="L-244"><a href="#L-244"><span class="linenos">244</span></a> <span class="n">current</span> <span class="o">=</span> <span class="p">{</span><span class="n">node</span> <span class="k">for</span> <span class="n">node</span><span class="p">,</span> <span class="n">deps</span> <span class="ow">in</span> <span class="n">dag</span><span class="o">.</span><span class="n">items</span><span class="p">()</span> <span class="k">if</span> <span class="ow">not</span> <span class="n">deps</span><span class="p">}</span> -</span><span id="L-245"><a href="#L-245"><span class="linenos">245</span></a> -</span><span id="L-246"><a href="#L-246"><span class="linenos">246</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="n">current</span><span class="p">:</span> -</span><span id="L-247"><a href="#L-247"><span class="linenos">247</span></a> <span class="k">raise</span> <span class="ne">ValueError</span><span class="p">(</span><span class="s2">"Cycle error"</span><span class="p">)</span> -</span><span id="L-248"><a href="#L-248"><span class="linenos">248</span></a> -</span><span id="L-249"><a href="#L-249"><span class="linenos">249</span></a> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">current</span><span class="p">:</span> -</span><span id="L-250"><a href="#L-250"><span class="linenos">250</span></a> <span class="n">dag</span><span class="o">.</span><span class="n">pop</span><span class="p">(</span><span class="n">node</span><span class="p">)</span> -</span><span id="L-251"><a href="#L-251"><span class="linenos">251</span></a> -</span><span id="L-252"><a href="#L-252"><span class="linenos">252</span></a> <span class="k">for</span> <span class="n">deps</span> <span class="ow">in</span> <span class="n">dag</span><span class="o">.</span><span class="n">values</span><span class="p">():</span> -</span><span id="L-253"><a href="#L-253"><span class="linenos">253</span></a> <span class="n">deps</span> <span class="o">-=</span> <span class="n">current</span> +</span><span id="L-223"><a href="#L-223"><span class="linenos">223</span></a> +</span><span id="L-224"><a href="#L-224"><span class="linenos">224</span></a><span class="k">def</span> <span class="nf">tsort</span><span class="p">(</span><span class="n">dag</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Dict</span><span class="p">[</span><span class="n">T</span><span class="p">,</span> <span class="n">t</span><span class="o">.</span><span class="n">Set</span><span class="p">[</span><span class="n">T</span><span class="p">]])</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">List</span><span class="p">[</span><span class="n">T</span><span class="p">]:</span> +</span><span id="L-225"><a href="#L-225"><span class="linenos">225</span></a><span class="w"> </span><span class="sd">"""</span> +</span><span id="L-226"><a href="#L-226"><span class="linenos">226</span></a><span class="sd"> Sorts a given directed acyclic graph in topological order.</span> +</span><span id="L-227"><a href="#L-227"><span class="linenos">227</span></a> +</span><span id="L-228"><a href="#L-228"><span class="linenos">228</span></a><span class="sd"> Args:</span> +</span><span id="L-229"><a href="#L-229"><span class="linenos">229</span></a><span class="sd"> dag: The graph to be sorted.</span> +</span><span id="L-230"><a href="#L-230"><span class="linenos">230</span></a> +</span><span id="L-231"><a href="#L-231"><span class="linenos">231</span></a><span class="sd"> Returns:</span> +</span><span id="L-232"><a href="#L-232"><span class="linenos">232</span></a><span class="sd"> A list that contains all of the graph's nodes in topological order.</span> +</span><span id="L-233"><a href="#L-233"><span class="linenos">233</span></a><span class="sd"> """</span> +</span><span id="L-234"><a href="#L-234"><span class="linenos">234</span></a> <span class="n">result</span> <span class="o">=</span> <span class="p">[]</span> +</span><span id="L-235"><a href="#L-235"><span class="linenos">235</span></a> +</span><span id="L-236"><a href="#L-236"><span class="linenos">236</span></a> <span class="k">for</span> <span class="n">node</span><span class="p">,</span> <span class="n">deps</span> <span class="ow">in</span> <span class="nb">tuple</span><span class="p">(</span><span class="n">dag</span><span class="o">.</span><span class="n">items</span><span class="p">()):</span> +</span><span id="L-237"><a href="#L-237"><span class="linenos">237</span></a> <span class="k">for</span> <span class="n">dep</span> <span class="ow">in</span> <span class="n">deps</span><span class="p">:</span> +</span><span id="L-238"><a href="#L-238"><span class="linenos">238</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="n">dep</span> <span class="ow">in</span> <span class="n">dag</span><span class="p">:</span> +</span><span id="L-239"><a href="#L-239"><span class="linenos">239</span></a> <span class="n">dag</span><span class="p">[</span><span class="n">dep</span><span class="p">]</span> <span class="o">=</span> <span class="nb">set</span><span class="p">()</span> +</span><span id="L-240"><a href="#L-240"><span class="linenos">240</span></a> +</span><span id="L-241"><a href="#L-241"><span class="linenos">241</span></a> <span class="k">while</span> <span class="n">dag</span><span class="p">:</span> +</span><span id="L-242"><a href="#L-242"><span class="linenos">242</span></a> <span class="n">current</span> <span class="o">=</span> <span class="p">{</span><span class="n">node</span> <span class="k">for</span> <span class="n">node</span><span class="p">,</span> <span class="n">deps</span> <span class="ow">in</span> <span class="n">dag</span><span class="o">.</span><span class="n">items</span><span class="p">()</span> <span class="k">if</span> <span class="ow">not</span> <span class="n">deps</span><span class="p">}</span> +</span><span id="L-243"><a href="#L-243"><span class="linenos">243</span></a> +</span><span id="L-244"><a href="#L-244"><span class="linenos">244</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="n">current</span><span class="p">:</span> +</span><span id="L-245"><a href="#L-245"><span class="linenos">245</span></a> <span class="k">raise</span> <span class="ne">ValueError</span><span class="p">(</span><span class="s2">"Cycle error"</span><span class="p">)</span> +</span><span id="L-246"><a href="#L-246"><span class="linenos">246</span></a> +</span><span id="L-247"><a href="#L-247"><span class="linenos">247</span></a> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">current</span><span class="p">:</span> +</span><span id="L-248"><a href="#L-248"><span class="linenos">248</span></a> <span class="n">dag</span><span class="o">.</span><span class="n">pop</span><span class="p">(</span><span class="n">node</span><span class="p">)</span> +</span><span id="L-249"><a href="#L-249"><span class="linenos">249</span></a> +</span><span id="L-250"><a href="#L-250"><span class="linenos">250</span></a> <span class="k">for</span> <span class="n">deps</span> <span class="ow">in</span> <span class="n">dag</span><span class="o">.</span><span class="n">values</span><span class="p">():</span> +</span><span id="L-251"><a href="#L-251"><span class="linenos">251</span></a> <span class="n">deps</span> <span class="o">-=</span> <span class="n">current</span> +</span><span id="L-252"><a href="#L-252"><span class="linenos">252</span></a> +</span><span id="L-253"><a href="#L-253"><span class="linenos">253</span></a> <span class="n">result</span><span class="o">.</span><span class="n">extend</span><span class="p">(</span><span class="nb">sorted</span><span class="p">(</span><span class="n">current</span><span class="p">))</span> <span class="c1"># type: ignore</span> </span><span id="L-254"><a href="#L-254"><span class="linenos">254</span></a> -</span><span id="L-255"><a href="#L-255"><span class="linenos">255</span></a> <span class="n">result</span><span class="o">.</span><span class="n">extend</span><span class="p">(</span><span class="nb">sorted</span><span class="p">(</span><span class="n">current</span><span class="p">))</span> <span class="c1"># type: ignore</span> +</span><span id="L-255"><a href="#L-255"><span class="linenos">255</span></a> <span class="k">return</span> <span class="n">result</span> </span><span id="L-256"><a href="#L-256"><span class="linenos">256</span></a> -</span><span id="L-257"><a href="#L-257"><span class="linenos">257</span></a> <span class="k">return</span> <span class="n">result</span> -</span><span id="L-258"><a href="#L-258"><span class="linenos">258</span></a> -</span><span id="L-259"><a href="#L-259"><span class="linenos">259</span></a> -</span><span id="L-260"><a href="#L-260"><span class="linenos">260</span></a><span class="k">def</span> <span class="nf">open_file</span><span class="p">(</span><span class="n">file_name</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">TextIO</span><span class="p">:</span> -</span><span id="L-261"><a href="#L-261"><span class="linenos">261</span></a><span class="w"> </span><span class="sd">"""Open a file that may be compressed as gzip and return it in universal newline mode."""</span> -</span><span id="L-262"><a href="#L-262"><span class="linenos">262</span></a> <span class="k">with</span> <span class="nb">open</span><span class="p">(</span><span class="n">file_name</span><span class="p">,</span> <span class="s2">"rb"</span><span class="p">)</span> <span class="k">as</span> <span class="n">f</span><span class="p">:</span> -</span><span id="L-263"><a href="#L-263"><span class="linenos">263</span></a> <span class="n">gzipped</span> <span class="o">=</span> <span class="n">f</span><span class="o">.</span><span class="n">read</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span> <span class="o">==</span> <span class="sa">b</span><span class="s2">"</span><span class="se">\x1f\x8b</span><span class="s2">"</span> -</span><span id="L-264"><a href="#L-264"><span class="linenos">264</span></a> -</span><span id="L-265"><a href="#L-265"><span class="linenos">265</span></a> <span class="k">if</span> <span class="n">gzipped</span><span class="p">:</span> -</span><span id="L-266"><a href="#L-266"><span class="linenos">266</span></a> <span class="kn">import</span> <span class="nn">gzip</span> +</span><span id="L-257"><a href="#L-257"><span class="linenos">257</span></a> +</span><span id="L-258"><a href="#L-258"><span class="linenos">258</span></a><span class="k">def</span> <span class="nf">open_file</span><span class="p">(</span><span class="n">file_name</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">TextIO</span><span class="p">:</span> +</span><span id="L-259"><a href="#L-259"><span class="linenos">259</span></a><span class="w"> </span><span class="sd">"""Open a file that may be compressed as gzip and return it in universal newline mode."""</span> +</span><span id="L-260"><a href="#L-260"><span class="linenos">260</span></a> <span class="k">with</span> <span class="nb">open</span><span class="p">(</span><span class="n">file_name</span><span class="p">,</span> <span class="s2">"rb"</span><span class="p">)</span> <span class="k">as</span> <span class="n">f</span><span class="p">:</span> +</span><span id="L-261"><a href="#L-261"><span class="linenos">261</span></a> <span class="n">gzipped</span> <span class="o">=</span> <span class="n">f</span><span class="o">.</span><span class="n">read</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span> <span class="o">==</span> <span class="sa">b</span><span class="s2">"</span><span class="se">\x1f\x8b</span><span class="s2">"</span> +</span><span id="L-262"><a href="#L-262"><span class="linenos">262</span></a> +</span><span id="L-263"><a href="#L-263"><span class="linenos">263</span></a> <span class="k">if</span> <span class="n">gzipped</span><span class="p">:</span> +</span><span id="L-264"><a href="#L-264"><span class="linenos">264</span></a> <span class="kn">import</span> <span class="nn">gzip</span> +</span><span id="L-265"><a href="#L-265"><span class="linenos">265</span></a> +</span><span id="L-266"><a href="#L-266"><span class="linenos">266</span></a> <span class="k">return</span> <span class="n">gzip</span><span class="o">.</span><span class="n">open</span><span class="p">(</span><span class="n">file_name</span><span class="p">,</span> <span class="s2">"rt"</span><span class="p">,</span> <span class="n">newline</span><span class="o">=</span><span class="s2">""</span><span class="p">)</span> </span><span id="L-267"><a href="#L-267"><span class="linenos">267</span></a> -</span><span id="L-268"><a href="#L-268"><span class="linenos">268</span></a> <span class="k">return</span> <span class="n">gzip</span><span class="o">.</span><span class="n">open</span><span class="p">(</span><span class="n">file_name</span><span class="p">,</span> <span class="s2">"rt"</span><span class="p">,</span> <span class="n">newline</span><span class="o">=</span><span class="s2">""</span><span class="p">)</span> +</span><span id="L-268"><a href="#L-268"><span class="linenos">268</span></a> <span class="k">return</span> <span class="nb">open</span><span class="p">(</span><span class="n">file_name</span><span class="p">,</span> <span class="n">encoding</span><span class="o">=</span><span class="s2">"utf-8"</span><span class="p">,</span> <span class="n">newline</span><span class="o">=</span><span class="s2">""</span><span class="p">)</span> </span><span id="L-269"><a href="#L-269"><span class="linenos">269</span></a> -</span><span id="L-270"><a href="#L-270"><span class="linenos">270</span></a> <span class="k">return</span> <span class="nb">open</span><span class="p">(</span><span class="n">file_name</span><span class="p">,</span> <span class="n">encoding</span><span class="o">=</span><span class="s2">"utf-8"</span><span class="p">,</span> <span class="n">newline</span><span class="o">=</span><span class="s2">""</span><span class="p">)</span> -</span><span id="L-271"><a href="#L-271"><span class="linenos">271</span></a> -</span><span id="L-272"><a href="#L-272"><span class="linenos">272</span></a> -</span><span id="L-273"><a href="#L-273"><span class="linenos">273</span></a><span class="nd">@contextmanager</span> -</span><span id="L-274"><a href="#L-274"><span class="linenos">274</span></a><span class="k">def</span> <span class="nf">csv_reader</span><span class="p">(</span><span class="n">read_csv</span><span class="p">:</span> <span class="n">exp</span><span class="o">.</span><span class="n">ReadCSV</span><span class="p">)</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">:</span> -</span><span id="L-275"><a href="#L-275"><span class="linenos">275</span></a><span class="w"> </span><span class="sd">"""</span> -</span><span id="L-276"><a href="#L-276"><span class="linenos">276</span></a><span class="sd"> Returns a csv reader given the expression `READ_CSV(name, ['delimiter', '|', ...])`.</span> -</span><span id="L-277"><a href="#L-277"><span class="linenos">277</span></a> -</span><span id="L-278"><a href="#L-278"><span class="linenos">278</span></a><span class="sd"> Args:</span> -</span><span id="L-279"><a href="#L-279"><span class="linenos">279</span></a><span class="sd"> read_csv: A `ReadCSV` function call.</span> -</span><span id="L-280"><a href="#L-280"><span class="linenos">280</span></a> -</span><span id="L-281"><a href="#L-281"><span class="linenos">281</span></a><span class="sd"> Yields:</span> -</span><span id="L-282"><a href="#L-282"><span class="linenos">282</span></a><span class="sd"> A python csv reader.</span> -</span><span id="L-283"><a href="#L-283"><span class="linenos">283</span></a><span class="sd"> """</span> -</span><span id="L-284"><a href="#L-284"><span class="linenos">284</span></a> <span class="n">args</span> <span class="o">=</span> <span class="n">read_csv</span><span class="o">.</span><span class="n">expressions</span> -</span><span id="L-285"><a href="#L-285"><span class="linenos">285</span></a> <span class="n">file</span> <span class="o">=</span> <span class="n">open_file</span><span class="p">(</span><span class="n">read_csv</span><span class="o">.</span><span class="n">name</span><span class="p">)</span> -</span><span id="L-286"><a href="#L-286"><span class="linenos">286</span></a> -</span><span id="L-287"><a href="#L-287"><span class="linenos">287</span></a> <span class="n">delimiter</span> <span class="o">=</span> <span class="s2">","</span> -</span><span id="L-288"><a href="#L-288"><span class="linenos">288</span></a> <span class="n">args</span> <span class="o">=</span> <span class="nb">iter</span><span class="p">(</span><span class="n">arg</span><span class="o">.</span><span class="n">name</span> <span class="k">for</span> <span class="n">arg</span> <span class="ow">in</span> <span class="n">args</span><span class="p">)</span> -</span><span id="L-289"><a href="#L-289"><span class="linenos">289</span></a> <span class="k">for</span> <span class="n">k</span><span class="p">,</span> <span class="n">v</span> <span class="ow">in</span> <span class="nb">zip</span><span class="p">(</span><span class="n">args</span><span class="p">,</span> <span class="n">args</span><span class="p">):</span> -</span><span id="L-290"><a href="#L-290"><span class="linenos">290</span></a> <span class="k">if</span> <span class="n">k</span> <span class="o">==</span> <span class="s2">"delimiter"</span><span class="p">:</span> -</span><span id="L-291"><a href="#L-291"><span class="linenos">291</span></a> <span class="n">delimiter</span> <span class="o">=</span> <span class="n">v</span> -</span><span id="L-292"><a href="#L-292"><span class="linenos">292</span></a> -</span><span id="L-293"><a href="#L-293"><span class="linenos">293</span></a> <span class="k">try</span><span class="p">:</span> -</span><span id="L-294"><a href="#L-294"><span class="linenos">294</span></a> <span class="kn">import</span> <span class="nn">csv</span> <span class="k">as</span> <span class="nn">csv_</span> -</span><span id="L-295"><a href="#L-295"><span class="linenos">295</span></a> -</span><span id="L-296"><a href="#L-296"><span class="linenos">296</span></a> <span class="k">yield</span> <span class="n">csv_</span><span class="o">.</span><span class="n">reader</span><span class="p">(</span><span class="n">file</span><span class="p">,</span> <span class="n">delimiter</span><span class="o">=</span><span class="n">delimiter</span><span class="p">)</span> -</span><span id="L-297"><a href="#L-297"><span class="linenos">297</span></a> <span class="k">finally</span><span class="p">:</span> -</span><span id="L-298"><a href="#L-298"><span class="linenos">298</span></a> <span class="n">file</span><span class="o">.</span><span class="n">close</span><span class="p">()</span> -</span><span id="L-299"><a href="#L-299"><span class="linenos">299</span></a> -</span><span id="L-300"><a href="#L-300"><span class="linenos">300</span></a> -</span><span id="L-301"><a href="#L-301"><span class="linenos">301</span></a><span class="k">def</span> <span class="nf">find_new_name</span><span class="p">(</span><span class="n">taken</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Collection</span><span class="p">[</span><span class="nb">str</span><span class="p">],</span> <span class="n">base</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-></span> <span class="nb">str</span><span class="p">:</span> -</span><span id="L-302"><a href="#L-302"><span class="linenos">302</span></a><span class="w"> </span><span class="sd">"""</span> -</span><span id="L-303"><a href="#L-303"><span class="linenos">303</span></a><span class="sd"> Searches for a new name.</span> -</span><span id="L-304"><a href="#L-304"><span class="linenos">304</span></a> -</span><span id="L-305"><a href="#L-305"><span class="linenos">305</span></a><span class="sd"> Args:</span> -</span><span id="L-306"><a href="#L-306"><span class="linenos">306</span></a><span class="sd"> taken: A collection of taken names.</span> -</span><span id="L-307"><a href="#L-307"><span class="linenos">307</span></a><span class="sd"> base: Base name to alter.</span> -</span><span id="L-308"><a href="#L-308"><span class="linenos">308</span></a> -</span><span id="L-309"><a href="#L-309"><span class="linenos">309</span></a><span class="sd"> Returns:</span> -</span><span id="L-310"><a href="#L-310"><span class="linenos">310</span></a><span class="sd"> The new, available name.</span> -</span><span id="L-311"><a href="#L-311"><span class="linenos">311</span></a><span class="sd"> """</span> -</span><span id="L-312"><a href="#L-312"><span class="linenos">312</span></a> <span class="k">if</span> <span class="n">base</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">taken</span><span class="p">:</span> -</span><span id="L-313"><a href="#L-313"><span class="linenos">313</span></a> <span class="k">return</span> <span class="n">base</span> -</span><span id="L-314"><a href="#L-314"><span class="linenos">314</span></a> -</span><span id="L-315"><a href="#L-315"><span class="linenos">315</span></a> <span class="n">i</span> <span class="o">=</span> <span class="mi">2</span> -</span><span id="L-316"><a href="#L-316"><span class="linenos">316</span></a> <span class="n">new</span> <span class="o">=</span> <span class="sa">f</span><span class="s2">"</span><span class="si">{</span><span class="n">base</span><span class="si">}</span><span class="s2">_</span><span class="si">{</span><span class="n">i</span><span class="si">}</span><span class="s2">"</span> -</span><span id="L-317"><a href="#L-317"><span class="linenos">317</span></a> <span class="k">while</span> <span class="n">new</span> <span class="ow">in</span> <span class="n">taken</span><span class="p">:</span> -</span><span id="L-318"><a href="#L-318"><span class="linenos">318</span></a> <span class="n">i</span> <span class="o">+=</span> <span class="mi">1</span> -</span><span id="L-319"><a href="#L-319"><span class="linenos">319</span></a> <span class="n">new</span> <span class="o">=</span> <span class="sa">f</span><span class="s2">"</span><span class="si">{</span><span class="n">base</span><span class="si">}</span><span class="s2">_</span><span class="si">{</span><span class="n">i</span><span class="si">}</span><span class="s2">"</span> +</span><span id="L-270"><a href="#L-270"><span class="linenos">270</span></a> +</span><span id="L-271"><a href="#L-271"><span class="linenos">271</span></a><span class="nd">@contextmanager</span> +</span><span id="L-272"><a href="#L-272"><span class="linenos">272</span></a><span class="k">def</span> <span class="nf">csv_reader</span><span class="p">(</span><span class="n">read_csv</span><span class="p">:</span> <span class="n">exp</span><span class="o">.</span><span class="n">ReadCSV</span><span class="p">)</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">:</span> +</span><span id="L-273"><a href="#L-273"><span class="linenos">273</span></a><span class="w"> </span><span class="sd">"""</span> +</span><span id="L-274"><a href="#L-274"><span class="linenos">274</span></a><span class="sd"> Returns a csv reader given the expression `READ_CSV(name, ['delimiter', '|', ...])`.</span> +</span><span id="L-275"><a href="#L-275"><span class="linenos">275</span></a> +</span><span id="L-276"><a href="#L-276"><span class="linenos">276</span></a><span class="sd"> Args:</span> +</span><span id="L-277"><a href="#L-277"><span class="linenos">277</span></a><span class="sd"> read_csv: A `ReadCSV` function call.</span> +</span><span id="L-278"><a href="#L-278"><span class="linenos">278</span></a> +</span><span id="L-279"><a href="#L-279"><span class="linenos">279</span></a><span class="sd"> Yields:</span> +</span><span id="L-280"><a href="#L-280"><span class="linenos">280</span></a><span class="sd"> A python csv reader.</span> +</span><span id="L-281"><a href="#L-281"><span class="linenos">281</span></a><span class="sd"> """</span> +</span><span id="L-282"><a href="#L-282"><span class="linenos">282</span></a> <span class="n">args</span> <span class="o">=</span> <span class="n">read_csv</span><span class="o">.</span><span class="n">expressions</span> +</span><span id="L-283"><a href="#L-283"><span class="linenos">283</span></a> <span class="n">file</span> <span class="o">=</span> <span class="n">open_file</span><span class="p">(</span><span class="n">read_csv</span><span class="o">.</span><span class="n">name</span><span class="p">)</span> +</span><span id="L-284"><a href="#L-284"><span class="linenos">284</span></a> +</span><span id="L-285"><a href="#L-285"><span class="linenos">285</span></a> <span class="n">delimiter</span> <span class="o">=</span> <span class="s2">","</span> +</span><span id="L-286"><a href="#L-286"><span class="linenos">286</span></a> <span class="n">args</span> <span class="o">=</span> <span class="nb">iter</span><span class="p">(</span><span class="n">arg</span><span class="o">.</span><span class="n">name</span> <span class="k">for</span> <span class="n">arg</span> <span class="ow">in</span> <span class="n">args</span><span class="p">)</span> +</span><span id="L-287"><a href="#L-287"><span class="linenos">287</span></a> <span class="k">for</span> <span class="n">k</span><span class="p">,</span> <span class="n">v</span> <span class="ow">in</span> <span class="nb">zip</span><span class="p">(</span><span class="n">args</span><span class="p">,</span> <span class="n">args</span><span class="p">):</span> +</span><span id="L-288"><a href="#L-288"><span class="linenos">288</span></a> <span class="k">if</span> <span class="n">k</span> <span class="o">==</span> <span class="s2">"delimiter"</span><span class="p">:</span> +</span><span id="L-289"><a href="#L-289"><span class="linenos">289</span></a> <span class="n">delimiter</span> <span class="o">=</span> <span class="n">v</span> +</span><span id="L-290"><a href="#L-290"><span class="linenos">290</span></a> +</span><span id="L-291"><a href="#L-291"><span class="linenos">291</span></a> <span class="k">try</span><span class="p">:</span> +</span><span id="L-292"><a href="#L-292"><span class="linenos">292</span></a> <span class="kn">import</span> <span class="nn">csv</span> <span class="k">as</span> <span class="nn">csv_</span> +</span><span id="L-293"><a href="#L-293"><span class="linenos">293</span></a> +</span><span id="L-294"><a href="#L-294"><span class="linenos">294</span></a> <span class="k">yield</span> <span class="n">csv_</span><span class="o">.</span><span class="n">reader</span><span class="p">(</span><span class="n">file</span><span class="p">,</span> <span class="n">delimiter</span><span class="o">=</span><span class="n">delimiter</span><span class="p">)</span> +</span><span id="L-295"><a href="#L-295"><span class="linenos">295</span></a> <span class="k">finally</span><span class="p">:</span> +</span><span id="L-296"><a href="#L-296"><span class="linenos">296</span></a> <span class="n">file</span><span class="o">.</span><span class="n">close</span><span class="p">()</span> +</span><span id="L-297"><a href="#L-297"><span class="linenos">297</span></a> +</span><span id="L-298"><a href="#L-298"><span class="linenos">298</span></a> +</span><span id="L-299"><a href="#L-299"><span class="linenos">299</span></a><span class="k">def</span> <span class="nf">find_new_name</span><span class="p">(</span><span class="n">taken</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Collection</span><span class="p">[</span><span class="nb">str</span><span class="p">],</span> <span class="n">base</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-></span> <span class="nb">str</span><span class="p">:</span> +</span><span id="L-300"><a href="#L-300"><span class="linenos">300</span></a><span class="w"> </span><span class="sd">"""</span> +</span><span id="L-301"><a href="#L-301"><span class="linenos">301</span></a><span class="sd"> Searches for a new name.</span> +</span><span id="L-302"><a href="#L-302"><span class="linenos">302</span></a> +</span><span id="L-303"><a href="#L-303"><span class="linenos">303</span></a><span class="sd"> Args:</span> +</span><span id="L-304"><a href="#L-304"><span class="linenos">304</span></a><span class="sd"> taken: A collection of taken names.</span> +</span><span id="L-305"><a href="#L-305"><span class="linenos">305</span></a><span class="sd"> base: Base name to alter.</span> +</span><span id="L-306"><a href="#L-306"><span class="linenos">306</span></a> +</span><span id="L-307"><a href="#L-307"><span class="linenos">307</span></a><span class="sd"> Returns:</span> +</span><span id="L-308"><a href="#L-308"><span class="linenos">308</span></a><span class="sd"> The new, available name.</span> +</span><span id="L-309"><a href="#L-309"><span class="linenos">309</span></a><span class="sd"> """</span> +</span><span id="L-310"><a href="#L-310"><span class="linenos">310</span></a> <span class="k">if</span> <span class="n">base</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">taken</span><span class="p">:</span> +</span><span id="L-311"><a href="#L-311"><span class="linenos">311</span></a> <span class="k">return</span> <span class="n">base</span> +</span><span id="L-312"><a href="#L-312"><span class="linenos">312</span></a> +</span><span id="L-313"><a href="#L-313"><span class="linenos">313</span></a> <span class="n">i</span> <span class="o">=</span> <span class="mi">2</span> +</span><span id="L-314"><a href="#L-314"><span class="linenos">314</span></a> <span class="n">new</span> <span class="o">=</span> <span class="sa">f</span><span class="s2">"</span><span class="si">{</span><span class="n">base</span><span class="si">}</span><span class="s2">_</span><span class="si">{</span><span class="n">i</span><span class="si">}</span><span class="s2">"</span> +</span><span id="L-315"><a href="#L-315"><span class="linenos">315</span></a> <span class="k">while</span> <span class="n">new</span> <span class="ow">in</span> <span class="n">taken</span><span class="p">:</span> +</span><span id="L-316"><a href="#L-316"><span class="linenos">316</span></a> <span class="n">i</span> <span class="o">+=</span> <span class="mi">1</span> +</span><span id="L-317"><a href="#L-317"><span class="linenos">317</span></a> <span class="n">new</span> <span class="o">=</span> <span class="sa">f</span><span class="s2">"</span><span class="si">{</span><span class="n">base</span><span class="si">}</span><span class="s2">_</span><span class="si">{</span><span class="n">i</span><span class="si">}</span><span class="s2">"</span> +</span><span id="L-318"><a href="#L-318"><span class="linenos">318</span></a> +</span><span id="L-319"><a href="#L-319"><span class="linenos">319</span></a> <span class="k">return</span> <span class="n">new</span> </span><span id="L-320"><a href="#L-320"><span class="linenos">320</span></a> -</span><span id="L-321"><a href="#L-321"><span class="linenos">321</span></a> <span class="k">return</span> <span class="n">new</span> -</span><span id="L-322"><a href="#L-322"><span class="linenos">322</span></a> -</span><span id="L-323"><a href="#L-323"><span class="linenos">323</span></a> -</span><span id="L-324"><a href="#L-324"><span class="linenos">324</span></a><span class="k">def</span> <span class="nf">name_sequence</span><span class="p">(</span><span class="n">prefix</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">Callable</span><span class="p">[[],</span> <span class="nb">str</span><span class="p">]:</span> -</span><span id="L-325"><a href="#L-325"><span class="linenos">325</span></a><span class="w"> </span><span class="sd">"""Returns a name generator given a prefix (e.g. a0, a1, a2, ... if the prefix is "a")."""</span> -</span><span id="L-326"><a href="#L-326"><span class="linenos">326</span></a> <span class="n">sequence</span> <span class="o">=</span> <span class="n">count</span><span class="p">()</span> -</span><span id="L-327"><a href="#L-327"><span class="linenos">327</span></a> <span class="k">return</span> <span class="k">lambda</span><span class="p">:</span> <span class="sa">f</span><span class="s2">"</span><span class="si">{</span><span class="n">prefix</span><span class="si">}{</span><span class="nb">next</span><span class="p">(</span><span class="n">sequence</span><span class="p">)</span><span class="si">}</span><span class="s2">"</span> -</span><span id="L-328"><a href="#L-328"><span class="linenos">328</span></a> -</span><span id="L-329"><a href="#L-329"><span class="linenos">329</span></a> -</span><span id="L-330"><a href="#L-330"><span class="linenos">330</span></a><span class="k">def</span> <span class="nf">object_to_dict</span><span class="p">(</span><span class="n">obj</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">,</span> <span class="o">**</span><span class="n">kwargs</span><span class="p">)</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">Dict</span><span class="p">:</span> -</span><span id="L-331"><a href="#L-331"><span class="linenos">331</span></a><span class="w"> </span><span class="sd">"""Returns a dictionary created from an object's attributes."""</span> -</span><span id="L-332"><a href="#L-332"><span class="linenos">332</span></a> <span class="k">return</span> <span class="p">{</span> -</span><span id="L-333"><a href="#L-333"><span class="linenos">333</span></a> <span class="o">**</span><span class="p">{</span><span class="n">k</span><span class="p">:</span> <span class="n">v</span><span class="o">.</span><span class="n">copy</span><span class="p">()</span> <span class="k">if</span> <span class="nb">hasattr</span><span class="p">(</span><span class="n">v</span><span class="p">,</span> <span class="s2">"copy"</span><span class="p">)</span> <span class="k">else</span> <span class="n">copy</span><span class="p">(</span><span class="n">v</span><span class="p">)</span> <span class="k">for</span> <span class="n">k</span><span class="p">,</span> <span class="n">v</span> <span class="ow">in</span> <span class="nb">vars</span><span class="p">(</span><span class="n">obj</span><span class="p">)</span><span class="o">.</span><span class="n">items</span><span class="p">()},</span> -</span><span id="L-334"><a href="#L-334"><span class="linenos">334</span></a> <span class="o">**</span><span class="n">kwargs</span><span class="p">,</span> -</span><span id="L-335"><a href="#L-335"><span class="linenos">335</span></a> <span class="p">}</span> -</span><span id="L-336"><a href="#L-336"><span class="linenos">336</span></a> -</span><span id="L-337"><a href="#L-337"><span class="linenos">337</span></a> -</span><span id="L-338"><a href="#L-338"><span class="linenos">338</span></a><span class="k">def</span> <span class="nf">split_num_words</span><span class="p">(</span> -</span><span id="L-339"><a href="#L-339"><span class="linenos">339</span></a> <span class="n">value</span><span class="p">:</span> <span class="nb">str</span><span class="p">,</span> <span class="n">sep</span><span class="p">:</span> <span class="nb">str</span><span class="p">,</span> <span class="n">min_num_words</span><span class="p">:</span> <span class="nb">int</span><span class="p">,</span> <span class="n">fill_from_start</span><span class="p">:</span> <span class="nb">bool</span> <span class="o">=</span> <span class="kc">True</span> -</span><span id="L-340"><a href="#L-340"><span class="linenos">340</span></a><span class="p">)</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">List</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Optional</span><span class="p">[</span><span class="nb">str</span><span class="p">]]:</span> -</span><span id="L-341"><a href="#L-341"><span class="linenos">341</span></a><span class="w"> </span><span class="sd">"""</span> -</span><span id="L-342"><a href="#L-342"><span class="linenos">342</span></a><span class="sd"> Perform a split on a value and return N words as a result with `None` used for words that don't exist.</span> -</span><span id="L-343"><a href="#L-343"><span class="linenos">343</span></a> -</span><span id="L-344"><a href="#L-344"><span class="linenos">344</span></a><span class="sd"> Args:</span> -</span><span id="L-345"><a href="#L-345"><span class="linenos">345</span></a><span class="sd"> value: The value to be split.</span> -</span><span id="L-346"><a href="#L-346"><span class="linenos">346</span></a><span class="sd"> sep: The value to use to split on.</span> -</span><span id="L-347"><a href="#L-347"><span class="linenos">347</span></a><span class="sd"> min_num_words: The minimum number of words that are going to be in the result.</span> -</span><span id="L-348"><a href="#L-348"><span class="linenos">348</span></a><span class="sd"> fill_from_start: Indicates that if `None` values should be inserted at the start or end of the list.</span> -</span><span id="L-349"><a href="#L-349"><span class="linenos">349</span></a> -</span><span id="L-350"><a href="#L-350"><span class="linenos">350</span></a><span class="sd"> Examples:</span> -</span><span id="L-351"><a href="#L-351"><span class="linenos">351</span></a><span class="sd"> >>> split_num_words("db.table", ".", 3)</span> -</span><span id="L-352"><a href="#L-352"><span class="linenos">352</span></a><span class="sd"> [None, 'db', 'table']</span> -</span><span id="L-353"><a href="#L-353"><span class="linenos">353</span></a><span class="sd"> >>> split_num_words("db.table", ".", 3, fill_from_start=False)</span> -</span><span id="L-354"><a href="#L-354"><span class="linenos">354</span></a><span class="sd"> ['db', 'table', None]</span> -</span><span id="L-355"><a href="#L-355"><span class="linenos">355</span></a><span class="sd"> >>> split_num_words("db.table", ".", 1)</span> -</span><span id="L-356"><a href="#L-356"><span class="linenos">356</span></a><span class="sd"> ['db', 'table']</span> -</span><span id="L-357"><a href="#L-357"><span class="linenos">357</span></a> -</span><span id="L-358"><a href="#L-358"><span class="linenos">358</span></a><span class="sd"> Returns:</span> -</span><span id="L-359"><a href="#L-359"><span class="linenos">359</span></a><span class="sd"> The list of words returned by `split`, possibly augmented by a number of `None` values.</span> -</span><span id="L-360"><a href="#L-360"><span class="linenos">360</span></a><span class="sd"> """</span> -</span><span id="L-361"><a href="#L-361"><span class="linenos">361</span></a> <span class="n">words</span> <span class="o">=</span> <span class="n">value</span><span class="o">.</span><span class="n">split</span><span class="p">(</span><span class="n">sep</span><span class="p">)</span> -</span><span id="L-362"><a href="#L-362"><span class="linenos">362</span></a> <span class="k">if</span> <span class="n">fill_from_start</span><span class="p">:</span> -</span><span id="L-363"><a href="#L-363"><span class="linenos">363</span></a> <span class="k">return</span> <span class="p">[</span><span class="kc">None</span><span class="p">]</span> <span class="o">*</span> <span class="p">(</span><span class="n">min_num_words</span> <span class="o">-</span> <span class="nb">len</span><span class="p">(</span><span class="n">words</span><span class="p">))</span> <span class="o">+</span> <span class="n">words</span> -</span><span id="L-364"><a href="#L-364"><span class="linenos">364</span></a> <span class="k">return</span> <span class="n">words</span> <span class="o">+</span> <span class="p">[</span><span class="kc">None</span><span class="p">]</span> <span class="o">*</span> <span class="p">(</span><span class="n">min_num_words</span> <span class="o">-</span> <span class="nb">len</span><span class="p">(</span><span class="n">words</span><span class="p">))</span> -</span><span id="L-365"><a href="#L-365"><span class="linenos">365</span></a> -</span><span id="L-366"><a href="#L-366"><span class="linenos">366</span></a> -</span><span id="L-367"><a href="#L-367"><span class="linenos">367</span></a><span class="k">def</span> <span class="nf">is_iterable</span><span class="p">(</span><span class="n">value</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">)</span> <span class="o">-></span> <span class="nb">bool</span><span class="p">:</span> -</span><span id="L-368"><a href="#L-368"><span class="linenos">368</span></a><span class="w"> </span><span class="sd">"""</span> -</span><span id="L-369"><a href="#L-369"><span class="linenos">369</span></a><span class="sd"> Checks if the value is an iterable, excluding the types `str` and `bytes`.</span> -</span><span id="L-370"><a href="#L-370"><span class="linenos">370</span></a> -</span><span id="L-371"><a href="#L-371"><span class="linenos">371</span></a><span class="sd"> Examples:</span> -</span><span id="L-372"><a href="#L-372"><span class="linenos">372</span></a><span class="sd"> >>> is_iterable([1,2])</span> -</span><span id="L-373"><a href="#L-373"><span class="linenos">373</span></a><span class="sd"> True</span> -</span><span id="L-374"><a href="#L-374"><span class="linenos">374</span></a><span class="sd"> >>> is_iterable("test")</span> -</span><span id="L-375"><a href="#L-375"><span class="linenos">375</span></a><span class="sd"> False</span> -</span><span id="L-376"><a href="#L-376"><span class="linenos">376</span></a> -</span><span id="L-377"><a href="#L-377"><span class="linenos">377</span></a><span class="sd"> Args:</span> -</span><span id="L-378"><a href="#L-378"><span class="linenos">378</span></a><span class="sd"> value: The value to check if it is an iterable.</span> -</span><span id="L-379"><a href="#L-379"><span class="linenos">379</span></a> -</span><span id="L-380"><a href="#L-380"><span class="linenos">380</span></a><span class="sd"> Returns:</span> -</span><span id="L-381"><a href="#L-381"><span class="linenos">381</span></a><span class="sd"> A `bool` value indicating if it is an iterable.</span> -</span><span id="L-382"><a href="#L-382"><span class="linenos">382</span></a><span class="sd"> """</span> -</span><span id="L-383"><a href="#L-383"><span class="linenos">383</span></a> <span class="kn">from</span> <span class="nn">sqlglot</span> <span class="kn">import</span> <span class="n">Expression</span> +</span><span id="L-321"><a href="#L-321"><span class="linenos">321</span></a> +</span><span id="L-322"><a href="#L-322"><span class="linenos">322</span></a><span class="k">def</span> <span class="nf">name_sequence</span><span class="p">(</span><span class="n">prefix</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">Callable</span><span class="p">[[],</span> <span class="nb">str</span><span class="p">]:</span> +</span><span id="L-323"><a href="#L-323"><span class="linenos">323</span></a><span class="w"> </span><span class="sd">"""Returns a name generator given a prefix (e.g. a0, a1, a2, ... if the prefix is "a")."""</span> +</span><span id="L-324"><a href="#L-324"><span class="linenos">324</span></a> <span class="n">sequence</span> <span class="o">=</span> <span class="n">count</span><span class="p">()</span> +</span><span id="L-325"><a href="#L-325"><span class="linenos">325</span></a> <span class="k">return</span> <span class="k">lambda</span><span class="p">:</span> <span class="sa">f</span><span class="s2">"</span><span class="si">{</span><span class="n">prefix</span><span class="si">}{</span><span class="nb">next</span><span class="p">(</span><span class="n">sequence</span><span class="p">)</span><span class="si">}</span><span class="s2">"</span> +</span><span id="L-326"><a href="#L-326"><span class="linenos">326</span></a> +</span><span id="L-327"><a href="#L-327"><span class="linenos">327</span></a> +</span><span id="L-328"><a href="#L-328"><span class="linenos">328</span></a><span class="k">def</span> <span class="nf">object_to_dict</span><span class="p">(</span><span class="n">obj</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">,</span> <span class="o">**</span><span class="n">kwargs</span><span class="p">)</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">Dict</span><span class="p">:</span> +</span><span id="L-329"><a href="#L-329"><span class="linenos">329</span></a><span class="w"> </span><span class="sd">"""Returns a dictionary created from an object's attributes."""</span> +</span><span id="L-330"><a href="#L-330"><span class="linenos">330</span></a> <span class="k">return</span> <span class="p">{</span> +</span><span id="L-331"><a href="#L-331"><span class="linenos">331</span></a> <span class="o">**</span><span class="p">{</span><span class="n">k</span><span class="p">:</span> <span class="n">v</span><span class="o">.</span><span class="n">copy</span><span class="p">()</span> <span class="k">if</span> <span class="nb">hasattr</span><span class="p">(</span><span class="n">v</span><span class="p">,</span> <span class="s2">"copy"</span><span class="p">)</span> <span class="k">else</span> <span class="n">copy</span><span class="p">(</span><span class="n">v</span><span class="p">)</span> <span class="k">for</span> <span class="n">k</span><span class="p">,</span> <span class="n">v</span> <span class="ow">in</span> <span class="nb">vars</span><span class="p">(</span><span class="n">obj</span><span class="p">)</span><span class="o">.</span><span class="n">items</span><span class="p">()},</span> +</span><span id="L-332"><a href="#L-332"><span class="linenos">332</span></a> <span class="o">**</span><span class="n">kwargs</span><span class="p">,</span> +</span><span id="L-333"><a href="#L-333"><span class="linenos">333</span></a> <span class="p">}</span> +</span><span id="L-334"><a href="#L-334"><span class="linenos">334</span></a> +</span><span id="L-335"><a href="#L-335"><span class="linenos">335</span></a> +</span><span id="L-336"><a href="#L-336"><span class="linenos">336</span></a><span class="k">def</span> <span class="nf">split_num_words</span><span class="p">(</span> +</span><span id="L-337"><a href="#L-337"><span class="linenos">337</span></a> <span class="n">value</span><span class="p">:</span> <span class="nb">str</span><span class="p">,</span> <span class="n">sep</span><span class="p">:</span> <span class="nb">str</span><span class="p">,</span> <span class="n">min_num_words</span><span class="p">:</span> <span class="nb">int</span><span class="p">,</span> <span class="n">fill_from_start</span><span class="p">:</span> <span class="nb">bool</span> <span class="o">=</span> <span class="kc">True</span> +</span><span id="L-338"><a href="#L-338"><span class="linenos">338</span></a><span class="p">)</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">List</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Optional</span><span class="p">[</span><span class="nb">str</span><span class="p">]]:</span> +</span><span id="L-339"><a href="#L-339"><span class="linenos">339</span></a><span class="w"> </span><span class="sd">"""</span> +</span><span id="L-340"><a href="#L-340"><span class="linenos">340</span></a><span class="sd"> Perform a split on a value and return N words as a result with `None` used for words that don't exist.</span> +</span><span id="L-341"><a href="#L-341"><span class="linenos">341</span></a> +</span><span id="L-342"><a href="#L-342"><span class="linenos">342</span></a><span class="sd"> Args:</span> +</span><span id="L-343"><a href="#L-343"><span class="linenos">343</span></a><span class="sd"> value: The value to be split.</span> +</span><span id="L-344"><a href="#L-344"><span class="linenos">344</span></a><span class="sd"> sep: The value to use to split on.</span> +</span><span id="L-345"><a href="#L-345"><span class="linenos">345</span></a><span class="sd"> min_num_words: The minimum number of words that are going to be in the result.</span> +</span><span id="L-346"><a href="#L-346"><span class="linenos">346</span></a><span class="sd"> fill_from_start: Indicates that if `None` values should be inserted at the start or end of the list.</span> +</span><span id="L-347"><a href="#L-347"><span class="linenos">347</span></a> +</span><span id="L-348"><a href="#L-348"><span class="linenos">348</span></a><span class="sd"> Examples:</span> +</span><span id="L-349"><a href="#L-349"><span class="linenos">349</span></a><span class="sd"> >>> split_num_words("db.table", ".", 3)</span> +</span><span id="L-350"><a href="#L-350"><span class="linenos">350</span></a><span class="sd"> [None, 'db', 'table']</span> +</span><span id="L-351"><a href="#L-351"><span class="linenos">351</span></a><span class="sd"> >>> split_num_words("db.table", ".", 3, fill_from_start=False)</span> +</span><span id="L-352"><a href="#L-352"><span class="linenos">352</span></a><span class="sd"> ['db', 'table', None]</span> +</span><span id="L-353"><a href="#L-353"><span class="linenos">353</span></a><span class="sd"> >>> split_num_words("db.table", ".", 1)</span> +</span><span id="L-354"><a href="#L-354"><span class="linenos">354</span></a><span class="sd"> ['db', 'table']</span> +</span><span id="L-355"><a href="#L-355"><span class="linenos">355</span></a> +</span><span id="L-356"><a href="#L-356"><span class="linenos">356</span></a><span class="sd"> Returns:</span> +</span><span id="L-357"><a href="#L-357"><span class="linenos">357</span></a><span class="sd"> The list of words returned by `split`, possibly augmented by a number of `None` values.</span> +</span><span id="L-358"><a href="#L-358"><span class="linenos">358</span></a><span class="sd"> """</span> +</span><span id="L-359"><a href="#L-359"><span class="linenos">359</span></a> <span class="n">words</span> <span class="o">=</span> <span class="n">value</span><span class="o">.</span><span class="n">split</span><span class="p">(</span><span class="n">sep</span><span class="p">)</span> +</span><span id="L-360"><a href="#L-360"><span class="linenos">360</span></a> <span class="k">if</span> <span class="n">fill_from_start</span><span class="p">:</span> +</span><span id="L-361"><a href="#L-361"><span class="linenos">361</span></a> <span class="k">return</span> <span class="p">[</span><span class="kc">None</span><span class="p">]</span> <span class="o">*</span> <span class="p">(</span><span class="n">min_num_words</span> <span class="o">-</span> <span class="nb">len</span><span class="p">(</span><span class="n">words</span><span class="p">))</span> <span class="o">+</span> <span class="n">words</span> +</span><span id="L-362"><a href="#L-362"><span class="linenos">362</span></a> <span class="k">return</span> <span class="n">words</span> <span class="o">+</span> <span class="p">[</span><span class="kc">None</span><span class="p">]</span> <span class="o">*</span> <span class="p">(</span><span class="n">min_num_words</span> <span class="o">-</span> <span class="nb">len</span><span class="p">(</span><span class="n">words</span><span class="p">))</span> +</span><span id="L-363"><a href="#L-363"><span class="linenos">363</span></a> +</span><span id="L-364"><a href="#L-364"><span class="linenos">364</span></a> +</span><span id="L-365"><a href="#L-365"><span class="linenos">365</span></a><span class="k">def</span> <span class="nf">is_iterable</span><span class="p">(</span><span class="n">value</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">)</span> <span class="o">-></span> <span class="nb">bool</span><span class="p">:</span> +</span><span id="L-366"><a href="#L-366"><span class="linenos">366</span></a><span class="w"> </span><span class="sd">"""</span> +</span><span id="L-367"><a href="#L-367"><span class="linenos">367</span></a><span class="sd"> Checks if the value is an iterable, excluding the types `str` and `bytes`.</span> +</span><span id="L-368"><a href="#L-368"><span class="linenos">368</span></a> +</span><span id="L-369"><a href="#L-369"><span class="linenos">369</span></a><span class="sd"> Examples:</span> +</span><span id="L-370"><a href="#L-370"><span class="linenos">370</span></a><span class="sd"> >>> is_iterable([1,2])</span> +</span><span id="L-371"><a href="#L-371"><span class="linenos">371</span></a><span class="sd"> True</span> +</span><span id="L-372"><a href="#L-372"><span class="linenos">372</span></a><span class="sd"> >>> is_iterable("test")</span> +</span><span id="L-373"><a href="#L-373"><span class="linenos">373</span></a><span class="sd"> False</span> +</span><span id="L-374"><a href="#L-374"><span class="linenos">374</span></a> +</span><span id="L-375"><a href="#L-375"><span class="linenos">375</span></a><span class="sd"> Args:</span> +</span><span id="L-376"><a href="#L-376"><span class="linenos">376</span></a><span class="sd"> value: The value to check if it is an iterable.</span> +</span><span id="L-377"><a href="#L-377"><span class="linenos">377</span></a> +</span><span id="L-378"><a href="#L-378"><span class="linenos">378</span></a><span class="sd"> Returns:</span> +</span><span id="L-379"><a href="#L-379"><span class="linenos">379</span></a><span class="sd"> A `bool` value indicating if it is an iterable.</span> +</span><span id="L-380"><a href="#L-380"><span class="linenos">380</span></a><span class="sd"> """</span> +</span><span id="L-381"><a href="#L-381"><span class="linenos">381</span></a> <span class="kn">from</span> <span class="nn">sqlglot</span> <span class="kn">import</span> <span class="n">Expression</span> +</span><span id="L-382"><a href="#L-382"><span class="linenos">382</span></a> +</span><span id="L-383"><a href="#L-383"><span class="linenos">383</span></a> <span class="k">return</span> <span class="nb">hasattr</span><span class="p">(</span><span class="n">value</span><span class="p">,</span> <span class="s2">"__iter__"</span><span class="p">)</span> <span class="ow">and</span> <span class="ow">not</span> <span class="nb">isinstance</span><span class="p">(</span><span class="n">value</span><span class="p">,</span> <span class="p">(</span><span class="nb">str</span><span class="p">,</span> <span class="nb">bytes</span><span class="p">,</span> <span class="n">Expression</span><span class="p">))</span> </span><span id="L-384"><a href="#L-384"><span class="linenos">384</span></a> -</span><span id="L-385"><a href="#L-385"><span class="linenos">385</span></a> <span class="k">return</span> <span class="nb">hasattr</span><span class="p">(</span><span class="n">value</span><span class="p">,</span> <span class="s2">"__iter__"</span><span class="p">)</span> <span class="ow">and</span> <span class="ow">not</span> <span class="nb">isinstance</span><span class="p">(</span><span class="n">value</span><span class="p">,</span> <span class="p">(</span><span class="nb">str</span><span class="p">,</span> <span class="nb">bytes</span><span class="p">,</span> <span class="n">Expression</span><span class="p">))</span> -</span><span id="L-386"><a href="#L-386"><span class="linenos">386</span></a> -</span><span id="L-387"><a href="#L-387"><span class="linenos">387</span></a> -</span><span id="L-388"><a href="#L-388"><span class="linenos">388</span></a><span class="k">def</span> <span class="nf">flatten</span><span class="p">(</span><span class="n">values</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Iterable</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Iterable</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">]</span> <span class="o">|</span> <span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">])</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">Iterator</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">]:</span> -</span><span id="L-389"><a href="#L-389"><span class="linenos">389</span></a><span class="w"> </span><span class="sd">"""</span> -</span><span id="L-390"><a href="#L-390"><span class="linenos">390</span></a><span class="sd"> Flattens an iterable that can contain both iterable and non-iterable elements. Objects of</span> -</span><span id="L-391"><a href="#L-391"><span class="linenos">391</span></a><span class="sd"> type `str` and `bytes` are not regarded as iterables.</span> -</span><span id="L-392"><a href="#L-392"><span class="linenos">392</span></a> -</span><span id="L-393"><a href="#L-393"><span class="linenos">393</span></a><span class="sd"> Examples:</span> -</span><span id="L-394"><a href="#L-394"><span class="linenos">394</span></a><span class="sd"> >>> list(flatten([[1, 2], 3, {4}, (5, "bla")]))</span> -</span><span id="L-395"><a href="#L-395"><span class="linenos">395</span></a><span class="sd"> [1, 2, 3, 4, 5, 'bla']</span> -</span><span id="L-396"><a href="#L-396"><span class="linenos">396</span></a><span class="sd"> >>> list(flatten([1, 2, 3]))</span> -</span><span id="L-397"><a href="#L-397"><span class="linenos">397</span></a><span class="sd"> [1, 2, 3]</span> -</span><span id="L-398"><a href="#L-398"><span class="linenos">398</span></a> -</span><span id="L-399"><a href="#L-399"><span class="linenos">399</span></a><span class="sd"> Args:</span> -</span><span id="L-400"><a href="#L-400"><span class="linenos">400</span></a><span class="sd"> values: The value to be flattened.</span> -</span><span id="L-401"><a href="#L-401"><span class="linenos">401</span></a> -</span><span id="L-402"><a href="#L-402"><span class="linenos">402</span></a><span class="sd"> Yields:</span> -</span><span id="L-403"><a href="#L-403"><span class="linenos">403</span></a><span class="sd"> Non-iterable elements in `values`.</span> -</span><span id="L-404"><a href="#L-404"><span class="linenos">404</span></a><span class="sd"> """</span> -</span><span id="L-405"><a href="#L-405"><span class="linenos">405</span></a> <span class="k">for</span> <span class="n">value</span> <span class="ow">in</span> <span class="n">values</span><span class="p">:</span> -</span><span id="L-406"><a href="#L-406"><span class="linenos">406</span></a> <span class="k">if</span> <span class="n">is_iterable</span><span class="p">(</span><span class="n">value</span><span class="p">):</span> -</span><span id="L-407"><a href="#L-407"><span class="linenos">407</span></a> <span class="k">yield from</span> <span class="n">flatten</span><span class="p">(</span><span class="n">value</span><span class="p">)</span> -</span><span id="L-408"><a href="#L-408"><span class="linenos">408</span></a> <span class="k">else</span><span class="p">:</span> -</span><span id="L-409"><a href="#L-409"><span class="linenos">409</span></a> <span class="k">yield</span> <span class="n">value</span> -</span><span id="L-410"><a href="#L-410"><span class="linenos">410</span></a> -</span><span id="L-411"><a href="#L-411"><span class="linenos">411</span></a> -</span><span id="L-412"><a href="#L-412"><span class="linenos">412</span></a><span class="k">def</span> <span class="nf">dict_depth</span><span class="p">(</span><span class="n">d</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Dict</span><span class="p">)</span> <span class="o">-></span> <span class="nb">int</span><span class="p">:</span> -</span><span id="L-413"><a href="#L-413"><span class="linenos">413</span></a><span class="w"> </span><span class="sd">"""</span> -</span><span id="L-414"><a href="#L-414"><span class="linenos">414</span></a><span class="sd"> Get the nesting depth of a dictionary.</span> -</span><span id="L-415"><a href="#L-415"><span class="linenos">415</span></a> -</span><span id="L-416"><a href="#L-416"><span class="linenos">416</span></a><span class="sd"> Example:</span> -</span><span id="L-417"><a href="#L-417"><span class="linenos">417</span></a><span class="sd"> >>> dict_depth(None)</span> -</span><span id="L-418"><a href="#L-418"><span class="linenos">418</span></a><span class="sd"> 0</span> -</span><span id="L-419"><a href="#L-419"><span class="linenos">419</span></a><span class="sd"> >>> dict_depth({})</span> +</span><span id="L-385"><a href="#L-385"><span class="linenos">385</span></a> +</span><span id="L-386"><a href="#L-386"><span class="linenos">386</span></a><span class="k">def</span> <span class="nf">flatten</span><span class="p">(</span><span class="n">values</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Iterable</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Iterable</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">]</span> <span class="o">|</span> <span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">])</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">Iterator</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">]:</span> +</span><span id="L-387"><a href="#L-387"><span class="linenos">387</span></a><span class="w"> </span><span class="sd">"""</span> +</span><span id="L-388"><a href="#L-388"><span class="linenos">388</span></a><span class="sd"> Flattens an iterable that can contain both iterable and non-iterable elements. Objects of</span> +</span><span id="L-389"><a href="#L-389"><span class="linenos">389</span></a><span class="sd"> type `str` and `bytes` are not regarded as iterables.</span> +</span><span id="L-390"><a href="#L-390"><span class="linenos">390</span></a> +</span><span id="L-391"><a href="#L-391"><span class="linenos">391</span></a><span class="sd"> Examples:</span> +</span><span id="L-392"><a href="#L-392"><span class="linenos">392</span></a><span class="sd"> >>> list(flatten([[1, 2], 3, {4}, (5, "bla")]))</span> +</span><span id="L-393"><a href="#L-393"><span class="linenos">393</span></a><span class="sd"> [1, 2, 3, 4, 5, 'bla']</span> +</span><span id="L-394"><a href="#L-394"><span class="linenos">394</span></a><span class="sd"> >>> list(flatten([1, 2, 3]))</span> +</span><span id="L-395"><a href="#L-395"><span class="linenos">395</span></a><span class="sd"> [1, 2, 3]</span> +</span><span id="L-396"><a href="#L-396"><span class="linenos">396</span></a> +</span><span id="L-397"><a href="#L-397"><span class="linenos">397</span></a><span class="sd"> Args:</span> +</span><span id="L-398"><a href="#L-398"><span class="linenos">398</span></a><span class="sd"> values: The value to be flattened.</span> +</span><span id="L-399"><a href="#L-399"><span class="linenos">399</span></a> +</span><span id="L-400"><a href="#L-400"><span class="linenos">400</span></a><span class="sd"> Yields:</span> +</span><span id="L-401"><a href="#L-401"><span class="linenos">401</span></a><span class="sd"> Non-iterable elements in `values`.</span> +</span><span id="L-402"><a href="#L-402"><span class="linenos">402</span></a><span class="sd"> """</span> +</span><span id="L-403"><a href="#L-403"><span class="linenos">403</span></a> <span class="k">for</span> <span class="n">value</span> <span class="ow">in</span> <span class="n">values</span><span class="p">:</span> +</span><span id="L-404"><a href="#L-404"><span class="linenos">404</span></a> <span class="k">if</span> <span class="n">is_iterable</span><span class="p">(</span><span class="n">value</span><span class="p">):</span> +</span><span id="L-405"><a href="#L-405"><span class="linenos">405</span></a> <span class="k">yield from</span> <span class="n">flatten</span><span class="p">(</span><span class="n">value</span><span class="p">)</span> +</span><span id="L-406"><a href="#L-406"><span class="linenos">406</span></a> <span class="k">else</span><span class="p">:</span> +</span><span id="L-407"><a href="#L-407"><span class="linenos">407</span></a> <span class="k">yield</span> <span class="n">value</span> +</span><span id="L-408"><a href="#L-408"><span class="linenos">408</span></a> +</span><span id="L-409"><a href="#L-409"><span class="linenos">409</span></a> +</span><span id="L-410"><a href="#L-410"><span class="linenos">410</span></a><span class="k">def</span> <span class="nf">dict_depth</span><span class="p">(</span><span class="n">d</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Dict</span><span class="p">)</span> <span class="o">-></span> <span class="nb">int</span><span class="p">:</span> +</span><span id="L-411"><a href="#L-411"><span class="linenos">411</span></a><span class="w"> </span><span class="sd">"""</span> +</span><span id="L-412"><a href="#L-412"><span class="linenos">412</span></a><span class="sd"> Get the nesting depth of a dictionary.</span> +</span><span id="L-413"><a href="#L-413"><span class="linenos">413</span></a> +</span><span id="L-414"><a href="#L-414"><span class="linenos">414</span></a><span class="sd"> Example:</span> +</span><span id="L-415"><a href="#L-415"><span class="linenos">415</span></a><span class="sd"> >>> dict_depth(None)</span> +</span><span id="L-416"><a href="#L-416"><span class="linenos">416</span></a><span class="sd"> 0</span> +</span><span id="L-417"><a href="#L-417"><span class="linenos">417</span></a><span class="sd"> >>> dict_depth({})</span> +</span><span id="L-418"><a href="#L-418"><span class="linenos">418</span></a><span class="sd"> 1</span> +</span><span id="L-419"><a href="#L-419"><span class="linenos">419</span></a><span class="sd"> >>> dict_depth({"a": "b"})</span> </span><span id="L-420"><a href="#L-420"><span class="linenos">420</span></a><span class="sd"> 1</span> -</span><span id="L-421"><a href="#L-421"><span class="linenos">421</span></a><span class="sd"> >>> dict_depth({"a": "b"})</span> -</span><span id="L-422"><a href="#L-422"><span class="linenos">422</span></a><span class="sd"> 1</span> -</span><span id="L-423"><a href="#L-423"><span class="linenos">423</span></a><span class="sd"> >>> dict_depth({"a": {}})</span> -</span><span id="L-424"><a href="#L-424"><span class="linenos">424</span></a><span class="sd"> 2</span> -</span><span id="L-425"><a href="#L-425"><span class="linenos">425</span></a><span class="sd"> >>> dict_depth({"a": {"b": {}}})</span> -</span><span id="L-426"><a href="#L-426"><span class="linenos">426</span></a><span class="sd"> 3</span> -</span><span id="L-427"><a href="#L-427"><span class="linenos">427</span></a><span class="sd"> """</span> -</span><span id="L-428"><a href="#L-428"><span class="linenos">428</span></a> <span class="k">try</span><span class="p">:</span> -</span><span id="L-429"><a href="#L-429"><span class="linenos">429</span></a> <span class="k">return</span> <span class="mi">1</span> <span class="o">+</span> <span class="n">dict_depth</span><span class="p">(</span><span class="nb">next</span><span class="p">(</span><span class="nb">iter</span><span class="p">(</span><span class="n">d</span><span class="o">.</span><span class="n">values</span><span class="p">())))</span> -</span><span id="L-430"><a href="#L-430"><span class="linenos">430</span></a> <span class="k">except</span> <span class="ne">AttributeError</span><span class="p">:</span> -</span><span id="L-431"><a href="#L-431"><span class="linenos">431</span></a> <span class="c1"># d doesn't have attribute "values"</span> -</span><span id="L-432"><a href="#L-432"><span class="linenos">432</span></a> <span class="k">return</span> <span class="mi">0</span> -</span><span id="L-433"><a href="#L-433"><span class="linenos">433</span></a> <span class="k">except</span> <span class="ne">StopIteration</span><span class="p">:</span> -</span><span id="L-434"><a href="#L-434"><span class="linenos">434</span></a> <span class="c1"># d.values() returns an empty sequence</span> -</span><span id="L-435"><a href="#L-435"><span class="linenos">435</span></a> <span class="k">return</span> <span class="mi">1</span> -</span><span id="L-436"><a href="#L-436"><span class="linenos">436</span></a> -</span><span id="L-437"><a href="#L-437"><span class="linenos">437</span></a> -</span><span id="L-438"><a href="#L-438"><span class="linenos">438</span></a><span class="k">def</span> <span class="nf">first</span><span class="p">(</span><span class="n">it</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Iterable</span><span class="p">[</span><span class="n">T</span><span class="p">])</span> <span class="o">-></span> <span class="n">T</span><span class="p">:</span> -</span><span id="L-439"><a href="#L-439"><span class="linenos">439</span></a><span class="w"> </span><span class="sd">"""Returns the first element from an iterable (useful for sets)."""</span> -</span><span id="L-440"><a href="#L-440"><span class="linenos">440</span></a> <span class="k">return</span> <span class="nb">next</span><span class="p">(</span><span class="n">i</span> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="n">it</span><span class="p">)</span> -</span><span id="L-441"><a href="#L-441"><span class="linenos">441</span></a> -</span><span id="L-442"><a href="#L-442"><span class="linenos">442</span></a> -</span><span id="L-443"><a href="#L-443"><span class="linenos">443</span></a><span class="k">def</span> <span class="nf">merge_ranges</span><span class="p">(</span><span class="n">ranges</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">List</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Tuple</span><span class="p">[</span><span class="n">A</span><span class="p">,</span> <span class="n">A</span><span class="p">]])</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">List</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Tuple</span><span class="p">[</span><span class="n">A</span><span class="p">,</span> <span class="n">A</span><span class="p">]]:</span> -</span><span id="L-444"><a href="#L-444"><span class="linenos">444</span></a><span class="w"> </span><span class="sd">"""</span> -</span><span id="L-445"><a href="#L-445"><span class="linenos">445</span></a><span class="sd"> Merges a sequence of ranges, represented as tuples (low, high) whose values</span> -</span><span id="L-446"><a href="#L-446"><span class="linenos">446</span></a><span class="sd"> belong to some totally-ordered set.</span> -</span><span id="L-447"><a href="#L-447"><span class="linenos">447</span></a> -</span><span id="L-448"><a href="#L-448"><span class="linenos">448</span></a><span class="sd"> Example:</span> -</span><span id="L-449"><a href="#L-449"><span class="linenos">449</span></a><span class="sd"> >>> merge_ranges([(1, 3), (2, 6)])</span> -</span><span id="L-450"><a href="#L-450"><span class="linenos">450</span></a><span class="sd"> [(1, 6)]</span> -</span><span id="L-451"><a href="#L-451"><span class="linenos">451</span></a><span class="sd"> """</span> -</span><span id="L-452"><a href="#L-452"><span class="linenos">452</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="n">ranges</span><span class="p">:</span> -</span><span id="L-453"><a href="#L-453"><span class="linenos">453</span></a> <span class="k">return</span> <span class="p">[]</span> +</span><span id="L-421"><a href="#L-421"><span class="linenos">421</span></a><span class="sd"> >>> dict_depth({"a": {}})</span> +</span><span id="L-422"><a href="#L-422"><span class="linenos">422</span></a><span class="sd"> 2</span> +</span><span id="L-423"><a href="#L-423"><span class="linenos">423</span></a><span class="sd"> >>> dict_depth({"a": {"b": {}}})</span> +</span><span id="L-424"><a href="#L-424"><span class="linenos">424</span></a><span class="sd"> 3</span> +</span><span id="L-425"><a href="#L-425"><span class="linenos">425</span></a><span class="sd"> """</span> +</span><span id="L-426"><a href="#L-426"><span class="linenos">426</span></a> <span class="k">try</span><span class="p">:</span> +</span><span id="L-427"><a href="#L-427"><span class="linenos">427</span></a> <span class="k">return</span> <span class="mi">1</span> <span class="o">+</span> <span class="n">dict_depth</span><span class="p">(</span><span class="nb">next</span><span class="p">(</span><span class="nb">iter</span><span class="p">(</span><span class="n">d</span><span class="o">.</span><span class="n">values</span><span class="p">())))</span> +</span><span id="L-428"><a href="#L-428"><span class="linenos">428</span></a> <span class="k">except</span> <span class="ne">AttributeError</span><span class="p">:</span> +</span><span id="L-429"><a href="#L-429"><span class="linenos">429</span></a> <span class="c1"># d doesn't have attribute "values"</span> +</span><span id="L-430"><a href="#L-430"><span class="linenos">430</span></a> <span class="k">return</span> <span class="mi">0</span> +</span><span id="L-431"><a href="#L-431"><span class="linenos">431</span></a> <span class="k">except</span> <span class="ne">StopIteration</span><span class="p">:</span> +</span><span id="L-432"><a href="#L-432"><span class="linenos">432</span></a> <span class="c1"># d.values() returns an empty sequence</span> +</span><span id="L-433"><a href="#L-433"><span class="linenos">433</span></a> <span class="k">return</span> <span class="mi">1</span> +</span><span id="L-434"><a href="#L-434"><span class="linenos">434</span></a> +</span><span id="L-435"><a href="#L-435"><span class="linenos">435</span></a> +</span><span id="L-436"><a href="#L-436"><span class="linenos">436</span></a><span class="k">def</span> <span class="nf">first</span><span class="p">(</span><span class="n">it</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Iterable</span><span class="p">[</span><span class="n">T</span><span class="p">])</span> <span class="o">-></span> <span class="n">T</span><span class="p">:</span> +</span><span id="L-437"><a href="#L-437"><span class="linenos">437</span></a><span class="w"> </span><span class="sd">"""Returns the first element from an iterable (useful for sets)."""</span> +</span><span id="L-438"><a href="#L-438"><span class="linenos">438</span></a> <span class="k">return</span> <span class="nb">next</span><span class="p">(</span><span class="n">i</span> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="n">it</span><span class="p">)</span> +</span><span id="L-439"><a href="#L-439"><span class="linenos">439</span></a> +</span><span id="L-440"><a href="#L-440"><span class="linenos">440</span></a> +</span><span id="L-441"><a href="#L-441"><span class="linenos">441</span></a><span class="k">def</span> <span class="nf">merge_ranges</span><span class="p">(</span><span class="n">ranges</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">List</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Tuple</span><span class="p">[</span><span class="n">A</span><span class="p">,</span> <span class="n">A</span><span class="p">]])</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">List</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Tuple</span><span class="p">[</span><span class="n">A</span><span class="p">,</span> <span class="n">A</span><span class="p">]]:</span> +</span><span id="L-442"><a href="#L-442"><span class="linenos">442</span></a><span class="w"> </span><span class="sd">"""</span> +</span><span id="L-443"><a href="#L-443"><span class="linenos">443</span></a><span class="sd"> Merges a sequence of ranges, represented as tuples (low, high) whose values</span> +</span><span id="L-444"><a href="#L-444"><span class="linenos">444</span></a><span class="sd"> belong to some totally-ordered set.</span> +</span><span id="L-445"><a href="#L-445"><span class="linenos">445</span></a> +</span><span id="L-446"><a href="#L-446"><span class="linenos">446</span></a><span class="sd"> Example:</span> +</span><span id="L-447"><a href="#L-447"><span class="linenos">447</span></a><span class="sd"> >>> merge_ranges([(1, 3), (2, 6)])</span> +</span><span id="L-448"><a href="#L-448"><span class="linenos">448</span></a><span class="sd"> [(1, 6)]</span> +</span><span id="L-449"><a href="#L-449"><span class="linenos">449</span></a><span class="sd"> """</span> +</span><span id="L-450"><a href="#L-450"><span class="linenos">450</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="n">ranges</span><span class="p">:</span> +</span><span id="L-451"><a href="#L-451"><span class="linenos">451</span></a> <span class="k">return</span> <span class="p">[]</span> +</span><span id="L-452"><a href="#L-452"><span class="linenos">452</span></a> +</span><span id="L-453"><a href="#L-453"><span class="linenos">453</span></a> <span class="n">ranges</span> <span class="o">=</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">ranges</span><span class="p">)</span> </span><span id="L-454"><a href="#L-454"><span class="linenos">454</span></a> -</span><span id="L-455"><a href="#L-455"><span class="linenos">455</span></a> <span class="n">ranges</span> <span class="o">=</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">ranges</span><span class="p">)</span> +</span><span id="L-455"><a href="#L-455"><span class="linenos">455</span></a> <span class="n">merged</span> <span class="o">=</span> <span class="p">[</span><span class="n">ranges</span><span class="p">[</span><span class="mi">0</span><span class="p">]]</span> </span><span id="L-456"><a href="#L-456"><span class="linenos">456</span></a> -</span><span id="L-457"><a href="#L-457"><span class="linenos">457</span></a> <span class="n">merged</span> <span class="o">=</span> <span class="p">[</span><span class="n">ranges</span><span class="p">[</span><span class="mi">0</span><span class="p">]]</span> -</span><span id="L-458"><a href="#L-458"><span class="linenos">458</span></a> -</span><span id="L-459"><a href="#L-459"><span class="linenos">459</span></a> <span class="k">for</span> <span class="n">start</span><span class="p">,</span> <span class="n">end</span> <span class="ow">in</span> <span class="n">ranges</span><span class="p">[</span><span class="mi">1</span><span class="p">:]:</span> -</span><span id="L-460"><a href="#L-460"><span class="linenos">460</span></a> <span class="n">last_start</span><span class="p">,</span> <span class="n">last_end</span> <span class="o">=</span> <span class="n">merged</span><span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">]</span> -</span><span id="L-461"><a href="#L-461"><span class="linenos">461</span></a> -</span><span id="L-462"><a href="#L-462"><span class="linenos">462</span></a> <span class="k">if</span> <span class="n">start</span> <span class="o"><=</span> <span class="n">last_end</span><span class="p">:</span> -</span><span id="L-463"><a href="#L-463"><span class="linenos">463</span></a> <span class="n">merged</span><span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">]</span> <span class="o">=</span> <span class="p">(</span><span class="n">last_start</span><span class="p">,</span> <span class="nb">max</span><span class="p">(</span><span class="n">last_end</span><span class="p">,</span> <span class="n">end</span><span class="p">))</span> -</span><span id="L-464"><a href="#L-464"><span class="linenos">464</span></a> <span class="k">else</span><span class="p">:</span> -</span><span id="L-465"><a href="#L-465"><span class="linenos">465</span></a> <span class="n">merged</span><span class="o">.</span><span class="n">append</span><span class="p">((</span><span class="n">start</span><span class="p">,</span> <span class="n">end</span><span class="p">))</span> -</span><span id="L-466"><a href="#L-466"><span class="linenos">466</span></a> -</span><span id="L-467"><a href="#L-467"><span class="linenos">467</span></a> <span class="k">return</span> <span class="n">merged</span> +</span><span id="L-457"><a href="#L-457"><span class="linenos">457</span></a> <span class="k">for</span> <span class="n">start</span><span class="p">,</span> <span class="n">end</span> <span class="ow">in</span> <span class="n">ranges</span><span class="p">[</span><span class="mi">1</span><span class="p">:]:</span> +</span><span id="L-458"><a href="#L-458"><span class="linenos">458</span></a> <span class="n">last_start</span><span class="p">,</span> <span class="n">last_end</span> <span class="o">=</span> <span class="n">merged</span><span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">]</span> +</span><span id="L-459"><a href="#L-459"><span class="linenos">459</span></a> +</span><span id="L-460"><a href="#L-460"><span class="linenos">460</span></a> <span class="k">if</span> <span class="n">start</span> <span class="o"><=</span> <span class="n">last_end</span><span class="p">:</span> +</span><span id="L-461"><a href="#L-461"><span class="linenos">461</span></a> <span class="n">merged</span><span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">]</span> <span class="o">=</span> <span class="p">(</span><span class="n">last_start</span><span class="p">,</span> <span class="nb">max</span><span class="p">(</span><span class="n">last_end</span><span class="p">,</span> <span class="n">end</span><span class="p">))</span> +</span><span id="L-462"><a href="#L-462"><span class="linenos">462</span></a> <span class="k">else</span><span class="p">:</span> +</span><span id="L-463"><a href="#L-463"><span class="linenos">463</span></a> <span class="n">merged</span><span class="o">.</span><span class="n">append</span><span class="p">((</span><span class="n">start</span><span class="p">,</span> <span class="n">end</span><span class="p">))</span> +</span><span id="L-464"><a href="#L-464"><span class="linenos">464</span></a> +</span><span id="L-465"><a href="#L-465"><span class="linenos">465</span></a> <span class="k">return</span> <span class="n">merged</span> </span></pre></div> @@ -992,12 +990,10 @@ of the corresponding enum's identifier (e.g. FOO.value results in "FOO").</p> </span><span id="apply_index_offset-185"><a href="#apply_index_offset-185"><span class="linenos">185</span></a> <span class="n">annotate_types</span><span class="p">(</span><span class="n">expression</span><span class="p">)</span> </span><span id="apply_index_offset-186"><a href="#apply_index_offset-186"><span class="linenos">186</span></a> <span class="k">if</span> <span class="n">t</span><span class="o">.</span><span class="n">cast</span><span class="p">(</span><span class="n">exp</span><span class="o">.</span><span class="n">DataType</span><span class="p">,</span> <span class="n">expression</span><span class="o">.</span><span class="n">type</span><span class="p">)</span><span class="o">.</span><span class="n">this</span> <span class="ow">in</span> <span class="n">exp</span><span class="o">.</span><span class="n">DataType</span><span class="o">.</span><span class="n">INTEGER_TYPES</span><span class="p">:</span> </span><span id="apply_index_offset-187"><a href="#apply_index_offset-187"><span class="linenos">187</span></a> <span class="n">logger</span><span class="o">.</span><span class="n">warning</span><span class="p">(</span><span class="s2">"Applying array index offset (</span><span class="si">%s</span><span class="s2">)"</span><span class="p">,</span> <span class="n">offset</span><span class="p">)</span> -</span><span id="apply_index_offset-188"><a href="#apply_index_offset-188"><span class="linenos">188</span></a> <span class="n">expression</span> <span class="o">=</span> <span class="n">simplify</span><span class="p">(</span> -</span><span id="apply_index_offset-189"><a href="#apply_index_offset-189"><span class="linenos">189</span></a> <span class="n">exp</span><span class="o">.</span><span class="n">Add</span><span class="p">(</span><span class="n">this</span><span class="o">=</span><span class="n">expression</span><span class="o">.</span><span class="n">copy</span><span class="p">(),</span> <span class="n">expression</span><span class="o">=</span><span class="n">exp</span><span class="o">.</span><span class="n">Literal</span><span class="o">.</span><span class="n">number</span><span class="p">(</span><span class="n">offset</span><span class="p">))</span> -</span><span id="apply_index_offset-190"><a href="#apply_index_offset-190"><span class="linenos">190</span></a> <span class="p">)</span> -</span><span id="apply_index_offset-191"><a href="#apply_index_offset-191"><span class="linenos">191</span></a> <span class="k">return</span> <span class="p">[</span><span class="n">expression</span><span class="p">]</span> -</span><span id="apply_index_offset-192"><a href="#apply_index_offset-192"><span class="linenos">192</span></a> -</span><span id="apply_index_offset-193"><a href="#apply_index_offset-193"><span class="linenos">193</span></a> <span class="k">return</span> <span class="n">expressions</span> +</span><span id="apply_index_offset-188"><a href="#apply_index_offset-188"><span class="linenos">188</span></a> <span class="n">expression</span> <span class="o">=</span> <span class="n">simplify</span><span class="p">(</span><span class="n">exp</span><span class="o">.</span><span class="n">Add</span><span class="p">(</span><span class="n">this</span><span class="o">=</span><span class="n">expression</span><span class="p">,</span> <span class="n">expression</span><span class="o">=</span><span class="n">exp</span><span class="o">.</span><span class="n">Literal</span><span class="o">.</span><span class="n">number</span><span class="p">(</span><span class="n">offset</span><span class="p">)))</span> +</span><span id="apply_index_offset-189"><a href="#apply_index_offset-189"><span class="linenos">189</span></a> <span class="k">return</span> <span class="p">[</span><span class="n">expression</span><span class="p">]</span> +</span><span id="apply_index_offset-190"><a href="#apply_index_offset-190"><span class="linenos">190</span></a> +</span><span id="apply_index_offset-191"><a href="#apply_index_offset-191"><span class="linenos">191</span></a> <span class="k">return</span> <span class="n">expressions</span> </span></pre></div> @@ -1032,9 +1028,9 @@ of the corresponding enum's identifier (e.g. FOO.value results in "FOO").</p> </div> <a class="headerlink" href="#camel_to_snake_case"></a> - <div class="pdoc-code codehilite"><pre><span></span><span id="camel_to_snake_case-196"><a href="#camel_to_snake_case-196"><span class="linenos">196</span></a><span class="k">def</span> <span class="nf">camel_to_snake_case</span><span class="p">(</span><span class="n">name</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-></span> <span class="nb">str</span><span class="p">:</span> -</span><span id="camel_to_snake_case-197"><a href="#camel_to_snake_case-197"><span class="linenos">197</span></a><span class="w"> </span><span class="sd">"""Converts `name` from camelCase to snake_case and returns the result."""</span> -</span><span id="camel_to_snake_case-198"><a href="#camel_to_snake_case-198"><span class="linenos">198</span></a> <span class="k">return</span> <span class="n">CAMEL_CASE_PATTERN</span><span class="o">.</span><span class="n">sub</span><span class="p">(</span><span class="s2">"_"</span><span class="p">,</span> <span class="n">name</span><span class="p">)</span><span class="o">.</span><span class="n">upper</span><span class="p">()</span> + <div class="pdoc-code codehilite"><pre><span></span><span id="camel_to_snake_case-194"><a href="#camel_to_snake_case-194"><span class="linenos">194</span></a><span class="k">def</span> <span class="nf">camel_to_snake_case</span><span class="p">(</span><span class="n">name</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-></span> <span class="nb">str</span><span class="p">:</span> +</span><span id="camel_to_snake_case-195"><a href="#camel_to_snake_case-195"><span class="linenos">195</span></a><span class="w"> </span><span class="sd">"""Converts `name` from camelCase to snake_case and returns the result."""</span> +</span><span id="camel_to_snake_case-196"><a href="#camel_to_snake_case-196"><span class="linenos">196</span></a> <span class="k">return</span> <span class="n">CAMEL_CASE_PATTERN</span><span class="o">.</span><span class="n">sub</span><span class="p">(</span><span class="s2">"_"</span><span class="p">,</span> <span class="n">name</span><span class="p">)</span><span class="o">.</span><span class="n">upper</span><span class="p">()</span> </span></pre></div> @@ -1054,30 +1050,30 @@ of the corresponding enum's identifier (e.g. FOO.value results in "FOO").</p> </div> <a class="headerlink" href="#while_changing"></a> - <div class="pdoc-code codehilite"><pre><span></span><span id="while_changing-201"><a href="#while_changing-201"><span class="linenos">201</span></a><span class="k">def</span> <span class="nf">while_changing</span><span class="p">(</span><span class="n">expression</span><span class="p">:</span> <span class="n">Expression</span><span class="p">,</span> <span class="n">func</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Callable</span><span class="p">[[</span><span class="n">Expression</span><span class="p">],</span> <span class="n">E</span><span class="p">])</span> <span class="o">-></span> <span class="n">E</span><span class="p">:</span> -</span><span id="while_changing-202"><a href="#while_changing-202"><span class="linenos">202</span></a><span class="w"> </span><span class="sd">"""</span> -</span><span id="while_changing-203"><a href="#while_changing-203"><span class="linenos">203</span></a><span class="sd"> Applies a transformation to a given expression until a fix point is reached.</span> -</span><span id="while_changing-204"><a href="#while_changing-204"><span class="linenos">204</span></a> -</span><span id="while_changing-205"><a href="#while_changing-205"><span class="linenos">205</span></a><span class="sd"> Args:</span> -</span><span id="while_changing-206"><a href="#while_changing-206"><span class="linenos">206</span></a><span class="sd"> expression: The expression to be transformed.</span> -</span><span id="while_changing-207"><a href="#while_changing-207"><span class="linenos">207</span></a><span class="sd"> func: The transformation to be applied.</span> -</span><span id="while_changing-208"><a href="#while_changing-208"><span class="linenos">208</span></a> -</span><span id="while_changing-209"><a href="#while_changing-209"><span class="linenos">209</span></a><span class="sd"> Returns:</span> -</span><span id="while_changing-210"><a href="#while_changing-210"><span class="linenos">210</span></a><span class="sd"> The transformed expression.</span> -</span><span id="while_changing-211"><a href="#while_changing-211"><span class="linenos">211</span></a><span class="sd"> """</span> -</span><span id="while_changing-212"><a href="#while_changing-212"><span class="linenos">212</span></a> <span class="k">while</span> <span class="kc">True</span><span class="p">:</span> -</span><span id="while_changing-213"><a href="#while_changing-213"><span class="linenos">213</span></a> <span class="k">for</span> <span class="n">n</span><span class="p">,</span> <span class="o">*</span><span class="n">_</span> <span class="ow">in</span> <span class="nb">reversed</span><span class="p">(</span><span class="nb">tuple</span><span class="p">(</span><span class="n">expression</span><span class="o">.</span><span class="n">walk</span><span class="p">())):</span> -</span><span id="while_changing-214"><a href="#while_changing-214"><span class="linenos">214</span></a> <span class="n">n</span><span class="o">.</span><span class="n">_hash</span> <span class="o">=</span> <span class="nb">hash</span><span class="p">(</span><span class="n">n</span><span class="p">)</span> -</span><span id="while_changing-215"><a href="#while_changing-215"><span class="linenos">215</span></a> -</span><span id="while_changing-216"><a href="#while_changing-216"><span class="linenos">216</span></a> <span class="n">start</span> <span class="o">=</span> <span class="nb">hash</span><span class="p">(</span><span class="n">expression</span><span class="p">)</span> -</span><span id="while_changing-217"><a href="#while_changing-217"><span class="linenos">217</span></a> <span class="n">expression</span> <span class="o">=</span> <span class="n">func</span><span class="p">(</span><span class="n">expression</span><span class="p">)</span> -</span><span id="while_changing-218"><a href="#while_changing-218"><span class="linenos">218</span></a> -</span><span id="while_changing-219"><a href="#while_changing-219"><span class="linenos">219</span></a> <span class="k">for</span> <span class="n">n</span><span class="p">,</span> <span class="o">*</span><span class="n">_</span> <span class="ow">in</span> <span class="n">expression</span><span class="o">.</span><span class="n">walk</span><span class="p">():</span> -</span><span id="while_changing-220"><a href="#while_changing-220"><span class="linenos">220</span></a> <span class="n">n</span><span class="o">.</span><span class="n">_hash</span> <span class="o">=</span> <span class="kc">None</span> -</span><span id="while_changing-221"><a href="#while_changing-221"><span class="linenos">221</span></a> <span class="k">if</span> <span class="n">start</span> <span class="o">==</span> <span class="nb">hash</span><span class="p">(</span><span class="n">expression</span><span class="p">):</span> -</span><span id="while_changing-222"><a href="#while_changing-222"><span class="linenos">222</span></a> <span class="k">break</span> -</span><span id="while_changing-223"><a href="#while_changing-223"><span class="linenos">223</span></a> -</span><span id="while_changing-224"><a href="#while_changing-224"><span class="linenos">224</span></a> <span class="k">return</span> <span class="n">expression</span> + <div class="pdoc-code codehilite"><pre><span></span><span id="while_changing-199"><a href="#while_changing-199"><span class="linenos">199</span></a><span class="k">def</span> <span class="nf">while_changing</span><span class="p">(</span><span class="n">expression</span><span class="p">:</span> <span class="n">Expression</span><span class="p">,</span> <span class="n">func</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Callable</span><span class="p">[[</span><span class="n">Expression</span><span class="p">],</span> <span class="n">E</span><span class="p">])</span> <span class="o">-></span> <span class="n">E</span><span class="p">:</span> +</span><span id="while_changing-200"><a href="#while_changing-200"><span class="linenos">200</span></a><span class="w"> </span><span class="sd">"""</span> +</span><span id="while_changing-201"><a href="#while_changing-201"><span class="linenos">201</span></a><span class="sd"> Applies a transformation to a given expression until a fix point is reached.</span> +</span><span id="while_changing-202"><a href="#while_changing-202"><span class="linenos">202</span></a> +</span><span id="while_changing-203"><a href="#while_changing-203"><span class="linenos">203</span></a><span class="sd"> Args:</span> +</span><span id="while_changing-204"><a href="#while_changing-204"><span class="linenos">204</span></a><span class="sd"> expression: The expression to be transformed.</span> +</span><span id="while_changing-205"><a href="#while_changing-205"><span class="linenos">205</span></a><span class="sd"> func: The transformation to be applied.</span> +</span><span id="while_changing-206"><a href="#while_changing-206"><span class="linenos">206</span></a> +</span><span id="while_changing-207"><a href="#while_changing-207"><span class="linenos">207</span></a><span class="sd"> Returns:</span> +</span><span id="while_changing-208"><a href="#while_changing-208"><span class="linenos">208</span></a><span class="sd"> The transformed expression.</span> +</span><span id="while_changing-209"><a href="#while_changing-209"><span class="linenos">209</span></a><span class="sd"> """</span> +</span><span id="while_changing-210"><a href="#while_changing-210"><span class="linenos">210</span></a> <span class="k">while</span> <span class="kc">True</span><span class="p">:</span> +</span><span id="while_changing-211"><a href="#while_changing-211"><span class="linenos">211</span></a> <span class="k">for</span> <span class="n">n</span><span class="p">,</span> <span class="o">*</span><span class="n">_</span> <span class="ow">in</span> <span class="nb">reversed</span><span class="p">(</span><span class="nb">tuple</span><span class="p">(</span><span class="n">expression</span><span class="o">.</span><span class="n">walk</span><span class="p">())):</span> +</span><span id="while_changing-212"><a href="#while_changing-212"><span class="linenos">212</span></a> <span class="n">n</span><span class="o">.</span><span class="n">_hash</span> <span class="o">=</span> <span class="nb">hash</span><span class="p">(</span><span class="n">n</span><span class="p">)</span> +</span><span id="while_changing-213"><a href="#while_changing-213"><span class="linenos">213</span></a> +</span><span id="while_changing-214"><a href="#while_changing-214"><span class="linenos">214</span></a> <span class="n">start</span> <span class="o">=</span> <span class="nb">hash</span><span class="p">(</span><span class="n">expression</span><span class="p">)</span> +</span><span id="while_changing-215"><a href="#while_changing-215"><span class="linenos">215</span></a> <span class="n">expression</span> <span class="o">=</span> <span class="n">func</span><span class="p">(</span><span class="n">expression</span><span class="p">)</span> +</span><span id="while_changing-216"><a href="#while_changing-216"><span class="linenos">216</span></a> +</span><span id="while_changing-217"><a href="#while_changing-217"><span class="linenos">217</span></a> <span class="k">for</span> <span class="n">n</span><span class="p">,</span> <span class="o">*</span><span class="n">_</span> <span class="ow">in</span> <span class="n">expression</span><span class="o">.</span><span class="n">walk</span><span class="p">():</span> +</span><span id="while_changing-218"><a href="#while_changing-218"><span class="linenos">218</span></a> <span class="n">n</span><span class="o">.</span><span class="n">_hash</span> <span class="o">=</span> <span class="kc">None</span> +</span><span id="while_changing-219"><a href="#while_changing-219"><span class="linenos">219</span></a> <span class="k">if</span> <span class="n">start</span> <span class="o">==</span> <span class="nb">hash</span><span class="p">(</span><span class="n">expression</span><span class="p">):</span> +</span><span id="while_changing-220"><a href="#while_changing-220"><span class="linenos">220</span></a> <span class="k">break</span> +</span><span id="while_changing-221"><a href="#while_changing-221"><span class="linenos">221</span></a> +</span><span id="while_changing-222"><a href="#while_changing-222"><span class="linenos">222</span></a> <span class="k">return</span> <span class="n">expression</span> </span></pre></div> @@ -1110,38 +1106,38 @@ of the corresponding enum's identifier (e.g. FOO.value results in "FOO").</p> </div> <a class="headerlink" href="#tsort"></a> - <div class="pdoc-code codehilite"><pre><span></span><span id="tsort-227"><a href="#tsort-227"><span class="linenos">227</span></a><span class="k">def</span> <span class="nf">tsort</span><span class="p">(</span><span class="n">dag</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Dict</span><span class="p">[</span><span class="n">T</span><span class="p">,</span> <span class="n">t</span><span class="o">.</span><span class="n">Set</span><span class="p">[</span><span class="n">T</span><span class="p">]])</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">List</span><span class="p">[</span><span class="n">T</span><span class="p">]:</span> -</span><span id="tsort-228"><a href="#tsort-228"><span class="linenos">228</span></a><span class="w"> </span><span class="sd">"""</span> -</span><span id="tsort-229"><a href="#tsort-229"><span class="linenos">229</span></a><span class="sd"> Sorts a given directed acyclic graph in topological order.</span> -</span><span id="tsort-230"><a href="#tsort-230"><span class="linenos">230</span></a> -</span><span id="tsort-231"><a href="#tsort-231"><span class="linenos">231</span></a><span class="sd"> Args:</span> -</span><span id="tsort-232"><a href="#tsort-232"><span class="linenos">232</span></a><span class="sd"> dag: The graph to be sorted.</span> -</span><span id="tsort-233"><a href="#tsort-233"><span class="linenos">233</span></a> -</span><span id="tsort-234"><a href="#tsort-234"><span class="linenos">234</span></a><span class="sd"> Returns:</span> -</span><span id="tsort-235"><a href="#tsort-235"><span class="linenos">235</span></a><span class="sd"> A list that contains all of the graph's nodes in topological order.</span> -</span><span id="tsort-236"><a href="#tsort-236"><span class="linenos">236</span></a><span class="sd"> """</span> -</span><span id="tsort-237"><a href="#tsort-237"><span class="linenos">237</span></a> <span class="n">result</span> <span class="o">=</span> <span class="p">[]</span> -</span><span id="tsort-238"><a href="#tsort-238"><span class="linenos">238</span></a> -</span><span id="tsort-239"><a href="#tsort-239"><span class="linenos">239</span></a> <span class="k">for</span> <span class="n">node</span><span class="p">,</span> <span class="n">deps</span> <span class="ow">in</span> <span class="nb">tuple</span><span class="p">(</span><span class="n">dag</span><span class="o">.</span><span class="n">items</span><span class="p">()):</span> -</span><span id="tsort-240"><a href="#tsort-240"><span class="linenos">240</span></a> <span class="k">for</span> <span class="n">dep</span> <span class="ow">in</span> <span class="n">deps</span><span class="p">:</span> -</span><span id="tsort-241"><a href="#tsort-241"><span class="linenos">241</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="n">dep</span> <span class="ow">in</span> <span class="n">dag</span><span class="p">:</span> -</span><span id="tsort-242"><a href="#tsort-242"><span class="linenos">242</span></a> <span class="n">dag</span><span class="p">[</span><span class="n">dep</span><span class="p">]</span> <span class="o">=</span> <span class="nb">set</span><span class="p">()</span> -</span><span id="tsort-243"><a href="#tsort-243"><span class="linenos">243</span></a> -</span><span id="tsort-244"><a href="#tsort-244"><span class="linenos">244</span></a> <span class="k">while</span> <span class="n">dag</span><span class="p">:</span> -</span><span id="tsort-245"><a href="#tsort-245"><span class="linenos">245</span></a> <span class="n">current</span> <span class="o">=</span> <span class="p">{</span><span class="n">node</span> <span class="k">for</span> <span class="n">node</span><span class="p">,</span> <span class="n">deps</span> <span class="ow">in</span> <span class="n">dag</span><span class="o">.</span><span class="n">items</span><span class="p">()</span> <span class="k">if</span> <span class="ow">not</span> <span class="n">deps</span><span class="p">}</span> -</span><span id="tsort-246"><a href="#tsort-246"><span class="linenos">246</span></a> -</span><span id="tsort-247"><a href="#tsort-247"><span class="linenos">247</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="n">current</span><span class="p">:</span> -</span><span id="tsort-248"><a href="#tsort-248"><span class="linenos">248</span></a> <span class="k">raise</span> <span class="ne">ValueError</span><span class="p">(</span><span class="s2">"Cycle error"</span><span class="p">)</span> -</span><span id="tsort-249"><a href="#tsort-249"><span class="linenos">249</span></a> -</span><span id="tsort-250"><a href="#tsort-250"><span class="linenos">250</span></a> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">current</span><span class="p">:</span> -</span><span id="tsort-251"><a href="#tsort-251"><span class="linenos">251</span></a> <span class="n">dag</span><span class="o">.</span><span class="n">pop</span><span class="p">(</span><span class="n">node</span><span class="p">)</span> -</span><span id="tsort-252"><a href="#tsort-252"><span class="linenos">252</span></a> -</span><span id="tsort-253"><a href="#tsort-253"><span class="linenos">253</span></a> <span class="k">for</span> <span class="n">deps</span> <span class="ow">in</span> <span class="n">dag</span><span class="o">.</span><span class="n">values</span><span class="p">():</span> -</span><span id="tsort-254"><a href="#tsort-254"><span class="linenos">254</span></a> <span class="n">deps</span> <span class="o">-=</span> <span class="n">current</span> + <div class="pdoc-code codehilite"><pre><span></span><span id="tsort-225"><a href="#tsort-225"><span class="linenos">225</span></a><span class="k">def</span> <span class="nf">tsort</span><span class="p">(</span><span class="n">dag</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Dict</span><span class="p">[</span><span class="n">T</span><span class="p">,</span> <span class="n">t</span><span class="o">.</span><span class="n">Set</span><span class="p">[</span><span class="n">T</span><span class="p">]])</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">List</span><span class="p">[</span><span class="n">T</span><span class="p">]:</span> +</span><span id="tsort-226"><a href="#tsort-226"><span class="linenos">226</span></a><span class="w"> </span><span class="sd">"""</span> +</span><span id="tsort-227"><a href="#tsort-227"><span class="linenos">227</span></a><span class="sd"> Sorts a given directed acyclic graph in topological order.</span> +</span><span id="tsort-228"><a href="#tsort-228"><span class="linenos">228</span></a> +</span><span id="tsort-229"><a href="#tsort-229"><span class="linenos">229</span></a><span class="sd"> Args:</span> +</span><span id="tsort-230"><a href="#tsort-230"><span class="linenos">230</span></a><span class="sd"> dag: The graph to be sorted.</span> +</span><span id="tsort-231"><a href="#tsort-231"><span class="linenos">231</span></a> +</span><span id="tsort-232"><a href="#tsort-232"><span class="linenos">232</span></a><span class="sd"> Returns:</span> +</span><span id="tsort-233"><a href="#tsort-233"><span class="linenos">233</span></a><span class="sd"> A list that contains all of the graph's nodes in topological order.</span> +</span><span id="tsort-234"><a href="#tsort-234"><span class="linenos">234</span></a><span class="sd"> """</span> +</span><span id="tsort-235"><a href="#tsort-235"><span class="linenos">235</span></a> <span class="n">result</span> <span class="o">=</span> <span class="p">[]</span> +</span><span id="tsort-236"><a href="#tsort-236"><span class="linenos">236</span></a> +</span><span id="tsort-237"><a href="#tsort-237"><span class="linenos">237</span></a> <span class="k">for</span> <span class="n">node</span><span class="p">,</span> <span class="n">deps</span> <span class="ow">in</span> <span class="nb">tuple</span><span class="p">(</span><span class="n">dag</span><span class="o">.</span><span class="n">items</span><span class="p">()):</span> +</span><span id="tsort-238"><a href="#tsort-238"><span class="linenos">238</span></a> <span class="k">for</span> <span class="n">dep</span> <span class="ow">in</span> <span class="n">deps</span><span class="p">:</span> +</span><span id="tsort-239"><a href="#tsort-239"><span class="linenos">239</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="n">dep</span> <span class="ow">in</span> <span class="n">dag</span><span class="p">:</span> +</span><span id="tsort-240"><a href="#tsort-240"><span class="linenos">240</span></a> <span class="n">dag</span><span class="p">[</span><span class="n">dep</span><span class="p">]</span> <span class="o">=</span> <span class="nb">set</span><span class="p">()</span> +</span><span id="tsort-241"><a href="#tsort-241"><span class="linenos">241</span></a> +</span><span id="tsort-242"><a href="#tsort-242"><span class="linenos">242</span></a> <span class="k">while</span> <span class="n">dag</span><span class="p">:</span> +</span><span id="tsort-243"><a href="#tsort-243"><span class="linenos">243</span></a> <span class="n">current</span> <span class="o">=</span> <span class="p">{</span><span class="n">node</span> <span class="k">for</span> <span class="n">node</span><span class="p">,</span> <span class="n">deps</span> <span class="ow">in</span> <span class="n">dag</span><span class="o">.</span><span class="n">items</span><span class="p">()</span> <span class="k">if</span> <span class="ow">not</span> <span class="n">deps</span><span class="p">}</span> +</span><span id="tsort-244"><a href="#tsort-244"><span class="linenos">244</span></a> +</span><span id="tsort-245"><a href="#tsort-245"><span class="linenos">245</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="n">current</span><span class="p">:</span> +</span><span id="tsort-246"><a href="#tsort-246"><span class="linenos">246</span></a> <span class="k">raise</span> <span class="ne">ValueError</span><span class="p">(</span><span class="s2">"Cycle error"</span><span class="p">)</span> +</span><span id="tsort-247"><a href="#tsort-247"><span class="linenos">247</span></a> +</span><span id="tsort-248"><a href="#tsort-248"><span class="linenos">248</span></a> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">current</span><span class="p">:</span> +</span><span id="tsort-249"><a href="#tsort-249"><span class="linenos">249</span></a> <span class="n">dag</span><span class="o">.</span><span class="n">pop</span><span class="p">(</span><span class="n">node</span><span class="p">)</span> +</span><span id="tsort-250"><a href="#tsort-250"><span class="linenos">250</span></a> +</span><span id="tsort-251"><a href="#tsort-251"><span class="linenos">251</span></a> <span class="k">for</span> <span class="n">deps</span> <span class="ow">in</span> <span class="n">dag</span><span class="o">.</span><span class="n">values</span><span class="p">():</span> +</span><span id="tsort-252"><a href="#tsort-252"><span class="linenos">252</span></a> <span class="n">deps</span> <span class="o">-=</span> <span class="n">current</span> +</span><span id="tsort-253"><a href="#tsort-253"><span class="linenos">253</span></a> +</span><span id="tsort-254"><a href="#tsort-254"><span class="linenos">254</span></a> <span class="n">result</span><span class="o">.</span><span class="n">extend</span><span class="p">(</span><span class="nb">sorted</span><span class="p">(</span><span class="n">current</span><span class="p">))</span> <span class="c1"># type: ignore</span> </span><span id="tsort-255"><a href="#tsort-255"><span class="linenos">255</span></a> -</span><span id="tsort-256"><a href="#tsort-256"><span class="linenos">256</span></a> <span class="n">result</span><span class="o">.</span><span class="n">extend</span><span class="p">(</span><span class="nb">sorted</span><span class="p">(</span><span class="n">current</span><span class="p">))</span> <span class="c1"># type: ignore</span> -</span><span id="tsort-257"><a href="#tsort-257"><span class="linenos">257</span></a> -</span><span id="tsort-258"><a href="#tsort-258"><span class="linenos">258</span></a> <span class="k">return</span> <span class="n">result</span> +</span><span id="tsort-256"><a href="#tsort-256"><span class="linenos">256</span></a> <span class="k">return</span> <span class="n">result</span> </span></pre></div> @@ -1173,17 +1169,17 @@ of the corresponding enum's identifier (e.g. FOO.value results in "FOO").</p> </div> <a class="headerlink" href="#open_file"></a> - <div class="pdoc-code codehilite"><pre><span></span><span id="open_file-261"><a href="#open_file-261"><span class="linenos">261</span></a><span class="k">def</span> <span class="nf">open_file</span><span class="p">(</span><span class="n">file_name</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">TextIO</span><span class="p">:</span> -</span><span id="open_file-262"><a href="#open_file-262"><span class="linenos">262</span></a><span class="w"> </span><span class="sd">"""Open a file that may be compressed as gzip and return it in universal newline mode."""</span> -</span><span id="open_file-263"><a href="#open_file-263"><span class="linenos">263</span></a> <span class="k">with</span> <span class="nb">open</span><span class="p">(</span><span class="n">file_name</span><span class="p">,</span> <span class="s2">"rb"</span><span class="p">)</span> <span class="k">as</span> <span class="n">f</span><span class="p">:</span> -</span><span id="open_file-264"><a href="#open_file-264"><span class="linenos">264</span></a> <span class="n">gzipped</span> <span class="o">=</span> <span class="n">f</span><span class="o">.</span><span class="n">read</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span> <span class="o">==</span> <span class="sa">b</span><span class="s2">"</span><span class="se">\x1f\x8b</span><span class="s2">"</span> -</span><span id="open_file-265"><a href="#open_file-265"><span class="linenos">265</span></a> -</span><span id="open_file-266"><a href="#open_file-266"><span class="linenos">266</span></a> <span class="k">if</span> <span class="n">gzipped</span><span class="p">:</span> -</span><span id="open_file-267"><a href="#open_file-267"><span class="linenos">267</span></a> <span class="kn">import</span> <span class="nn">gzip</span> + <div class="pdoc-code codehilite"><pre><span></span><span id="open_file-259"><a href="#open_file-259"><span class="linenos">259</span></a><span class="k">def</span> <span class="nf">open_file</span><span class="p">(</span><span class="n">file_name</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">TextIO</span><span class="p">:</span> +</span><span id="open_file-260"><a href="#open_file-260"><span class="linenos">260</span></a><span class="w"> </span><span class="sd">"""Open a file that may be compressed as gzip and return it in universal newline mode."""</span> +</span><span id="open_file-261"><a href="#open_file-261"><span class="linenos">261</span></a> <span class="k">with</span> <span class="nb">open</span><span class="p">(</span><span class="n">file_name</span><span class="p">,</span> <span class="s2">"rb"</span><span class="p">)</span> <span class="k">as</span> <span class="n">f</span><span class="p">:</span> +</span><span id="open_file-262"><a href="#open_file-262"><span class="linenos">262</span></a> <span class="n">gzipped</span> <span class="o">=</span> <span class="n">f</span><span class="o">.</span><span class="n">read</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span> <span class="o">==</span> <span class="sa">b</span><span class="s2">"</span><span class="se">\x1f\x8b</span><span class="s2">"</span> +</span><span id="open_file-263"><a href="#open_file-263"><span class="linenos">263</span></a> +</span><span id="open_file-264"><a href="#open_file-264"><span class="linenos">264</span></a> <span class="k">if</span> <span class="n">gzipped</span><span class="p">:</span> +</span><span id="open_file-265"><a href="#open_file-265"><span class="linenos">265</span></a> <span class="kn">import</span> <span class="nn">gzip</span> +</span><span id="open_file-266"><a href="#open_file-266"><span class="linenos">266</span></a> +</span><span id="open_file-267"><a href="#open_file-267"><span class="linenos">267</span></a> <span class="k">return</span> <span class="n">gzip</span><span class="o">.</span><span class="n">open</span><span class="p">(</span><span class="n">file_name</span><span class="p">,</span> <span class="s2">"rt"</span><span class="p">,</span> <span class="n">newline</span><span class="o">=</span><span class="s2">""</span><span class="p">)</span> </span><span id="open_file-268"><a href="#open_file-268"><span class="linenos">268</span></a> -</span><span id="open_file-269"><a href="#open_file-269"><span class="linenos">269</span></a> <span class="k">return</span> <span class="n">gzip</span><span class="o">.</span><span class="n">open</span><span class="p">(</span><span class="n">file_name</span><span class="p">,</span> <span class="s2">"rt"</span><span class="p">,</span> <span class="n">newline</span><span class="o">=</span><span class="s2">""</span><span class="p">)</span> -</span><span id="open_file-270"><a href="#open_file-270"><span class="linenos">270</span></a> -</span><span id="open_file-271"><a href="#open_file-271"><span class="linenos">271</span></a> <span class="k">return</span> <span class="nb">open</span><span class="p">(</span><span class="n">file_name</span><span class="p">,</span> <span class="n">encoding</span><span class="o">=</span><span class="s2">"utf-8"</span><span class="p">,</span> <span class="n">newline</span><span class="o">=</span><span class="s2">""</span><span class="p">)</span> +</span><span id="open_file-269"><a href="#open_file-269"><span class="linenos">269</span></a> <span class="k">return</span> <span class="nb">open</span><span class="p">(</span><span class="n">file_name</span><span class="p">,</span> <span class="n">encoding</span><span class="o">=</span><span class="s2">"utf-8"</span><span class="p">,</span> <span class="n">newline</span><span class="o">=</span><span class="s2">""</span><span class="p">)</span> </span></pre></div> @@ -1204,32 +1200,32 @@ of the corresponding enum's identifier (e.g. FOO.value results in "FOO").</p> </div> <a class="headerlink" href="#csv_reader"></a> - <div class="pdoc-code codehilite"><pre><span></span><span id="csv_reader-274"><a href="#csv_reader-274"><span class="linenos">274</span></a><span class="nd">@contextmanager</span> -</span><span id="csv_reader-275"><a href="#csv_reader-275"><span class="linenos">275</span></a><span class="k">def</span> <span class="nf">csv_reader</span><span class="p">(</span><span class="n">read_csv</span><span class="p">:</span> <span class="n">exp</span><span class="o">.</span><span class="n">ReadCSV</span><span class="p">)</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">:</span> -</span><span id="csv_reader-276"><a href="#csv_reader-276"><span class="linenos">276</span></a><span class="w"> </span><span class="sd">"""</span> -</span><span id="csv_reader-277"><a href="#csv_reader-277"><span class="linenos">277</span></a><span class="sd"> Returns a csv reader given the expression `READ_CSV(name, ['delimiter', '|', ...])`.</span> -</span><span id="csv_reader-278"><a href="#csv_reader-278"><span class="linenos">278</span></a> -</span><span id="csv_reader-279"><a href="#csv_reader-279"><span class="linenos">279</span></a><span class="sd"> Args:</span> -</span><span id="csv_reader-280"><a href="#csv_reader-280"><span class="linenos">280</span></a><span class="sd"> read_csv: A `ReadCSV` function call.</span> -</span><span id="csv_reader-281"><a href="#csv_reader-281"><span class="linenos">281</span></a> -</span><span id="csv_reader-282"><a href="#csv_reader-282"><span class="linenos">282</span></a><span class="sd"> Yields:</span> -</span><span id="csv_reader-283"><a href="#csv_reader-283"><span class="linenos">283</span></a><span class="sd"> A python csv reader.</span> -</span><span id="csv_reader-284"><a href="#csv_reader-284"><span class="linenos">284</span></a><span class="sd"> """</span> -</span><span id="csv_reader-285"><a href="#csv_reader-285"><span class="linenos">285</span></a> <span class="n">args</span> <span class="o">=</span> <span class="n">read_csv</span><span class="o">.</span><span class="n">expressions</span> -</span><span id="csv_reader-286"><a href="#csv_reader-286"><span class="linenos">286</span></a> <span class="n">file</span> <span class="o">=</span> <span class="n">open_file</span><span class="p">(</span><span class="n">read_csv</span><span class="o">.</span><span class="n">name</span><span class="p">)</span> -</span><span id="csv_reader-287"><a href="#csv_reader-287"><span class="linenos">287</span></a> -</span><span id="csv_reader-288"><a href="#csv_reader-288"><span class="linenos">288</span></a> <span class="n">delimiter</span> <span class="o">=</span> <span class="s2">","</span> -</span><span id="csv_reader-289"><a href="#csv_reader-289"><span class="linenos">289</span></a> <span class="n">args</span> <span class="o">=</span> <span class="nb">iter</span><span class="p">(</span><span class="n">arg</span><span class="o">.</span><span class="n">name</span> <span class="k">for</span> <span class="n">arg</span> <span class="ow">in</span> <span class="n">args</span><span class="p">)</span> -</span><span id="csv_reader-290"><a href="#csv_reader-290"><span class="linenos">290</span></a> <span class="k">for</span> <span class="n">k</span><span class="p">,</span> <span class="n">v</span> <span class="ow">in</span> <span class="nb">zip</span><span class="p">(</span><span class="n">args</span><span class="p">,</span> <span class="n">args</span><span class="p">):</span> -</span><span id="csv_reader-291"><a href="#csv_reader-291"><span class="linenos">291</span></a> <span class="k">if</span> <span class="n">k</span> <span class="o">==</span> <span class="s2">"delimiter"</span><span class="p">:</span> -</span><span id="csv_reader-292"><a href="#csv_reader-292"><span class="linenos">292</span></a> <span class="n">delimiter</span> <span class="o">=</span> <span class="n">v</span> -</span><span id="csv_reader-293"><a href="#csv_reader-293"><span class="linenos">293</span></a> -</span><span id="csv_reader-294"><a href="#csv_reader-294"><span class="linenos">294</span></a> <span class="k">try</span><span class="p">:</span> -</span><span id="csv_reader-295"><a href="#csv_reader-295"><span class="linenos">295</span></a> <span class="kn">import</span> <span class="nn">csv</span> <span class="k">as</span> <span class="nn">csv_</span> -</span><span id="csv_reader-296"><a href="#csv_reader-296"><span class="linenos">296</span></a> -</span><span id="csv_reader-297"><a href="#csv_reader-297"><span class="linenos">297</span></a> <span class="k">yield</span> <span class="n">csv_</span><span class="o">.</span><span class="n">reader</span><span class="p">(</span><span class="n">file</span><span class="p">,</span> <span class="n">delimiter</span><span class="o">=</span><span class="n">delimiter</span><span class="p">)</span> -</span><span id="csv_reader-298"><a href="#csv_reader-298"><span class="linenos">298</span></a> <span class="k">finally</span><span class="p">:</span> -</span><span id="csv_reader-299"><a href="#csv_reader-299"><span class="linenos">299</span></a> <span class="n">file</span><span class="o">.</span><span class="n">close</span><span class="p">()</span> + <div class="pdoc-code codehilite"><pre><span></span><span id="csv_reader-272"><a href="#csv_reader-272"><span class="linenos">272</span></a><span class="nd">@contextmanager</span> +</span><span id="csv_reader-273"><a href="#csv_reader-273"><span class="linenos">273</span></a><span class="k">def</span> <span class="nf">csv_reader</span><span class="p">(</span><span class="n">read_csv</span><span class="p">:</span> <span class="n">exp</span><span class="o">.</span><span class="n">ReadCSV</span><span class="p">)</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">:</span> +</span><span id="csv_reader-274"><a href="#csv_reader-274"><span class="linenos">274</span></a><span class="w"> </span><span class="sd">"""</span> +</span><span id="csv_reader-275"><a href="#csv_reader-275"><span class="linenos">275</span></a><span class="sd"> Returns a csv reader given the expression `READ_CSV(name, ['delimiter', '|', ...])`.</span> +</span><span id="csv_reader-276"><a href="#csv_reader-276"><span class="linenos">276</span></a> +</span><span id="csv_reader-277"><a href="#csv_reader-277"><span class="linenos">277</span></a><span class="sd"> Args:</span> +</span><span id="csv_reader-278"><a href="#csv_reader-278"><span class="linenos">278</span></a><span class="sd"> read_csv: A `ReadCSV` function call.</span> +</span><span id="csv_reader-279"><a href="#csv_reader-279"><span class="linenos">279</span></a> +</span><span id="csv_reader-280"><a href="#csv_reader-280"><span class="linenos">280</span></a><span class="sd"> Yields:</span> +</span><span id="csv_reader-281"><a href="#csv_reader-281"><span class="linenos">281</span></a><span class="sd"> A python csv reader.</span> +</span><span id="csv_reader-282"><a href="#csv_reader-282"><span class="linenos">282</span></a><span class="sd"> """</span> +</span><span id="csv_reader-283"><a href="#csv_reader-283"><span class="linenos">283</span></a> <span class="n">args</span> <span class="o">=</span> <span class="n">read_csv</span><span class="o">.</span><span class="n">expressions</span> +</span><span id="csv_reader-284"><a href="#csv_reader-284"><span class="linenos">284</span></a> <span class="n">file</span> <span class="o">=</span> <span class="n">open_file</span><span class="p">(</span><span class="n">read_csv</span><span class="o">.</span><span class="n">name</span><span class="p">)</span> +</span><span id="csv_reader-285"><a href="#csv_reader-285"><span class="linenos">285</span></a> +</span><span id="csv_reader-286"><a href="#csv_reader-286"><span class="linenos">286</span></a> <span class="n">delimiter</span> <span class="o">=</span> <span class="s2">","</span> +</span><span id="csv_reader-287"><a href="#csv_reader-287"><span class="linenos">287</span></a> <span class="n">args</span> <span class="o">=</span> <span class="nb">iter</span><span class="p">(</span><span class="n">arg</span><span class="o">.</span><span class="n">name</span> <span class="k">for</span> <span class="n">arg</span> <span class="ow">in</span> <span class="n">args</span><span class="p">)</span> +</span><span id="csv_reader-288"><a href="#csv_reader-288"><span class="linenos">288</span></a> <span class="k">for</span> <span class="n">k</span><span class="p">,</span> <span class="n">v</span> <span class="ow">in</span> <span class="nb">zip</span><span class="p">(</span><span class="n">args</span><span class="p">,</span> <span class="n">args</span><span class="p">):</span> +</span><span id="csv_reader-289"><a href="#csv_reader-289"><span class="linenos">289</span></a> <span class="k">if</span> <span class="n">k</span> <span class="o">==</span> <span class="s2">"delimiter"</span><span class="p">:</span> +</span><span id="csv_reader-290"><a href="#csv_reader-290"><span class="linenos">290</span></a> <span class="n">delimiter</span> <span class="o">=</span> <span class="n">v</span> +</span><span id="csv_reader-291"><a href="#csv_reader-291"><span class="linenos">291</span></a> +</span><span id="csv_reader-292"><a href="#csv_reader-292"><span class="linenos">292</span></a> <span class="k">try</span><span class="p">:</span> +</span><span id="csv_reader-293"><a href="#csv_reader-293"><span class="linenos">293</span></a> <span class="kn">import</span> <span class="nn">csv</span> <span class="k">as</span> <span class="nn">csv_</span> +</span><span id="csv_reader-294"><a href="#csv_reader-294"><span class="linenos">294</span></a> +</span><span id="csv_reader-295"><a href="#csv_reader-295"><span class="linenos">295</span></a> <span class="k">yield</span> <span class="n">csv_</span><span class="o">.</span><span class="n">reader</span><span class="p">(</span><span class="n">file</span><span class="p">,</span> <span class="n">delimiter</span><span class="o">=</span><span class="n">delimiter</span><span class="p">)</span> +</span><span id="csv_reader-296"><a href="#csv_reader-296"><span class="linenos">296</span></a> <span class="k">finally</span><span class="p">:</span> +</span><span id="csv_reader-297"><a href="#csv_reader-297"><span class="linenos">297</span></a> <span class="n">file</span><span class="o">.</span><span class="n">close</span><span class="p">()</span> </span></pre></div> @@ -1261,27 +1257,27 @@ of the corresponding enum's identifier (e.g. FOO.value results in "FOO").</p> </div> <a class="headerlink" href="#find_new_name"></a> - <div class="pdoc-code codehilite"><pre><span></span><span id="find_new_name-302"><a href="#find_new_name-302"><span class="linenos">302</span></a><span class="k">def</span> <span class="nf">find_new_name</span><span class="p">(</span><span class="n">taken</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Collection</span><span class="p">[</span><span class="nb">str</span><span class="p">],</span> <span class="n">base</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-></span> <span class="nb">str</span><span class="p">:</span> -</span><span id="find_new_name-303"><a href="#find_new_name-303"><span class="linenos">303</span></a><span class="w"> </span><span class="sd">"""</span> -</span><span id="find_new_name-304"><a href="#find_new_name-304"><span class="linenos">304</span></a><span class="sd"> Searches for a new name.</span> -</span><span id="find_new_name-305"><a href="#find_new_name-305"><span class="linenos">305</span></a> -</span><span id="find_new_name-306"><a href="#find_new_name-306"><span class="linenos">306</span></a><span class="sd"> Args:</span> -</span><span id="find_new_name-307"><a href="#find_new_name-307"><span class="linenos">307</span></a><span class="sd"> taken: A collection of taken names.</span> -</span><span id="find_new_name-308"><a href="#find_new_name-308"><span class="linenos">308</span></a><span class="sd"> base: Base name to alter.</span> -</span><span id="find_new_name-309"><a href="#find_new_name-309"><span class="linenos">309</span></a> -</span><span id="find_new_name-310"><a href="#find_new_name-310"><span class="linenos">310</span></a><span class="sd"> Returns:</span> -</span><span id="find_new_name-311"><a href="#find_new_name-311"><span class="linenos">311</span></a><span class="sd"> The new, available name.</span> -</span><span id="find_new_name-312"><a href="#find_new_name-312"><span class="linenos">312</span></a><span class="sd"> """</span> -</span><span id="find_new_name-313"><a href="#find_new_name-313"><span class="linenos">313</span></a> <span class="k">if</span> <span class="n">base</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">taken</span><span class="p">:</span> -</span><span id="find_new_name-314"><a href="#find_new_name-314"><span class="linenos">314</span></a> <span class="k">return</span> <span class="n">base</span> -</span><span id="find_new_name-315"><a href="#find_new_name-315"><span class="linenos">315</span></a> -</span><span id="find_new_name-316"><a href="#find_new_name-316"><span class="linenos">316</span></a> <span class="n">i</span> <span class="o">=</span> <span class="mi">2</span> -</span><span id="find_new_name-317"><a href="#find_new_name-317"><span class="linenos">317</span></a> <span class="n">new</span> <span class="o">=</span> <span class="sa">f</span><span class="s2">"</span><span class="si">{</span><span class="n">base</span><span class="si">}</span><span class="s2">_</span><span class="si">{</span><span class="n">i</span><span class="si">}</span><span class="s2">"</span> -</span><span id="find_new_name-318"><a href="#find_new_name-318"><span class="linenos">318</span></a> <span class="k">while</span> <span class="n">new</span> <span class="ow">in</span> <span class="n">taken</span><span class="p">:</span> -</span><span id="find_new_name-319"><a href="#find_new_name-319"><span class="linenos">319</span></a> <span class="n">i</span> <span class="o">+=</span> <span class="mi">1</span> -</span><span id="find_new_name-320"><a href="#find_new_name-320"><span class="linenos">320</span></a> <span class="n">new</span> <span class="o">=</span> <span class="sa">f</span><span class="s2">"</span><span class="si">{</span><span class="n">base</span><span class="si">}</span><span class="s2">_</span><span class="si">{</span><span class="n">i</span><span class="si">}</span><span class="s2">"</span> -</span><span id="find_new_name-321"><a href="#find_new_name-321"><span class="linenos">321</span></a> -</span><span id="find_new_name-322"><a href="#find_new_name-322"><span class="linenos">322</span></a> <span class="k">return</span> <span class="n">new</span> + <div class="pdoc-code codehilite"><pre><span></span><span id="find_new_name-300"><a href="#find_new_name-300"><span class="linenos">300</span></a><span class="k">def</span> <span class="nf">find_new_name</span><span class="p">(</span><span class="n">taken</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Collection</span><span class="p">[</span><span class="nb">str</span><span class="p">],</span> <span class="n">base</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-></span> <span class="nb">str</span><span class="p">:</span> +</span><span id="find_new_name-301"><a href="#find_new_name-301"><span class="linenos">301</span></a><span class="w"> </span><span class="sd">"""</span> +</span><span id="find_new_name-302"><a href="#find_new_name-302"><span class="linenos">302</span></a><span class="sd"> Searches for a new name.</span> +</span><span id="find_new_name-303"><a href="#find_new_name-303"><span class="linenos">303</span></a> +</span><span id="find_new_name-304"><a href="#find_new_name-304"><span class="linenos">304</span></a><span class="sd"> Args:</span> +</span><span id="find_new_name-305"><a href="#find_new_name-305"><span class="linenos">305</span></a><span class="sd"> taken: A collection of taken names.</span> +</span><span id="find_new_name-306"><a href="#find_new_name-306"><span class="linenos">306</span></a><span class="sd"> base: Base name to alter.</span> +</span><span id="find_new_name-307"><a href="#find_new_name-307"><span class="linenos">307</span></a> +</span><span id="find_new_name-308"><a href="#find_new_name-308"><span class="linenos">308</span></a><span class="sd"> Returns:</span> +</span><span id="find_new_name-309"><a href="#find_new_name-309"><span class="linenos">309</span></a><span class="sd"> The new, available name.</span> +</span><span id="find_new_name-310"><a href="#find_new_name-310"><span class="linenos">310</span></a><span class="sd"> """</span> +</span><span id="find_new_name-311"><a href="#find_new_name-311"><span class="linenos">311</span></a> <span class="k">if</span> <span class="n">base</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">taken</span><span class="p">:</span> +</span><span id="find_new_name-312"><a href="#find_new_name-312"><span class="linenos">312</span></a> <span class="k">return</span> <span class="n">base</span> +</span><span id="find_new_name-313"><a href="#find_new_name-313"><span class="linenos">313</span></a> +</span><span id="find_new_name-314"><a href="#find_new_name-314"><span class="linenos">314</span></a> <span class="n">i</span> <span class="o">=</span> <span class="mi">2</span> +</span><span id="find_new_name-315"><a href="#find_new_name-315"><span class="linenos">315</span></a> <span class="n">new</span> <span class="o">=</span> <span class="sa">f</span><span class="s2">"</span><span class="si">{</span><span class="n">base</span><span class="si">}</span><span class="s2">_</span><span class="si">{</span><span class="n">i</span><span class="si">}</span><span class="s2">"</span> +</span><span id="find_new_name-316"><a href="#find_new_name-316"><span class="linenos">316</span></a> <span class="k">while</span> <span class="n">new</span> <span class="ow">in</span> <span class="n">taken</span><span class="p">:</span> +</span><span id="find_new_name-317"><a href="#find_new_name-317"><span class="linenos">317</span></a> <span class="n">i</span> <span class="o">+=</span> <span class="mi">1</span> +</span><span id="find_new_name-318"><a href="#find_new_name-318"><span class="linenos">318</span></a> <span class="n">new</span> <span class="o">=</span> <span class="sa">f</span><span class="s2">"</span><span class="si">{</span><span class="n">base</span><span class="si">}</span><span class="s2">_</span><span class="si">{</span><span class="n">i</span><span class="si">}</span><span class="s2">"</span> +</span><span id="find_new_name-319"><a href="#find_new_name-319"><span class="linenos">319</span></a> +</span><span id="find_new_name-320"><a href="#find_new_name-320"><span class="linenos">320</span></a> <span class="k">return</span> <span class="n">new</span> </span></pre></div> @@ -1314,10 +1310,10 @@ of the corresponding enum's identifier (e.g. FOO.value results in "FOO").</p> </div> <a class="headerlink" href="#name_sequence"></a> - <div class="pdoc-code codehilite"><pre><span></span><span id="name_sequence-325"><a href="#name_sequence-325"><span class="linenos">325</span></a><span class="k">def</span> <span class="nf">name_sequence</span><span class="p">(</span><span class="n">prefix</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">Callable</span><span class="p">[[],</span> <span class="nb">str</span><span class="p">]:</span> -</span><span id="name_sequence-326"><a href="#name_sequence-326"><span class="linenos">326</span></a><span class="w"> </span><span class="sd">"""Returns a name generator given a prefix (e.g. a0, a1, a2, ... if the prefix is "a")."""</span> -</span><span id="name_sequence-327"><a href="#name_sequence-327"><span class="linenos">327</span></a> <span class="n">sequence</span> <span class="o">=</span> <span class="n">count</span><span class="p">()</span> -</span><span id="name_sequence-328"><a href="#name_sequence-328"><span class="linenos">328</span></a> <span class="k">return</span> <span class="k">lambda</span><span class="p">:</span> <span class="sa">f</span><span class="s2">"</span><span class="si">{</span><span class="n">prefix</span><span class="si">}{</span><span class="nb">next</span><span class="p">(</span><span class="n">sequence</span><span class="p">)</span><span class="si">}</span><span class="s2">"</span> + <div class="pdoc-code codehilite"><pre><span></span><span id="name_sequence-323"><a href="#name_sequence-323"><span class="linenos">323</span></a><span class="k">def</span> <span class="nf">name_sequence</span><span class="p">(</span><span class="n">prefix</span><span class="p">:</span> <span class="nb">str</span><span class="p">)</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">Callable</span><span class="p">[[],</span> <span class="nb">str</span><span class="p">]:</span> +</span><span id="name_sequence-324"><a href="#name_sequence-324"><span class="linenos">324</span></a><span class="w"> </span><span class="sd">"""Returns a name generator given a prefix (e.g. a0, a1, a2, ... if the prefix is "a")."""</span> +</span><span id="name_sequence-325"><a href="#name_sequence-325"><span class="linenos">325</span></a> <span class="n">sequence</span> <span class="o">=</span> <span class="n">count</span><span class="p">()</span> +</span><span id="name_sequence-326"><a href="#name_sequence-326"><span class="linenos">326</span></a> <span class="k">return</span> <span class="k">lambda</span><span class="p">:</span> <span class="sa">f</span><span class="s2">"</span><span class="si">{</span><span class="n">prefix</span><span class="si">}{</span><span class="nb">next</span><span class="p">(</span><span class="n">sequence</span><span class="p">)</span><span class="si">}</span><span class="s2">"</span> </span></pre></div> @@ -1337,12 +1333,12 @@ of the corresponding enum's identifier (e.g. FOO.value results in "FOO").</p> </div> <a class="headerlink" href="#object_to_dict"></a> - <div class="pdoc-code codehilite"><pre><span></span><span id="object_to_dict-331"><a href="#object_to_dict-331"><span class="linenos">331</span></a><span class="k">def</span> <span class="nf">object_to_dict</span><span class="p">(</span><span class="n">obj</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">,</span> <span class="o">**</span><span class="n">kwargs</span><span class="p">)</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">Dict</span><span class="p">:</span> -</span><span id="object_to_dict-332"><a href="#object_to_dict-332"><span class="linenos">332</span></a><span class="w"> </span><span class="sd">"""Returns a dictionary created from an object's attributes."""</span> -</span><span id="object_to_dict-333"><a href="#object_to_dict-333"><span class="linenos">333</span></a> <span class="k">return</span> <span class="p">{</span> -</span><span id="object_to_dict-334"><a href="#object_to_dict-334"><span class="linenos">334</span></a> <span class="o">**</span><span class="p">{</span><span class="n">k</span><span class="p">:</span> <span class="n">v</span><span class="o">.</span><span class="n">copy</span><span class="p">()</span> <span class="k">if</span> <span class="nb">hasattr</span><span class="p">(</span><span class="n">v</span><span class="p">,</span> <span class="s2">"copy"</span><span class="p">)</span> <span class="k">else</span> <span class="n">copy</span><span class="p">(</span><span class="n">v</span><span class="p">)</span> <span class="k">for</span> <span class="n">k</span><span class="p">,</span> <span class="n">v</span> <span class="ow">in</span> <span class="nb">vars</span><span class="p">(</span><span class="n">obj</span><span class="p">)</span><span class="o">.</span><span class="n">items</span><span class="p">()},</span> -</span><span id="object_to_dict-335"><a href="#object_to_dict-335"><span class="linenos">335</span></a> <span class="o">**</span><span class="n">kwargs</span><span class="p">,</span> -</span><span id="object_to_dict-336"><a href="#object_to_dict-336"><span class="linenos">336</span></a> <span class="p">}</span> + <div class="pdoc-code codehilite"><pre><span></span><span id="object_to_dict-329"><a href="#object_to_dict-329"><span class="linenos">329</span></a><span class="k">def</span> <span class="nf">object_to_dict</span><span class="p">(</span><span class="n">obj</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">,</span> <span class="o">**</span><span class="n">kwargs</span><span class="p">)</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">Dict</span><span class="p">:</span> +</span><span id="object_to_dict-330"><a href="#object_to_dict-330"><span class="linenos">330</span></a><span class="w"> </span><span class="sd">"""Returns a dictionary created from an object's attributes."""</span> +</span><span id="object_to_dict-331"><a href="#object_to_dict-331"><span class="linenos">331</span></a> <span class="k">return</span> <span class="p">{</span> +</span><span id="object_to_dict-332"><a href="#object_to_dict-332"><span class="linenos">332</span></a> <span class="o">**</span><span class="p">{</span><span class="n">k</span><span class="p">:</span> <span class="n">v</span><span class="o">.</span><span class="n">copy</span><span class="p">()</span> <span class="k">if</span> <span class="nb">hasattr</span><span class="p">(</span><span class="n">v</span><span class="p">,</span> <span class="s2">"copy"</span><span class="p">)</span> <span class="k">else</span> <span class="n">copy</span><span class="p">(</span><span class="n">v</span><span class="p">)</span> <span class="k">for</span> <span class="n">k</span><span class="p">,</span> <span class="n">v</span> <span class="ow">in</span> <span class="nb">vars</span><span class="p">(</span><span class="n">obj</span><span class="p">)</span><span class="o">.</span><span class="n">items</span><span class="p">()},</span> +</span><span id="object_to_dict-333"><a href="#object_to_dict-333"><span class="linenos">333</span></a> <span class="o">**</span><span class="n">kwargs</span><span class="p">,</span> +</span><span id="object_to_dict-334"><a href="#object_to_dict-334"><span class="linenos">334</span></a> <span class="p">}</span> </span></pre></div> @@ -1362,33 +1358,33 @@ of the corresponding enum's identifier (e.g. FOO.value results in "FOO").</p> </div> <a class="headerlink" href="#split_num_words"></a> - <div class="pdoc-code codehilite"><pre><span></span><span id="split_num_words-339"><a href="#split_num_words-339"><span class="linenos">339</span></a><span class="k">def</span> <span class="nf">split_num_words</span><span class="p">(</span> -</span><span id="split_num_words-340"><a href="#split_num_words-340"><span class="linenos">340</span></a> <span class="n">value</span><span class="p">:</span> <span class="nb">str</span><span class="p">,</span> <span class="n">sep</span><span class="p">:</span> <span class="nb">str</span><span class="p">,</span> <span class="n">min_num_words</span><span class="p">:</span> <span class="nb">int</span><span class="p">,</span> <span class="n">fill_from_start</span><span class="p">:</span> <span class="nb">bool</span> <span class="o">=</span> <span class="kc">True</span> -</span><span id="split_num_words-341"><a href="#split_num_words-341"><span class="linenos">341</span></a><span class="p">)</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">List</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Optional</span><span class="p">[</span><span class="nb">str</span><span class="p">]]:</span> -</span><span id="split_num_words-342"><a href="#split_num_words-342"><span class="linenos">342</span></a><span class="w"> </span><span class="sd">"""</span> -</span><span id="split_num_words-343"><a href="#split_num_words-343"><span class="linenos">343</span></a><span class="sd"> Perform a split on a value and return N words as a result with `None` used for words that don't exist.</span> -</span><span id="split_num_words-344"><a href="#split_num_words-344"><span class="linenos">344</span></a> -</span><span id="split_num_words-345"><a href="#split_num_words-345"><span class="linenos">345</span></a><span class="sd"> Args:</span> -</span><span id="split_num_words-346"><a href="#split_num_words-346"><span class="linenos">346</span></a><span class="sd"> value: The value to be split.</span> -</span><span id="split_num_words-347"><a href="#split_num_words-347"><span class="linenos">347</span></a><span class="sd"> sep: The value to use to split on.</span> -</span><span id="split_num_words-348"><a href="#split_num_words-348"><span class="linenos">348</span></a><span class="sd"> min_num_words: The minimum number of words that are going to be in the result.</span> -</span><span id="split_num_words-349"><a href="#split_num_words-349"><span class="linenos">349</span></a><span class="sd"> fill_from_start: Indicates that if `None` values should be inserted at the start or end of the list.</span> -</span><span id="split_num_words-350"><a href="#split_num_words-350"><span class="linenos">350</span></a> -</span><span id="split_num_words-351"><a href="#split_num_words-351"><span class="linenos">351</span></a><span class="sd"> Examples:</span> -</span><span id="split_num_words-352"><a href="#split_num_words-352"><span class="linenos">352</span></a><span class="sd"> >>> split_num_words("db.table", ".", 3)</span> -</span><span id="split_num_words-353"><a href="#split_num_words-353"><span class="linenos">353</span></a><span class="sd"> [None, 'db', 'table']</span> -</span><span id="split_num_words-354"><a href="#split_num_words-354"><span class="linenos">354</span></a><span class="sd"> >>> split_num_words("db.table", ".", 3, fill_from_start=False)</span> -</span><span id="split_num_words-355"><a href="#split_num_words-355"><span class="linenos">355</span></a><span class="sd"> ['db', 'table', None]</span> -</span><span id="split_num_words-356"><a href="#split_num_words-356"><span class="linenos">356</span></a><span class="sd"> >>> split_num_words("db.table", ".", 1)</span> -</span><span id="split_num_words-357"><a href="#split_num_words-357"><span class="linenos">357</span></a><span class="sd"> ['db', 'table']</span> -</span><span id="split_num_words-358"><a href="#split_num_words-358"><span class="linenos">358</span></a> -</span><span id="split_num_words-359"><a href="#split_num_words-359"><span class="linenos">359</span></a><span class="sd"> Returns:</span> -</span><span id="split_num_words-360"><a href="#split_num_words-360"><span class="linenos">360</span></a><span class="sd"> The list of words returned by `split`, possibly augmented by a number of `None` values.</span> -</span><span id="split_num_words-361"><a href="#split_num_words-361"><span class="linenos">361</span></a><span class="sd"> """</span> -</span><span id="split_num_words-362"><a href="#split_num_words-362"><span class="linenos">362</span></a> <span class="n">words</span> <span class="o">=</span> <span class="n">value</span><span class="o">.</span><span class="n">split</span><span class="p">(</span><span class="n">sep</span><span class="p">)</span> -</span><span id="split_num_words-363"><a href="#split_num_words-363"><span class="linenos">363</span></a> <span class="k">if</span> <span class="n">fill_from_start</span><span class="p">:</span> -</span><span id="split_num_words-364"><a href="#split_num_words-364"><span class="linenos">364</span></a> <span class="k">return</span> <span class="p">[</span><span class="kc">None</span><span class="p">]</span> <span class="o">*</span> <span class="p">(</span><span class="n">min_num_words</span> <span class="o">-</span> <span class="nb">len</span><span class="p">(</span><span class="n">words</span><span class="p">))</span> <span class="o">+</span> <span class="n">words</span> -</span><span id="split_num_words-365"><a href="#split_num_words-365"><span class="linenos">365</span></a> <span class="k">return</span> <span class="n">words</span> <span class="o">+</span> <span class="p">[</span><span class="kc">None</span><span class="p">]</span> <span class="o">*</span> <span class="p">(</span><span class="n">min_num_words</span> <span class="o">-</span> <span class="nb">len</span><span class="p">(</span><span class="n">words</span><span class="p">))</span> + <div class="pdoc-code codehilite"><pre><span></span><span id="split_num_words-337"><a href="#split_num_words-337"><span class="linenos">337</span></a><span class="k">def</span> <span class="nf">split_num_words</span><span class="p">(</span> +</span><span id="split_num_words-338"><a href="#split_num_words-338"><span class="linenos">338</span></a> <span class="n">value</span><span class="p">:</span> <span class="nb">str</span><span class="p">,</span> <span class="n">sep</span><span class="p">:</span> <span class="nb">str</span><span class="p">,</span> <span class="n">min_num_words</span><span class="p">:</span> <span class="nb">int</span><span class="p">,</span> <span class="n">fill_from_start</span><span class="p">:</span> <span class="nb">bool</span> <span class="o">=</span> <span class="kc">True</span> +</span><span id="split_num_words-339"><a href="#split_num_words-339"><span class="linenos">339</span></a><span class="p">)</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">List</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Optional</span><span class="p">[</span><span class="nb">str</span><span class="p">]]:</span> +</span><span id="split_num_words-340"><a href="#split_num_words-340"><span class="linenos">340</span></a><span class="w"> </span><span class="sd">"""</span> +</span><span id="split_num_words-341"><a href="#split_num_words-341"><span class="linenos">341</span></a><span class="sd"> Perform a split on a value and return N words as a result with `None` used for words that don't exist.</span> +</span><span id="split_num_words-342"><a href="#split_num_words-342"><span class="linenos">342</span></a> +</span><span id="split_num_words-343"><a href="#split_num_words-343"><span class="linenos">343</span></a><span class="sd"> Args:</span> +</span><span id="split_num_words-344"><a href="#split_num_words-344"><span class="linenos">344</span></a><span class="sd"> value: The value to be split.</span> +</span><span id="split_num_words-345"><a href="#split_num_words-345"><span class="linenos">345</span></a><span class="sd"> sep: The value to use to split on.</span> +</span><span id="split_num_words-346"><a href="#split_num_words-346"><span class="linenos">346</span></a><span class="sd"> min_num_words: The minimum number of words that are going to be in the result.</span> +</span><span id="split_num_words-347"><a href="#split_num_words-347"><span class="linenos">347</span></a><span class="sd"> fill_from_start: Indicates that if `None` values should be inserted at the start or end of the list.</span> +</span><span id="split_num_words-348"><a href="#split_num_words-348"><span class="linenos">348</span></a> +</span><span id="split_num_words-349"><a href="#split_num_words-349"><span class="linenos">349</span></a><span class="sd"> Examples:</span> +</span><span id="split_num_words-350"><a href="#split_num_words-350"><span class="linenos">350</span></a><span class="sd"> >>> split_num_words("db.table", ".", 3)</span> +</span><span id="split_num_words-351"><a href="#split_num_words-351"><span class="linenos">351</span></a><span class="sd"> [None, 'db', 'table']</span> +</span><span id="split_num_words-352"><a href="#split_num_words-352"><span class="linenos">352</span></a><span class="sd"> >>> split_num_words("db.table", ".", 3, fill_from_start=False)</span> +</span><span id="split_num_words-353"><a href="#split_num_words-353"><span class="linenos">353</span></a><span class="sd"> ['db', 'table', None]</span> +</span><span id="split_num_words-354"><a href="#split_num_words-354"><span class="linenos">354</span></a><span class="sd"> >>> split_num_words("db.table", ".", 1)</span> +</span><span id="split_num_words-355"><a href="#split_num_words-355"><span class="linenos">355</span></a><span class="sd"> ['db', 'table']</span> +</span><span id="split_num_words-356"><a href="#split_num_words-356"><span class="linenos">356</span></a> +</span><span id="split_num_words-357"><a href="#split_num_words-357"><span class="linenos">357</span></a><span class="sd"> Returns:</span> +</span><span id="split_num_words-358"><a href="#split_num_words-358"><span class="linenos">358</span></a><span class="sd"> The list of words returned by `split`, possibly augmented by a number of `None` values.</span> +</span><span id="split_num_words-359"><a href="#split_num_words-359"><span class="linenos">359</span></a><span class="sd"> """</span> +</span><span id="split_num_words-360"><a href="#split_num_words-360"><span class="linenos">360</span></a> <span class="n">words</span> <span class="o">=</span> <span class="n">value</span><span class="o">.</span><span class="n">split</span><span class="p">(</span><span class="n">sep</span><span class="p">)</span> +</span><span id="split_num_words-361"><a href="#split_num_words-361"><span class="linenos">361</span></a> <span class="k">if</span> <span class="n">fill_from_start</span><span class="p">:</span> +</span><span id="split_num_words-362"><a href="#split_num_words-362"><span class="linenos">362</span></a> <span class="k">return</span> <span class="p">[</span><span class="kc">None</span><span class="p">]</span> <span class="o">*</span> <span class="p">(</span><span class="n">min_num_words</span> <span class="o">-</span> <span class="nb">len</span><span class="p">(</span><span class="n">words</span><span class="p">))</span> <span class="o">+</span> <span class="n">words</span> +</span><span id="split_num_words-363"><a href="#split_num_words-363"><span class="linenos">363</span></a> <span class="k">return</span> <span class="n">words</span> <span class="o">+</span> <span class="p">[</span><span class="kc">None</span><span class="p">]</span> <span class="o">*</span> <span class="p">(</span><span class="n">min_num_words</span> <span class="o">-</span> <span class="nb">len</span><span class="p">(</span><span class="n">words</span><span class="p">))</span> </span></pre></div> @@ -1437,25 +1433,25 @@ of the corresponding enum's identifier (e.g. FOO.value results in "FOO").</p> </div> <a class="headerlink" href="#is_iterable"></a> - <div class="pdoc-code codehilite"><pre><span></span><span id="is_iterable-368"><a href="#is_iterable-368"><span class="linenos">368</span></a><span class="k">def</span> <span class="nf">is_iterable</span><span class="p">(</span><span class="n">value</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">)</span> <span class="o">-></span> <span class="nb">bool</span><span class="p">:</span> -</span><span id="is_iterable-369"><a href="#is_iterable-369"><span class="linenos">369</span></a><span class="w"> </span><span class="sd">"""</span> -</span><span id="is_iterable-370"><a href="#is_iterable-370"><span class="linenos">370</span></a><span class="sd"> Checks if the value is an iterable, excluding the types `str` and `bytes`.</span> -</span><span id="is_iterable-371"><a href="#is_iterable-371"><span class="linenos">371</span></a> -</span><span id="is_iterable-372"><a href="#is_iterable-372"><span class="linenos">372</span></a><span class="sd"> Examples:</span> -</span><span id="is_iterable-373"><a href="#is_iterable-373"><span class="linenos">373</span></a><span class="sd"> >>> is_iterable([1,2])</span> -</span><span id="is_iterable-374"><a href="#is_iterable-374"><span class="linenos">374</span></a><span class="sd"> True</span> -</span><span id="is_iterable-375"><a href="#is_iterable-375"><span class="linenos">375</span></a><span class="sd"> >>> is_iterable("test")</span> -</span><span id="is_iterable-376"><a href="#is_iterable-376"><span class="linenos">376</span></a><span class="sd"> False</span> -</span><span id="is_iterable-377"><a href="#is_iterable-377"><span class="linenos">377</span></a> -</span><span id="is_iterable-378"><a href="#is_iterable-378"><span class="linenos">378</span></a><span class="sd"> Args:</span> -</span><span id="is_iterable-379"><a href="#is_iterable-379"><span class="linenos">379</span></a><span class="sd"> value: The value to check if it is an iterable.</span> -</span><span id="is_iterable-380"><a href="#is_iterable-380"><span class="linenos">380</span></a> -</span><span id="is_iterable-381"><a href="#is_iterable-381"><span class="linenos">381</span></a><span class="sd"> Returns:</span> -</span><span id="is_iterable-382"><a href="#is_iterable-382"><span class="linenos">382</span></a><span class="sd"> A `bool` value indicating if it is an iterable.</span> -</span><span id="is_iterable-383"><a href="#is_iterable-383"><span class="linenos">383</span></a><span class="sd"> """</span> -</span><span id="is_iterable-384"><a href="#is_iterable-384"><span class="linenos">384</span></a> <span class="kn">from</span> <span class="nn">sqlglot</span> <span class="kn">import</span> <span class="n">Expression</span> -</span><span id="is_iterable-385"><a href="#is_iterable-385"><span class="linenos">385</span></a> -</span><span id="is_iterable-386"><a href="#is_iterable-386"><span class="linenos">386</span></a> <span class="k">return</span> <span class="nb">hasattr</span><span class="p">(</span><span class="n">value</span><span class="p">,</span> <span class="s2">"__iter__"</span><span class="p">)</span> <span class="ow">and</span> <span class="ow">not</span> <span class="nb">isinstance</span><span class="p">(</span><span class="n">value</span><span class="p">,</span> <span class="p">(</span><span class="nb">str</span><span class="p">,</span> <span class="nb">bytes</span><span class="p">,</span> <span class="n">Expression</span><span class="p">))</span> + <div class="pdoc-code codehilite"><pre><span></span><span id="is_iterable-366"><a href="#is_iterable-366"><span class="linenos">366</span></a><span class="k">def</span> <span class="nf">is_iterable</span><span class="p">(</span><span class="n">value</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">)</span> <span class="o">-></span> <span class="nb">bool</span><span class="p">:</span> +</span><span id="is_iterable-367"><a href="#is_iterable-367"><span class="linenos">367</span></a><span class="w"> </span><span class="sd">"""</span> +</span><span id="is_iterable-368"><a href="#is_iterable-368"><span class="linenos">368</span></a><span class="sd"> Checks if the value is an iterable, excluding the types `str` and `bytes`.</span> +</span><span id="is_iterable-369"><a href="#is_iterable-369"><span class="linenos">369</span></a> +</span><span id="is_iterable-370"><a href="#is_iterable-370"><span class="linenos">370</span></a><span class="sd"> Examples:</span> +</span><span id="is_iterable-371"><a href="#is_iterable-371"><span class="linenos">371</span></a><span class="sd"> >>> is_iterable([1,2])</span> +</span><span id="is_iterable-372"><a href="#is_iterable-372"><span class="linenos">372</span></a><span class="sd"> True</span> +</span><span id="is_iterable-373"><a href="#is_iterable-373"><span class="linenos">373</span></a><span class="sd"> >>> is_iterable("test")</span> +</span><span id="is_iterable-374"><a href="#is_iterable-374"><span class="linenos">374</span></a><span class="sd"> False</span> +</span><span id="is_iterable-375"><a href="#is_iterable-375"><span class="linenos">375</span></a> +</span><span id="is_iterable-376"><a href="#is_iterable-376"><span class="linenos">376</span></a><span class="sd"> Args:</span> +</span><span id="is_iterable-377"><a href="#is_iterable-377"><span class="linenos">377</span></a><span class="sd"> value: The value to check if it is an iterable.</span> +</span><span id="is_iterable-378"><a href="#is_iterable-378"><span class="linenos">378</span></a> +</span><span id="is_iterable-379"><a href="#is_iterable-379"><span class="linenos">379</span></a><span class="sd"> Returns:</span> +</span><span id="is_iterable-380"><a href="#is_iterable-380"><span class="linenos">380</span></a><span class="sd"> A `bool` value indicating if it is an iterable.</span> +</span><span id="is_iterable-381"><a href="#is_iterable-381"><span class="linenos">381</span></a><span class="sd"> """</span> +</span><span id="is_iterable-382"><a href="#is_iterable-382"><span class="linenos">382</span></a> <span class="kn">from</span> <span class="nn">sqlglot</span> <span class="kn">import</span> <span class="n">Expression</span> +</span><span id="is_iterable-383"><a href="#is_iterable-383"><span class="linenos">383</span></a> +</span><span id="is_iterable-384"><a href="#is_iterable-384"><span class="linenos">384</span></a> <span class="k">return</span> <span class="nb">hasattr</span><span class="p">(</span><span class="n">value</span><span class="p">,</span> <span class="s2">"__iter__"</span><span class="p">)</span> <span class="ow">and</span> <span class="ow">not</span> <span class="nb">isinstance</span><span class="p">(</span><span class="n">value</span><span class="p">,</span> <span class="p">(</span><span class="nb">str</span><span class="p">,</span> <span class="nb">bytes</span><span class="p">,</span> <span class="n">Expression</span><span class="p">))</span> </span></pre></div> @@ -1499,28 +1495,28 @@ of the corresponding enum's identifier (e.g. FOO.value results in "FOO").</p> </div> <a class="headerlink" href="#flatten"></a> - <div class="pdoc-code codehilite"><pre><span></span><span id="flatten-389"><a href="#flatten-389"><span class="linenos">389</span></a><span class="k">def</span> <span class="nf">flatten</span><span class="p">(</span><span class="n">values</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Iterable</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Iterable</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">]</span> <span class="o">|</span> <span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">])</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">Iterator</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">]:</span> -</span><span id="flatten-390"><a href="#flatten-390"><span class="linenos">390</span></a><span class="w"> </span><span class="sd">"""</span> -</span><span id="flatten-391"><a href="#flatten-391"><span class="linenos">391</span></a><span class="sd"> Flattens an iterable that can contain both iterable and non-iterable elements. Objects of</span> -</span><span id="flatten-392"><a href="#flatten-392"><span class="linenos">392</span></a><span class="sd"> type `str` and `bytes` are not regarded as iterables.</span> -</span><span id="flatten-393"><a href="#flatten-393"><span class="linenos">393</span></a> -</span><span id="flatten-394"><a href="#flatten-394"><span class="linenos">394</span></a><span class="sd"> Examples:</span> -</span><span id="flatten-395"><a href="#flatten-395"><span class="linenos">395</span></a><span class="sd"> >>> list(flatten([[1, 2], 3, {4}, (5, "bla")]))</span> -</span><span id="flatten-396"><a href="#flatten-396"><span class="linenos">396</span></a><span class="sd"> [1, 2, 3, 4, 5, 'bla']</span> -</span><span id="flatten-397"><a href="#flatten-397"><span class="linenos">397</span></a><span class="sd"> >>> list(flatten([1, 2, 3]))</span> -</span><span id="flatten-398"><a href="#flatten-398"><span class="linenos">398</span></a><span class="sd"> [1, 2, 3]</span> -</span><span id="flatten-399"><a href="#flatten-399"><span class="linenos">399</span></a> -</span><span id="flatten-400"><a href="#flatten-400"><span class="linenos">400</span></a><span class="sd"> Args:</span> -</span><span id="flatten-401"><a href="#flatten-401"><span class="linenos">401</span></a><span class="sd"> values: The value to be flattened.</span> -</span><span id="flatten-402"><a href="#flatten-402"><span class="linenos">402</span></a> -</span><span id="flatten-403"><a href="#flatten-403"><span class="linenos">403</span></a><span class="sd"> Yields:</span> -</span><span id="flatten-404"><a href="#flatten-404"><span class="linenos">404</span></a><span class="sd"> Non-iterable elements in `values`.</span> -</span><span id="flatten-405"><a href="#flatten-405"><span class="linenos">405</span></a><span class="sd"> """</span> -</span><span id="flatten-406"><a href="#flatten-406"><span class="linenos">406</span></a> <span class="k">for</span> <span class="n">value</span> <span class="ow">in</span> <span class="n">values</span><span class="p">:</span> -</span><span id="flatten-407"><a href="#flatten-407"><span class="linenos">407</span></a> <span class="k">if</span> <span class="n">is_iterable</span><span class="p">(</span><span class="n">value</span><span class="p">):</span> -</span><span id="flatten-408"><a href="#flatten-408"><span class="linenos">408</span></a> <span class="k">yield from</span> <span class="n">flatten</span><span class="p">(</span><span class="n">value</span><span class="p">)</span> -</span><span id="flatten-409"><a href="#flatten-409"><span class="linenos">409</span></a> <span class="k">else</span><span class="p">:</span> -</span><span id="flatten-410"><a href="#flatten-410"><span class="linenos">410</span></a> <span class="k">yield</span> <span class="n">value</span> + <div class="pdoc-code codehilite"><pre><span></span><span id="flatten-387"><a href="#flatten-387"><span class="linenos">387</span></a><span class="k">def</span> <span class="nf">flatten</span><span class="p">(</span><span class="n">values</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Iterable</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Iterable</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">]</span> <span class="o">|</span> <span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">])</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">Iterator</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Any</span><span class="p">]:</span> +</span><span id="flatten-388"><a href="#flatten-388"><span class="linenos">388</span></a><span class="w"> </span><span class="sd">"""</span> +</span><span id="flatten-389"><a href="#flatten-389"><span class="linenos">389</span></a><span class="sd"> Flattens an iterable that can contain both iterable and non-iterable elements. Objects of</span> +</span><span id="flatten-390"><a href="#flatten-390"><span class="linenos">390</span></a><span class="sd"> type `str` and `bytes` are not regarded as iterables.</span> +</span><span id="flatten-391"><a href="#flatten-391"><span class="linenos">391</span></a> +</span><span id="flatten-392"><a href="#flatten-392"><span class="linenos">392</span></a><span class="sd"> Examples:</span> +</span><span id="flatten-393"><a href="#flatten-393"><span class="linenos">393</span></a><span class="sd"> >>> list(flatten([[1, 2], 3, {4}, (5, "bla")]))</span> +</span><span id="flatten-394"><a href="#flatten-394"><span class="linenos">394</span></a><span class="sd"> [1, 2, 3, 4, 5, 'bla']</span> +</span><span id="flatten-395"><a href="#flatten-395"><span class="linenos">395</span></a><span class="sd"> >>> list(flatten([1, 2, 3]))</span> +</span><span id="flatten-396"><a href="#flatten-396"><span class="linenos">396</span></a><span class="sd"> [1, 2, 3]</span> +</span><span id="flatten-397"><a href="#flatten-397"><span class="linenos">397</span></a> +</span><span id="flatten-398"><a href="#flatten-398"><span class="linenos">398</span></a><span class="sd"> Args:</span> +</span><span id="flatten-399"><a href="#flatten-399"><span class="linenos">399</span></a><span class="sd"> values: The value to be flattened.</span> +</span><span id="flatten-400"><a href="#flatten-400"><span class="linenos">400</span></a> +</span><span id="flatten-401"><a href="#flatten-401"><span class="linenos">401</span></a><span class="sd"> Yields:</span> +</span><span id="flatten-402"><a href="#flatten-402"><span class="linenos">402</span></a><span class="sd"> Non-iterable elements in `values`.</span> +</span><span id="flatten-403"><a href="#flatten-403"><span class="linenos">403</span></a><span class="sd"> """</span> +</span><span id="flatten-404"><a href="#flatten-404"><span class="linenos">404</span></a> <span class="k">for</span> <span class="n">value</span> <span class="ow">in</span> <span class="n">values</span><span class="p">:</span> +</span><span id="flatten-405"><a href="#flatten-405"><span class="linenos">405</span></a> <span class="k">if</span> <span class="n">is_iterable</span><span class="p">(</span><span class="n">value</span><span class="p">):</span> +</span><span id="flatten-406"><a href="#flatten-406"><span class="linenos">406</span></a> <span class="k">yield from</span> <span class="n">flatten</span><span class="p">(</span><span class="n">value</span><span class="p">)</span> +</span><span id="flatten-407"><a href="#flatten-407"><span class="linenos">407</span></a> <span class="k">else</span><span class="p">:</span> +</span><span id="flatten-408"><a href="#flatten-408"><span class="linenos">408</span></a> <span class="k">yield</span> <span class="n">value</span> </span></pre></div> @@ -1565,30 +1561,30 @@ type <code>str</code> and <code>bytes</code> are not regarded as iterables.</p> </div> <a class="headerlink" href="#dict_depth"></a> - <div class="pdoc-code codehilite"><pre><span></span><span id="dict_depth-413"><a href="#dict_depth-413"><span class="linenos">413</span></a><span class="k">def</span> <span class="nf">dict_depth</span><span class="p">(</span><span class="n">d</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Dict</span><span class="p">)</span> <span class="o">-></span> <span class="nb">int</span><span class="p">:</span> -</span><span id="dict_depth-414"><a href="#dict_depth-414"><span class="linenos">414</span></a><span class="w"> </span><span class="sd">"""</span> -</span><span id="dict_depth-415"><a href="#dict_depth-415"><span class="linenos">415</span></a><span class="sd"> Get the nesting depth of a dictionary.</span> -</span><span id="dict_depth-416"><a href="#dict_depth-416"><span class="linenos">416</span></a> -</span><span id="dict_depth-417"><a href="#dict_depth-417"><span class="linenos">417</span></a><span class="sd"> Example:</span> -</span><span id="dict_depth-418"><a href="#dict_depth-418"><span class="linenos">418</span></a><span class="sd"> >>> dict_depth(None)</span> -</span><span id="dict_depth-419"><a href="#dict_depth-419"><span class="linenos">419</span></a><span class="sd"> 0</span> -</span><span id="dict_depth-420"><a href="#dict_depth-420"><span class="linenos">420</span></a><span class="sd"> >>> dict_depth({})</span> + <div class="pdoc-code codehilite"><pre><span></span><span id="dict_depth-411"><a href="#dict_depth-411"><span class="linenos">411</span></a><span class="k">def</span> <span class="nf">dict_depth</span><span class="p">(</span><span class="n">d</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Dict</span><span class="p">)</span> <span class="o">-></span> <span class="nb">int</span><span class="p">:</span> +</span><span id="dict_depth-412"><a href="#dict_depth-412"><span class="linenos">412</span></a><span class="w"> </span><span class="sd">"""</span> +</span><span id="dict_depth-413"><a href="#dict_depth-413"><span class="linenos">413</span></a><span class="sd"> Get the nesting depth of a dictionary.</span> +</span><span id="dict_depth-414"><a href="#dict_depth-414"><span class="linenos">414</span></a> +</span><span id="dict_depth-415"><a href="#dict_depth-415"><span class="linenos">415</span></a><span class="sd"> Example:</span> +</span><span id="dict_depth-416"><a href="#dict_depth-416"><span class="linenos">416</span></a><span class="sd"> >>> dict_depth(None)</span> +</span><span id="dict_depth-417"><a href="#dict_depth-417"><span class="linenos">417</span></a><span class="sd"> 0</span> +</span><span id="dict_depth-418"><a href="#dict_depth-418"><span class="linenos">418</span></a><span class="sd"> >>> dict_depth({})</span> +</span><span id="dict_depth-419"><a href="#dict_depth-419"><span class="linenos">419</span></a><span class="sd"> 1</span> +</span><span id="dict_depth-420"><a href="#dict_depth-420"><span class="linenos">420</span></a><span class="sd"> >>> dict_depth({"a": "b"})</span> </span><span id="dict_depth-421"><a href="#dict_depth-421"><span class="linenos">421</span></a><span class="sd"> 1</span> -</span><span id="dict_depth-422"><a href="#dict_depth-422"><span class="linenos">422</span></a><span class="sd"> >>> dict_depth({"a": "b"})</span> -</span><span id="dict_depth-423"><a href="#dict_depth-423"><span class="linenos">423</span></a><span class="sd"> 1</span> -</span><span id="dict_depth-424"><a href="#dict_depth-424"><span class="linenos">424</span></a><span class="sd"> >>> dict_depth({"a": {}})</span> -</span><span id="dict_depth-425"><a href="#dict_depth-425"><span class="linenos">425</span></a><span class="sd"> 2</span> -</span><span id="dict_depth-426"><a href="#dict_depth-426"><span class="linenos">426</span></a><span class="sd"> >>> dict_depth({"a": {"b": {}}})</span> -</span><span id="dict_depth-427"><a href="#dict_depth-427"><span class="linenos">427</span></a><span class="sd"> 3</span> -</span><span id="dict_depth-428"><a href="#dict_depth-428"><span class="linenos">428</span></a><span class="sd"> """</span> -</span><span id="dict_depth-429"><a href="#dict_depth-429"><span class="linenos">429</span></a> <span class="k">try</span><span class="p">:</span> -</span><span id="dict_depth-430"><a href="#dict_depth-430"><span class="linenos">430</span></a> <span class="k">return</span> <span class="mi">1</span> <span class="o">+</span> <span class="n">dict_depth</span><span class="p">(</span><span class="nb">next</span><span class="p">(</span><span class="nb">iter</span><span class="p">(</span><span class="n">d</span><span class="o">.</span><span class="n">values</span><span class="p">())))</span> -</span><span id="dict_depth-431"><a href="#dict_depth-431"><span class="linenos">431</span></a> <span class="k">except</span> <span class="ne">AttributeError</span><span class="p">:</span> -</span><span id="dict_depth-432"><a href="#dict_depth-432"><span class="linenos">432</span></a> <span class="c1"># d doesn't have attribute "values"</span> -</span><span id="dict_depth-433"><a href="#dict_depth-433"><span class="linenos">433</span></a> <span class="k">return</span> <span class="mi">0</span> -</span><span id="dict_depth-434"><a href="#dict_depth-434"><span class="linenos">434</span></a> <span class="k">except</span> <span class="ne">StopIteration</span><span class="p">:</span> -</span><span id="dict_depth-435"><a href="#dict_depth-435"><span class="linenos">435</span></a> <span class="c1"># d.values() returns an empty sequence</span> -</span><span id="dict_depth-436"><a href="#dict_depth-436"><span class="linenos">436</span></a> <span class="k">return</span> <span class="mi">1</span> +</span><span id="dict_depth-422"><a href="#dict_depth-422"><span class="linenos">422</span></a><span class="sd"> >>> dict_depth({"a": {}})</span> +</span><span id="dict_depth-423"><a href="#dict_depth-423"><span class="linenos">423</span></a><span class="sd"> 2</span> +</span><span id="dict_depth-424"><a href="#dict_depth-424"><span class="linenos">424</span></a><span class="sd"> >>> dict_depth({"a": {"b": {}}})</span> +</span><span id="dict_depth-425"><a href="#dict_depth-425"><span class="linenos">425</span></a><span class="sd"> 3</span> +</span><span id="dict_depth-426"><a href="#dict_depth-426"><span class="linenos">426</span></a><span class="sd"> """</span> +</span><span id="dict_depth-427"><a href="#dict_depth-427"><span class="linenos">427</span></a> <span class="k">try</span><span class="p">:</span> +</span><span id="dict_depth-428"><a href="#dict_depth-428"><span class="linenos">428</span></a> <span class="k">return</span> <span class="mi">1</span> <span class="o">+</span> <span class="n">dict_depth</span><span class="p">(</span><span class="nb">next</span><span class="p">(</span><span class="nb">iter</span><span class="p">(</span><span class="n">d</span><span class="o">.</span><span class="n">values</span><span class="p">())))</span> +</span><span id="dict_depth-429"><a href="#dict_depth-429"><span class="linenos">429</span></a> <span class="k">except</span> <span class="ne">AttributeError</span><span class="p">:</span> +</span><span id="dict_depth-430"><a href="#dict_depth-430"><span class="linenos">430</span></a> <span class="c1"># d doesn't have attribute "values"</span> +</span><span id="dict_depth-431"><a href="#dict_depth-431"><span class="linenos">431</span></a> <span class="k">return</span> <span class="mi">0</span> +</span><span id="dict_depth-432"><a href="#dict_depth-432"><span class="linenos">432</span></a> <span class="k">except</span> <span class="ne">StopIteration</span><span class="p">:</span> +</span><span id="dict_depth-433"><a href="#dict_depth-433"><span class="linenos">433</span></a> <span class="c1"># d.values() returns an empty sequence</span> +</span><span id="dict_depth-434"><a href="#dict_depth-434"><span class="linenos">434</span></a> <span class="k">return</span> <span class="mi">1</span> </span></pre></div> @@ -1626,9 +1622,9 @@ type <code>str</code> and <code>bytes</code> are not regarded as iterables.</p> </div> <a class="headerlink" href="#first"></a> - <div class="pdoc-code codehilite"><pre><span></span><span id="first-439"><a href="#first-439"><span class="linenos">439</span></a><span class="k">def</span> <span class="nf">first</span><span class="p">(</span><span class="n">it</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Iterable</span><span class="p">[</span><span class="n">T</span><span class="p">])</span> <span class="o">-></span> <span class="n">T</span><span class="p">:</span> -</span><span id="first-440"><a href="#first-440"><span class="linenos">440</span></a><span class="w"> </span><span class="sd">"""Returns the first element from an iterable (useful for sets)."""</span> -</span><span id="first-441"><a href="#first-441"><span class="linenos">441</span></a> <span class="k">return</span> <span class="nb">next</span><span class="p">(</span><span class="n">i</span> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="n">it</span><span class="p">)</span> + <div class="pdoc-code codehilite"><pre><span></span><span id="first-437"><a href="#first-437"><span class="linenos">437</span></a><span class="k">def</span> <span class="nf">first</span><span class="p">(</span><span class="n">it</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">Iterable</span><span class="p">[</span><span class="n">T</span><span class="p">])</span> <span class="o">-></span> <span class="n">T</span><span class="p">:</span> +</span><span id="first-438"><a href="#first-438"><span class="linenos">438</span></a><span class="w"> </span><span class="sd">"""Returns the first element from an iterable (useful for sets)."""</span> +</span><span id="first-439"><a href="#first-439"><span class="linenos">439</span></a> <span class="k">return</span> <span class="nb">next</span><span class="p">(</span><span class="n">i</span> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="n">it</span><span class="p">)</span> </span></pre></div> @@ -1648,31 +1644,31 @@ type <code>str</code> and <code>bytes</code> are not regarded as iterables.</p> </div> <a class="headerlink" href="#merge_ranges"></a> - <div class="pdoc-code codehilite"><pre><span></span><span id="merge_ranges-444"><a href="#merge_ranges-444"><span class="linenos">444</span></a><span class="k">def</span> <span class="nf">merge_ranges</span><span class="p">(</span><span class="n">ranges</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">List</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Tuple</span><span class="p">[</span><span class="n">A</span><span class="p">,</span> <span class="n">A</span><span class="p">]])</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">List</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Tuple</span><span class="p">[</span><span class="n">A</span><span class="p">,</span> <span class="n">A</span><span class="p">]]:</span> -</span><span id="merge_ranges-445"><a href="#merge_ranges-445"><span class="linenos">445</span></a><span class="w"> </span><span class="sd">"""</span> -</span><span id="merge_ranges-446"><a href="#merge_ranges-446"><span class="linenos">446</span></a><span class="sd"> Merges a sequence of ranges, represented as tuples (low, high) whose values</span> -</span><span id="merge_ranges-447"><a href="#merge_ranges-447"><span class="linenos">447</span></a><span class="sd"> belong to some totally-ordered set.</span> -</span><span id="merge_ranges-448"><a href="#merge_ranges-448"><span class="linenos">448</span></a> -</span><span id="merge_ranges-449"><a href="#merge_ranges-449"><span class="linenos">449</span></a><span class="sd"> Example:</span> -</span><span id="merge_ranges-450"><a href="#merge_ranges-450"><span class="linenos">450</span></a><span class="sd"> >>> merge_ranges([(1, 3), (2, 6)])</span> -</span><span id="merge_ranges-451"><a href="#merge_ranges-451"><span class="linenos">451</span></a><span class="sd"> [(1, 6)]</span> -</span><span id="merge_ranges-452"><a href="#merge_ranges-452"><span class="linenos">452</span></a><span class="sd"> """</span> -</span><span id="merge_ranges-453"><a href="#merge_ranges-453"><span class="linenos">453</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="n">ranges</span><span class="p">:</span> -</span><span id="merge_ranges-454"><a href="#merge_ranges-454"><span class="linenos">454</span></a> <span class="k">return</span> <span class="p">[]</span> + <div class="pdoc-code codehilite"><pre><span></span><span id="merge_ranges-442"><a href="#merge_ranges-442"><span class="linenos">442</span></a><span class="k">def</span> <span class="nf">merge_ranges</span><span class="p">(</span><span class="n">ranges</span><span class="p">:</span> <span class="n">t</span><span class="o">.</span><span class="n">List</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Tuple</span><span class="p">[</span><span class="n">A</span><span class="p">,</span> <span class="n">A</span><span class="p">]])</span> <span class="o">-></span> <span class="n">t</span><span class="o">.</span><span class="n">List</span><span class="p">[</span><span class="n">t</span><span class="o">.</span><span class="n">Tuple</span><span class="p">[</span><span class="n">A</span><span class="p">,</span> <span class="n">A</span><span class="p">]]:</span> +</span><span id="merge_ranges-443"><a href="#merge_ranges-443"><span class="linenos">443</span></a><span class="w"> </span><span class="sd">"""</span> +</span><span id="merge_ranges-444"><a href="#merge_ranges-444"><span class="linenos">444</span></a><span class="sd"> Merges a sequence of ranges, represented as tuples (low, high) whose values</span> +</span><span id="merge_ranges-445"><a href="#merge_ranges-445"><span class="linenos">445</span></a><span class="sd"> belong to some totally-ordered set.</span> +</span><span id="merge_ranges-446"><a href="#merge_ranges-446"><span class="linenos">446</span></a> +</span><span id="merge_ranges-447"><a href="#merge_ranges-447"><span class="linenos">447</span></a><span class="sd"> Example:</span> +</span><span id="merge_ranges-448"><a href="#merge_ranges-448"><span class="linenos">448</span></a><span class="sd"> >>> merge_ranges([(1, 3), (2, 6)])</span> +</span><span id="merge_ranges-449"><a href="#merge_ranges-449"><span class="linenos">449</span></a><span class="sd"> [(1, 6)]</span> +</span><span id="merge_ranges-450"><a href="#merge_ranges-450"><span class="linenos">450</span></a><span class="sd"> """</span> +</span><span id="merge_ranges-451"><a href="#merge_ranges-451"><span class="linenos">451</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="n">ranges</span><span class="p">:</span> +</span><span id="merge_ranges-452"><a href="#merge_ranges-452"><span class="linenos">452</span></a> <span class="k">return</span> <span class="p">[]</span> +</span><span id="merge_ranges-453"><a href="#merge_ranges-453"><span class="linenos">453</span></a> +</span><span id="merge_ranges-454"><a href="#merge_ranges-454"><span class="linenos">454</span></a> <span class="n">ranges</span> <span class="o">=</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">ranges</span><span class="p">)</span> </span><span id="merge_ranges-455"><a href="#merge_ranges-455"><span class="linenos">455</span></a> -</span><span id="merge_ranges-456"><a href="#merge_ranges-456"><span class="linenos">456</span></a> <span class="n">ranges</span> <span class="o">=</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">ranges</span><span class="p">)</span> +</span><span id="merge_ranges-456"><a href="#merge_ranges-456"><span class="linenos">456</span></a> <span class="n">merged</span> <span class="o">=</span> <span class="p">[</span><span class="n">ranges</span><span class="p">[</span><span class="mi">0</span><span class="p">]]</span> </span><span id="merge_ranges-457"><a href="#merge_ranges-457"><span class="linenos">457</span></a> -</span><span id="merge_ranges-458"><a href="#merge_ranges-458"><span class="linenos">458</span></a> <span class="n">merged</span> <span class="o">=</span> <span class="p">[</span><span class="n">ranges</span><span class="p">[</span><span class="mi">0</span><span class="p">]]</span> -</span><span id="merge_ranges-459"><a href="#merge_ranges-459"><span class="linenos">459</span></a> -</span><span id="merge_ranges-460"><a href="#merge_ranges-460"><span class="linenos">460</span></a> <span class="k">for</span> <span class="n">start</span><span class="p">,</span> <span class="n">end</span> <span class="ow">in</span> <span class="n">ranges</span><span class="p">[</span><span class="mi">1</span><span class="p">:]:</span> -</span><span id="merge_ranges-461"><a href="#merge_ranges-461"><span class="linenos">461</span></a> <span class="n">last_start</span><span class="p">,</span> <span class="n">last_end</span> <span class="o">=</span> <span class="n">merged</span><span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">]</span> -</span><span id="merge_ranges-462"><a href="#merge_ranges-462"><span class="linenos">462</span></a> -</span><span id="merge_ranges-463"><a href="#merge_ranges-463"><span class="linenos">463</span></a> <span class="k">if</span> <span class="n">start</span> <span class="o"><=</span> <span class="n">last_end</span><span class="p">:</span> -</span><span id="merge_ranges-464"><a href="#merge_ranges-464"><span class="linenos">464</span></a> <span class="n">merged</span><span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">]</span> <span class="o">=</span> <span class="p">(</span><span class="n">last_start</span><span class="p">,</span> <span class="nb">max</span><span class="p">(</span><span class="n">last_end</span><span class="p">,</span> <span class="n">end</span><span class="p">))</span> -</span><span id="merge_ranges-465"><a href="#merge_ranges-465"><span class="linenos">465</span></a> <span class="k">else</span><span class="p">:</span> -</span><span id="merge_ranges-466"><a href="#merge_ranges-466"><span class="linenos">466</span></a> <span class="n">merged</span><span class="o">.</span><span class="n">append</span><span class="p">((</span><span class="n">start</span><span class="p">,</span> <span class="n">end</span><span class="p">))</span> -</span><span id="merge_ranges-467"><a href="#merge_ranges-467"><span class="linenos">467</span></a> -</span><span id="merge_ranges-468"><a href="#merge_ranges-468"><span class="linenos">468</span></a> <span class="k">return</span> <span class="n">merged</span> +</span><span id="merge_ranges-458"><a href="#merge_ranges-458"><span class="linenos">458</span></a> <span class="k">for</span> <span class="n">start</span><span class="p">,</span> <span class="n">end</span> <span class="ow">in</span> <span class="n">ranges</span><span class="p">[</span><span class="mi">1</span><span class="p">:]:</span> +</span><span id="merge_ranges-459"><a href="#merge_ranges-459"><span class="linenos">459</span></a> <span class="n">last_start</span><span class="p">,</span> <span class="n">last_end</span> <span class="o">=</span> <span class="n">merged</span><span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">]</span> +</span><span id="merge_ranges-460"><a href="#merge_ranges-460"><span class="linenos">460</span></a> +</span><span id="merge_ranges-461"><a href="#merge_ranges-461"><span class="linenos">461</span></a> <span class="k">if</span> <span class="n">start</span> <span class="o"><=</span> <span class="n">last_end</span><span class="p">:</span> +</span><span id="merge_ranges-462"><a href="#merge_ranges-462"><span class="linenos">462</span></a> <span class="n">merged</span><span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">]</span> <span class="o">=</span> <span class="p">(</span><span class="n">last_start</span><span class="p">,</span> <span class="nb">max</span><span class="p">(</span><span class="n">last_end</span><span class="p">,</span> <span class="n">end</span><span class="p">))</span> +</span><span id="merge_ranges-463"><a href="#merge_ranges-463"><span class="linenos">463</span></a> <span class="k">else</span><span class="p">:</span> +</span><span id="merge_ranges-464"><a href="#merge_ranges-464"><span class="linenos">464</span></a> <span class="n">merged</span><span class="o">.</span><span class="n">append</span><span class="p">((</span><span class="n">start</span><span class="p">,</span> <span class="n">end</span><span class="p">))</span> +</span><span id="merge_ranges-465"><a href="#merge_ranges-465"><span class="linenos">465</span></a> +</span><span id="merge_ranges-466"><a href="#merge_ranges-466"><span class="linenos">466</span></a> <span class="k">return</span> <span class="n">merged</span> </span></pre></div> |