zoukankan      html  css  js  c++  java
  • 打印request的信息

    HttpServletRequest req = (HttpServletRequest) RequestContext.getCurrentContext().getRequest();
            System.err.println("REQUEST:: " + req.getScheme() + " " + req.getRemoteAddr() + ":" + req.getRemotePort());
            StringBuilder params = new StringBuilder("?");
            // 获取URL参数
            Enumeration<String> names = req.getParameterNames();
            if (req.getMethod().equals("GET")) {
                while (names.hasMoreElements()) {
                    String name = (String) names.nextElement();
                    params.append(name);
                    params.append("=");
                    params.append(req.getParameter(name));
                    params.append("&");
                }
            }
            if (params.length() > 0) {
                params.delete(params.length() - 1, params.length());
            }
            System.err.println(
                    "REQUEST:: > " + req.getMethod() + " " + req.getRequestURI() + params + " " + req.getProtocol());
            Enumeration<String> headers = req.getHeaderNames();
            while (headers.hasMoreElements()) {
                String name = (String) headers.nextElement();
                String value = req.getHeader(name);
                System.err.println("REQUEST:: > " + name + ":" + value);
            }
            RequestContext ctx = RequestContext.getCurrentContext();
            if (!ctx.isChunkedRequestBody()) {
                ServletInputStream inp = null;
                try {
                    inp = ctx.getRequest().getInputStream();
                    String body = null;
                    if (inp != null) {
                        body = IOUtils.toString(inp);
                        System.err.println("REQUEST:: > " + body);
                    }
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }

     转http://c.biancheng.net/view/5424.html

  • 相关阅读:
    [OpenJudge] 反正切函数的应用 (枚举)(数学)
    [OpenJudge] 摘花生 (模拟)
    [OpenJudge] 宇航员(模拟)
    [OpenJudge] 显示器(模拟)
    背包问题
    BFS_最短路径
    链表
    网站
    网站
    洛谷_递归整理
  • 原文地址:https://www.cnblogs.com/aknife/p/14144023.html
Copyright © 2011-2022 走看看