zoukankan      html  css  js  c++  java
  • 使用过滤器实现网站访问计数器的功能

    创建过滤器类:

    public class CountFilter implements Filter {

        private int count;//访问数量

        //初始化

    @Override

        public void init (FilterConfig config) throws ServletException{

                      //获取初始化数量

                      String  param = filterConfig.getInitParameter(“count”);

                      count = Integer.valueOf(param);  

         }

    @Override

         public void doFilter(ServletRequest request,ServletResponse response,FilterChain chain) throws IOException ,ServletException{

                        //访问数据自增

                        count++;

                        //将ServletRequest转换为HttpServletRequest

                        HttpServletRequest req = (HttpServletRequest)request;

                        //获取ServletContext   (Application)

                         ServletContext context=req.getSession().getServletContext();

                        //将来访数量值放入到ServletContext中

                        context.setAttribute(“count”,count);

                        //向下传递过滤器

                        chain.doFilter(request, response);

          }

    @Override

         public void destory(){

                

         }

    }

    在web.xml中配置过滤器

    <filter>

         <filter-name>countfilter</filter>

          <filter-class>com.filter.CountFilter</filter-class>

    <!--设置初始化参数      -->

           <init-param>

                 <param-name>count</param-name>

                 <param-value>5000</param-value>

           </init-param>

    <filter>

    <filter-mapping>

        <filter-name>countfilter</filter>

        <url-pattern>/index.jsp</url-pattern>

    <filter-mapping>

  • 相关阅读:
    UVA 12901 Refraction 折射 (物理)
    UVA 12898
    UVA 690 PipelineScheduling 位运算+dfs+剪枝
    UVA1602 Lattice Animals 网格动物 (暴力,STL)
    UVA 810 A Dicey Promblem 筛子难题 (暴力BFS+状态处理)
    UVA 1600 Patrol Robert 巡逻机器人 (启发搜索BFS)
    UVA 536 TreeRocvery 树重建 (递归)
    二分查找
    OI记忆口诀
    OI经典语录
  • 原文地址:https://www.cnblogs.com/next-open/p/3536551.html
Copyright © 2011-2022 走看看