Implements linked hashset with a linked set as a backend. Uses an equal method for comparison, meaning it can use complex keys. Has poorer access times compared to the hashset with a binary search tree as a backend, but less costly insertion. Elements cannot be accessed directly, instead it can check whether an element is within it or not. Backend's foreach capability is exposed to iterate over hashcodes.