import kotlin.math.min

/**
 * Split a list of elements into nearly even sublist. If an element is too large, largeElementSplitFunction will be used to split the large element into several smaller pieces;
 * if some elements are too small, they will be aggregated by smallElementAggregateFunction.
 *
 * @param list the list to split, must be ordered by size desc
 * @param toIntFunction the function used to map the element to its "size"

                            }
                        });

                        var divider = \$("<hr>");
                        divider.css({ margin: "5px" });
                        var tip = \$("<small>").text("Use the 'bin.cmp.report.severity.filter' property to set the default severity filter");
                        tip.css({ padding: "20px" });
                        var menu = \$("ul .dropdown-menu");

        description = "Promotes a successful build on master as the start of a new release cycle on the release branch"

        params {
            text("gitUserEmail", "", label = "Git user.email Configuration", description = "Enter the git 'user.email' configuration to commit change under", display = ParameterDisplay.PROMPT, allowEmpty = true)

) {
    init {
        params {
            text(
                "gitUserEmail",
                "",
                label = "Git user.email Configuration",
                description = "Enter the git 'user.email' configuration to commit change under",
                display = ParameterDisplay.PROMPT,
                allowEmpty = true
            )
            text(