for k, v := range ps.MatchLabels {
		r, err := labels.NewRequirement(k, selection.Equals, []string{v})
		if err != nil {
			return nil, err
		}
		requirements = append(requirements, *r)
	}
	for _, expr := range ps.MatchExpressions {
		var op selection.Operator
		switch metav1.LabelSelectorOperator(expr.Operator) {
		case metav1.LabelSelectorOpIn:
			op = selection.In
		case metav1.LabelSelectorOpNotIn:
			op = selection.NotIn

    /**
     * Returns the set of variants of this component to use for variant aware resolution of the dependency graph nodes.
     * May be empty, in which case selection falls back to an ecosystem-specific selection strategy.
     */
    List<? extends VariantGraphResolveMetadata> getVariantsForGraphTraversal();

    /**
     * Returns the names of all legacy configurations for this component.

    }

    /**
     * Gets all artifact variants that should be considered for artifact selection.
     *
     * <p>This emulates the normal variant selection process where graph variants are first
     * considered, then artifact variants. We first consider graph variants, which leverages the
     * same algorithm used during graph variant selection. This considers requested and declared
     * capabilities.</p>
     */

        'validation' : 'Validation',
        'compilation' : 'Compilation',
        'deprecation' : 'Deprecation',
        'compilation:java' : 'Java compilation',
        'task-selection' : 'Task selection',
        'dependency-version-catalog' : 'Version catalog',
        'compilation:groovy-dsl' : 'Groovy DSL script compilation',
        'validation:property-validation' : 'Property validation problems',

    /**
     * Returns the public view of all variants of this component that are available for variant selection, either during graph resolution or artifact resolution.
     */
    List<ResolvedVariantResult> getAllSelectableVariantResults();

    /**
     * Returns the candidates for variant selection during graph resolution.
     */
    GraphSelectionCandidates getCandidatesForGraphVariantSelection();

    /**

                }
            }
        }
    }
}

public abstract class KaReferenceShortener : KaSessionComponent() {
    public abstract fun collectShortenings(
        file: KtFile,
        selection: TextRange,
        shortenOptions: ShortenOptions,
        classShortenStrategy: (KaClassLikeSymbol) -> ShortenStrategy,
        callableShortenStrategy: (KaCallableSymbol) -> ShortenStrategy
    ): ShortenCommand
}

     * component does not support attribute matching.
     */
    List<? extends VariantGraphResolveState> getVariantsForAttributeMatching();

    /**
     * Returns the variant to use when attribute-based variant selection is not enabled.
     */
    @Nullable
    default VariantGraphResolveState getLegacyVariant(ResolutionFailureHandler failureHandler) {

) : KaReferenceShortener(), KaFe10SessionComponent {
    override val token: KaLifetimeToken
        get() = analysisSession.token

    override fun collectShortenings(
        file: KtFile,
        selection: TextRange,
        shortenOptions: ShortenOptions,
        classShortenStrategy: (KaClassLikeSymbol) -> ShortenStrategy,
        callableShortenStrategy: (KaCallableSymbol) -> ShortenStrategy,
    ): ShortenCommand {

     */
    @Nullable
    String getRepositoryId();

    /**
     * Returns all the variants of this component available for selection. Does not include variants that cannot be consumed, which means this
     * may not include all the variants returned by {@link #getVariants()}.
     *
     * <p>
     * Note: for performance reasons,

        def event = new SelectOptionPromptEvent(123, "question", ["11", "12", "13"], 1)

        assert event.prompt == TextUtil.toPlatformLineSeparators("""question:
  1: 11
  2: 12
  3: 13
Enter selection (default: 12) [1..3] """)
    }

    def "accepts valid input"() {
        def event = new SelectOptionPromptEvent(123, "question", ["1", "2", "3", "4"], 1)

        expect:
        def result = event.convert(input)