5. It sends the HTTP request and reads the response.

If there's a problem with the connection, OkHttp will select another route and try again. This allows OkHttp to recover when a subset of a server's addresses are unreachable. It's also useful when a pooled connection is stale or if the attempted TLS version is unsupported.

                    e);
            return new PersistedToolchains();
        } catch (IOException e) {
            problems.add(
                    Problem.Severity.FATAL,
                    "Non-readable toolchains " + toolchainsSource.getLocation() + ": " + e.getMessage(),
                    -1,
                    -1,
                    e);
            return new PersistedToolchains();
        }

  }

  /**
   * It's possible a self-terminating deflated message will contain trailing data that won't be
   * processed during inflation. If this happens, we need to either reject the message or discard
   * the unreachable data. We choose to discard it!
   *
   * In practice this could happen if the encoder doesn't strip the [0x00, 0x00, 0xff, 0xff] suffix
   * and that ends up repeated.
   *

                    e);
            return new Settings();
        } catch (IOException e) {
            problems.add(
                    SettingsProblem.Severity.FATAL,
                    "Non-readable settings " + settingsSource.getLocation() + ": " + e.getMessage(),
                    -1,
                    -1,
                    e);
            return new Settings();
        }

        };

        File tempFile = ResponseDataUtil.createResponseBodyFile(responseData);

        assertNotNull(tempFile);
        assertTrue(tempFile.exists());

        // Verify file permissions (readable and writable by owner)
        assertTrue(tempFile.canRead());
        assertTrue(tempFile.canWrite());

        // Clean up
        tempFile.delete();
    }

                || algorithm == COMPRESSION_LZNT1 || algorithm == COMPRESSION_PATTERN_V1;
    }

    /**
     * Gets a human-readable name for the compression algorithm.
     *
     * @param algorithm the algorithm constant
     * @return the algorithm name
     */
    public static String getAlgorithmName(int algorithm) {

 */

package jcifs.util;

/**
 * Utility class for hexadecimal dumping of binary data.
 * This class provides methods for converting binary data to readable hex format.
 */

public class Hexdump {

    /**
     * Default constructor.
     */
    public Hexdump() {
        // Utility class - no instance variables to initialize
    }

    /**

or <code>*s</code>, and returns the field offset in bytes relative to the struct's address.
If <code>f</code> is an <a href="#Struct_types">embedded field</a>, it must be reachable
without pointer indirections through fields of the struct.
For a struct <code>s</code> with field <code>f</code>:
</p>

<pre>

				switch reflectValue.Kind() {
				case reflect.Struct:
					for _, field := range s.Fields {
						selected := selectedColumns[field.DBName] || selectedColumns[field.Name]
						if selected || (!restricted && field.Readable) {
							if v, isZero := field.ValueOf(stmt.Context, reflectValue); !isZero || selected {
								if field.DBName != "" {

   * #asMapOfRanges()}.
   */
  @Override
  boolean equals(@Nullable Object o);

  /** Returns {@code asMapOfRanges().hashCode()}. */
  @Override
  int hashCode();

  /** Returns a readable string representation of this range map. */
  @Override
  String toString();