// partitionValues returns a list of equivalence classes, each
// being a sorted by ID list of *Values. The eqclass slices are
// backed by the same storage as the input slice.
// Equivalence classes of size 1 are ignored.
func partitionValues(a []*Value, auxIDs auxmap) []eqclass {
	sort.Sort(sortvalues{a, auxIDs})

	var partition []eqclass
	for len(a) > 0 {
		v := a[0]
		j := 1
		for ; j < len(a); j++ {
			w := a[j]

package org;

public class MyClass {
    

class OkClass {
    String field1

package org;

public class MyClass {
    

KtDeclaration: KtClass Foo
annotations: [
  A(a = 1, c = kotlin.Int::class)
    psi: KtAnnotationEntry

import com.google.common.base.Optional;

public class MyClass {
    public <T> Optional<T> createOptional() {
        return Optional.absent();
    }

        sourceWithFileSuffixForProject("java", "impl", "class F {}")
        sourceWithFileSuffixForProject("groovy", "impl", "class G {}")
        run ":impl:compileGroovy"

        when:
        aClass.text = "class A { void m1() {}; void m2() {}; }"
        eClass.text = "class E { boolean isCacheEnabled = D.cache; garbage }"

annotation class A(val a: Int, val c: KClass<*>)

@A(1, Int::class)

import com.google.common.base.Optional;

public class MyClass {
    public <T> Optional<T> createOptional() {
        return Optional.absent();
    }

Laura Kassovic <******@****.***> 1701107622 -0800