"application/mathml+xml",
				"application/mbms-associated-procedure-description+xml",
				"application/mbms-deregister+xml",
				"application/mbms-envelope+xml",
				"application/mbms-msk+xml",
				"application/mbms-msk-response+xml",
				"application/mbms-protection-description+xml",
				"application/mbms-reception-report+xml",
				"application/mbms-register+xml",
				"application/mbms-register-response+xml",

	MOVW	R0, R1<<0(R2)        // 010082e7
	MOVW	R0, R1>>0(R2)        // 010082e7
	MOVW	R0, R1->0(R2)        // 010082e7
	MOVW	R0, R1@>0(R2)        // 010082e7

// MULA / MULS
	MULAWT		R1, R2, R3, R4       // c23124e1
	MULAWB		R1, R2, R3, R4       // 823124e1
	MULS		R1, R2, R3, R4       // 923164e0
	MULA		R1, R2, R3, R4       // 923124e0
	MULA.S		R1, R2, R3, R4       // 923134e0
	MMULA		R1, R2, R3, R4       // 123154e7

        return inputSet.keySet().equals(that.inputSet.keySet());
      }
      return super.equals(obj);
    }

    @Override
    public int hashCode() {
      /*
       * The sum of the sums of the hash codes in each subset is just the sum of
       * each input element's hash code times the number of sets that element
       * appears in. Each element appears in exactly half of the 2^n sets, so:
       */

        return inputSet.keySet().equals(that.inputSet.keySet());
      }
      return super.equals(obj);
    }

    @Override
    public int hashCode() {
      /*
       * The sum of the sums of the hash codes in each subset is just the sum of
       * each input element's hash code times the number of sets that element
       * appears in. Each element appears in exactly half of the 2^n sets, so:
       */