containsOnly
made.containsOnly$package.containsOnly
object containsOnly extends containsOnlyLowPriority
Attributes
- Graph
-
- Supertypes
- Self type
-
containsOnly.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
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_Concat_T: [Tup1 <: Tuple, Tup2 <: Tuple, T] => (containsOnly[Tup1, T], containsOnly[Tup2, T]) => containsOnly[Concat[Tup1, Tup2], T]
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
A covariant F gives F[e] <: F[Any] for every element (invariant F still needs refl).
A covariant F gives F[e] <: F[Any] for every element (invariant F still needs refl).
Attributes
given given_containsOnly_Reverse_T: [Tup <: Tuple, T] => containsOnly[Tup, T] => containsOnly[Reverse[Tup], T]
given given_containsOnly_Tail_T: [Tup <: Tuple, T] => containsOnly[Tup, T] => containsOnly[Tail[Tup], T]
inline given given_containsOnly_Tup_T: [Tup <: Tuple, T] => Loop[Tup, T] =:= true => containsOnly[Tup, T]
given given_containsOnly_Zip_T1_T2: [Tup1 <: Tuple, Tup2 <: Tuple, T1, T2] => (containsOnly[Tup1, T1], containsOnly[Tup2, T2]) => containsOnly[Zip[Tup1, Tup2], (T1, T2)]
Inherited givens
Attributes
- Inherited from:
- containsOnlyLowPriority
In this article