// Copyright (c) 2015-2021 MinIO, Inc.
//
// This file is part of MinIO Object Storage stack
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful

            return execute(cliRequest);
        } catch (ExitException e) {
            return e.exitCode;
        } catch (UnrecognizedOptionException e) {
            // pure user error, suppress stack trace
            return 1;
        } catch (BuildAbort e) {
            CLIReportingUtils.showError(slf4jLogger, "ABORTED", e, cliRequest.showErrors);

            return 2;
        } catch (Exception e) {

   * number of elements.)
   */
  private static final class MergingIterator<T extends @Nullable Object>
      extends UnmodifiableIterator<T> {

    // Wrapper class to track insertion order for stable sorting
    private static class IndexedIterator<E extends @Nullable Object> {
      final PeekingIterator<E> iterator;
      final int index;

   * number of elements.)
   */
  private static final class MergingIterator<T extends @Nullable Object>
      extends UnmodifiableIterator<T> {

    // Wrapper class to track insertion order for stable sorting
    private static class IndexedIterator<E extends @Nullable Object> {
      final PeekingIterator<E> iterator;
      final int index;

  }

  // Verify that stack traces of func is copied to graph function library.
  ASSERT_NE(func_stack_traces, nullptr);
  EXPECT_EQ(func_stack_traces->size(), 4);
  EXPECT_EQ(func_stack_traces->at("neg")->ToString({}), kNegStackToString);
  EXPECT_EQ(func_stack_traces->at("feed")->ToString({}), kFeedStackToString);

  // Verify that stack traces of grad_func is copied to graph function library.

                }
            }));

            // Eagerly resolve all plugins in parallel
            toResolve.parallelStream().forEach(Runnable::run);

            // Keep track of phase aliases
            lifecycle.aliases().forEach(alias -> plan.aliases().put(alias.v3Phase(), alias.v4Phase()));

            return plan;
        }
    }

// Copyright (c) 2015-2021 MinIO, Inc.
//
// This file is part of MinIO Object Storage stack
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful

// Copyright (c) 2015-2021 MinIO, Inc.
//
// This file is part of MinIO Object Storage stack
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful

    </default>
  </defaults>
  <classes>
    <class java.clone="deep">
      <name>TrackableBase</name>
      <version>1.0.0+</version>
      <description>
        Common base class that contains code to track the source for this instance.
      </description>
      <codeSegments>
        <codeSegment>
          <version>1.0.0/1.3.0</version>
          <code>
    public static final String USER_LEVEL = "user-level";

// Copyright (c) 2015-2021 MinIO, Inc.
//
// This file is part of MinIO Object Storage stack
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful