zoukankan      html  css  js  c++  java
  • JS判断Gridview

     function chkDetailValid() {
                var gv = document.getElementById("gvDetail");
                for (var i = 0; i < gv.rows.length; i++) {
                    var txtAC = gv.rows[i].cells[7].getElementsByTagName("input")[0];
                    var txtLoc = gv.rows[i].cells[8].getElementsByTagName("input")[0];
                    var txtDept = gv.rows[i].cells[9].getElementsByTagName("input")[0];
                    if (txtAC != null) {
                        if (txtAC.value == '') {
                            alert("<%=localize.lblCOA + localize.IsNotAllowNull%>"); //会计科目代码不能为空。
                            txtAC.focus();
                            return false;
                        }
                    }

                    if (txtLoc != null) {
                        if (txtLoc.value == '') {
                            alert($("#lblLocationTitle").html() + "<%=localize.IsNotAllowNull %>"); //不能为空。
                            txtLoc.focus();
                            return false;
                        }
                    }

                    if (txtDept != null) {
                        if (txtDept.value == '') {
                            alert($("#lblDeptTitle").html() + "<%=localize.IsNotAllowNull %>"); //不能为空。
                            txtDept.focus();
                            return false;
                        }
                    }
                    var vatInvoice = obj.value;
                    if (vatInvoice != '')
                        var xmlURL = "JsonData.ashx?t=IV&val=" + vatInvoice;
                    $.get(xmlURL, {}, function(result) {
                        if (result == "N") {
                            alert("<%= localize.lblVatInvoice + localize.IsExists%>"); //發票號碼已經存在。
                            obj.value = '';
                            obj.focus();
                            return false;
                        }
                    }, "text");
                }

                return true;
            }

  • 相关阅读:
    ArrayList removeRange方法分析
    LinkedHashMap源码分析(基于JDK1.6)
    LinkedList原码分析(基于JDK1.6)
    TreeMap源码分析——深入分析(基于JDK1.6)
    51NOD 2072 装箱问题 背包问题 01 背包 DP 动态规划
    51 NOD 1049 最大子段和 动态规划 模板 板子 DP
    51NOD 1006 最长公共子序列 Lcs 动态规划 DP 模板题 板子
    8月20日 训练日记
    CodeForces
    CodeForces
  • 原文地址:https://www.cnblogs.com/Chinarain/p/3914044.html
Copyright © 2011-2022 走看看