zoukankan      html  css  js  c++  java
  • javascript-工具函数

    /**
     * 解析日期
     * @param {(Object|string|number)} time
     * @param {string} cFormat
     * @returns {string | null}
     */
    export function parseTime(time, cFormat) {
      if (arguments.length === 0 || !time) {
        return null
      }
      const format = cFormat || '{y}-{m}-{d} {h}:{i}:{s}'
      let date
      if (typeof time === 'object') {
        date = time
      } else {
        if ((typeof time === 'string')) {
          if ((/^[0-9]+$/.test(time))) {
            // support "1548221490638"
            time = parseInt(time)
          } else {
            // support safari
            // https://stackoverflow.com/questions/4310953/invalid-date-in-safari
            time = time.replace(new RegExp(/-/gm), '/')
          }
        }
    
        if ((typeof time === 'number') && (time.toString().length === 10)) {
          time = 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 time_str = format.replace(/{([ymdhisa])+}/g, (result, key) => {
        const value = formatObj[key]
        // Note: getDay() returns 0 on Sunday
        if (key === 'a') { return ['日', '一', '二', '三', '四', '五', '六'][value ] }
        return value.toString().padStart(2, '0')
      })
      return time_str
    }
    
    /**
     * 三位分节发
     * @param number
     * @returns {string}
     */
    export function formatNumber(number) {
      const numbers = number.toString().split('').reverse()
      const segs = []
    
      while (numbers.length) segs.push(numbers.splice(0, 3).join(''))
    
      return segs.join(',').split('').reverse().join('')
    }
    
    /**
     * 数字翻牌器
     * @param obj:对象
     * @param field:字段
     * @param to:结束值
     */
    export function countTo(obj, field, to) {
      const range = obj[field] - to// 范围
      let pm = 0// 1正方向、-1负方向、0
      if (range > 0) {
        pm = -1
      } else if (range < 0) {
        pm = 1
      } else {
        return
      }
      const times = 20// 翻牌次数
      const step = parseInt(range / times) || pm// 每次翻牌数
    
      const timer = setInterval(() => {
        obj[field] += step
        if ((step > 0 && obj[field] >= to) || (step < 0 && obj[field] <= to)) {
          obj[field] = to
          clearInterval(timer)
        }
      }, 30)
    }
    
  • 相关阅读:
    POJ 2991(线段树)
    UVa_1592
    紫书 -- 大整数类
    在结构体中添加成员函数/C++
    双向队列
    用埃氏筛法生成质数表
    poj 3687(拓扑排序)
    它们其实都是“图”-- 最小生成树
    最小生成树(MST, Minimum Spanning Tree)
    他们其实都是“图”--最短路
  • 原文地址:https://www.cnblogs.com/linding/p/14985547.html
Copyright © 2011-2022 走看看