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>
    
  • 相关阅读:
    51nod 1087 1 10 100 1000(找规律+递推+stl)
    51nod 1082 与7无关的数 (打表预处理)
    51 nod 1080 两个数的平方和
    1015 水仙花数(水题)
    51 nod 1003 阶乘后面0的数量
    51nod 1002 数塔取数问题
    51 nod 1001 数组中和等于K的数对
    51 nod 1081 子段求和
    51nod 1134 最长递增子序列 (O(nlogn)算法)
    51nod 1174 区间中最大的数(RMQ)
  • 原文地址:https://www.cnblogs.com/cuianbing/p/14479166.html
Copyright © 2011-2022 走看看