zoukankan      html  css  js  c++  java
  • jquery.validationEngine+ajax验证

    利用jquery.validationEngine ajax验证后台id是否已存在

    前台jquery validation框架验证

    jsp:

    <link rel="stylesheet" type="text/css" href="<%=path%>/js/css/validationEngine.jquery.css"/>
    <script type="text/javascript" src="<%=path%>/js/jquery/jquery-1.4.2.min.js"></script>
    <script type="text/javascript" src="<%=path%>/js/validation/jquery.validationEngine-cn.js"></script>
    <script type="text/javascript" src="<%=path%>/js/validation/jquery.validationEngine.js"></script>
    
     <input  type="text" name="item.entry" id="item_entry" class="validate[required,custom[onlyNumber],ajax[ajaxItemNoCall],length[0,4]] text-input" size="10"/></td>

     

    jquery.validationEngine-cn.js

                    "ajaxItemNoCall": {
    	                "url": "validateItemNo",
    				    "alertText": "* ID已被使用",
    				    "alertTextOk": "*ID可以使用",
    				    "alertTextLoad": "* 检查中, 请稍候..."
    	            }

     

    ItemAction.java

     

    @Action(results = {@Result(type="json")}, params = { "excludeProperties", "validateReturn"}, value="validateItemNo")
    	public String validateItemNo() throws Exception{
    		ActionContext ct = ActionContext.getContext();
    		HttpServletRequest request= 
    			(HttpServletRequest)ct.get(ServletActionContext. HTTP_REQUEST ); 
    		String validateId = request.getParameter("fieldId");
    		String validateValue = request.getParameter("fieldValue");
    		int valiValue = Integer.parseInt(validateValue);
    		   
    			item = itemService.findItemById(valiValue);
    				if(item.getEntry() != valiValue){
    					validateReturn[0] = validateId;
    					validateReturn[1] = true;
    					validateReturn[2] = "可以使用";
    				}else {
    					validateReturn[0] = validateId;
    					validateReturn[1] = false;
    					validateReturn[2] = "在指定ID已经存在";
    				}
    		return "success";
    	}

    ---------------------------------------------------------------------------------------------------------------------------------
    copyright:http://www.cnblogs.com/anee/
  • 相关阅读:
    CodeForces 894C Marco and GCD Sequence|构造
    【学习笔记】KMP中的border及其应用
    NOIP2020游记
    CodeForces 1006F Xor-Paths|Meet in the middle
    Luogu P4809 [CCC 2018]最大战略储备|最小生成树
    Luogu P5304 [GXOI/GZOI2019]旅行者|最短路
    Luogu P4552 [Poetize6] IncDec Sequence|差分
    Luogu P6852 Mex|构造
    Codeforces 1292C Xenon's Attack on the Gangs|DP,贪心
    [LeetCode]7. Reverse Integer
  • 原文地址:https://www.cnblogs.com/anee/p/2675834.html
Copyright © 2011-2022 走看看