int NT_STATUS_CONNECTION_REFUSED = 0xC0000236;
    /** The pathname does not traverse a DFS junction */
    int NT_STATUS_PATH_NOT_COVERED = 0xC0000257;
    /** The IO operation on the reparse point failed */
    int NT_STATUS_IO_REPARSE_TAG_NOT_HANDLED = 0xC0000279;
    /** No more files were found matching the file specification */
    int NT_STATUS_NO_MORE_FILES = 0x80000006;

            return new InputStreamReader(new FileInputStream(file), encoding);
        } catch (final IOException e) {
            throw new IORuntimeException(e);
        }
    }

    /**
     * Reads a single line from the given {@link BufferedReader}.
     *
     * @param reader
     *            the {@link BufferedReader} (must not be {@literal null})

   * concurrently readable hash table. The map supports non-blocking reads and concurrent writes
   * across different segments.
   *
   * The page replacement algorithm's data structures are kept casually consistent with the map. The
   * ordering of writes to a segment is sequentially consistent. An update to the map and recording
   * of reads may not be immediately reflected on the algorithm's data structures. These structures

    void testMaxDelayLimit() {
        // Given
        SmbOperationException.RetryPolicy policy = new SmbOperationException.RetryPolicy(10, 1000, 5000, 2.0, true);

        // When - Calculate delays for increasing attempts
        long delay1 = policy.getDelayMs(1);
        long delay2 = policy.getDelayMs(2);
        long delay3 = policy.getDelayMs(3);
        long delay4 = policy.getDelayMs(4);

		if err != nil {
			return fmt.Errorf("xlMetaInlineData: %w", err)
		}
	}

	return nil
}

// repair will copy all seemingly valid data entries from a corrupted set.
// This does not ensure that data is correct, but will allow all operations to complete.
func (x *xlMetaInlineData) repair() {
	data := *x
	if len(data) == 0 {
		return
	}

	if !data.versionOK() {
		*x = nil
		return
	}

  protected Ticker() {}

  /** Returns the number of nanoseconds elapsed since this ticker's fixed point of reference. */
  public abstract long read();

  /**
   * A ticker that reads the current time using {@link System#nanoTime}.
   *
   * @since 10.0
   */
  public static Ticker systemTicker() {
    return SYSTEM_TICKER;
  }

  private static final Ticker SYSTEM_TICKER =

	*b = Reader{
		buf:          buf,
		rd:           r,
		lastByte:     -1,
		lastRuneSize: -1,
	}
}

var errNegativeRead = errors.New("bufio: reader returned negative count from Read")

// fill reads a new chunk into the buffer.
func (b *Reader) fill() {
	// Slide existing data to beginning.
	if b.r > 0 {
		copy(b.buf, b.buf[b.r:b.w])
		b.w -= b.r
		b.r = 0
	}

	if b.w >= len(b.buf) {

 * @author Colin Decker
 * @since 1.0
 */
@GwtIncompatible
public final class ByteStreams {

  private static final int BUFFER_SIZE = 8192;

  /** Creates a new byte array for buffering reads or writes. */
  static byte[] createBuffer() {
    return new byte[BUFFER_SIZE];
  }

  /**
   * There are three methods to implement {@link FileChannel#transferTo(long, long,
   * WritableByteChannel)}:
   *

// ETag returns the ETag of the underlying Tagger.
func (r wrapReader) ETag() ETag {
	if r.Tagger == nil {
		return nil
	}
	return r.Tagger.ETag()
}

// Wrap returns an io.Reader that reads from the wrapped
// io.Reader and implements the Tagger interaface.
//
// If content implements Tagger then the returned Reader
// returns ETag of the content. Otherwise, it returns
// nil as ETag.
//

        assertEquals("00", Hexdump.toHexString(data4, 1, 2)); // Bug: ignores srcIndex, reads from 0
        assertEquals("0011", Hexdump.toHexString(data4, 1, 4)); // Bug: ignores srcIndex, reads from 0
        assertEquals("0011", Hexdump.toHexString(data4, 2, 4)); // Bug: ignores srcIndex, reads from 0
    }

    @Test
    @DisplayName("Should perform hexdump with correct formatting")