}

    return closeable;
  }

  /**
   * Stores the given throwable and rethrows it. It will be rethrown as is if it is an {@code
   * IOException}, {@code RuntimeException} or {@code Error}. Otherwise, it will be rethrown wrapped
   * in a {@code RuntimeException}. <b>Note:</b> Be sure to declare all of the checked exception
   * types your try block can throw when calling an overload of this method so as to avoid losing

     * Retrieves a file configuration by its unique identifier.
     *
     * @param id the unique identifier of the file configuration
     * @return an OptionalEntity containing the file configuration if found, empty otherwise
     */
    public OptionalEntity<FileConfig> getFileConfig(final String id) {
        return fileConfigBhv.selectByPK(id);
    }

    /**
     * Retrieves a file configuration by its name.

  b) Subject to the terms of this Agreement, each Contributor hereby
  grants Recipient a non-exclusive, worldwide, royalty-free patent
  license under Licensed Patents to make, use, sell, offer to sell,
  import and otherwise transfer the Contribution of such Contributor,
  if any, in Source Code or other form. This patent license shall
  apply to the combination of the Contribution and the Program if, at

     * @param text the string to check
     * @return true if empty or null, false otherwise
     */
    public static final boolean isEmpty(final String text) {
        return text == null || text.length() == 0;
    }

    /**
     * Checks if the string is not empty.
     *
     * @param text the string to check
     * @return true if not empty, false otherwise
     */
    public static final boolean isNotEmpty(final String text) {

    addNodes(graph);

    assertThat(graph.nodeOrder()).isEqualTo(insertion());
    assertThat(graph.nodes()).containsExactly(3, 1, 4).inOrder();
  }

  // The default ordering is INSERTION unless otherwise specified.
  @Test
  public void nodeOrder_default() {
    MutableGraph<Integer> graph = GraphBuilder.directed().build();

    addNodes(graph);

    assertThat(graph.nodeOrder()).isEqualTo(insertion());

        this.allPageCount = allPageCount;
    }

    /**
     * Checks if a previous page exists.
     *
     * @return True if a previous page exists, false otherwise
     */
    public boolean isExistPrePage() {
        return existPrePage;
    }

    /**
     * Sets whether a previous page exists.
     *
     * @param existPrePage True if a previous page exists

    /**
     * Converts a wildcard value to lowercase if configured to do so.
     *
     * @param value The wildcard value to potentially convert
     * @return The value in lowercase if lowercaseWildcard is true, otherwise the original value
     */
    protected String toLowercaseWildcard(final String value) {
        if (lowercaseWildcard) {
            return value.toLowerCase(Locale.ROOT);
        }
        return value;

         * @return {@code true} if the artifact was resolved, {@code false} otherwise.
         */
        boolean isResolved();

        /**
         * Indicates whether the requested artifact is not present in any of the specified repositories.
         *
         * @return {@code true} if the artifact is not present in any repository, {@code false} otherwise.
         */
        boolean isMissing();
    }

                    + "THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n"
                    + "\\(INCLUDING NEGLIGENCE OR OTHERWISE\\) ARISING IN ANY WAY OUT OF THE USE OF\n"
                    + "THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE\\.").replaceAll("\\s+", "\\\\s*"),
                Pattern.DOTALL
            )
        ),

     *
     * @param parent The parent of the node to transform.
     */
    void transformTest(T parent);

    /**
     * @return true if the transformation should be applied, false otherwise.
     */
    default boolean shouldApply(RestTestContext testContext) {
        return true;
    }

    @Override
    @Input
    default String getName() {
        return this.getClass().getCanonicalName();