if err != nil {
		writeErrorResponseJSON(ctx, w, errorCodes.ToAPIErr(ErrInvalidRequest), r.URL)
		return
	}
	setEventStreamHeaders(w)

	// Trace Publisher and peer-trace-client uses nonblocking send and hence does not wait for slow receivers.
	// Keep 100k buffered channel.
	// If receiver cannot keep up with that we drop events.
	traceCh := make(chan []byte, 100000)

  /*
   * The basic strategy is to subdivide the table among Segments, each of which itself is a
   * concurrently readable hash table. The map supports non-blocking reads and concurrent writes
   * across different segments.
   *
   * If a maximum size is specified, a best-effort bounding is performed per segment, using a

And in she went.

  Once more she found herself in the long hall, and close to the
little glass table.  `Now, I'll manage better this time,'
she said to herself, and began by taking the little golden key,
and unlocking the door that led into the garden.  Then she went
to work nibbling at the mushroom (she had kept a piece of it
in her pocket) till she was about a foot high:  then she walked down

  /*
   * The basic strategy is to subdivide the table among Segments, each of which itself is a
   * concurrently readable hash table. The map supports non-blocking reads and concurrent writes
   * across different segments.
   *
   * If a maximum size is specified, a best-effort bounding is performed per segment, using a

And in she went.

  Once more she found herself in the long hall, and close to the
little glass table.  `Now, I'll manage better this time,'
she said to herself, and began by taking the little golden key,
and unlocking the door that led into the garden.  Then she went
to work nibbling at the mushroom (she had kept a piece of it
in her pocket) till she was about a foot high:  then she walked down