}

	pattern := event.NewPattern(prefix, suffix)

	var eventNames []event.Name
	var mask pubsub.Mask
	for _, ev := range values[peerRESTListenEvents] {
		eventName, err := event.ParseName(ev)
		if err != nil {
			return grid.NewRemoteErr(err)
		}
		mask.MergeMaskable(eventName)
		eventNames = append(eventNames, eventName)
	}

    private final int mask;

    SubSet(ImmutableMap<E, Integer> inputSet, int mask) {
      this.inputSet = inputSet;
      this.mask = mask;
    }

    @Override
    public Iterator<E> iterator() {
      return new UnmodifiableIterator<E>() {
        final ImmutableList<E> elements = inputSet.keySet().asList();
        int remainingSetBits = mask;

        @Override

   * <p>This must be a (2^n)-1 as it is used as a mask.
   */
  static final int DRAIN_THRESHOLD = 0x3F;

  /**
   * Maximum number of entries to be drained in a single cleanup run. This applies independently to
   * the cleanup queue and both reference queues.
   */
  // TODO(fry): empirically optimize this
  static final int DRAIN_MAX = 16;

  // Fields

  /**

	VFWREDOSUMVS	V1, V2, V3			// d79120ce
	VFWREDOSUMVS	V1, V2, V0, V3			// d79120cc
	VFWREDUSUMVS	V1, V2, V3			// d79120c6
	VFWREDUSUMVS	V1, V2, V0, V3			// d79120c4

	// 31.15: Vector Mask Instructions
	VMANDMM		V1, V2, V3			// d7a12066
	VMNANDMM	V1, V2, V3			// d7a12076
	VMANDNMM	V1, V2, V3			// d7a12062
	VMXORMM		V1, V2, V3			// d7a1206e
	VMORMM		V1, V2, V3			// d7a1206a