zoukankan      html  css  js  c++  java
  • 文本中允许指定的信息输入,兼容多种浏览器

    与许输入整数

    function AllowInputNumberNew(e) {
    var key = window.event ? e.keyCode : e.which;
    //8--backspace, 0--delete
    if (key == 8 || key == 0) {
    e.returnValue = true;
    return true;
    }
    else {
    var keychar = String.fromCharCode(key);
    reg = /\d/;
    var flag = reg.test(keychar);
    e.returnValue = flag;
    return flag;
    }
    }

    允许输入float

    function AllowInputFloatNew(e) {
    var key = window.event ? e.keyCode : e.which;
    //8--backspace, 0--delete, 46--.
    if (key == 8 || key == 0 || key == 46) {
    e.returnValue = true;
    return true;
    }
    else {
    var keychar = String.fromCharCode(key);
    reg = /\d/;
    var flag = reg.test(keychar);
    e.returnValue = flag;
    return flag;
    }
    }

    允许输入指定字符

    function AllowInputChar(e) {
    var key = window.event ? e.keyCode : e.which;
    if (key == 8 || key == 0 || key == 46 || key == 32 || (key >= 48 && key <= 57)) {
    e.returnValue = true;
    return true;
    }
    else {
    var keychar = String.fromCharCode(key);
    if (keychar == "." || keychar == "_" || keychar == "-" || keychar == "," || keychar == "(" || keychar == ")") {
    return true;
    } else {
    reg = /^\w*[a-z]+\w*$/i;
    var flag = reg.test(keychar);
    e.returnValue = flag;
    return flag;
    }
    }
    }

    不允许输入任何数据

    function NotAllowInputAny(e) {
    var key = window.event ? e.keyCode : e.which;
    if (key == 8 || key == 0) {
    e.returnValue = false;
    return false;
    }
    else {
    e.returnValue = false;
    return false;
    }
    }

    Kyle

  • 相关阅读:
    清北学堂2019NOIP提高储备营DAY1
    最小生成树--克鲁斯卡尔算法(Kruskal)
    关于队列(还有广度优先搜索的例题)
    染色问题
    行列式的相关知识
    素数筛法
    中国剩余定理(孙子定理)
    AOJ 9.University
    AOJ 8.童年生活二三事
    AOJ 7.Redraiment猜想
  • 原文地址:https://www.cnblogs.com/lovewife/p/2467714.html
Copyright © 2011-2022 走看看