voddan/permutations_Circular_0.kt

## permutations_Circular_0.kt
interface Circular<T> {
    fun state(): T
    fun inc()
    fun isZero(): Boolean   // `true` in exactly one state
    fun hasNext(): Boolean  // `false` if the next state `isZero()`
}
	interface Circular<T> {
	fun state(): T
	fun inc()
	fun isZero(): Boolean // `true` in exactly one state
	fun hasNext(): Boolean // `false` if the next state `isZero()`
	}