zoukankan      html  css  js  c++  java
  • c:forEach实现动态select标签

    c:forEach实现动态select标签

    <c:forEach>标签是更加通用的标签,因为它迭代一个集合中的对象。

    <c:forTokens>标签通过指定分隔符将字符串分隔为一个数组然后迭代它们。

    • JavaBean

      public class SelectData {
      	private String	key;	// 键
      	private String	value;	// 值
      							
      	public SelectData(String key, String value) {
      		super();
      		this.key = key;
      		this.value = value;
      	}
      	
      	public String getKey() {
      		return key;
      	}
      	
      	public void setKey(String key) {
      		this.key = key;
      	}
      	
      	public String getValue() {
      		return value;
      	}
      	
      	public void setValue(String value) {
      		this.value = value;
      	}
      	
      }
      
    • Servlet

      public class ServletDemo3 extends HttpServlet {
      
          @Override
          protected void doGet(HttpServletRequest req, HttpServletResponse resp)
                  throws ServletException, IOException {
            List<SelectData> list = new ArrayList<SelectData>();
      		proList.add(new SelectData("1", "北京"));
      		proList.add(new SelectData("2", "上海"));
      		proList.add(new SelectData("3", "广州"));
      		proList.add(new SelectData("4", "深圳"));
      		proList.add(new SelectData("5", "河北"));
      		proList.add(new SelectData("6", "河南"));
      		proList.add(new SelectData("7", "山西"));
      		proList.add(new SelectData("8", "山东"));
      		proList.add(new SelectData("9", "江苏"));
      		proList.add(new SelectData("10", "浙江"));
              req.setAttribute("proList",proList);
          }
      
          @Override
          protected void doPost(HttpServletRequest req, HttpServletResponse resp)
                  throws ServletException, IOException {
              doGet(req,resp);
          }
      
      }
      
    • 前端核心代码

    <select name="sel_Province">
        <c:forEach items="${proList}" var="user" varStatus="status">
                <option value="${user.key}">${list.value}</option>
        </c:forEach>
    </select>
    
  • 相关阅读:
    (离线算法 LCA) hdu 2874
    (树形DP) hdu 4118
    (树的重心) poj 1655
    (线性基) bzoj 2115
    (线性基) bzoj 2460
    (边双联通+树直径) hdu 4612
    (拓扑图+DP) poj 3249
    (求割点和除去割点后的联通块数目) poj 1523
    (边双联通) poj 3352
    (DP求最长路) hdu 4607
  • 原文地址:https://www.cnblogs.com/cuianbing/p/14479166.html
Copyright © 2011-2022 走看看