Problem: the hexagonal refactor churns the backend tree for nine more phases; the UI delivery stack (web/ SPA, cmd/desktop Wails wrapper, compose/web image) must move to its own repo first so doc/layout rewrites land once on a backend-only tree. Change: - New repo git.hubris.network/dtoro/oikos-web (v0.33.0): web/, desktop/ (updateURL repointed to oikos-web releases), compose/, own CI (web + desktop jobs), own deploy script (CI-green gate, TOCTOU guard, version-tagged images, prune-to-3), own webhook receiver on :9798 + launchd unit, own compose project publishing the same 8091:80. - Cutover executed on mac-mini in order: oikos stack's web service stopped+removed, oikos-web project brought up on 8091; outer Caddy untouched (targets the published port) — serving + Authentik flow + /wails 404 quirk verified post-cutover. - Stripped from oikos: web/, cmd/desktop/, compose/web/, desktop CI workflow, ci.yml web job, Makefile ui/desktop/desktop-package/install targets, the compose web service, oikos-web from deploy.sh's fallback prune list; wails + go-keyring dropped from go.mod, vendor synced. - README / CONTRIBUTING / AGENTS.md / .agents dev+operations docs now point at the new repo; mbse + mascot design docs carry a path note. Risk: production SPA serving depends on the new pipeline now; rollback is versioned-image re-up of the old web service from a pre-split checkout (port 8091). Desktop builds installed before the split still check dtoro/oikos releases — one manual reinstall, noted in the oikos-web release notes. Verification: go vet, make test (race), make generate-check, golangci (no new findings; baseline down 400→365); post-cutover curls — localhost:8091 200, /wails/runtime.js 404, outer Caddy 302 Authentik.
236 lines
6.6 KiB
JavaScript
236 lines
6.6 KiB
JavaScript
/**
|
|
* @fileoverview Rule to disallow Math.pow in favor of the ** operator
|
|
* @author Milos Djermanovic
|
|
*/
|
|
|
|
"use strict";
|
|
|
|
//------------------------------------------------------------------------------
|
|
// Requirements
|
|
//------------------------------------------------------------------------------
|
|
|
|
const astUtils = require("./utils/ast-utils");
|
|
const { CALL, ReferenceTracker } = require("@eslint-community/eslint-utils");
|
|
|
|
//------------------------------------------------------------------------------
|
|
// Helpers
|
|
//------------------------------------------------------------------------------
|
|
|
|
const PRECEDENCE_OF_EXPONENTIATION_EXPR = astUtils.getPrecedence({
|
|
type: "BinaryExpression",
|
|
operator: "**",
|
|
});
|
|
|
|
/**
|
|
* Determines whether the given node needs parens if used as the base in an exponentiation binary expression.
|
|
* @param {ASTNode} base The node to check.
|
|
* @returns {boolean} `true` if the node needs to be parenthesised.
|
|
*/
|
|
function doesBaseNeedParens(base) {
|
|
return (
|
|
// '**' is right-associative, parens are needed when Math.pow(a ** b, c) is converted to (a ** b) ** c
|
|
astUtils.getPrecedence(base) <= PRECEDENCE_OF_EXPONENTIATION_EXPR ||
|
|
// An unary operator cannot be used immediately before an exponentiation expression
|
|
base.type === "AwaitExpression" ||
|
|
base.type === "UnaryExpression"
|
|
);
|
|
}
|
|
|
|
/**
|
|
* Determines whether the given node needs parens if used as the exponent in an exponentiation binary expression.
|
|
* @param {ASTNode} exponent The node to check.
|
|
* @returns {boolean} `true` if the node needs to be parenthesised.
|
|
*/
|
|
function doesExponentNeedParens(exponent) {
|
|
// '**' is right-associative, there is no need for parens when Math.pow(a, b ** c) is converted to a ** b ** c
|
|
return astUtils.getPrecedence(exponent) < PRECEDENCE_OF_EXPONENTIATION_EXPR;
|
|
}
|
|
|
|
/**
|
|
* Determines whether an exponentiation binary expression at the place of the given node would need parens.
|
|
* @param {ASTNode} node A node that would be replaced by an exponentiation binary expression.
|
|
* @param {SourceCode} sourceCode A SourceCode object.
|
|
* @returns {boolean} `true` if the expression needs to be parenthesised.
|
|
*/
|
|
function doesExponentiationExpressionNeedParens(node, sourceCode) {
|
|
const parent =
|
|
node.parent.type === "ChainExpression"
|
|
? node.parent.parent
|
|
: node.parent;
|
|
|
|
const parentPrecedence = astUtils.getPrecedence(parent);
|
|
const needsParens =
|
|
parent.type === "ClassDeclaration" ||
|
|
(parent.type.endsWith("Expression") &&
|
|
(parentPrecedence === -1 ||
|
|
parentPrecedence >= PRECEDENCE_OF_EXPONENTIATION_EXPR) &&
|
|
!(
|
|
parent.type === "BinaryExpression" &&
|
|
parent.operator === "**" &&
|
|
parent.right === node
|
|
) &&
|
|
!(
|
|
(parent.type === "CallExpression" ||
|
|
parent.type === "NewExpression") &&
|
|
parent.arguments.includes(node)
|
|
) &&
|
|
!(
|
|
parent.type === "MemberExpression" &&
|
|
parent.computed &&
|
|
parent.property === node
|
|
) &&
|
|
!(parent.type === "ArrayExpression"));
|
|
|
|
return needsParens && !astUtils.isParenthesised(sourceCode, node);
|
|
}
|
|
|
|
/**
|
|
* Optionally parenthesizes given text.
|
|
* @param {string} text The text to parenthesize.
|
|
* @param {boolean} shouldParenthesize If `true`, the text will be parenthesised.
|
|
* @returns {string} parenthesised or unchanged text.
|
|
*/
|
|
function parenthesizeIfShould(text, shouldParenthesize) {
|
|
return shouldParenthesize ? `(${text})` : text;
|
|
}
|
|
|
|
//------------------------------------------------------------------------------
|
|
// Rule Definition
|
|
//------------------------------------------------------------------------------
|
|
|
|
/** @type {import('../types').Rule.RuleModule} */
|
|
module.exports = {
|
|
meta: {
|
|
type: "suggestion",
|
|
|
|
docs: {
|
|
description:
|
|
"Disallow the use of `Math.pow` in favor of the `**` operator",
|
|
recommended: false,
|
|
frozen: true,
|
|
url: "https://eslint.org/docs/latest/rules/prefer-exponentiation-operator",
|
|
},
|
|
|
|
schema: [],
|
|
fixable: "code",
|
|
|
|
messages: {
|
|
useExponentiation: "Use the '**' operator instead of 'Math.pow'.",
|
|
},
|
|
},
|
|
|
|
create(context) {
|
|
const sourceCode = context.sourceCode;
|
|
|
|
/**
|
|
* Reports the given node.
|
|
* @param {ASTNode} node 'Math.pow()' node to report.
|
|
* @returns {void}
|
|
*/
|
|
function report(node) {
|
|
context.report({
|
|
node,
|
|
messageId: "useExponentiation",
|
|
fix(fixer) {
|
|
if (
|
|
node.arguments.length !== 2 ||
|
|
node.arguments.some(
|
|
arg => arg.type === "SpreadElement",
|
|
) ||
|
|
sourceCode.getCommentsInside(node).length > 0
|
|
) {
|
|
return null;
|
|
}
|
|
|
|
const base = node.arguments[0],
|
|
exponent = node.arguments[1],
|
|
baseText = sourceCode.getText(base),
|
|
exponentText = sourceCode.getText(exponent),
|
|
shouldParenthesizeBase = doesBaseNeedParens(base),
|
|
shouldParenthesizeExponent =
|
|
doesExponentNeedParens(exponent),
|
|
shouldParenthesizeAll =
|
|
doesExponentiationExpressionNeedParens(
|
|
node,
|
|
sourceCode,
|
|
);
|
|
|
|
let prefix = "",
|
|
suffix = "";
|
|
|
|
if (!shouldParenthesizeAll) {
|
|
if (!shouldParenthesizeBase) {
|
|
const firstReplacementToken =
|
|
sourceCode.getFirstToken(base),
|
|
tokenBefore = sourceCode.getTokenBefore(node);
|
|
|
|
if (
|
|
tokenBefore &&
|
|
tokenBefore.range[1] === node.range[0] &&
|
|
!astUtils.canTokensBeAdjacent(
|
|
tokenBefore,
|
|
firstReplacementToken,
|
|
)
|
|
) {
|
|
prefix = " "; // a+Math.pow(++b, c) -> a+ ++b**c
|
|
}
|
|
}
|
|
if (!shouldParenthesizeExponent) {
|
|
const lastReplacementToken =
|
|
sourceCode.getLastToken(exponent),
|
|
tokenAfter = sourceCode.getTokenAfter(node);
|
|
|
|
if (
|
|
tokenAfter &&
|
|
node.range[1] === tokenAfter.range[0] &&
|
|
!astUtils.canTokensBeAdjacent(
|
|
lastReplacementToken,
|
|
tokenAfter,
|
|
)
|
|
) {
|
|
suffix = " "; // Math.pow(a, b)in c -> a**b in c
|
|
}
|
|
}
|
|
}
|
|
|
|
const baseReplacement = parenthesizeIfShould(
|
|
baseText,
|
|
shouldParenthesizeBase,
|
|
),
|
|
exponentReplacement = parenthesizeIfShould(
|
|
exponentText,
|
|
shouldParenthesizeExponent,
|
|
),
|
|
replacement = parenthesizeIfShould(
|
|
`${baseReplacement}**${exponentReplacement}`,
|
|
shouldParenthesizeAll,
|
|
);
|
|
|
|
return fixer.replaceText(
|
|
node,
|
|
`${prefix}${replacement}${suffix}`,
|
|
);
|
|
},
|
|
});
|
|
}
|
|
|
|
return {
|
|
Program(node) {
|
|
const scope = sourceCode.getScope(node);
|
|
const tracker = new ReferenceTracker(scope);
|
|
const trackMap = {
|
|
Math: {
|
|
pow: { [CALL]: true },
|
|
},
|
|
};
|
|
|
|
for (const { node: refNode } of tracker.iterateGlobalReferences(
|
|
trackMap,
|
|
)) {
|
|
report(refNode);
|
|
}
|
|
},
|
|
};
|
|
},
|
|
};
|