Skip to content

Commit 0e56dfd

Browse files
github-actions[bot]github-actions[bot]
committed
1 parent d50f1dc commit 0e56dfd

File tree

7 files changed

+179
-179
lines changed

7 files changed

+179
-179
lines changed

‎1473/feed_json_updated.json

Lines changed: 1 addition & 1 deletion
Large diffs are not rendered by default.

‎1473/feed_rss_created.xml

Lines changed: 1 addition & 1 deletion
Large diffs are not rendered by default.

‎1473/feed_rss_updated.xml

Lines changed: 1 addition & 1 deletion
Large diffs are not rendered by default.

‎1473/geometry/nearest_points.html

Lines changed: 9 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -6741,7 +6741,7 @@
67416741
<ul class="metadata page-metadata" data-bi-name="page info" lang="en-us" dir="ltr">
67426742

67436743
Last update:
6744-
<span class="git-revision-date-localized-plugin git-revision-date-localized-plugin-date" title="June 28, 2025 20:57:36 UTC">June 28, 2025</span>&emsp;
6744+
<span class="git-revision-date-localized-plugin git-revision-date-localized-plugin-date" title="June 29, 2025 19:28:11 UTC">June 29, 2025</span>&emsp;
67456745

67466746
<!-- Tags -->
67476747

@@ -6911,7 +6911,7 @@ <h4 id="implementation-of-the-algorithm">Implementation of the algorithm<a class
69116911
<span class="k">struct</span><span class="w"> </span><span class="nc">RealPoint</span><span class="w"> </span><span class="p">{</span>
69126912
<span class="w"> </span><span class="n">ld</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">;</span>
69136913
<span class="w"> </span><span class="n">RealPoint</span><span class="p">()</span><span class="w"> </span><span class="p">{}</span>
6914-
<span class="w"> </span><span class="n">RealPoint</span><span class="p">(</span><span class="n">T</span><span class="w"> </span><span class="n">x_</span><span class="p">,</span><span class="w"> </span><span class="n">T</span><span class="w"> </span><span class="n">y_</span><span class="p">)</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="n">x_</span><span class="p">),</span><span class="w"> </span><span class="n">y</span><span class="p">(</span><span class="n">y_</span><span class="p">)</span><span class="w"> </span><span class="p">{}</span>
6914+
<span class="w"> </span><span class="n">RealPoint</span><span class="p">(</span><span class="n">ld</span><span class="w"> </span><span class="n">x_</span><span class="p">,</span><span class="w"> </span><span class="n">ld</span><span class="w"> </span><span class="n">y_</span><span class="p">)</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="n">x_</span><span class="p">),</span><span class="w"> </span><span class="n">y</span><span class="p">(</span><span class="n">y_</span><span class="p">)</span><span class="w"> </span><span class="p">{}</span>
69156915
<span class="p">};</span>
69166916
<span class="k">using</span><span class="w"> </span><span class="n">pt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">RealPoint</span><span class="p">;</span>
69176917

@@ -6922,7 +6922,7 @@ <h4 id="implementation-of-the-algorithm">Implementation of the algorithm<a class
69226922
<span class="w"> </span><span class="p">}</span>
69236923
<span class="p">};</span>
69246924

6925-
<span class="n">ld</span><span class="w"> </span><span class="nf">dist</span><span class="p">(</span><span class="n">pt</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">pt</span><span class="w"> </span><span class="n">b</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
6925+
<span class="n">ld</span><span class="w"> </span><span class="nf">dist</span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">pt</span><span class="o">&amp;</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="k">const</span><span class="w"> </span><span class="n">pt</span><span class="o">&amp;</span><span class="w"> </span><span class="n">b</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
69266926
<span class="w"> </span><span class="n">ld</span><span class="w"> </span><span class="n">dx</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">a</span><span class="p">.</span><span class="n">x</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">b</span><span class="p">.</span><span class="n">x</span><span class="p">;</span>
69276927
<span class="w"> </span><span class="n">ld</span><span class="w"> </span><span class="n">dy</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">a</span><span class="p">.</span><span class="n">y</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">b</span><span class="p">.</span><span class="n">y</span><span class="p">;</span>
69286928
<span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">sqrt</span><span class="p">(</span><span class="n">dx</span><span class="o">*</span><span class="n">dx</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">dy</span><span class="o">*</span><span class="n">dy</span><span class="p">);</span>
@@ -6936,8 +6936,8 @@ <h4 id="implementation-of-the-algorithm">Implementation of the algorithm<a class
69366936
<span class="w"> </span><span class="n">unordered_map</span><span class="o">&lt;</span><span class="n">pair</span><span class="o">&lt;</span><span class="n">ll</span><span class="p">,</span><span class="n">ll</span><span class="o">&gt;</span><span class="p">,</span><span class="n">vector</span><span class="o">&lt;</span><span class="n">pt</span><span class="o">&gt;</span><span class="p">,</span><span class="n">CustomHash</span><span class="o">&gt;</span><span class="w"> </span><span class="n">grid</span><span class="p">;</span>
69376937
<span class="w"> </span><span class="n">grid</span><span class="p">.</span><span class="n">reserve</span><span class="p">(</span><span class="n">n</span><span class="p">);</span>
69386938

6939-
<span class="w"> </span><span class="n">mt19937</span><span class="w"> </span><span class="nf">rd</span><span class="p">(</span><span class="n">chrono</span><span class="o">::</span><span class="n">system_clock</span><span class="o">::</span><span class="n">now</span><span class="p">().</span><span class="n">time_since_epoch</span><span class="p">().</span><span class="n">count</span><span class="p">());</span>
6940-
<span class="w"> </span><span class="n">uniform_int_distribution</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="w"> </span><span class="n">dis</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="mi">-1</span><span class="p">);</span>
6939+
<span class="w"> </span><span class="n">mt19937</span><span class="w"> </span><span class="nf">prng</span><span class="p">(</span><span class="n">chrono</span><span class="o">::</span><span class="n">system_clock</span><span class="o">::</span><span class="n">now</span><span class="p">().</span><span class="n">time_since_epoch</span><span class="p">().</span><span class="n">count</span><span class="p">());</span>
6940+
<span class="w"> </span><span class="n">uniform_int_distribution</span><span class="o">&lt;</span><span class="kt">int</span><span class="o">&gt;</span><span class="w"> </span><span class="n">uniform</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="mi">-1</span><span class="p">);</span>
69416941

69426942
<span class="w"> </span><span class="n">ld</span><span class="w"> </span><span class="n">d</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">dist</span><span class="p">(</span><span class="n">P</span><span class="p">[</span><span class="mi">0</span><span class="p">],</span><span class="w"> </span><span class="n">P</span><span class="p">[</span><span class="mi">1</span><span class="p">]);</span>
69436943
<span class="w"> </span><span class="n">pair</span><span class="o">&lt;</span><span class="n">pt</span><span class="p">,</span><span class="n">pt</span><span class="o">&gt;</span><span class="w"> </span><span class="n">closest</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="n">P</span><span class="p">[</span><span class="mi">0</span><span class="p">],</span><span class="w"> </span><span class="n">P</span><span class="p">[</span><span class="mi">1</span><span class="p">]};</span>
@@ -6951,10 +6951,10 @@ <h4 id="implementation-of-the-algorithm">Implementation of the algorithm<a class
69516951
<span class="w"> </span><span class="p">};</span>
69526952

69536953
<span class="w"> </span><span class="k">for</span><span class="w"> </span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">n</span><span class="p">;</span><span class="w"> </span><span class="o">++</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
6954-
<span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">j</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">dis</span><span class="p">(</span><span class="n">rd</span><span class="p">);</span>
6955-
<span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">k</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">dis</span><span class="p">(</span><span class="n">rd</span><span class="p">);</span>
6954+
<span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">j</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">uniform</span><span class="p">(</span><span class="n">prng</span><span class="p">);</span>
6955+
<span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">k</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">uniform</span><span class="p">(</span><span class="n">prng</span><span class="p">);</span>
69566956
<span class="w"> </span><span class="k">while</span><span class="w"> </span><span class="p">(</span><span class="n">j</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">k</span><span class="p">)</span>
6957-
<span class="w"> </span><span class="n">k</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">dis</span><span class="p">(</span><span class="n">rd</span><span class="p">);</span>
6957+
<span class="w"> </span><span class="n">k</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">uniform</span><span class="p">(</span><span class="n">prng</span><span class="p">);</span>
69586958
<span class="w"> </span><span class="n">consider_pair</span><span class="p">(</span><span class="n">P</span><span class="p">[</span><span class="n">j</span><span class="p">],</span><span class="w"> </span><span class="n">P</span><span class="p">[</span><span class="n">k</span><span class="p">]);</span>
69596959
<span class="w"> </span><span class="p">}</span>
69606960

@@ -6981,7 +6981,7 @@ <h4 id="implementation-of-the-algorithm">Implementation of the algorithm<a class
69816981
<span class="w"> </span><span class="k">for</span><span class="w"> </span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">pt</span><span class="o">&amp;</span><span class="w"> </span><span class="n">p</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">it</span><span class="p">.</span><span class="n">second</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
69826982
<span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="k">not</span><span class="w"> </span><span class="n">grid</span><span class="p">.</span><span class="n">count</span><span class="p">(</span><span class="n">neighbour</span><span class="p">))</span><span class="w"> </span><span class="k">continue</span><span class="p">;</span>
69836983
<span class="w"> </span><span class="k">for</span><span class="w"> </span><span class="p">(</span><span class="k">const</span><span class="w"> </span><span class="n">pt</span><span class="o">&amp;</span><span class="w"> </span><span class="n">q</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="n">grid</span><span class="p">.</span><span class="n">at</span><span class="p">(</span><span class="n">neighbour</span><span class="p">))</span>
6984-
<span class="w"> </span><span class="n">candidate_closest</span><span class="p">(</span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">q</span><span class="p">);</span>
6984+
<span class="w"> </span><span class="n">consider_pair</span><span class="p">(</span><span class="n">p</span><span class="p">,</span><span class="w"> </span><span class="n">q</span><span class="p">);</span>
69856985
<span class="w"> </span><span class="p">}</span>
69866986
<span class="w"> </span><span class="p">}</span>
69876987
<span class="w"> </span><span class="p">}</span>

‎1473/search/search_index.json

Lines changed: 1 addition & 1 deletion
Large diffs are not rendered by default.

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy