zoukankan      html  css  js  c++  java
  • 针对HttpClient 重写 HttpRequestRetryHandler针对特定异常 增加重试




    调用方法:
    public static String doGet(String url) { try { RequestConfig defaultRequestConfig = RequestConfig.custom() .setSocketTimeout(200) .setConnectTimeout(200) .setConnectionRequestTimeout(200) .build(); CloseableHttpClient httpclient = HttpClients.custom() .setDefaultRequestConfig(defaultRequestConfig) .setRetryHandler(retryHandler()) .build(); return httpGetString(url, httpclient); } catch (IOException e) { logger.warn("doGetTimeoutUrl:" + url, e); return ""; } }



    /** * 从写重试handler * @return */ private static HttpRequestRetryHandler retryHandler(){ return (exception, executionCount, context) -> { logger.warn("tryRequest: " + executionCount,exception); if (executionCount >= 3) { // Do not retry if over max retry count return false; } if (exception instanceof InterruptedIOException) { // Timeout return true; } if (exception instanceof UnknownHostException) { // Unknown host return true; } if (exception instanceof SSLException) { // SSL handshake exception return true; } HttpClientContext clientContext = HttpClientContext.adapt(context); HttpRequest request = clientContext.getRequest(); boolean idempotent = !(request instanceof HttpEntityEnclosingRequest); if (idempotent) { // Retry if the request is considered idempotent return true; } return false; }; }
  • 相关阅读:
    HDU 1800 Flying to the Mars 字典树,STL中的map ,哈希树
    字典树 HDU 1075 What Are You Talking About
    字典树 HDU 1251 统计难题
    最小生成树prim算法 POJ2031
    POJ 1287 Networking 最小生成树
    次小生成树 POJ 2728
    最短路N题Tram SPFA
    poj2236 并查集
    POJ 1611并查集
    Number Sequence
  • 原文地址:https://www.cnblogs.com/tonyauto/p/11225985.html
Copyright © 2011-2022 走看看