interfaces.add(info);
            }

            if (next == 0) {
                // Last entry - advance by the full structure size
                bufferIndex += 152;
                break;
            }

            // Move to next entry based on Next offset
            bufferIndex += next;
        }

        return bufferIndex - start;
    }

        for (int h = Hashing.smear(key.hashCode()); ; h++) {
          h &= mask;
          int previousKeyIndex = hashTable[h] & BYTE_MASK; // unsigned read
          if (previousKeyIndex == BYTE_MASK) { // -1 signed becomes 255 unsigned
            hashTable[h] = (byte) outKeyIndex;
            break;
          } else if (key.equals(alternatingKeysAndValues[previousKeyIndex])) {
            duplicateKey =
                new Builder.DuplicateKey(

		}
		files := []file{}
		for {
			hdr, err := r.Next()
			if err == io.EOF {
				break
			}
			if err != nil {
				return
			}
			buf := bytes.NewBuffer(nil)
			if _, err := io.Copy(buf, r); err != nil {
				continue
			}
			files = append(files, file{header: hdr, content: buf.Bytes()})
		}

		// If we were unable to read anything out of the archive don't
		// bother trying to roundtrip it.
		if len(files) == 0 {

// Read is never called with an empty buffer.
type testNonEmptyReader struct{ io.Reader }

func (r testNonEmptyReader) Read(b []byte) (int, error) {
	if len(b) == 0 {
		return 0, errors.New("unexpected empty Read call")
	}
	return r.Reader.Read(b)
}

func TestFileReader(t *testing.T) {
	type (
		testRead struct { // Read(cnt) == (wantStr, wantErr)
			cnt     int

        entry.updateChild("file1.txt", 1024L, 1000L, false, 0x20, 500L, 800L);
        entry.markComplete();

        // Break lease with loss of read cache
        int newState = Smb2LeaseState.SMB2_LEASE_HANDLE_CACHING; // Lost read cache
        directoryLeaseManager.handleDirectoryLeaseBreak(leaseKey, newState);

        // Cache should be invalidated
        assertFalse(entry.isComplete());

    }

    // Helper method to read string from buffer
    private String readString(byte[] buffer, int offset, int maxLength) {
        int length = 0;
        for (int i = offset; i < offset + maxLength && i < buffer.length; i++) {
            if (buffer[i] == 0) {
                break;
            }
            length++;
        }

	maxWorkers int64

	// workerStartMu sync.Mutex
	lastStarted time.Time

	wg sync.WaitGroup

	// Channel of log entries.
	// Reading logCh must hold read lock on logChMu (to avoid read race)
	// Sending a value on logCh must hold read lock on logChMu (to avoid closing)
	logCh   chan any
	logChMu sync.RWMutex

	// If this webhook is being re-configured we will
	// assign the new webhook target to this field.

									m.mapped[i] = 0
								}
							}
							break
						}
						ok := k
						for i, sh := range splitFilled {
							for j, v := range sh {
								if v == 0 {
									splitData[i] = nil
									if i < k {
										fmt.Println("Shard", i, "is missing data from offset", i*len(sh)+j)
										ok--
									}
									break
								}
							}
						}

            try {
                QueryLog queryLog = queryLogReader.read();
                while (queryLog != null) {
                    if (Thread.currentThread().isInterrupted()) {
                        break;
                    }
                    queryLogs.add(queryLog);
                    queryLog = queryLogReader.read();

			t.Fatalf("Impossible read specified: %d %d %d", skipLen, readLen, oSize)
		}

		var cumulativeSum, cumulativeEncSum int64
		toRead := readLen
		readStart := false
		for i, v := range s {
			partOffset := int64(0)
			partDarePkgOffset := int64(0)
			if !readStart && cumulativeSum+v > skipLen {
				// Read starts at the current part
				readStart = true