HiNC-Deploy/HiNC-2025-win-desktop-Deploy
2
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

tune

Browse Source
This commit is contained in:
iamboss
2025-12-05 16:33:37 +08:00
parent dbbe3303b3
commit 9de88d2db0
163 changed files with 5633 additions and 2293 deletions
Download Patch File Download Diff File Expand all files Collapse all files
App/wwwroot/HiAPI-docsite/api/Hi.Geom.Solvers.BinarySolverUtil.html
+14 -14
View File
@@ -166,7 +166,7 @@ The algorithm intelligently chooses the optimal boundary points based on the ini
<div class="markdown level1 conceptual"></div>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public static IEnumerable&lt;BinarySolvingStatus&gt; CenterSplitionSolve(Func&lt;double, double&gt; func, Range&lt;double&gt; xBoundary, Vec2d x0y0, double yTarget, double convergenceLimit, Func&lt;double, bool&gt; isYAcceptableFunc, int maxIteration = 12)</code></pre>
<pre><code class="lang-csharp hljs">public static IEnumerable&lt;BinarySolvingEntry&gt; CenterSplitionSolve(Func&lt;double, double&gt; func, Range&lt;double&gt; xBoundary, Vec2d x0y0, double yTarget, double convergenceLimit, Func&lt;double, bool&gt; isYAcceptableFunc, int maxIteration = 12)</code></pre>
</div>
<h4 class="section">Parameters</h4>
@@ -196,7 +196,7 @@ The algorithm intelligently chooses the optimal boundary points based on the ini
<h4 class="section">Returns</h4>
<dl class="parameters">
<dt><a class="xref" href="https://learn.microsoft.com/dotnet/api/system.collections.generic.ienumerable-1">IEnumerable</a>&lt;<a class="xref" href="Hi.Geom.Solvers.BinarySolvingStatus.html">BinarySolvingStatus</a>&gt;</dt>
<dt><a class="xref" href="https://learn.microsoft.com/dotnet/api/system.collections.generic.ienumerable-1">IEnumerable</a>&lt;<a class="xref" href="Hi.Geom.Solvers.BinarySolvingEntry.html">BinarySolvingEntry</a>&gt;</dt>
<dd><p>A sequence of solving status objects showing the progress of the solution</p>
</dd>
</dl>
@@ -223,7 +223,7 @@ The algorithm intelligently chooses the optimal boundary points based on the ini
<div class="markdown level1 conceptual"></div>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public static IEnumerable&lt;BinarySolvingStatus&gt; CenterSplitionSolve(Func&lt;double, double&gt; func, Range&lt;double&gt; xBoundary, double x0, double yTarget, double convergenceLimit, Func&lt;double, bool&gt; isYAcceptableFunc, int maxIteration = 12)</code></pre>
<pre><code class="lang-csharp hljs">public static IEnumerable&lt;BinarySolvingEntry&gt; CenterSplitionSolve(Func&lt;double, double&gt; func, Range&lt;double&gt; xBoundary, double x0, double yTarget, double convergenceLimit, Func&lt;double, bool&gt; isYAcceptableFunc, int maxIteration = 12)</code></pre>
</div>
<h4 class="section">Parameters</h4>
@@ -253,7 +253,7 @@ The algorithm intelligently chooses the optimal boundary points based on the ini
<h4 class="section">Returns</h4>
<dl class="parameters">
<dt><a class="xref" href="https://learn.microsoft.com/dotnet/api/system.collections.generic.ienumerable-1">IEnumerable</a>&lt;<a class="xref" href="Hi.Geom.Solvers.BinarySolvingStatus.html">BinarySolvingStatus</a>&gt;</dt>
<dt><a class="xref" href="https://learn.microsoft.com/dotnet/api/system.collections.generic.ienumerable-1">IEnumerable</a>&lt;<a class="xref" href="Hi.Geom.Solvers.BinarySolvingEntry.html">BinarySolvingEntry</a>&gt;</dt>
<dd><p>A sequence of solving status objects showing the progress of the solution</p>
</dd>
</dl>
@@ -280,7 +280,7 @@ The algorithm intelligently chooses the optimal boundary points based on the ini
<div class="markdown level1 conceptual"></div>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public static IEnumerable&lt;BinarySolvingStatus&gt; CenterSplitionSolve(Func&lt;double, double&gt; func, Range&lt;double&gt; xBoundary, double yTarget, double convergenceLimit, Func&lt;double, bool&gt; isYAcceptableFunc, int maxIteration = 12)</code></pre>
<pre><code class="lang-csharp hljs">public static IEnumerable&lt;BinarySolvingEntry&gt; CenterSplitionSolve(Func&lt;double, double&gt; func, Range&lt;double&gt; xBoundary, double yTarget, double convergenceLimit, Func&lt;double, bool&gt; isYAcceptableFunc, int maxIteration = 12)</code></pre>
</div>
<h4 class="section">Parameters</h4>
@@ -307,7 +307,7 @@ The algorithm intelligently chooses the optimal boundary points based on the ini
<h4 class="section">Returns</h4>
<dl class="parameters">
<dt><a class="xref" href="https://learn.microsoft.com/dotnet/api/system.collections.generic.ienumerable-1">IEnumerable</a>&lt;<a class="xref" href="Hi.Geom.Solvers.BinarySolvingStatus.html">BinarySolvingStatus</a>&gt;</dt>
<dt><a class="xref" href="https://learn.microsoft.com/dotnet/api/system.collections.generic.ienumerable-1">IEnumerable</a>&lt;<a class="xref" href="Hi.Geom.Solvers.BinarySolvingEntry.html">BinarySolvingEntry</a>&gt;</dt>
<dd><p>A sequence of solving status objects showing the progress of the solution</p>
</dd>
</dl>
@@ -334,7 +334,7 @@ The algorithm intelligently chooses the optimal boundary points based on the ini
<div class="markdown level1 conceptual"></div>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public static IEnumerable&lt;BinarySolvingStatus&gt; CenterSplitionSolve(Func&lt;double, double&gt; func, double x0, double y0, double xBoundary, double yTarget, double convergenceLimit, Func&lt;double, bool&gt; isYAcceptableFunc, int maxIteration = 12)</code></pre>
<pre><code class="lang-csharp hljs">public static IEnumerable&lt;BinarySolvingEntry&gt; CenterSplitionSolve(Func&lt;double, double&gt; func, double x0, double y0, double xBoundary, double yTarget, double convergenceLimit, Func&lt;double, bool&gt; isYAcceptableFunc, int maxIteration = 12)</code></pre>
</div>
<h4 class="section">Parameters</h4>
@@ -367,7 +367,7 @@ The algorithm intelligently chooses the optimal boundary points based on the ini
<h4 class="section">Returns</h4>
<dl class="parameters">
<dt><a class="xref" href="https://learn.microsoft.com/dotnet/api/system.collections.generic.ienumerable-1">IEnumerable</a>&lt;<a class="xref" href="Hi.Geom.Solvers.BinarySolvingStatus.html">BinarySolvingStatus</a>&gt;</dt>
<dt><a class="xref" href="https://learn.microsoft.com/dotnet/api/system.collections.generic.ienumerable-1">IEnumerable</a>&lt;<a class="xref" href="Hi.Geom.Solvers.BinarySolvingEntry.html">BinarySolvingEntry</a>&gt;</dt>
<dd><p>A sequence of solving status objects showing the progress of the solution</p>
</dd>
</dl>
@@ -394,7 +394,7 @@ The algorithm intelligently chooses the optimal boundary points based on the ini
<div class="markdown level1 conceptual"></div>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public static IEnumerable&lt;BinarySolvingStatus&gt; CenterSplitionSolveWithY1(Func&lt;double, double&gt; func, double x0, double y0, double x1, double y1, double yTarget, double convergenceLimit, Func&lt;double, bool&gt; isYAcceptableFunc, int maxIteration = 12)</code></pre>
<pre><code class="lang-csharp hljs">public static IEnumerable&lt;BinarySolvingEntry&gt; CenterSplitionSolveWithY1(Func&lt;double, double&gt; func, double x0, double y0, double x1, double y1, double yTarget, double convergenceLimit, Func&lt;double, bool&gt; isYAcceptableFunc, int maxIteration = 12)</code></pre>
</div>
<h4 class="section">Parameters</h4>
@@ -430,7 +430,7 @@ The algorithm intelligently chooses the optimal boundary points based on the ini
<h4 class="section">Returns</h4>
<dl class="parameters">
<dt><a class="xref" href="https://learn.microsoft.com/dotnet/api/system.collections.generic.ienumerable-1">IEnumerable</a>&lt;<a class="xref" href="Hi.Geom.Solvers.BinarySolvingStatus.html">BinarySolvingStatus</a>&gt;</dt>
<dt><a class="xref" href="https://learn.microsoft.com/dotnet/api/system.collections.generic.ienumerable-1">IEnumerable</a>&lt;<a class="xref" href="Hi.Geom.Solvers.BinarySolvingEntry.html">BinarySolvingEntry</a>&gt;</dt>
<dd><p>A sequence of solving status objects showing the progress of the solution</p>
</dd>
</dl>
@@ -457,7 +457,7 @@ The algorithm intelligently chooses the optimal boundary points based on the ini
<div class="markdown level1 conceptual"></div>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public static IEnumerable&lt;BinarySolvingStatus&gt; SlopeSolve(Func&lt;double, double&gt; func, double x0, double y0, double x1, double yTarget, double convergenceLimit, int maxIteration = 12)</code></pre>
<pre><code class="lang-csharp hljs">public static IEnumerable&lt;BinarySolvingEntry&gt; SlopeSolve(Func&lt;double, double&gt; func, double x0, double y0, double x1, double yTarget, double convergenceLimit, int maxIteration = 12)</code></pre>
</div>
<h4 class="section">Parameters</h4>
@@ -487,7 +487,7 @@ The algorithm intelligently chooses the optimal boundary points based on the ini
<h4 class="section">Returns</h4>
<dl class="parameters">
<dt><a class="xref" href="https://learn.microsoft.com/dotnet/api/system.collections.generic.ienumerable-1">IEnumerable</a>&lt;<a class="xref" href="Hi.Geom.Solvers.BinarySolvingStatus.html">BinarySolvingStatus</a>&gt;</dt>
<dt><a class="xref" href="https://learn.microsoft.com/dotnet/api/system.collections.generic.ienumerable-1">IEnumerable</a>&lt;<a class="xref" href="Hi.Geom.Solvers.BinarySolvingEntry.html">BinarySolvingEntry</a>&gt;</dt>
<dd><p>A sequence of solving status objects showing the progress of the solution</p>
</dd>
</dl>
@@ -514,7 +514,7 @@ The algorithm intelligently chooses the optimal boundary points based on the ini
<div class="markdown level1 conceptual"></div>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public static IEnumerable&lt;BinarySolvingStatus&gt; SlopeSolveWithY1(Func&lt;double, double&gt; func, double x0, double y0, double x1, double y1, double yTarget, double convergenceLimit, int maxIteration = 12)</code></pre>
<pre><code class="lang-csharp hljs">public static IEnumerable&lt;BinarySolvingEntry&gt; SlopeSolveWithY1(Func&lt;double, double&gt; func, double x0, double y0, double x1, double y1, double yTarget, double convergenceLimit, int maxIteration = 12)</code></pre>
</div>
<h4 class="section">Parameters</h4>
@@ -547,7 +547,7 @@ The algorithm intelligently chooses the optimal boundary points based on the ini
<h4 class="section">Returns</h4>
<dl class="parameters">
<dt><a class="xref" href="https://learn.microsoft.com/dotnet/api/system.collections.generic.ienumerable-1">IEnumerable</a>&lt;<a class="xref" href="Hi.Geom.Solvers.BinarySolvingStatus.html">BinarySolvingStatus</a>&gt;</dt>
<dt><a class="xref" href="https://learn.microsoft.com/dotnet/api/system.collections.generic.ienumerable-1">IEnumerable</a>&lt;<a class="xref" href="Hi.Geom.Solvers.BinarySolvingEntry.html">BinarySolvingEntry</a>&gt;</dt>
<dd><p>A sequence of solving status objects showing the progress of the solution</p>
</dd>
</dl>