Design patterns for generic programming in C

Generic programming is a paradigm whose wide adop-tion by the C++ community is quite recent. In this scheme most classes and procedures are parameterized, leading to the construction of general and efficient soft-ware components. In this paper, we show how some de-sign patterns from Gamma et al. can be adapted to this paradigm. Although these patterns rely highly on dy-namic binding, we show that, by intensive use of para-metric polymorphism, the method calls in these patterns can be resolved at compile-time. In intensive computa-tions, the generic patterns bring a significant speed-up compared to their classical peers.