import { SkPoint } from "../core/SkPoint"; import { SkDPoint, SkDVector } from "./SkPathOpsPoint"; import { SkDQuad } from "./SkPathOpsQuad"; import { SkTCurve } from "./SkPathOpsTCurve"; import type { SkDConic } from "./SkPathOpsConic"; import type { SkIntersections } from "./SkIntersections"; import type { SkDLine } from "./SkPathOpsLine"; import type { SkDRect } from "./SkPathOpsRect"; export declare enum SkCubicType { kSerpentine = 0, kLoop = 1, kLocalCusp = 2, kCuspAtInfinity = 3, kQuadratic = 4, kLineOrPoint = 5 } export declare class SkDCubicPair { pts: SkDPoint[]; first(): SkDCubic; second(): SkDCubic; } export declare class SkDCubic { static readonly kPointCount = 4; static readonly kPointLast: number; static readonly kMaxIntersections = 9; static readonly gPrecisionUnit = 256; static readonly kXAxis = 0; static readonly kYAxis = 1; fPts: SkDPoint[]; at(n: number): SkDPoint; copyFrom(c: SkDCubic): void; collapsed(): boolean; controlsInside(): boolean; static IsConic(): boolean; debugInit(): void; set(pts: SkPoint[]): this; align(endIndex: number, ctrlIndex: number, dstPt: SkDPoint): void; binarySearch(min: number, max: number, axisIntercept: number, xAxis: number): number; calcPrecision(): number; chopAt(t: number): SkDCubicPair; static Coefficients(src: number[]): number[]; static ComplexBreak(pointsPtr: SkPoint[], t: number[]): number; convexHull(order: number[]): number; dxdyAtT(t: number): SkDVector; endsAreExtremaInXOrY(): boolean; static FindExtrema(src: number[], tValue: number[]): number; findInflections(tValues: number[]): number; static FindInflections(a: SkPoint[], tValues: number[]): number; findMaxCurvature(tValues: number[]): number; private hullIntersects; hullIntersectsCubic(c2: SkDCubic, isLinear: boolean[]): boolean; hullIntersectsQuad(quad: SkDQuad, isLinear: boolean[]): boolean; hullIntersectsConic(conic: SkDConic, isLinear: boolean[]): boolean; isLinear(startIndex: number, endIndex: number): boolean; static maxIntersections(): number; monotonicInX(): boolean; monotonicInY(): boolean; otherPts(index: number, o1Pts: SkDPoint[]): void; static pointCount(): number; static pointLast(): number; ptAtT(t: number): SkDPoint; static RootsReal(A: number, B: number, C: number, D: number, s: number[]): number; static RootsValidT(A: number, B: number, C: number, D: number, t: number[]): number; searchRoots(extremeTs: number[], extrema: number, axisIntercept: number, xAxis: number, validRoots: number[]): number; toFloatPoints(pts: SkPoint[]): boolean; horizontalIntersect(yIntercept: number, roots: number[]): number; verticalIntersect(xIntercept: number, roots: number[]): number; top(dCurve: SkDCubic, startT: number, endT: number, topPt: SkDPoint): number; toQuad(): SkDQuad; subDivide(t1: number, t2: number): SkDCubic; subDivideInto(t1: number, t2: number, c: SkDCubic): void; static SubDivide(a: SkPoint[], t1: number, t2: number): SkDCubic; subDividePt(a: SkDPoint, d: SkDPoint, t1: number, t2: number, p: SkDPoint[]): void; static SubDividePt(pts: SkPoint[], a: SkDPoint, d: SkDPoint, t1: number, t2: number, p: SkDPoint[]): void; } export declare class SkTCubic extends SkTCurve { fCubic: SkDCubic; constructor(c?: SkDCubic); at(n: number): SkDPoint; collapsed(): boolean; controlsInside(): boolean; debugInit(): void; dxdyAtT(t: number): SkDVector; hullIntersectsQuad(quad: SkDQuad, isLinear: boolean[]): boolean; hullIntersectsConic(conic: SkDConic, isLinear: boolean[]): boolean; hullIntersectsCubic(cubic: SkDCubic, isLinear: boolean[]): boolean; hullIntersects(curve: SkTCurve, isLinear: boolean[]): boolean; intersectRay(i: SkIntersections, line: SkDLine): number; isConic(): boolean; make(): SkTCurve; maxIntersections(): number; otherPts(oddMan: number, endPt: SkDPoint[]): void; pointCount(): number; pointLast(): number; ptAtT(t: number): SkDPoint; setBounds(rect: SkDRect): void; subDivide(t1: number, t2: number, curve: SkTCurve): void; }