This documents the type of $C_p$-Mackey functors. A $C_p$-Mackey functor is encoded as a hash table with keys through which we can pull various parts of the data.
The keys available (internally) in the hash table are as follows, together with their external get methods:
Constructing new Mackey functors: See constructing examples of Mackey functors.
Operations with Mackey functor types: One of the first operations to know about is pruning a $C_p$-Mackey functor. This basically takes the data of a Mackey functor and attempts to simplify it and make it more reader-friendly. Pruning is the only unary operation on $C_p$-Mackey functors that we consider. The $0$-ary (Boolean-valued) operations are
For binary (and $n$-ary) operations, there are a few, including:
Well-definedness: The global variable assertLevel controls whether the methods that construct Mackey functors will check whether the input data is well-defined. If assertLevel is set to 0 or lower, then no checks are made, and the methods will return a Mackey functor (which may be malformed) regardless of the input data. If assertLevel is set to 1 or higher, then the methods will check whether the input data yields a well-defined Mackey functor, and if not, they will throw an error.
The object CpMackeyFunctor is a type, with ancestor classes HashTable < Thing.
The source of this document is in CpMackeyFunctors/Documentation/MackeyFunctorDoc.m2:55:0.