"use strict"; var __extends = (this && this.__extends) || function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; function __() { this.constructor = d; } d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __()); }; var ts = require("typescript"); var Lint = require("../lint"); var Rule = (function (_super) { __extends(Rule, _super); function Rule() { _super.apply(this, arguments); } Rule.prototype.apply = function (sourceFile) { return this.applyWithWalker(new NoBitwiseWalker(sourceFile, this.getOptions())); }; Rule.metadata = { ruleName: "no-bitwise", description: "Disallows bitwise operators.", descriptionDetails: (_a = ["\n Specifically, the following bitwise operators are banned:\n `&`, `&=`, `|`, `|=`,\n `^`, `^=`, `<<`, `<<=`,\n `>>`, `>>=`, `>>>`, `>>>=`, and `~`.\n This rule does not ban the use of `&` and `|` for intersection and union types."], _a.raw = ["\n Specifically, the following bitwise operators are banned:\n \\`&\\`, \\`&=\\`, \\`|\\`, \\`|=\\`,\n \\`^\\`, \\`^=\\`, \\`<<\\`, \\`<<=\\`,\n \\`>>\\`, \\`>>=\\`, \\`>>>\\`, \\`>>>=\\`, and \\`~\\`.\n This rule does not ban the use of \\`&\\` and \\`|\\` for intersection and union types."], Lint.Utils.dedent(_a)), rationale: (_b = ["\n Bitwise operators are often typos - for example `bool1 & bool2` instead of `bool1 && bool2`.\n They also can be an indicator of overly clever code which decreases maintainability."], _b.raw = ["\n Bitwise operators are often typos - for example \\`bool1 & bool2\\` instead of \\`bool1 && bool2\\`.\n They also can be an indicator of overly clever code which decreases maintainability."], Lint.Utils.dedent(_b)), optionsDescription: "Not configurable.", options: null, optionExamples: ["true"], type: "functionality", }; Rule.FAILURE_STRING = "Forbidden bitwise operation"; return Rule; var _a, _b; }(Lint.Rules.AbstractRule)); exports.Rule = Rule; var NoBitwiseWalker = (function (_super) { __extends(NoBitwiseWalker, _super); function NoBitwiseWalker() { _super.apply(this, arguments); } NoBitwiseWalker.prototype.visitBinaryExpression = function (node) { switch (node.operatorToken.kind) { case ts.SyntaxKind.AmpersandToken: case ts.SyntaxKind.AmpersandEqualsToken: case ts.SyntaxKind.BarToken: case ts.SyntaxKind.BarEqualsToken: case ts.SyntaxKind.CaretToken: case ts.SyntaxKind.CaretEqualsToken: case ts.SyntaxKind.LessThanLessThanToken: case ts.SyntaxKind.LessThanLessThanEqualsToken: case ts.SyntaxKind.GreaterThanGreaterThanToken: case ts.SyntaxKind.GreaterThanGreaterThanEqualsToken: case ts.SyntaxKind.GreaterThanGreaterThanGreaterThanToken: case ts.SyntaxKind.GreaterThanGreaterThanGreaterThanEqualsToken: this.addFailure(this.createFailure(node.getStart(), node.getWidth(), Rule.FAILURE_STRING)); break; default: break; } _super.prototype.visitBinaryExpression.call(this, node); }; NoBitwiseWalker.prototype.visitPrefixUnaryExpression = function (node) { if (node.operator === ts.SyntaxKind.TildeToken) { this.addFailure(this.createFailure(node.getStart(), node.getWidth(), Rule.FAILURE_STRING)); } _super.prototype.visitPrefixUnaryExpression.call(this, node); }; return NoBitwiseWalker; }(Lint.RuleWalker));