We review some known facts on classes of functions of several arguments stable under right and left compositions with fixed clones, also known as clonoids. We describe the lattices of clonoids of Boolean functions with respect to certain pairs of Post classes that give rise to a countable closure system.