zoukankan      html  css  js  c++  java
  • idea增删改查之 删除

    单删
    {title:'操作',field:'s',formatter:function(value,row,index){
    return "<input class='btn btn-default glyphicon glyphicon-plus' type='button' onclick='delUser("+row.couId+")' value='删除'>";
    }
    },

    //单删
    function delUser(couId){
    var msg = "您真的确定要删除吗?";
    if (confirm(msg) == true) {
    $.ajax({
    url:"../ysq/deleteCoupon",
    data:{couId:couId},
    type:"post",
    success:function(){
    searchUser();
    }
    })
    }
    }

    controller
    @RequestMapping("deleteCoupon")
    @ResponseBody
    public void deleteConpon(Integer couId){

    ysqService.deleteConpon(couId);
    }

    mapper
    <delete id="deleteConpon" parameterType="int">
    delete from coupon where couId=#{couId}
    </delete>

    批删

    <div class="panel panel-default">
    <input type="button" class="btn btn-primary" onclick="delAll()" value="批量删除">
    </div>

    columns: [
    {checkbox:true},

    //批量删除
    function delAll(){
    //获取表格中所有选中的行
    var arr = $("#conpon").bootstrapTable("getSelections");
    var ids = "";
    for(var i=0;i<arr.length;i++){
    var id = arr[i].couId;
    ids+= ids=="" ? id: ","+id;
    }
    if(ids==""){
    alert("请至少选中一条数据!");
    return;
    }
    alert("是否确认删除ID为"+ids);
    $.ajax({
    url:"../ysq/deleteList",
    type:"post",
    data:{ids:ids},
    success:function(data){
    alert("删除成功");
    location.reload();
    }
    })

    }

    controller
    @RequestMapping("deleteList")
    @ResponseBody
    public void deleteList(String[] ids){
    ysqService.deleteList(ids);
    }

    mapper
    <!--批删-->
    <delete id="deleteList" parameterType="int">
    delete from coupon where couId in
    <foreach collection="array" open="(" separator="," close=")" item="ids">
    #{ids}
    </foreach>
    </delete>

  • 相关阅读:
    codeforces 671B Robin Hood 二分
    HDU 4009 Transfer water 最小树形图
    HDU 2121 Ice_cream’s world II 最小树形图
    UVA1395 Slim Span(枚举最小生成树)
    ZOJ 1107FatMouse and Cheese(BFS)
    POJ2239 Selecting Courses(二分图最大匹配)
    UVA 11419SAM I AM(输出 最小覆盖点 )
    POJ 3678 Katu Puzzle(强连通 法)
    POJ3207Ikki's Story IV
    POJ1236Network of Schools(强连通分量 + 缩点)
  • 原文地址:https://www.cnblogs.com/yu72732/p/12621079.html
Copyright © 2011-2022 走看看