if globalEventNotifier == nil {
		return nil
	}

	nstats := globalEventNotifier.targetList.Stats()
	m.Set(notificationCurrentSendInProgress, float64(nstats.CurrentSendCalls))
	m.Set(notificationEventsErrorsTotal, float64(nstats.EventsErrorsTotal))
	m.Set(notificationEventsSentTotal, float64(nstats.TotalEvents))
	m.Set(notificationEventsSkippedTotal, float64(nstats.EventsSkipped))

	return nil

			Effect:    string(policy.Allow),
			Principal: miniogopolicy.User{AWS: set.CreateStringSet("*")},
			Resources: set.CreateStringSet(policy.NewResource(bucketName).String()),
			Actions:   set.CreateStringSet("s3:GetBucketLocation", "s3:ListBucket"),
		},
		{
			Effect:    string(policy.Allow),
			Principal: miniogopolicy.User{AWS: set.CreateStringSet("*")},
			Resources: set.CreateStringSet(policy.NewResource(bucketName + "/" + prefix).String()),

        int result = response.readParametersWireFormat(buffer, 0, buffer.length);

        assertEquals(4, result);

        // Access private field to verify length was set
        Field lengthField = response.getClass().getSuperclass().getSuperclass().getSuperclass().getDeclaredField("length");
        lengthField.setAccessible(true);
        int actualLength = (int) lengthField.get(response);

 * and be part of all the specified tasks.
 */
public class TestingConventionRule implements Serializable {

    private final String suffix;

    private Set<String> baseClasses = new HashSet<>();

    private Set<Pattern> taskNames = new HashSet<>();

    public TestingConventionRule(String suffix) {
        this.suffix = suffix;
    }

    public String getSuffix() {
        return suffix;
    }

    /**

  }

  @Override
  public String toString() {
    return "[]";
  }

  @Override
  public boolean equals(@Nullable Object object) {
    if (object instanceof Set) {
      Set<?> that = (Set<?>) object;
      return that.isEmpty();
    }
    return false;
  }

  @GwtIncompatible // not used in GWT
  @Override
  boolean isHashCodeFast() {
    return true;
  }

  }

  abstract Iterator<Entry<E>> entryIterator();

  @LazyInit private transient @Nullable Set<Entry<E>> entrySet;

  @Override
  public Set<Entry<E>> entrySet() {
    Set<Entry<E>> result = entrySet;
    return (result == null) ? entrySet = createEntrySet() : result;
  }

  Set<Entry<E>> createEntrySet() {
    @WeakOuter
    final class EntrySetImpl extends Multisets.EntrySet<E> {

                "getFlags() should return correct flags");
        assertTrue(msrpcSamrConnect2.isFlagSet(DcerpcConstants.DCERPC_FIRST_FRAG), "DCERPC_FIRST_FRAG should be set");
        assertTrue(msrpcSamrConnect2.isFlagSet(DcerpcConstants.DCERPC_LAST_FRAG), "DCERPC_LAST_FRAG should be set");
    }

    long bitSize() {
      return (long) data.length() * Long.SIZE;
    }

    /**
     * Number of set bits (1s).
     *
     * <p>Note that because of concurrent set calls and uses of atomics, this bitCount is a (very)
     * close *estimate* of the actual number of bits set. It's not possible to do better than an
     * estimate without locking. Note that the number, if not exactly accurate, is *always*

    assertFalse(spy.wasExecuted);
    assertFalse(singleCallListener.wasCalled());
    assertTrue(listenableFuture.isDone()); // We call AbstractFuture#set above.

    // #addListener() will run the listener immediately because the Future is
    // already finished (we explicitly set the result of it above).
    listenableFuture.addListener(singleCallListener, directExecutor());
    assertThat(listenableFuture.get()).isEqualTo(DATA1);

  }

  @Override
  public Set<N> predecessors() {
    return Collections.unmodifiableSet(((BiMap<E, N>) inEdgeMap).values());
  }

  @Override
  public Set<N> successors() {
    return Collections.unmodifiableSet(((BiMap<E, N>) outEdgeMap).values());
  }

  @Override
  public Set<E> edgesConnecting(N node) {