zoukankan      html  css  js  c++  java
  • 省市级联

    <script src="http://www.cnblogs.com/JS/jquery-ui-1.8.5.SouthStreet/js/jquery-1.4.2.min.js"type="text/javascript"></script>

    <script type="text/javascript">

      function changeshen(shen) {
                document.getElementById("drpshi").length = 0;
                $.getJSON("http://www.cnblogs.com/ashx/area.ashx?shen=" + shen, { "resultType": "json" }, function(data) {
                    alert(data);
                    if (data != null) {
                        var data = data.data;
                        for (var i = 0; i < data.length; i++) {
                            document.getElementById("drpshi").options.add(new Option(data[i].Name, data[i].Code));
                        }
                    }
                });
            }
        </script>

    protected void Page_Load(object sender, EventArgs e)
            {

        if (!IsPostBack)
                {
                    shenbind();
                    shibind(this.drpshen.SelectedValue.ToString());
                }
                           
            }

     protected void shenbind()
            {
                IMDMSP.BLL.AreaManage bll = new AreaManage();
                IList<Area> list = bll.getshen();
                foreach (Area area in list)
                {
                    drpshen.Items.Add(new ListItem(area.Name, area.Code));
                }
            }
            protected void shibind(string shencode)
            {
                IMDMSP.BLL.AreaManage bll = new AreaManage();
                IList<Area> list = bll.getshi(shencode);
                foreach (Area area in list)
                {
                    drpshi.Items.Add(new ListItem(area.Name, area.Code));
                }
            }
            protected void drpshen_SelectedIndexChanged(object sender, EventArgs e)
            {
                drpshi.Items.Clear();
                shibind(this.drpshen.SelectedValue.ToString());
            }

  • 相关阅读:
    条款33:避免遮掩继承而来的名称
    LeetCode OJ:Combinations (排列组合)
    LeetCode OJ:Delete Node in a Linked List(链表节点删除)
    LeetCode OJ:Contains Duplicate III(是否包含重复)
    LeetCode OJ:Contains DuplicateII(是否包含重复II)
    luogu 1004 方格取数
    平衡树之伸展树(Splay Tree)题目整理
    P2472 [SCOI2007]蜥蜴(网络最大流)
    P1349 广义斐波那契数列(矩阵加速)
    P4113 [HEOI2012]采花 (莫队TLE)
  • 原文地址:https://www.cnblogs.com/whlhaikuotiankong/p/1969893.html
Copyright © 2011-2022 走看看