Name:           "webhook_rejection_count",

    public static final ComponentSelectionDescriptorInternal REJECTION = new DefaultComponentSelectionDescriptor(ComponentSelectionCause.REJECTION);
    public static final ComponentSelectionDescriptorInternal BY_ANCESTOR = new DefaultComponentSelectionDescriptor(ComponentSelectionCause.BY_ANCESTOR);

func NewAdmissionFailureHandlerStub() *AdmissionFailureHandlerStub {
	return &AdmissionFailureHandlerStub{}
}

// HandleAdmissionFailure simply passes admission rejection on, with no special handling.
func (n *AdmissionFailureHandlerStub) HandleAdmissionFailure(admitPod *v1.Pod, failureReasons []PredicateFailureReason) ([]PredicateFailureReason, error) {
	return failureReasons, nil

                assert actualStrictly == version
                this
            }

            DependencyView rejects(String... rejections) {
                Set<String> actualRejects = find()?.rejectsVersion
                Set<String> expectedRejects = rejections as Set
                assert actualRejects == expectedRejects
                this
            }

    }

    def "accepted until rejected"() {
        when:
        selection.reject("bad")

        then:
        selection.rejected
        selection.rejectionReason == "bad"
    }

    def "last rejection wins"() {
        when:
        selection.reject("bad")
        selection.reject("worse")

        then:
        selection.rejected
        selection.rejectionReason == "worse"
    }

     */
    String renderSelector(VersionSelector selector);

    /**
     * Creates another version selector which complements the provided one, but also makes sense to use
     * in a rejection rule. It will therefore fail when computing a complement for this use case doesn't
     * make sense.
     * @param selector the selector to create a complement for

        "1.+"                | "select status" | "1.1"         | '["1.2", "1.1"]' | ['1.2', '1.1']     | false           | true             | ["didn't match versions 2.1, 2.0", "rejection: 1.2 by rule because not milestone"]

        then:
        selector instanceof ExactVersionSelector
        selector.selector == '1.0'

        where:
        version << ["[1.0]", "[1.0, 1.0]"]
    }

    def "computes rejection selector for strict dependency version #selector"() {
        given:
        def normal = matcher.parseSelector(selector)

        when:
        def reject = matcher.complementForRejection(normal)

        then:

// Copyright 2009 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

// W.Hormann, G.Derflinger:
// "Rejection-Inversion to Generate Variates
// from Monotone Discrete Distributions"
// http://eeyore.wu-wien.ac.at/papers/96-04-04.wh-der.ps.gz

package rand

import "math"

// A Zipf generates Zipf distributed variates.
type Zipf struct {

    data object AccessOnCurrentReceiverOnlyViolation : ErrorReason
    data class DuplicateLocalValue(val name: String) : ErrorReason
    data object UnresolvedAssignmentLhs : ErrorReason // TODO: report candidate with rejection reasons
    data object UnresolvedAssignmentRhs : ErrorReason // TODO: resolution trace here, too?
    data object UnitAssignment : ErrorReason
    data object DanglingPureExpression : ErrorReason
}