Does the hard stuff.... Initializes the Bool Array, and attempts to find a perfect function that will hash all the key words without getting any duplications. This is made much easier since we aren't attempting to generate *minimum* functions, only perfect ones. If we can't generate a perfect function in one pass *and* the user hasn't enabled the DUP option, we'll inform the user to try the ran
source not stored for this graph (policy: none)
no test coverage detected