We investigate Wilf-type equivalence relations among structures that can be regarded as generalizations of permutations. In particular, we investigate set partitions, involutions and fillings of diagrams.