Hirse/brackets-outline-list

File postcss-safe-parser.js has 5443 lines of code (exceeds 250 allowed). Consider refactoring.

Open

/**!
 * PostCSS Safe Parser version 6.0.0
 * (browserified with Browserify version 17.0.0)
 *
 * The MIT License (MIT)

Function 3 has 1381 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{}],3:[function(require,module,exports){
(function (Buffer){(function (){
/*!
 * The buffer module from node.js, for the browser.
 *

Function 23 has 516 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{"./container":11,"./input":16,"./parser":23,"_process":36}],23:[function(require,module,exports){
'use strict'

let Declaration = require('./declaration')
let tokenizer = require('./tokenize')

Function 17 has 484 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{"./css-syntax-error":12,"./previous-map":25,"./terminal-highlight":2,"nanoid/non-secure":5,"path":2,"source-map-js":2,"url":2}],17:[function(require,module,exports){
(function (process){(function (){
'use strict'

let { isClean, my } = require('./symbols')

Function 11 has 371 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{"./node":21}],11:[function(require,module,exports){
'use strict'

let { isClean, my } = require('./symbols')
let Declaration = require('./declaration')

Function 21 has 331 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{"./map-generator":19,"./parse":22,"./result":27,"./stringify":31,"./warn-once":34,"_process":36}],21:[function(require,module,exports){
'use strict'

let { isClean, my } = require('./symbols')
let CssSyntaxError = require('./css-syntax-error')

Function 30 has 299 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{"./container":11,"./list":18}],30:[function(require,module,exports){
'use strict'

const DEFAULT_RAW = {
  after: '\n',

Function 19 has 297 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{}],19:[function(require,module,exports){
(function (Buffer){(function (){
'use strict'

let { SourceMapConsumer, SourceMapGenerator } = require('source-map-js')

Function 33 has 230 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{}],33:[function(require,module,exports){
'use strict'

const SINGLE_QUOTE = "'".charCodeAt(0)
const DOUBLE_QUOTE = '"'.charCodeAt(0)

Function 16 has 213 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{"./at-rule":9,"./comment":10,"./declaration":13,"./input":16,"./previous-map":25,"./root":28,"./rule":29}],16:[function(require,module,exports){
'use strict'

let { SourceMapConsumer, SourceMapGenerator } = require('source-map-js')
let { fileURLToPath, pathToFileURL } = require('url')

Function tokenizer has 205 lines of code (exceeds 25 allowed). Consider refactoring.

Open

module.exports = function tokenizer(input, options = {}) {
  let css = input.css.valueOf()
  let ignore = options.ignoreErrors

  let code, next, quote, content, escape

Function nextToken has 177 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  function nextToken(opts) {
    if (returned.length) return returned.pop()
    if (pos >= length) return

    let ignoreUnclosed = opts ? opts.ignoreUnclosed : false

Function 36 has 149 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{}],36:[function(require,module,exports){
// shim for using process in browser
var process = module.exports = {};

// cached from whatever global is present so that test runners that stub it

Function 25 has 120 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{"./at-rule":9,"./comment":10,"./container":11,"./css-syntax-error":12,"./declaration":13,"./document":14,"./fromJSON":15,"./input":16,"./lazy-result":17,"./list":18,"./node":21,"./parse":22,"./processor":26,"./result.js":27,"./root":28,"./rule":29,"./stringify":31,"./warning":35,"_process":36}],25:[function(require,module,exports){
(function (Buffer){(function (){
'use strict'

let { SourceMapConsumer, SourceMapGenerator } = require('source-map-js')

Function 1 has 116 lines of code (exceeds 25 allowed). Consider refactoring.

Open

(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.postcssSafeParser = f()}})(function(){var define,module,exports;return (function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c="function"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error("Cannot find module '"+i+"'");throw a.code="MODULE_NOT_FOUND",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u="function"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(require,module,exports){
'use strict'

exports.byteLength = byteLength
exports.toByteArray = toByteArray

Function 20 has 111 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{"./input":16,"buffer":3,"path":2,"source-map-js":2,"url":2}],20:[function(require,module,exports){
(function (process){(function (){
'use strict'

let MapGenerator = require('./map-generator')

Function 24 has 88 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{"./at-rule":9,"./comment":10,"./declaration":13,"./root":28,"./rule":29,"./tokenize":33}],24:[function(require,module,exports){
(function (process){(function (){
'use strict'

let CssSyntaxError = require('./css-syntax-error')

Function decl has 86 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  decl(tokens, customProperty) {
    let node = new Declaration()
    this.init(node, tokens[0][2])

    let last = tokens[tokens.length - 1]

Function 12 has 84 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{"./comment":10,"./declaration":13,"./node":21,"./symbols":32}],12:[function(require,module,exports){
'use strict'

let pico = require('picocolors')

Function 7 has 79 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{}],7:[function(require,module,exports){
let tokenizer = require('postcss/lib/tokenize')
let Comment = require('postcss/lib/comment')
let Parser = require('postcss/lib/parser')

Function atrule has 73 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  atrule(token) {
    let node = new AtRule()
    node.name = token[1].slice(1)
    if (node.name === '') {
      this.unnamedAtrule(node, token)

Function 4 has 73 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{"base64-js":1,"buffer":3,"ieee754":4}],4:[function(require,module,exports){
/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
exports.read = function (buffer, offset, isLE, mLen, nBytes) {
  var e, m
  var eLen = (nBytes * 8) - mLen - 1

Function utf8Slice has 61 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function utf8Slice (buf, start, end) {
  end = Math.min(buf.length, end)
  var res = []

  var i = start

Function 26 has 61 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{"buffer":3,"fs":2,"path":2,"source-map-js":2}],26:[function(require,module,exports){
(function (process){(function (){
'use strict'

let NoWorkResult = require('./no-work-result')

Function generateString has 59 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  generateString() {
    this.css = ''
    this.map = new SourceMapGenerator({ file: this.outputFile() })

    let line = 1

Function utf8ToBytes has 58 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function utf8ToBytes (string, units) {
  units = units || Infinity
  var codePoint
  var length = string.length
  var leadSurrogate = null

Function error has 57 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  error(message, line, column, opts = {}) {
    let result, endLine, endColumn

    if (line && typeof line === 'object') {
      let start = line

Function other has 55 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  other(start) {
    let end = false
    let type = null
    let colon = false
    let bracket = null

Function write has 54 lines of code (exceeds 25 allowed). Consider refactoring.

Open

Buffer.prototype.write = function write (string, offset, length, encoding) {
  // Buffer#write(string)
  if (offset === undefined) {
    encoding = 'utf8'
    length = this.length

Function fill has 53 lines of code (exceeds 25 allowed). Consider refactoring.

Open

Buffer.prototype.fill = function fill (val, start, end, encoding) {
  // Handle string cases:
  if (typeof val === 'string') {
    if (typeof start === 'string') {
      encoding = start

Function compare has 53 lines of code (exceeds 25 allowed). Consider refactoring.

Open

Buffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {
  if (isInstance(target, Uint8Array)) {
    target = Buffer.from(target, target.offset, target.byteLength)
  }
  if (!Buffer.isBuffer(target)) {

Function visitTick has 50 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  visitTick(stack) {
    let visit = stack[stack.length - 1]
    let { node, visitors } = visit

    if (node.type !== 'root' && node.type !== 'document' && !node.parent) {

Function runAsync has 50 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  async runAsync() {
    this.plugin = 0
    for (let i = 0; i < this.plugins.length; i++) {
      let plugin = this.plugins[i]
      let promise = this.runOnRoot(plugin)

Function arrayIndexOf has 49 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function arrayIndexOf (arr, val, byteOffset, encoding, dir) {
  var indexSize = 1
  var arrLength = arr.length
  var valLength = val.length

Function 15 has 49 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{"./container":11}],15:[function(require,module,exports){
'use strict'

let Declaration = require('./declaration')
let PreviousMap = require('./previous-map')

Function 18 has 49 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{"./container":11,"./document":14,"./map-generator":19,"./parse":22,"./result":27,"./root":28,"./stringify":31,"./symbols":32,"./warn-once":34,"_process":36}],18:[function(require,module,exports){
'use strict'

let list = {
  comma(string) {

Function rangeBy has 47 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  rangeBy(opts) {
    let start = {
      column: this.source.start.column,
      line: this.source.start.line
    }

Function getProxyProcessor has 46 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  getProxyProcessor() {
    return {
      get(node, prop) {
        if (prop === 'proxyOf') {
          return node

Function 28 has 46 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{"./warning":35}],28:[function(require,module,exports){
'use strict'

let Container = require('./container')

Function normalize has 44 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  normalize(nodes, sample) {
    if (typeof nodes === 'string') {
      nodes = cleanSource(parse(nodes).nodes)
    } else if (Array.isArray(nodes)) {
      nodes = nodes.slice(0)

Function slowToString has 44 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function slowToString (encoding, start, end) {
  var loweredCase = false

  // No need to verify that "this.length <= MAX_UINT32" since it's a read-only
  // property of a typed array.

Function write has 43 lines of code (exceeds 25 allowed). Consider refactoring.

Open

exports.write = function (buffer, value, offset, isLE, mLen, nBytes) {
  var e, m, c
  var eLen = (nBytes * 8) - mLen - 1
  var eMax = (1 << eLen) - 1
  var eBias = eMax >> 1

Function byteLength has 42 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function byteLength (string, encoding) {
  if (Buffer.isBuffer(string)) {
    return string.length
  }
  if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {

Function bidirectionalIndexOf has 41 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {
  // Empty buffer means no match
  if (buffer.length === 0) return -1

  // Normalize byteOffset

Function constructor has 40 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  constructor(processor, css, opts) {
    this.stringified = false
    this.processed = false

    let root

Function toJSON has 40 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  toJSON(_, inputs) {
    let fixed = {}
    let emitInputs = inputs == null
    inputs = inputs || new Map()
    let inputsNextIndex = 0

Function 22 has 39 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{"./css-syntax-error":12,"./stringifier":30,"./stringify":31,"./symbols":32}],22:[function(require,module,exports){
(function (process){(function (){
'use strict'

let Container = require('./container')

Function fromJSON has 38 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function fromJSON(json, inputs) {
  if (Array.isArray(json)) return json.map(n => fromJSON(n))

  let { inputs: ownInputs, ...defaults } = json
  if (ownInputs) {

Function from has 37 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function from (value, encodingOrOffset, length) {
  if (typeof value === 'string') {
    return fromString(value, encodingOrOffset)
  }

Function raw has 37 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  raw(node, own, detect) {
    let value
    if (!detect) detect = own

    // Already had

Function constructor has 37 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  constructor(css, opts = {}) {
    if (
      css === null ||
      typeof css === 'undefined' ||
      (typeof css === 'object' && !css.toString)

Function split has 36 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  split(string, separators, last) {
    let array = []
    let current = ''
    let split = false

Function fromOffset has 36 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  fromOffset(offset) {
    let lastLine, lineToIndex
    if (!this[fromOffsetCache]) {
      let lines = this.css.split('\n')
      lineToIndex = new Array(lines.length)

Function toByteArray has 35 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function toByteArray (b64) {
  var tmp
  var lens = getLens(b64)
  var validLen = lens[0]
  var placeHoldersLen = lens[1]

Function prepareVisitors has 35 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  prepareVisitors() {
    this.listeners = {}
    let add = (plugin, type, cb) => {
      if (!this.listeners[type]) this.listeners[type] = []
      this.listeners[type].push([plugin, cb])

Function origin has 34 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  origin(line, column, endLine, endColumn) {
    if (!this.map) return false
    let consumer = this.map.consumer()

    let from = consumer.originalPositionFor({ column, line })

Function get has 34 lines of code (exceeds 25 allowed). Consider refactoring.

Open

      get(node, prop) {
        if (prop === 'proxyOf') {
          return node
        } else if (!node[prop]) {
          return node[prop]

Consider simplifying this complex logical expression.

Open

        if (
          prev === 'url' &&
          n !== SINGLE_QUOTE &&
          n !== DOUBLE_QUOTE &&
          n !== SPACE &&

Function loadMap has 33 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  loadMap(file, prev) {
    if (prev === false) return false

    if (prev) {
      if (typeof prev === 'string') {

Function plugin has 33 lines of code (exceeds 25 allowed). Consider refactoring.

Open

postcss.plugin = function plugin(name, initializer) {
  let warningPrinted = false
  function creator(...args) {
    // eslint-disable-next-line no-console
    if (console && console.warn && !warningPrinted) {

Function 27 has 32 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{"./document":14,"./lazy-result":17,"./no-work-result":20,"./root":28,"_process":36}],27:[function(require,module,exports){
'use strict'

let Warning = require('./warning')

Function handleError has 32 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  handleError(error, node) {
    let plugin = this.result.lastPlugin
    try {
      if (node) node.addToError(error)
      this.error = error

Function copy has 32 lines of code (exceeds 25 allowed). Consider refactoring.

Open

Buffer.prototype.copy = function copy (target, targetStart, start, end) {
  if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')
  if (!start) start = 0
  if (!end && end !== 0) end = this.length
  if (targetStart >= target.length) targetStart = target.length

Function showSourceCode has 32 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  showSourceCode(color) {
    if (!this.source) return ''

    let css = this.source
    if (color == null) color = pico.isColorSupported

Function raw has 31 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  raw(node, prop, tokens, customProperty) {
    let token, type
    let length = tokens.length
    let value = ''
    let clean = true

Function sync has 30 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  sync() {
    if (this.error) throw this.error
    if (this.processed) return this.result
    this.processed = true

Function 35 has 29 lines of code (exceeds 25 allowed). Consider refactoring.

Open

},{}],35:[function(require,module,exports){
'use strict'

class Warning {
  constructor(text, opts = {}) {

Function parse has 28 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  parse() {
    let token
    while (!this.tokenizer.endOfFile()) {
      token = this.tokenizer.nextToken()

Function parse has 28 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function parse(css, opts) {
  let input = new Input(css, opts)
  let parser = new Parser(input)
  try {
    parser.parse()

Function concat has 27 lines of code (exceeds 25 allowed). Consider refactoring.

Open

Buffer.concat = function concat (list, length) {
  if (!Array.isArray(list)) {
    throw new TypeError('"list" argument must be an Array of Buffers')
  }

Function constructor has 27 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  constructor(message, line, column, source, file, plugin) {
    super(message)
    this.name = 'CssSyntaxError'
    this.reason = message

Function read has 26 lines of code (exceeds 25 allowed). Consider refactoring.

Open

exports.read = function (buffer, offset, isLE, mLen, nBytes) {
  var e, m
  var eLen = (nBytes * 8) - mLen - 1
  var eMax = (1 << eLen) - 1
  var eBias = eMax >> 1

Function getProxyProcessor has 26 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  getProxyProcessor() {
    return {
      get(node, prop) {
        if (prop === 'proxyOf') {
          return node

Function normalize has 26 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  normalize(plugins) {
    let normalized = []
    for (let i of plugins) {
      if (i.postcss === true) {
        i = i()

Function constructor has 26 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  constructor(processor, css, opts) {
    css = css.toString()
    this.stringified = false

    this._processor = processor

Consider simplifying this complex logical expression.

Open

        if (
          escape &&
          code !== SLASH &&
          code !== SPACE &&
          code !== NEWLINE &&

Function checkIEEE754 has 6 arguments (exceeds 4 allowed). Consider refactoring.

Open

function checkIEEE754 (buf, value, offset, ext, max, min) {

Avoid deeply nested control flow statements.

Open

            if (tempCodePoint > 0x7F) {
              codePoint = tempCodePoint
            }

Avoid deeply nested control flow statements.

Open

            while (prev && prev[0] === 'space') {
              prev = params[--shift]
            }

Avoid deeply nested control flow statements.

Open

            if (typeof plugin[event] === 'object') {
              for (let filter in plugin[event]) {
                if (filter === '*') {
                  add(plugin, event, plugin[event][filter])
                } else {

Avoid deeply nested control flow statements.

Open

              if (ignore || ignoreUnclosed) {
                next = pos
                break
              } else {
                unclosed('bracket')

Avoid deeply nested control flow statements.

Open

          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)

Function checkInt has 6 arguments (exceeds 4 allowed). Consider refactoring.

Open

function checkInt (buf, value, offset, ext, max, min) {

Avoid deeply nested control flow statements.

Open

      } else if (type === brackets[brackets.length - 1]) {
        brackets.pop()
        if (brackets.length === 0) bracket = null
      }

Avoid deeply nested control flow statements.

Open

        } else if (i + 1 === length) {
          // unpaired lead
          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
          continue
        }

Avoid deeply nested control flow statements.

Open

          if (str.trim().indexOf('!') === 0 && type !== 'space') {
            break
          }

Avoid deeply nested control flow statements.

Open

            if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {
              codePoint = tempCodePoint
            }

Avoid deeply nested control flow statements.

Open

        if (separators.includes(letter)) split = true

Avoid deeply nested control flow statements.

Open

            if (prev) {
              node.source.end = this.getPosition(prev[3] || prev[2])
            }

Avoid deeply nested control flow statements.

Open

            if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {
              codePoint = tempCodePoint
            }

Avoid deeply nested control flow statements.

Open

      if ((units -= 3) < 0) break

Avoid deeply nested control flow statements.

Open

    } else if (codePoint < 0x110000) {
      if ((units -= 4) < 0) break
      bytes.push(
        codePoint >> 0x12 | 0xF0,
        codePoint >> 0xC & 0x3F | 0x80,

Function write has 6 arguments (exceeds 4 allowed). Consider refactoring.

Open

exports.write = function (buffer, value, offset, isLE, mLen, nBytes) {

Avoid deeply nested control flow statements.

Open

        if (type === ';') {
          if (colon) {
            this.decl(tokens, customProperty)
            return
          } else {

Consider simplifying this complex logical expression.

Open

        if (
          prop === 'prop' ||
          prop === 'value' ||
          prop === 'name' ||
          prop === 'params' ||

Function compare has 5 arguments (exceeds 4 allowed). Consider refactoring.

Open

Buffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {

Function arrayIndexOf has 5 arguments (exceeds 4 allowed). Consider refactoring.

Open

function arrayIndexOf (arr, val, byteOffset, encoding, dir) {

Function writeDouble has 5 arguments (exceeds 4 allowed). Consider refactoring.

Open

function writeDouble (buf, value, offset, littleEndian, noAssert) {

Function writeFloat has 5 arguments (exceeds 4 allowed). Consider refactoring.

Open

function writeFloat (buf, value, offset, littleEndian, noAssert) {

Function read has 5 arguments (exceeds 4 allowed). Consider refactoring.

Open

exports.read = function (buffer, offset, isLE, mLen, nBytes) {

Function bidirectionalIndexOf has 5 arguments (exceeds 4 allowed). Consider refactoring.

Open

function bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {

Avoid too many return statements within this function.

Open

        return prev.toString()

Avoid too many return statements within this function.

Open

      return root.rawCache[detect]

Avoid too many return statements within this function.

Open

          return () => node.root().toProxy()

Avoid too many return statements within this function.

Open

            return cachedSetTimeout.call(this, fun, 0);

Avoid too many return statements within this function.

Open

    return arrayIndexOf(buffer, val, byteOffset, encoding, dir)

Avoid too many return statements within this function.

Open

          return node[prop].toProxy()

Avoid too many return statements within this function.

Open

    return new Comment(defaults)

Avoid too many return statements within this function.

Open

      return this.loadFile(map)

Avoid too many return statements within this function.

Open

      return this.beforeAfter(node, detect)

Avoid too many return statements within this function.

Open

  if (y < x) return 1

Avoid too many return statements within this function.

Open

            return cachedClearTimeout.call(this, marker);

Avoid too many return statements within this function.

Open

  return 0

Avoid too many return statements within this function.

Open

        return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)

Avoid too many return statements within this function.

Open

  if (b) return b

Avoid too many return statements within this function.

Open

    return Buffer.from(
      value[Symbol.toPrimitive]('string'), encodingOrOffset, length
    )

Avoid too many return statements within this function.

Open

    return new AtRule(defaults)

Avoid too many return statements within this function.

Open

          return node.nodes.map(i => i.toProxy())

Avoid too many return statements within this function.

Open

          return node[prop]

Avoid too many return statements within this function.

Open

    return arrayIndexOf(buffer, [ val ], byteOffset, encoding, dir)

Avoid too many return statements within this function.

Open

        return JSON.stringify(prev)

Avoid too many return statements within this function.

Open

      return this.decodeInline(this.annotation)

Avoid too many return statements within this function.

Open

  if (x < y) return -1

Avoid too many return statements within this function.

Open

        return

Avoid too many return statements within this function.

Open

    return fromArrayLike(obj.data)

Avoid too many return statements within this function.

Open

        return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)

Avoid too many return statements within this function.

Open

    return value

Similar blocks of code found in 3 locations. Consider refactoring.

Open

},{}],36:[function(require,module,exports){
// shim for using process in browser
var process = module.exports = {};

// cached from whatever global is present so that test runners that stub it

• Read up
  Read up

Similar blocks of code found in 5 locations. Consider refactoring.

Open

(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.postcssSafeParser = f()}})(function(){var define,module,exports;return (function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c="function"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error("Cannot find module '"+i+"'");throw a.code="MODULE_NOT_FOUND",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u="function"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(require,module,exports){
'use strict'

exports.byteLength = byteLength
exports.toByteArray = toByteArray

• Read up
  Read up

Similar blocks of code found in 3 locations. Consider refactoring.

Open

  walkRules(selector, callback) {
    if (!callback) {
      callback = selector

      return this.walk((child, i) => {

• Read up
  Read up

Similar blocks of code found in 3 locations. Consider refactoring.

Open

  walkDecls(prop, callback) {
    if (!callback) {
      callback = prop
      return this.walk((child, i) => {
        if (child.type === 'decl') {

• Read up
  Read up

Similar blocks of code found in 3 locations. Consider refactoring.

Open

  walkAtRules(name, callback) {
    if (!callback) {
      callback = name
      return this.walk((child, i) => {
        if (child.type === 'atrule') {

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  rawBeforeDecl(root, node) {
    let value
    root.walkDecls(i => {
      if (typeof i.raws.before !== 'undefined') {
        value = i.raws.before

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  rawBeforeComment(root, node) {
    let value
    root.walkComments(i => {
      if (typeof i.raws.before !== 'undefined') {
        value = i.raws.before

• Read up
  Read up

Identical blocks of code found in 2 locations. Consider refactoring.

Open

    if (/^\s*$/.test(text)) {
      node.text = ''
      node.raws.left = text
      node.raws.right = ''
    } else {

• Read up
  Read up

Identical blocks of code found in 2 locations. Consider refactoring.

Open

    if (/^\s*$/.test(text)) {
      node.text = ''
      node.raws.left = text
      node.raws.right = ''
    } else {

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

Buffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {
  offset = offset >>> 0
  if (!noAssert) checkOffset(offset, 4, this.length)

  return ((this[offset]) |

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

Buffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {
  offset = offset >>> 0
  if (!noAssert) checkOffset(offset, 4, this.length)

  return (this[offset]) |

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

Buffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {
  value = +value
  offset = offset >>> 0
  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)
  this[offset] = (value & 0xff)

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

Buffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {
  value = +value
  offset = offset >>> 0
  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)
  this[offset] = (value >>> 8)

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

Buffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {
  value = +value
  offset = offset >>> 0
  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)
  this[offset] = (value & 0xff)

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

Buffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {
  value = +value
  offset = offset >>> 0
  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)
  this[offset] = (value >>> 8)

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

      if (typeof end.offset === 'number') {
        let pos = this.fromOffset(end.offset)
        endLine = pos.line
        endColumn = pos.col
      } else {

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

      if (typeof start.offset === 'number') {
        let pos = this.fromOffset(start.offset)
        line = pos.line
        column = pos.col
      } else {

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  while (++i < byteLength && (mul *= 0x100)) {
    if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {
      sub = 1
    }
    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  while (--i >= 0 && (mul *= 0x100)) {
    if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {
      sub = 1
    }
    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  then(onFulfilled, onRejected) {
    if (process.env.NODE_ENV !== 'production') {
      if (!('from' in this._opts)) {
        warnOnce(
          'Without `from` option PostCSS could generate wrong source map ' +

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  then(onFulfilled, onRejected) {
    if (process.env.NODE_ENV !== 'production') {
      if (!('from' in this.opts)) {
        warnOnce(
          'Without `from` option PostCSS could generate wrong source map ' +

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

function writeFloat (buf, value, offset, littleEndian, noAssert) {
  value = +value
  offset = offset >>> 0
  if (!noAssert) {
    checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

function writeDouble (buf, value, offset, littleEndian, noAssert) {
  value = +value
  offset = offset >>> 0
  if (!noAssert) {
    checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

      if (i.nodes && (i.parent !== root || root.first !== i)) {
        if (typeof i.raws.before !== 'undefined') {
          value = i.raws.before
          if (value.includes('\n')) {
            value = value.replace(/[^\n]+$/, '')

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

      if (i.nodes && i.nodes.length > 0) {
        if (typeof i.raws.after !== 'undefined') {
          value = i.raws.after
          if (value.includes('\n')) {
            value = value.replace(/[^\n]+$/, '')

• Read up
  Read up

Similar blocks of code found in 4 locations. Consider refactoring.

Open

Buffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {
  offset = offset >>> 0
  if (!noAssert) checkOffset(offset, 4, this.length)
  return ieee754.read(this, offset, true, 23, 4)
}

• Read up
  Read up

Similar blocks of code found in 4 locations. Consider refactoring.

Open

Buffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {
  offset = offset >>> 0
  if (!noAssert) checkOffset(offset, 8, this.length)
  return ieee754.read(this, offset, true, 52, 8)
}

• Read up
  Read up

Similar blocks of code found in 4 locations. Consider refactoring.

Open

Buffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {
  offset = offset >>> 0
  if (!noAssert) checkOffset(offset, 8, this.length)
  return ieee754.read(this, offset, false, 52, 8)
}

• Read up
  Read up

Similar blocks of code found in 4 locations. Consider refactoring.

Open

Buffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {
  offset = offset >>> 0
  if (!noAssert) checkOffset(offset, 4, this.length)
  return ieee754.read(this, offset, false, 23, 4)
}

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    for (let id in this.indexes) {
      index = this.indexes[id]
      if (existIndex < index) {
        this.indexes[id] = index + nodes.length
      }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    for (let id in this.indexes) {
      index = this.indexes[id]
      if (existIndex <= index) {
        this.indexes[id] = index + nodes.length
      }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

      (revLookup[b64.charCodeAt(i)] << 10) |
      (revLookup[b64.charCodeAt(i + 1)] << 4) |
      (revLookup[b64.charCodeAt(i + 2)] >> 2)

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

      (revLookup[b64.charCodeAt(i)] << 18) |
      (revLookup[b64.charCodeAt(i + 1)] << 12) |
      (revLookup[b64.charCodeAt(i + 2)] << 6) |

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  next() {
    if (!this.parent) return undefined
    let index = this.parent.index(this)
    return this.parent.nodes[index + 1]
  }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  prev() {
    if (!this.parent) return undefined
    let index = this.parent.index(this)
    return this.parent.nodes[index - 1]
  }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

Object.defineProperty(Buffer.prototype, 'parent', {
  enumerable: true,
  get: function () {
    if (!Buffer.isBuffer(this)) return undefined
    return this.buffer

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

Object.defineProperty(Buffer.prototype, 'offset', {
  enumerable: true,
  get: function () {
    if (!Buffer.isBuffer(this)) return undefined
    return this.byteOffset

• Read up
  Read up

Identical blocks of code found in 3 locations. Consider refactoring.

Open

    if (this.current.nodes && this.current.nodes.length) {
      this.current.raws.semicolon = this.semicolon
    }

• Read up
  Read up

Identical blocks of code found in 3 locations. Consider refactoring.

Open

    if (this.current.nodes && this.current.nodes.length) {
      this.current.raws.semicolon = this.semicolon
    }

• Read up
  Read up

Identical blocks of code found in 3 locations. Consider refactoring.

Open

    if (this.current.nodes && this.current.nodes.length) {
      this.current.raws.semicolon = this.semicolon
    }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  unnamedAtrule(node, token) {
    throw this.input.error(
      'At-rule without name',
      { offset: token[2] },
      { offset: token[2] + token[1].length }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  doubleColon(token) {
    throw this.input.error(
      'Double colon',
      { offset: token[2] },
      { offset: token[2] + token[1].length }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  if (start < 0) {
    start += len
    if (start < 0) start = 0
  } else if (start > len) {
    start = len

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  if (end < 0) {
    end += len
    if (end < 0) end = 0
  } else if (end > len) {
    end = len

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  if (!noAssert) {
    var limit = Math.pow(2, (8 * byteLength) - 1)

    checkInt(this, value, offset, byteLength, limit - 1, -limit)
  }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  if (!noAssert) {
    var limit = Math.pow(2, (8 * byteLength) - 1)

    checkInt(this, value, offset, byteLength, limit - 1, -limit)
  }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    if (baseCharsetUri.test(text) || baseUri.test(text)) {
      return fromBase64(text.substr(RegExp.lastMatch.length))
    }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  unclosedBracket(bracket) {
    throw this.input.error(
      'Unclosed bracket',
      { offset: bracket[2] },
      { offset: bracket[2] + 1 }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    if (charsetUri.test(text) || uri.test(text)) {
      return decodeURIComponent(text.substr(RegExp.lastMatch.length))
    }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  unexpectedClose(token) {
    throw this.input.error(
      'Unexpected }',
      { offset: token[2] },
      { offset: token[2] + 1 }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  append(...children) {
    if (!this.proxyOf.nodes) this.nodes = []
    return super.append(...children)
  }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  prepend(...children) {
    if (!this.proxyOf.nodes) this.nodes = []
    return super.prepend(...children)
  }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  constructor(defaults) {
    super(defaults)
    this.type = 'root'
    if (!this.nodes) this.nodes = []
  }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

        if (RE_AT_END.lastIndex === 0) {
          next = css.length - 1
        } else {
          next = RE_AT_END.lastIndex - 2
        }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  constructor(defaults) {
    super(defaults)
    this.type = 'rule'
    if (!this.nodes) this.nodes = []
  }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

          if (RE_WORD_END.lastIndex === 0) {
            next = css.length - 1
          } else {
            next = RE_WORD_END.lastIndex - 2
          }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  cloneBefore(overrides = {}) {
    let cloned = this.clone(overrides)
    this.parent.insertBefore(this, cloned)
    return cloned
  }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  cloneAfter(overrides = {}) {
    let cloned = this.clone(overrides)
    this.parent.insertAfter(this, cloned)
    return cloned
  }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  for (var i = 0; i < len; ++i) {
    if (thisCopy[i] !== targetCopy[i]) {
      x = thisCopy[i]
      y = targetCopy[i]
      break

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  for (var i = 0, len = Math.min(x, y); i < len; ++i) {
    if (a[i] !== b[i]) {
      x = a[i]
      y = b[i]
      break

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}

• Read up
  Read up

Identical blocks of code found in 2 locations. Consider refactoring.

Open

  if (!noAssert) {
    var maxBytes = Math.pow(2, 8 * byteLength) - 1
    checkInt(this, value, offset, byteLength, maxBytes, 0)
  }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}

• Read up
  Read up

Identical blocks of code found in 2 locations. Consider refactoring.

Open

  if (!noAssert) {
    var maxBytes = Math.pow(2, 8 * byteLength) - 1
    checkInt(this, value, offset, byteLength, maxBytes, 0)
  }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}

• Read up
  Read up