}
                if (doc.entrySet().stream().anyMatch(entry -> entry.getValue().toString().toLowerCase().contains(keyword.toLowerCase()))) {
                    match = true;
                    break;
                }
            }
            assertTrue(match, doc.toString());
        }
    }

    @Test
    public void searchTestWithNotOperation() throws Exception {

  static final class Crc32cHasher extends AbstractStreamingHasher {

    /*
     * The striding algorithm works roughly as follows: it is universally the case that
     * CRC(x ^ y) == CRC(x) ^ CRC(y).  The approach we take is to break the message as follows,
     * with each letter representing a 4-byte word: ABCDABCDABCDABCD... and to calculate
     * CRC(A000A000A000...), CRC(0B000B000B...), CRC(00C000C000C...), CRC(000D000D000D...)

		if objName <= startAfter || objName <= token {
			continue
		}
		if strings.HasPrefix(objName, prefix) {
			if count == maxKeys {
				isTruncated = true
				break
			}
			if delimiter != "" {
				i := strings.Index(objName[len(prefix):], delimiter)
				if i >= 0 {
					commonPrefix := objName[:len(prefix)+i+1]

func (config *TierConfigMgr) Reload(ctx context.Context, objAPI ObjectLayer) error {
	newConfig, err := loadTierConfig(ctx, objAPI)

	config.Lock()
	defer config.Unlock()

	switch err {
	case nil:
		break
	case errConfigNotFound: // nothing to reload
		// To maintain the invariance that lastRefreshedAt records the
		// timestamp of last successful refresh
		config.lastRefreshedAt = UTCNow()
		return nil
	default:

	}

	indices, ok := v["indices"].([]any)
	if ok {
		for _, index := range indices {
			if name, ok := index.(map[string]any); ok && name["name"] == args.Index {
				found = true
				break
			}
		}
	}

	if !found {
		resp, err := c.Indices.Create(args.Index)
		if err != nil {
			return err
		}
		defer xhttp.DrainBody(resp.Body)
		if resp.IsError() {

    set -e
    set -o pipefail

    # Retry install command up to $2 times, if failed
    retry_installcommand() {
      n=0
      while true; do
        #{install_command} $1 && break
        let n=n+1
        if [ $n -ge $2 ]; then
          echo "==> Exhausted retries to install $1"
          return 1
        fi
        echo "==> Retrying installing $1, attempt $((n+1))"

            }

            char ch = s.charAt(pos);
            pos++;
            if (ch == '\\') {
                sb.append(ch);
                if (pos >= end) {
                    break; // ERROR, or let it go?
                }
                ch = s.charAt(pos);
                pos++;
            }

            sb.append(ch);
        }

        if (sb.length() > 0) {

            boolean found = false;
            for (String field : queryFieldConfig.sortFields) {
                if (field.equals(testField)) {
                    found = true;
                    break;
                }
            }
        }
        long arrayDuration = System.nanoTime() - arrayStartTime;

        // Set-based lookup should be significantly faster

      ),
    )
    val readBuff = Buffer()
    var byteCount = 0L
    while (true) {
      val readByteCount = onlyPart.body.read(readBuff, 1024L)
      if (readByteCount == -1L) break
      byteCount += readByteCount
      assertThat(readBuff.readUtf8()).isEqualTo("a".repeat(readByteCount.toInt()))
    }
    assertThat(byteCount).isEqualTo(1024L * 1024L * 100L)

            int read = sis.read(buffer, totalRead, size - totalRead);
            if (read == -1)
                break;
            totalRead += read;
        }

        assertEquals(size, totalRead);
        assertArrayEquals(data, buffer);
    }

    @Test
    @DisplayName("Read handles partial reads from underlying stream")
    void readHandlesPartialReads() throws IOException {
        // Create message with data