import { SkDPoint } from "./SkPathOpsPoint"; import { SkDRect } from "./SkPathOpsRect"; import { SkIntersections } from "./SkIntersections"; import { SkTCurve } from "./SkPathOpsTCurve"; export declare class SkTCoincident { fPerpPt: SkDPoint; fPerpT: number; fMatch: boolean; isMatch(): boolean; init(): void; markCoincident(): void; perpPt(): SkDPoint; perpT(): number; setPerp(c1: SkTCurve, t: number, cPt: SkDPoint, c2: SkTCurve): void; } export declare class SkTSpanBounded { fBounded: SkTSpan; fNext: SkTSpanBounded; } export declare class SkTSpan { fPart: SkTCurve; fCoinStart: SkTCoincident; fCoinEnd: SkTCoincident; fBounded: SkTSpanBounded; fPrev: SkTSpan; fNext: SkTSpan; fBounds: SkDRect; fStartT: number; fEndT: number; fBoundsMax: number; fCollapsed: boolean; fHasPerp: boolean; fIsLinear: boolean; fIsLine: boolean; fDeleted: boolean; constructor(curve: SkTCurve); addBounded(span: SkTSpan): void; closestBoundedT(pt: SkDPoint): number; contains(t: number): boolean; endT(): number; findOppSpan(opp: SkTSpan): SkTSpan; findOppT(t: number): SkTSpan; hasOppT(t: number): boolean; hullsIntersect(opp: SkTSpan, start: boolean[], oppStart: boolean[]): number; init(c: SkTCurve): void; initBounds(c: SkTCurve): boolean; isBounded(): boolean; linearsIntersect(span: SkTSpan): boolean; linearT(pt: SkDPoint): number; markCoincident(): void; next(): SkTSpan; onlyEndPointsInCommon(opp: SkTSpan, start: boolean[], oppStart: boolean[], ptsInCommon: boolean[]): boolean; oppT(t: number): SkTSpan; part(): SkTCurve; pointCount(): number; pointFirst(): SkDPoint; pointLast(): SkDPoint; removeAllBounded(): boolean; removeBounded(opp: SkTSpan): boolean; reset(): void; resetBounds(curve: SkTCurve): void; split(work: SkTSpan): boolean; splitAt(work: SkTSpan, t: number): boolean; startT(): number; hullCheck(opp: SkTSpan, start: boolean[], oppStart: boolean[]): number; linearIntersects(q2: SkTCurve): number; } export declare class SkTSect { fCurve: SkTCurve; fHead: SkTSpan; fCoincident: SkTSpan; fDeleted: SkTSpan; fActiveCount: number; fRemovedStartT: boolean; fRemovedEndT: boolean; fHung: boolean; constructor(curve: SkTCurve); addFollowing(prior: SkTSpan): SkTSpan; addForPerp(span: SkTSpan, t: number): void; addOne(): SkTSpan; addSplitAt(span: SkTSpan, t: number): SkTSpan; binarySearchCoin(sect2: SkTSect, tStart: number, tStep: number, resultT: number[], oppT: number[], oppFirst: SkTSpan[]): boolean; boundsMax(): SkTSpan; coincidentCheck(sect2: SkTSect): boolean; coincidentForce(sect2: SkTSect, start1s: number, start1e: number): void; coincidentHasT(t: number): boolean; collapsed(): number; computePerpendiculars(sect2: SkTSect, first: SkTSpan, last: SkTSpan): void; countConsecutiveSpans(first: SkTSpan, lastPtr: SkTSpan[]): number; hasBounded(span: SkTSpan): boolean; deleteEmptySpans(): boolean; extractCoincident(sect2: SkTSect, firstIn: SkTSpan, lastIn: SkTSpan, result: SkTSpan[]): boolean; findCoincidentRun(first: SkTSpan, lastPtr: SkTSpan[]): SkTSpan; intersects(span: SkTSpan, opp: SkTSect, oppSpan: SkTSpan, oppResult: number[]): number; linesIntersect(span: SkTSpan, opp: SkTSect, oppSpan: SkTSpan, i: SkIntersections): number; markSpanGone(span: SkTSpan): boolean; matchedDirection(t: number, sect2: SkTSect, t2: number): boolean; matchedDirCheck(t: number, sect2: SkTSect, t2: number, calcMatched: boolean[], oppMatched: boolean[]): void; mergeCoincidence(sect2: SkTSect): void; prev(span: SkTSpan): SkTSpan; recoverCollapsed(): void; removeAllBut(keep: SkTSpan, span: SkTSpan, opp: SkTSect): void; removeByPerpendicular(opp: SkTSect): boolean; removeCoincident(span: SkTSpan, isBetween: boolean): boolean; removedEndCheck(span: SkTSpan): void; removeSpan(span: SkTSpan): boolean; removeSpanRange(first: SkTSpan, last: SkTSpan): void; removeSpans(span: SkTSpan, opp: SkTSect): boolean; spanAtT(t: number, priorSpan: SkTSpan[]): SkTSpan; tail(): SkTSpan; trim(span: SkTSpan, opp: SkTSect): boolean; unlinkSpan(span: SkTSpan): boolean; updateBounded(first: SkTSpan, last: SkTSpan, oppFirst: SkTSpan): boolean; resetRemovedEnds(): void; pointLast(): SkDPoint; static EndsEqual(sect1: SkTSect, sect2: SkTSect, intersections: SkIntersections): number; static BinarySearch(sect1: SkTSect, sect2: SkTSect, intersections: SkIntersections): void; }