public int Compare(x1, x2)
{
if (x1.parent == parent1 && x2.parent == parent2)
{
return(1);
}
if (x1.parent == x2.parent)
{
return(0);
}
//ect
}
Mnbrak(x1, x2, out float ax, out float bx, out float cx, out float fa, out float fb, out float fc,
(x0) =>
{
(float fx0, float dx0) = func(x0);
=> RotateY(x1, y1, z1, rad);
=> this.Fx = (x1, x2) => f(x1, x2);
=> LineSegmentCenter1(x1, y1, x2, y2);
=> QuadraticBezierInterpolate3D0(t, x0, y0, z0, x1, y1, z1, x2, y2, z2);
=> this.Fx = (x1, x2, x3) => f(x1, x2, x3);
select (x1, x2, x3);
int IComparer.Compare(object?x, object?y) => x is T x1 && y is T y1?Compare(x1, y1) : 0;
=> RotateZ(x1, y1, z1, rad);
=> RotateX1(x1, y1, z1, yOff, zOff, rad);
=> RotateX(x1, y1, z1, rad);
=> CubicBezierSelfIntersectionX(x0, y0, x1, y1, x2, y2, x3, y3);
=> Rejection1(x1, y1, z1, x2, y2, z2);
=> LineSegmentToQuadraticBezier0(x0, y0, x1, y1);
select (x1, x2, x3, x4, x5, x6);
select (x1, x2);
// want to solve: // x = r1 (m1) // x = r2 (m2) // Bézout: // exists x1, x2: x1*m1 + x2*m2 = 1 <-- get with Extended Eucl. alg. (primes -> gcd=1) // -> a solution: x1*m1*r2 + r1*x2*m2 var(x1, x2) = Euclidean(cong1.mod, cong2.mod);
var(x1, y1, x2, y2) = line;
=> this.comparer = comparer ?? ((X x1, X x2) => object.Equals(x1, x2));
=> ComplexProduct0(x0, y0, x1, y1);
=> HermiteInterpolate3D1(mu, x0, y0, z0, x1, y1, z1, x2, y2, z2, x3, y3, z3, tension, bias);
=> CrossProduct2Points3D0(x1, y1, z1, x2, y2, z2);
=> FindIntersection(x1, y1, x2, y2, x3, y3, x4, y4, epsilon);
=> LineSegmentToCubicBezier0(x0, y0, x1, y1);
select (x1, x2, x3, x4);
=> CubicInterpolate3D1(t, x0, y0, z0, x1, y1, z1, x2, y2, z2, x3, y3, z3);
select (x1, x2, x3, x4, x5);
return(new Rectangle(x1, y1, x2 - x1, y2 - y1));
=> Projection1(x1, y1, z1, x2, y2, z2);
