type Iter[T any] interface {
// Next returns next N items of iterator when it is not empty.
// When iterator is empty, nil is returned.
// When n = [ALL] or n is greater than number of remaining elements,
// all remaining are returned.
//
// The returned slice is owned by caller. So implementer should return a
// newly allocated slice if needed.
//
// Passing in a negative n (except [ALL]) is undefined behavior.
Next(n int) []T
}
Hello, i am using go-callvis with the rta algorithm. However i got a panic with it:
it seems that the panic occurs on following code:
Does the RTA algorithm not support generics?