本文整理匯總了TypeScript中app/model/paths.Path.isClockwise方法的典型用法代碼示例。如果您正苦於以下問題：TypeScript Path.isClockwise方法的具體用法？TypeScript Path.isClockwise怎麽用？TypeScript Path.isClockwise使用的例子？那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在類app/model/paths.Path的用法示例。
在下文中一共展示了Path.isClockwise方法的1個代碼示例，這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚，您的評價將有助於係統推薦出更棒的TypeScript代碼示例。
示例1: permuteSubPath
function permuteSubPath(from: Path, to: Path, subIdx: number): [Path, Path] {
if (from.isClockwise(subIdx) !== to.isClockwise(subIdx)) {
// Make sure the paths share the same direction.
to = to
.mutate()
.reverseSubPath(subIdx)
.build();
}
// Create and return a list of reversed and shifted from paths to test.
// Each generated 'from path' will be aligned with the target 'to path'.
const fromPaths: Path[] = [from];
if (from.getSubPath(subIdx).isClosed()) {
for (let i = 1; i < from.getSubPath(subIdx).getCommands().length - 1; i++) {
// TODO: we need to find a way to reduce the number of paths to try.
fromPaths.push(
from
.mutate()
.shiftSubPathBack(subIdx, i)
.build(),
);
}
}
let bestFromPath = from;
let min = Infinity;
for (const fromPath of fromPaths) {
const fromCmds = fromPath.getSubPath(subIdx).getCommands();
let sumOfSquares = 0;
const toCmds = to.getSubPath(subIdx).getCommands();
fromCmds.forEach(
(c, cmdIdx) => (sumOfSquares += MathUtil.distance(c.end, toCmds[cmdIdx].end) ** 2),
);
if (sumOfSquares < min) {
min = sumOfSquares;
bestFromPath = fromPath;
}
}
return [bestFromPath, to];
}