| Table | Data.Graph |
| TaggedQueue | Data.Sequence.Internal.Sorting |
| tails | Data.Sequence.Internal, Data.Sequence |
| take | |
| 1 (Function) | Data.Sequence.Internal, Data.Sequence |
| 2 (Function) | Data.Set.Internal, Data.Set |
| 3 (Function) | Data.Map.Internal, Data.Map.Strict.Internal, Data.Map.Strict, Data.Map.Lazy, Data.Map |
| takeWhileAntitone | |
| 1 (Function) | Data.Set.Internal, Data.Set |
| 2 (Function) | Data.Map.Internal, Data.Map.Strict.Internal, Data.Map.Strict, Data.Map.Lazy, Data.Map |
| takeWhileL | Data.Sequence.Internal, Data.Sequence |
| takeWhileR | Data.Sequence.Internal, Data.Sequence |
| Three | Data.Sequence.Internal |
| Tip | |
| 1 (Data Constructor) | Data.Set.Internal |
| 2 (Data Constructor) | Data.Map.Internal, Data.Map.Strict.Internal |
| 3 (Data Constructor) | Data.IntSet.Internal |
| 4 (Data Constructor) | Data.IntMap.Internal |
| toAscList | |
| 1 (Function) | Data.Set.Internal, Data.Set |
| 2 (Function) | Data.Map.Internal, Data.Map.Strict.Internal, Data.Map.Strict, Data.Map.Lazy, Data.Map |
| 3 (Function) | Data.IntSet.Internal, Data.IntSet |
| 4 (Function) | Data.IntMap.Internal, Data.IntMap.Strict, Data.IntMap.Lazy, Data.IntMap |
| toDescList | |
| 1 (Function) | Data.Set.Internal, Data.Set |
| 2 (Function) | Data.Map.Internal, Data.Map.Strict.Internal, Data.Map.Strict, Data.Map.Lazy, Data.Map |
| 3 (Function) | Data.IntSet.Internal, Data.IntSet |
| 4 (Function) | Data.IntMap.Internal, Data.IntMap.Strict, Data.IntMap.Lazy, Data.IntMap |
| toList | |
| 1 (Function) | Data.Set.Internal, Data.Set |
| 2 (Function) | Data.Map.Internal, Data.Map.Strict.Internal, Data.Map.Strict, Data.Map.Lazy, Data.Map |
| 3 (Function) | Data.IntSet.Internal, Data.IntSet |
| 4 (Function) | Data.IntMap.Internal, Data.IntMap.Strict, Data.IntMap.Lazy, Data.IntMap |
| toListQ | Utils.Containers.Internal.BitQueue |
| toPair | Utils.Containers.Internal.StrictPair |
| topSort | Data.Graph |
| TQ | Data.Sequence.Internal.Sorting |
| TQCons | Data.Sequence.Internal.Sorting |
| TQList | Data.Sequence.Internal.Sorting |
| TQNil | Data.Sequence.Internal.Sorting |
| transposeG | Data.Graph |
| traverseMaybeMissing | |
| 1 (Function) | Data.Map.Internal, Data.Map.Merge.Lazy |
| 2 (Function) | Data.Map.Strict.Internal, Data.Map.Merge.Strict |
| 3 (Function) | Data.IntMap.Internal, Data.IntMap.Merge.Lazy, Data.IntMap.Merge.Strict |
| traverseMaybeWithKey | |
| 1 (Function) | Data.Map.Internal, Data.Map.Lazy, Data.Map |
| 2 (Function) | Data.Map.Strict.Internal, Data.Map.Strict |
| traverseMissing | |
| 1 (Function) | Data.Map.Internal, Data.Map.Merge.Lazy |
| 2 (Function) | Data.Map.Strict.Internal, Data.Map.Merge.Strict |
| 3 (Function) | Data.IntMap.Internal, Data.IntMap.Merge.Lazy, Data.IntMap.Merge.Strict |
| traverseWithIndex | Data.Sequence.Internal, Data.Sequence |
| traverseWithKey | |
| 1 (Function) | Data.Map.Internal, Data.Map.Lazy, Data.Map |
| 2 (Function) | Data.Map.Strict.Internal, Data.Map.Strict |
| 3 (Function) | Data.IntMap.Internal, Data.IntMap.Lazy, Data.IntMap |
| 4 (Function) | Data.IntMap.Strict |
| Tree | Data.Tree, Data.Graph |
| Two | Data.Sequence.Internal |