Add some perftests for wait sets.

Add some perftests for wait sets.

The main important of these tests is to verify that they behave
reasonably as wait set size varies.

(The overhead per wait should be O(1) or O(log n) in the wait set size
n. Currently it's probably O(log n), since we use an std::map for
lookups, but obviously we could use a hash table instead.)

R=azani@chromium.org
BUG=#350

Committed: https://chromium.googlesource.com/external/mojo/+/c6f7609574beef8afdeee72fd777aed9bdb67d7a

[azani, 2016-06-27 22:55:05]

lgtm

[viettrungluu, 2016-06-27 22:59:33]

Description was changed from

==========
Add some perftests for wait sets.

The main important of these tests is to verify that they behave
reasonably as wait set size varies.

(The overhead per wait should be O(1) or O(log n) in the wait set size
n. Currently it's probably O(log n), since we use an std::map for
lookups, but obviously we could use a hash table instead.)

R=azani@chromium.org
BUG=#350
==========

to

==========
Add some perftests for wait sets.

The main important of these tests is to verify that they behave
reasonably as wait set size varies.

(The overhead per wait should be O(1) or O(log n) in the wait set size
n. Currently it's probably O(log n), since we use an std::map for
lookups, but obviously we could use a hash table instead.)

R=azani@chromium.org
BUG=#350

Committed:
https://chromium.googlesource.com/external/mojo/+/c6f7609574beef8afdeee72fd77...
==========

[viettrungluu, 2016-06-27 22:59:36]

Committed patchset #1 (id:1) manually as
c6f7609574beef8afdeee72fd777aed9bdb67d7a (presubmit successful).