常见工具类函数

---

时间格式类

dayFormatUTC

export const c = (time) => {
return dayjs.utc(time).format('MMM-DD-YYYY h:mm:ss A +[UTC]')
}

timeAgoFormat

export function timeAgoFormat(cellValue) {
const timeNow = new Date().getTime()
const compare = timeNow - cellValue
if (!cellValue) {
  return '--'
}
if (compare < 0) {
  return '0 secs ago'
}
if (compare < 1000 * 60) {
  const secs = Math.floor(compare / 1000)
  return `${secs} ${secs <= 1 ? 'sec' : 'secs'} ago`
}
if (compare < 1000 * 60 * 60) {
  const minutes = Math.floor(compare / (1000 * 60))
  return `${minutes} ${minutes <= 1 ? 'min' : 'mins'} ago`
}
if (compare < 1000 * 60 * 60 * 24) {
  const hours = Math.floor(compare / (1000 * 60 * 60))
  const minutes = Math.floor((compare % (1000 * 60 * 60)) / (1000 * 60))
  return minutes === 0 ? `${hours} ${hours <= 1 ? 'hr' : 'hrs'} ago` : `${hours} ${hours <= 1 ? 'hr' : 'hrs'} ${minutes} ${minutes <= 1 ? 'min' : 'mins'} ago`
}
return dayjs.utc(cellValue).format('YYYY-MM-DD HH:mm:ss')
}

customFormatUTC

 export const customFormatUTC = (time) => {
const now = Date.now()
const diffMilliseconds = now - time

const seconds = Math.floor(diffMilliseconds / 1000)
const minutes = Math.floor(seconds / 60)
const hours = Math.floor(minutes / 60)
const days = Math.floor(hours / 24)

if (days > 0) {
  return `${days} ${days <= 1 ? 'day' : 'days'} ${hours % 24} ${hours % 24 <= 1 ? 'hr' : 'hrs'} ago`
} else if (hours > 0) {
  const remainingMinutes = minutes % 60
  return remainingMinutes === 0 ? `${hours} ${hours <= 1 ? 'hr' : 'hrs'} ago` : `${hours} ${hours <= 1 ? 'hr' : 'hrs'} ${remainingMinutes} ${remainingMinutes <= 1 ? 'min' : 'mins'} ago`
} else if (minutes > 0) {
  return `${minutes} ${minutes <= 1 ? 'min' : 'mins'} ago`
} else {
  return `${seconds} ${seconds <= 1 ? 'sec' : 'secs'} ago`
}
}

package

import dayjs from 'dayjs'
import utc from 'dayjs/plugin/utc'

dayjs.extend(utc)

Live Editor

function Example(props) { function getSubStr(address, before, after) { return address ? address.slice(0, before) + '...' + address.slice(address.length - after, address.length) : '' } const test = getSubStr('0xf4168ADb9f13e12FE68Bd64cC7cb2EE10B2D8e8C', 4, 4) return ( <span>{test}</span> ); }

function Example(props) {

  function getSubStr(address, before, after) {
    return address
      ? address.slice(0, before) + '...' + address.slice(address.length - after, address.length)
      : ''
  }

  const test = getSubStr('0xf4168ADb9f13e12FE68Bd64cC7cb2EE10B2D8e8C', 4, 4)

  return (
    <span>{test}</span>
  );
}

Result

Loading...

Live Editor

function Example(props) { /* * 3333.1234567 -> 3,333.123456 */ function paddingNum(num, amount = 6) { const defaultPadding = amount === 6 ? '0 .000000' : '0 .000000000000000000' if (!num || num === '0') return defaultPadding const str = typeof num === 'number' ? num.toString() : num if (str.length <= 2) { return str + ' .' + (amount === 6 ? '000000' : '000000000000000000') } let [integer, floater,] = str.includes('.') ? str.split('.') : [str, '',]; const count = Math.floor(integer.length / 3) for (let i = 0; i < count; i++) { integer = integer.replace(/(\d)(?=(\d{3})+$)/, '$1,') } floater = floater.substring(0, amount).padEnd(amount, '0') return `${integer} .${floater}` } const test = paddingNum('1000001.98888') return ( <span>{test}</span> ); }

function Example(props) {

  /*
  * 3333.1234567 -> 3,333.123456
  */
  function paddingNum(num, amount = 6) {
    const defaultPadding = amount === 6 ? '0 .000000' : '0 .000000000000000000'

    if (!num || num === '0') return defaultPadding

    const str = typeof num === 'number' ? num.toString() : num

    if (str.length <= 2) {
      return str + ' .' + (amount === 6 ? '000000' : '000000000000000000')
    }

    let [integer, floater,] = str.includes('.') ? str.split('.') : [str, '',];

    const count = Math.floor(integer.length / 3)
    for (let i = 0; i < count; i++) {
      integer = integer.replace(/(\d)(?=(\d{3})+$)/, '$1,')
    }

    floater = floater.substring(0, amount).padEnd(amount, '0')

    return `${integer} .${floater}`
  }

  const test = paddingNum('1000001.98888')

  return (
    <span>{test}</span>
  );
}

Result

Loading...

/**
 * 等待指定的毫秒数后 resolve 的函数
 * @param ms 要等待的毫秒数
 * @returns 返回一个 Promise，在指定的毫秒数后 resolve
 */
export function sleep(ms: number): Promise<void> {
  return new Promise((resolve) => setTimeout(resolve, ms));
}

Live Editor

/** * 寻找两个字符串中公共最长的子串 */ function Example(props) { function findLongestCommonSubstring(str1, str2) { const len1 = str1.length; const len2 = str2.length; let maxLength = 0; let endIndex = 0; // 创建一个二维数组，初始化为0 const dp = Array.from({length: len1 + 1}, () => Array(len2 + 1).fill(0)); console.log(dp); // 填充 dp 表 for (let i = 1; i <= len1; i++) { for (let j = 1; j <= len2; j++) { if (str1[i - 1] === str2[j - 1]) { dp[i][j] = dp[i - 1][j - 1] + 1; if (dp[i][j] > maxLength) { maxLength = dp[i][j]; endIndex = i; // 记录最长子串的结尾索引 } } } } // 根据最长子串的长度和结尾索引，截取子串 return str1.substring(endIndex - maxLength, endIndex); } const str1 = "1222234444445"; const str2 = "6222854445"; const longestCommonSubstring = findLongestCommonSubstring(str1, str2); return ( <span>{longestCommonSubstring}</span> ); }

/**
 * 寻找两个字符串中公共最长的子串
 */

function Example(props) {

  function findLongestCommonSubstring(str1, str2) {
    const len1 = str1.length;
    const len2 = str2.length;
    let maxLength = 0;
    let endIndex = 0;

    // 创建一个二维数组，初始化为0
    const dp = Array.from({length: len1 + 1}, () => Array(len2 + 1).fill(0));
    console.log(dp);
    // 填充 dp 表
    for (let i = 1; i <= len1; i++) {
      for (let j = 1; j <= len2; j++) {
        if (str1[i - 1] === str2[j - 1]) {
          dp[i][j] = dp[i - 1][j - 1] + 1;
          if (dp[i][j] > maxLength) {
            maxLength = dp[i][j];
            endIndex = i;  // 记录最长子串的结尾索引
          }
        }
      }
    }

    // 根据最长子串的长度和结尾索引，截取子串
    return str1.substring(endIndex - maxLength, endIndex);
  }

  const str1 = "1222234444445";
  const str2 = "6222854445";
  const longestCommonSubstring = findLongestCommonSubstring(str1, str2);

  return (
    <span>{longestCommonSubstring}</span>
  );
}

Result

Loading...