zoukankan      html  css  js  c++  java
  • map在Sql中的传参 模糊查询limit分页

    mapper.xml页面
    sql传入map,需要用${},不能用#{}
    <select id="findAllByCountName" parameterType="java.util.Map" resultType="bean.ChuHuoDan" >     <!-- SELECT * FROM chuhuodan WHERE siji LIKE '%张%' ORDER BY createtime DESC limit 0,5; --> SELECT * FROM chuhuodan WHERE siji LIKE ${moHuName} ORDER BY createtime DESC limit ${pageNum},${pageSize} </select>
    serviceImpl层
    
      @Override
        public List<ChuHuoDan> findAllByCountName(String moHuName, Integer pageNum, Integer pageSize) {
            moHuName="'%"+moHuName+"%'";
            System.out.println (moHuName);
            map.put ( "moHuName",moHuName );
            map.put ( "pageNum" ,pageNum);
            map.put ( "pageSize",pageSize );
            return chuHuoDanMapper.findAllByCountName(map);
        }
    Controller层
    
        @RequestMapping("findChuHuoDanByCountName")
        public String findChuHuoDanByCountName(Model model, String moHuName,
                                               @RequestParam(value = "pageNum" ,defaultValue = "1") Integer pageNum,
                                               @RequestParam(value = "pageSize",defaultValue ="5")Integer pageSize){
            if (pageNum==0){
                pageNum=1;
            }
            count = chuHuoDanService.findCount ();
            limitPage = (int)Math.ceil ( count / pageSize );
            allCH = chuHuoDanService.findAllByCountName (moHuName,(pageNum - 1) * pageSize, pageSize );
            model.addAttribute ( "moHuName",moHuName );
            model.addAttribute ( "list",allCH);
            model.addAttribute ("pageNum",pageNum);
            model.addAttribute ("firstPage",1);
            model.addAttribute ("lastPage",limitPage);
            return "show.jsp";
        }
  • 相关阅读:
    [leetCode]945.使数组唯一的最小增量
    [leetCode]974. 和可被 K 整除的子数组
    [leetCode]1035.不相交的线
    [leetCode]面试题 10.01. 合并排序的数组
    [leetCode]面试题04.二维数组
    [面试题03]数组中的重复数字
    [leetCode]169.多数元素
    [leetCode]160.相交链表
    [leetCode]155.最小栈
    POJ 2127 Greatest Common Increasing Subsequence
  • 原文地址:https://www.cnblogs.com/duneF/p/8277681.html
Copyright © 2011-2022 走看看