containsOnly

made.containsOnly$package.containsOnly

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Self type

Members list

Type members

Types

type Loop[Tup <: Tuple, T] = Tup match { case EmptyTuple => true case T *: tail => Loop[tail, T] case Any => false }

Value members

Concrete methods

def refl[Tup <: Tuple, T]: containsOnly[Tup, T]

Givens

Givens

given given_Conversion_Head_T: [Tup <: Tuple, T] => containsOnly[Tup, T] => Conversion[Head[Tup], T]
given given_Conversion_Last_T: [Tup <: Tuple, T] => containsOnly[Tup, T] => Conversion[Last[Tup], T]
given given_containsOnly_Map_C: [Es <: Tuple, C] => containsOnly[Map[Es, [_] =>> C], C]

A constant map [_] =>> C makes every element C. Unifies even for abstract Es.

A constant map [_] =>> C makes every element C. Unifies even for abstract Es.

Attributes

given given_containsOnly_Map_F: [Es <: Tuple, F[_]] => containsOnly[Map[Es, F], F[Any]]

A covariant F gives F[e] &lt;: F[Any] for every element (invariant F still needs refl).

A covariant F gives F[e] &lt;: F[Any] for every element (invariant F still needs refl).

Attributes

inline given given_containsOnly_Tup_T: [Tup <: Tuple, T] => Loop[Tup, T] =:= true => containsOnly[Tup, T]

Inherited givens