I don't have a book on algorithms and data structers by hand (and googling did not render any usefull result) but I remember from my education that there are data structers for set operations with slightly better complexity characteristics than hash.

By the way they should make a note in the documentation of this module on the algorithm they use.