} 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})
     * @return a line of text, or {@literal null} if the end of the stream has been reached

     * @return whether this version is a least the given one
     */
    public boolean atLeast(final DialectVersion v) {
        return ordinal() >= v.ordinal();
    }

    /**
     * Check if this dialect version is at most the specified version
     *
     * @param v the version to compare against
     * @return whether this version is a most the given one
     */

`MINIO_IDENTITY_PLUGIN_ROLE_POLICY` is a required parameter and can be list of comma separated policy names.

On setting up the plugin, the MinIO server prints the Role ARN to its log. The Role ARN is generated by default based on the given plugin URL. To avoid this and use a configurable value set a unique role ID via `MINIO_IDENTITY_PLUGIN_ROLE_ID`.

## REST API call to plugin

    /**
     * Unwraps the tree instance to the specified type
     * @param <T> the target tree type
     * @param type the class of the tree type to unwrap to
     * @return tree instance with the given type
     */
    <T extends SmbTree> T unwrap(Class<T> type);

    /**
     * {@inheritDoc}
     *
     * @see java.lang.AutoCloseable#close()
     */
    @Override
    void close();

  public static <E extends @Nullable Object> CompactHashSet<E> create() {
    return new CompactHashSet<>();
  }

  /**
   * Creates a <i>mutable</i> {@code CompactHashSet} instance containing the elements of the given
   * collection in unspecified order.
   *
   * @param collection the elements that the set should contain
   * @return a new {@code CompactHashSet} containing those elements (minus duplicates)
   */

            return count < items.length;
          }
        };
  }

  /**
   * Creates an {@code MonitorBasedArrayBlockingQueue} with the given (fixed) capacity, the
   * specified access policy and initially containing the elements of the given collection, added in
   * traversal order of the collection's iterator.
   *
   * @param capacity the capacity of this queue

    /**
     * Test that modifying the original array affects the field (reference test)
     */
    @Test
    @DisplayName("Test byte array reference behavior")
    public void testByteArrayReference() {
        // Given
        byte[] originalKey = new byte[] { 0x01, 0x02, 0x03, 0x04 };
        serverData.encryptionKey = originalKey;

        // When - modify the original array
        originalKey[0] = (byte) 0xFF;

      try {
        if (!cleanUp(queue.remove())) {
          break;
        }
      } catch (InterruptedException e) {
        // ignore
      }
    }
  }

  /**
   * Cleans up the given reference and any other references already in the queue. Catches and logs
   * all throwables.
   *
   * @return true if the caller should continue to wait for more references to be added to the

  }

  /**
   * Asserts that the collection under test contains exactly the elements it was initialized with
   * plus the given elements, according to {@link #expectContents(java.util.Collection)}. In other
   * words, for the default {@code expectContents()} implementation, the number of occurrences of
   * each given element has increased by one since the test collection was created, and the number

		}

		return updateTx
	}

	return
}

// First finds the first record ordered by primary key, matching given conditions conds
func (db *DB) First(dest interface{}, conds ...interface{}) (tx *DB) {
	tx = db.Limit(1).Order(clause.OrderByColumn{
		Column: clause.Column{Table: clause.CurrentTable, Name: clause.PrimaryKey},
	})