Discontinuous Skeletal methods approximate the solution of boundary-value problems by attaching discrete unknowns to mesh faces (hence the term skeletal) while allowing these discrete unknowns to be chosen independently on each mesh face (hence the term discontinuous). Cell-based unknowns, which can be eliminated locally by a Schur complement technique (also known as static condensation), are also used in the formulation. Salient examples of high-order Discontinuous Skeletal methods are Hybridizable Discontinuous Galerkin methods and the recently-devised Hybrid High-Order methods. Some major benefits of Discontinuous Skeletal methods are that their construction is dimension-independent and that they offer the possibility to use general meshes with polytopal cells and non-matching interfaces. In this work, we show how this mathematical flexibility can be efficiently replicated in a numerical software using generic programming. We describe a number of generic algorithms and data structures for high-order Discontinuous Skeletal methods within a " write once, run on any kind of mesh " framework. The computational efficiency of the implementation is assessed on the Poisson model problem discretized using various polytopal meshes and the Hybrid High-Order method.