zoukankan      html  css  js  c++  java
  • js 原生: 身份证脱敏、唯一随机字符串uuid、对于高 index 元素的隐藏与显示

    1. 对于高 index 元素的隐藏 与 显示

    • export const hideIndexEle = (cssStr)=>{
        const player = getElementsByCss(cssStr)[0]
        if(player){
          player.style.position = 'relative'
          player.style.top = '9999px'
          player.style.marginTop = '9999px'
        }
      }
      
      export const showIndexEle = (cssStr)=>{
        const player = getElementsByCss(cssStr)[0]
        if(player){
          player.style.marginTop = '0'
          player.style.top = '0'
        }
      }

    2. 唯一字符串     (参考: https://blog.csdn.net/w405722907/article/details/74375266

    • export const kjfUUID = (len, radix)=>{
        let chars = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz'.split('');
        let uuid = [], i;
        radix = radix || chars.length;
        
        if (len) {
          // Compact form
          for (i = 0; i < len; i++) uuid[i] = chars[0 | Math.random()*radix];
        } else {
          // rfc4122, version 4 form
          let r;
          
          // rfc4122 requires these characters
          uuid[8] = uuid[13] = uuid[18] = uuid[23] = '-';
          uuid[14] = '4';
          
          // Fill in random data.  At i==19 set the high bits of clock sequence as
          // per rfc4122, sec. 4.1.5
          for (i = 0; i < 36; i++) {
            if (!uuid[i]) {
              r = 0 | Math.random()*16;
              uuid[i] = chars[(i === 19) ? (r & 0x3) | 0x8 : r];
            }
          }
        }
        
        return uuid.join('');
      }

    3. 对身份证的月日进行 脱敏

    • export const kjfSafeId = (idStr)=>{
        let charArr = idStr.split("")
        let result = charArr.reduce((arr, next, index)=>{
          (index>9&&index<14)?arr.push("*"):arr.push(next)
          return arr
        }, [])
        return result.join("")
      }

     

    --------小尾巴 ________一个人欣赏-最后一朵颜色的消逝-忠诚于我的是·一颗叫做野的心.决不受人奴役.怒火中生的那一刻·终将结束...
  • 相关阅读:
    BUPT复试专题—最小距离查询(2013)
    BUPT复试专题—中序遍历序列(2013)
    BUPT复试专题—统计节点个数(2013)
    BUPT复试专题—日期(2013)
    BUPT复试专题—内存分配(2014-2)
    BUPT复试专题—图像识别(2014-2)
    Catch That Cow(BFS)
    Pet(hdu 4707 BFS)
    Knight Moves(BFS,走’日‘字)
    Lost Cows(BIT poj2182)
  • 原文地址:https://www.cnblogs.com/tianxiaxuange/p/10768325.html
Copyright © 2011-2022 走看看