CS-Tao/GTD-Visualization

File `index.js` has 311 lines of code (exceeds 250 allowed). Consider refactoring.
/**
 * Created by jiachenpan on 16/11/18.
 */
 
Function `parseTime` has a Cognitive Complexity of 12 (exceeds 5 allowed). Consider refactoring.
Function `parseTime` has 29 lines of code (exceeds 25 allowed). Consider refactoring.
export function parseTime (time, cFormat) {
  if (arguments.length === 0) {
    return null
  }
  const format = cFormat || '{y}-{m}-{d} {h}:{i}:{s}'
  let date
  if (typeof time === 'object') {
    date = time
  } else {
    if (('' + time).length === 10) time = parseInt(time) * 1000
    date = new Date(time)
  }
  const formatObj = {
    y: date.getFullYear(),
    m: date.getMonth() + 1,
    d: date.getDate(),
    h: date.getHours(),
    i: date.getMinutes(),
    s: date.getSeconds(),
    a: date.getDay()
  }
  const timeStr = format.replace(/{(y|m|d|h|i|s|a)+}/g, (result, key) => {
    let value = formatObj[key]
    if (key === 'a') return ['一', '二', '三', '四', '五', '六', '日'][value - 1]
    if (result.length > 0 && value < 10) {
      value = '0' + value
    }
    return value || 0
  })
  return timeStr
}
 
Function `formatTime` has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.
export function formatTime (time, option) {
  time = +time * 1000
  const d = new Date(time)
  const now = Date.now()
 
  const diff = (now - d) / 1000
 
  if (diff < 30) {
    return '刚刚'
  } else if (diff < 3600) { // less 1 hour
    return Math.ceil(diff / 60) + '分钟前'
  } else if (diff < 3600 * 24) {
    return Math.ceil(diff / 3600) + '小时前'
  } else if (diff < 3600 * 24 * 2) {
    return '1天前'
  }
  if (option) {
Avoid too many `return` statements within this function.
    return parseTime(time, option)
  } else {
Avoid too many `return` statements within this function.
    return d.getMonth() + 1 + '月' + d.getDate() + '日' + d.getHours() + '时' + d.getMinutes() + '分'
  }
}
 
// 格式化时间
export function getQueryObject (url) {
  url = url == null ? window.location.href : url
  const search = url.substring(url.lastIndexOf('?') + 1)
  const obj = {}
  const reg = /([^?&=]+)=([^?&=]*)/g
  search.replace(reg, (rs, $1, $2) => {
    const name = decodeURIComponent($1)
    let val = decodeURIComponent($2)
    val = String(val)
    obj[name] = val
    return rs
  })
  return obj
}
 
export function isLeapYear (year) {
  return (year % 4 === 0) && (year % 100 !== 0 || year % 400 === 0)
}
 
function sumArraySpecifyCount (numArray, count) {
  if (numArray.length < count) { return -1 }
  var sum = 0
  for (var i = 0; i < count; i++) {
    sum += numArray[i]
  }
  return sum
}
 
Function `getDateByDaysInYear` has 69 lines of code (exceeds 25 allowed). Consider refactoring.
Function `getDateByDaysInYear` has a Cognitive Complexity of 13 (exceeds 5 allowed). Consider refactoring.
export function getDateByDaysInYear (daysInYear, year) {
  var month = 0
  var day = 0
  const FEB = isLeapYear(year) ? 29 : 28
  const monthArray = [
    31,
    FEB,
    31,
    30,
    31,
    30,
    31,
    31,
    30,
    31,
    30,
    31
  ]
  const monthSumArray = [
    sumArraySpecifyCount(monthArray, 1),
    sumArraySpecifyCount(monthArray, 2),
    sumArraySpecifyCount(monthArray, 3),
    sumArraySpecifyCount(monthArray, 4),
    sumArraySpecifyCount(monthArray, 5),
    sumArraySpecifyCount(monthArray, 6),
    sumArraySpecifyCount(monthArray, 7),
    sumArraySpecifyCount(monthArray, 8),
    sumArraySpecifyCount(monthArray, 9),
    sumArraySpecifyCount(monthArray, 10),
    sumArraySpecifyCount(monthArray, 11),
    sumArraySpecifyCount(monthArray, 12)
  ]
  if (daysInYear <= monthSumArray[0]) {
    month = 1
    day = daysInYear
  } else if (daysInYear <= monthSumArray[1]) {
    month = 2
    day = daysInYear - monthSumArray[0]
  } else if (daysInYear <= monthSumArray[2]) {
    month = 3
    day = daysInYear - monthSumArray[1]
  } else if (daysInYear <= monthSumArray[3]) {
    month = 4
    day = daysInYear - monthSumArray[2]
  } else if (daysInYear <= monthSumArray[4]) {
    month = 5
    day = daysInYear - monthSumArray[3]
  } else if (daysInYear <= monthSumArray[5]) {
    month = 6
    day = daysInYear - monthSumArray[4]
  } else if (daysInYear <= monthSumArray[6]) {
    month = 7
    day = daysInYear - monthSumArray[5]
  } else if (daysInYear <= monthSumArray[7]) {
    month = 8
    day = daysInYear - monthSumArray[6]
  } else if (daysInYear <= monthSumArray[8]) {
    month = 9
    day = daysInYear - monthSumArray[7]
  } else if (daysInYear <= monthSumArray[9]) {
    month = 10
    day = daysInYear - monthSumArray[8]
  } else if (daysInYear <= monthSumArray[10]) {
    month = 11
    day = daysInYear - monthSumArray[9]
  } else {
    month = 12
    day = daysInYear - monthSumArray[10]
  }
  return new Date(year, month - 1, day)
}
 
/**
 *get getByteLen
 * @param {Sting} val input value
 * @returns {number} output value
 */
export function getByteLen (val) {
  let len = 0
  for (let i = 0; i < val.length; i++) {
    if (val[i].match(/[^\x00-\xff]/ig) != null) { // eslint-disable-line
      len += 1
    } else { len += 0.5 }
  }
  return Math.floor(len)
}
 
export function cleanArray (actual) {
  const newArray = []
  for (let i = 0; i < actual.length; i++) {
    if (actual[i]) {
      newArray.push(actual[i])
    }
  }
  return newArray
}
 
export function param (json) {
  if (!json) return ''
  return cleanArray(Object.keys(json).map(key => {
    if (json[key] === undefined) return ''
    return encodeURIComponent(key) + '=' +
            encodeURIComponent(json[key])
  })).join('&')
}
 
export function param2Obj (url) {
  const search = url.split('?')[1]
  if (!search) {
    return {}
  }
  return JSON.parse('{"' + decodeURIComponent(search).replace(/"/g, '\\"').replace(/&/g, '","').replace(/=/g, '":"') + '"}')
}
 
export function html2Text (val) {
  const div = document.createElement('div')
  div.innerHTML = val
  return div.textContent || div.innerText
}
 
Function `objectMerge` has a Cognitive Complexity of 9 (exceeds 5 allowed). Consider refactoring.
export function objectMerge (target, source) {
  /* Merges two  objects,
     giving the last one precedence */
 
  if (typeof target !== 'object') {
    target = {}
  }
  if (Array.isArray(source)) {
    return source.slice()
  }
  for (const property in source) {
    if (source.hasOwnProperty(property)) {
      const sourceProperty = source[property]
      if (typeof sourceProperty === 'object') {
        target[property] = objectMerge(target[property], sourceProperty)
        continue
      }
      target[property] = sourceProperty
    }
  }
  return target
}
 
export function scrollTo (element, to, duration) {
  if (duration <= 0) return
  const difference = to - element.scrollTop
  const perTick = difference / duration * 10
  setTimeout(() => {
    element.scrollTop = element.scrollTop + perTick
    if (element.scrollTop === to) return
    scrollTo(element, to, duration - 10)
  }, 10)
}
 
export function toggleClass (element, className) {
  if (!element || !className) {
    return
  }
  let classString = element.className
  const nameIndex = classString.indexOf(className)
  if (nameIndex === -1) {
    classString += '' + className
  } else {
    classString = classString.substr(0, nameIndex) + classString.substr(nameIndex + className.length)
  }
  element.className = classString
}
 
export const pickerOptions = [
  {
    text: '今天',
    onClick (picker) {
      const end = new Date()
      const start = new Date(new Date().toDateString())
      end.setTime(start.getTime())
      picker.$emit('pick', [start, end])
    }
Similar blocks of code found in 3 locations. Consider refactoring.
  }, {
    text: '最近一周',
    onClick (picker) {
      const end = new Date(new Date().toDateString())
      const start = new Date()
      start.setTime(end.getTime() - 3600 * 1000 * 24 * 7)
      picker.$emit('pick', [start, end])
    }
Similar blocks of code found in 3 locations. Consider refactoring.
  }, {
    text: '最近一个月',
    onClick (picker) {
      const end = new Date(new Date().toDateString())
      const start = new Date()
      start.setTime(start.getTime() - 3600 * 1000 * 24 * 30)
      picker.$emit('pick', [start, end])
    }
Similar blocks of code found in 3 locations. Consider refactoring.
  }, {
    text: '最近三个月',
    onClick (picker) {
      const end = new Date(new Date().toDateString())
      const start = new Date()
      start.setTime(start.getTime() - 3600 * 1000 * 24 * 90)
      picker.$emit('pick', [start, end])
    }
  }]
 
export function getTime (type) {
  if (type === 'start') {
    return new Date().getTime() - 3600 * 1000 * 24 * 90
  } else {
    return new Date(new Date().toDateString())
  }
}
 
Function `debounce` has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.
export function debounce (func, wait, immediate) {
  let timeout, args, context, timestamp, result
 
  const later = function () {
    // 据上一次触发时间间隔
    const last = +new Date() - timestamp
 
    // 上次被包装函数被调用时间间隔last小于设定时间间隔wait
    if (last < wait && last > 0) {
      timeout = setTimeout(later, wait - last)
    } else {
      timeout = null
      // 如果设定为immediate===true，因为开始边界已经调用过了此处无需调用
      if (!immediate) {
        result = func.apply(context, args)
        if (!timeout) context = args = null
      }
    }
  }
 
  return function (...args) {
    context = this
    timestamp = +new Date()
    const callNow = immediate && !timeout
    // 如果延时不存在，重新设定延时
    if (!timeout) timeout = setTimeout(later, wait)
    if (callNow) {
      result = func.apply(context, args)
      context = args = null
    }
 
    return result
  }
}
 
Function `deepClone` has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.
export function deepClone (source) {
  if (!source && typeof source !== 'object') {
    throw new Error('error arguments', 'shallowClone')
  }
  const targetObj = source.constructor === Array ? [] : {}
  for (const keys in source) {
    if (source.hasOwnProperty(keys)) {
      if (source[keys] && typeof source[keys] === 'object') {
        targetObj[keys] = source[keys].constructor === Array ? [] : {}
        targetObj[keys] = deepClone(source[keys])
      } else {
        targetObj[keys] = source[keys]
      }
    }
  }
  return targetObj
}