A span represents a single timed event within a trace. Spans can be
nested and form a trace tree. Often, a trace contains a root span that
describes the end-to-end latency of an operation and, optionally, one or
more subspans for its suboperations. Spans do not need to be contiguous.
There may be gaps between spans in a trace.
Distinguishes between spans generated in a particular context.
For example, two spans with the same name may be distinguished
using RPC_CLIENT and RPC_SERVER to identify queueing
latency associated with the span.
Start time of the span in nanoseconds from the UNIX epoch.
ID of the parent span, if any. Optional.
Classes
LabelsEntry
API documentation for trace_v1.types.TraceSpan.LabelsEntry class.
