mirror of
https://github.com/hanzoai/telemetry.git
synced 2026-10-30 20:01:49 +00:00
This is a huge PR that does not touch any of the critical logic "marshaling/unmarshaling" of the pdata. We have e2e tests with the go official generated protobufs to ensure nothing breaks. The easy way to review this is to only look at what change publicly in "pdata/pcommon", "pdata/plog", "pdata/ptrace", "pdata/pmetric", "pdata/pprofile", "pdata/xpdata". This PR also switches the xpada request to use the same generating mechanism as pdatagen. **Binary size before:** ``` 42246018 bin/otelcorecol_darwin_arm64 ``` **Binary size after:** ``` 40709202 bin/otelcorecol_darwin_arm64 ``` Signed-off-by: Bogdan Drutu <[email protected]>
164 lines
4.6 KiB
Go
164 lines
4.6 KiB
Go
// Copyright The OpenTelemetry Authors
|
|
// SPDX-License-Identifier: Apache-2.0
|
|
|
|
// Code generated by "internal/cmd/pdatagen/main.go". DO NOT EDIT.
|
|
// To regenerate this file run "make genpdata".
|
|
|
|
package ptrace
|
|
|
|
import (
|
|
"iter"
|
|
"sort"
|
|
|
|
"go.opentelemetry.io/collector/pdata/internal"
|
|
)
|
|
|
|
// SpanLinkSlice logically represents a slice of SpanLink.
|
|
//
|
|
// This is a reference type. If passed by value and callee modifies it, the
|
|
// caller will see the modification.
|
|
//
|
|
// Must use NewSpanLinkSlice function to create new instances.
|
|
// Important: zero-initialized instance is not valid for use.
|
|
type SpanLinkSlice struct {
|
|
orig *[]*internal.SpanLink
|
|
state *internal.State
|
|
}
|
|
|
|
func newSpanLinkSlice(orig *[]*internal.SpanLink, state *internal.State) SpanLinkSlice {
|
|
return SpanLinkSlice{orig: orig, state: state}
|
|
}
|
|
|
|
// NewSpanLinkSlice creates a SpanLinkSliceWrapper with 0 elements.
|
|
// Can use "EnsureCapacity" to initialize with a given capacity.
|
|
func NewSpanLinkSlice() SpanLinkSlice {
|
|
orig := []*internal.SpanLink(nil)
|
|
return newSpanLinkSlice(&orig, internal.NewState())
|
|
}
|
|
|
|
// Len returns the number of elements in the slice.
|
|
//
|
|
// Returns "0" for a newly instance created with "NewSpanLinkSlice()".
|
|
func (es SpanLinkSlice) Len() int {
|
|
return len(*es.orig)
|
|
}
|
|
|
|
// At returns the element at the given index.
|
|
//
|
|
// This function is used mostly for iterating over all the values in the slice:
|
|
//
|
|
// for i := 0; i < es.Len(); i++ {
|
|
// e := es.At(i)
|
|
// ... // Do something with the element
|
|
// }
|
|
func (es SpanLinkSlice) At(i int) SpanLink {
|
|
return newSpanLink((*es.orig)[i], es.state)
|
|
}
|
|
|
|
// All returns an iterator over index-value pairs in the slice.
|
|
//
|
|
// for i, v := range es.All() {
|
|
// ... // Do something with index-value pair
|
|
// }
|
|
func (es SpanLinkSlice) All() iter.Seq2[int, SpanLink] {
|
|
return func(yield func(int, SpanLink) bool) {
|
|
for i := 0; i < es.Len(); i++ {
|
|
if !yield(i, es.At(i)) {
|
|
return
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// EnsureCapacity is an operation that ensures the slice has at least the specified capacity.
|
|
// 1. If the newCap <= cap then no change in capacity.
|
|
// 2. If the newCap > cap then the slice capacity will be expanded to equal newCap.
|
|
//
|
|
// Here is how a new SpanLinkSlice can be initialized:
|
|
//
|
|
// es := NewSpanLinkSlice()
|
|
// es.EnsureCapacity(4)
|
|
// for i := 0; i < 4; i++ {
|
|
// e := es.AppendEmpty()
|
|
// // Here should set all the values for e.
|
|
// }
|
|
func (es SpanLinkSlice) EnsureCapacity(newCap int) {
|
|
es.state.AssertMutable()
|
|
oldCap := cap(*es.orig)
|
|
if newCap <= oldCap {
|
|
return
|
|
}
|
|
|
|
newOrig := make([]*internal.SpanLink, len(*es.orig), newCap)
|
|
copy(newOrig, *es.orig)
|
|
*es.orig = newOrig
|
|
}
|
|
|
|
// AppendEmpty will append to the end of the slice an empty SpanLink.
|
|
// It returns the newly added SpanLink.
|
|
func (es SpanLinkSlice) AppendEmpty() SpanLink {
|
|
es.state.AssertMutable()
|
|
*es.orig = append(*es.orig, internal.NewSpanLink())
|
|
return es.At(es.Len() - 1)
|
|
}
|
|
|
|
// MoveAndAppendTo moves all elements from the current slice and appends them to the dest.
|
|
// The current slice will be cleared.
|
|
func (es SpanLinkSlice) MoveAndAppendTo(dest SpanLinkSlice) {
|
|
es.state.AssertMutable()
|
|
dest.state.AssertMutable()
|
|
// If they point to the same data, they are the same, nothing to do.
|
|
if es.orig == dest.orig {
|
|
return
|
|
}
|
|
if *dest.orig == nil {
|
|
// We can simply move the entire vector and avoid any allocations.
|
|
*dest.orig = *es.orig
|
|
} else {
|
|
*dest.orig = append(*dest.orig, *es.orig...)
|
|
}
|
|
*es.orig = nil
|
|
}
|
|
|
|
// RemoveIf calls f sequentially for each element present in the slice.
|
|
// If f returns true, the element is removed from the slice.
|
|
func (es SpanLinkSlice) RemoveIf(f func(SpanLink) bool) {
|
|
es.state.AssertMutable()
|
|
newLen := 0
|
|
for i := 0; i < len(*es.orig); i++ {
|
|
if f(es.At(i)) {
|
|
internal.DeleteSpanLink((*es.orig)[i], true)
|
|
(*es.orig)[i] = nil
|
|
|
|
continue
|
|
}
|
|
if newLen == i {
|
|
// Nothing to move, element is at the right place.
|
|
newLen++
|
|
continue
|
|
}
|
|
(*es.orig)[newLen] = (*es.orig)[i]
|
|
// Cannot delete here since we just move the data(or pointer to data) to a different position in the slice.
|
|
(*es.orig)[i] = nil
|
|
newLen++
|
|
}
|
|
*es.orig = (*es.orig)[:newLen]
|
|
}
|
|
|
|
// CopyTo copies all elements from the current slice overriding the destination.
|
|
func (es SpanLinkSlice) CopyTo(dest SpanLinkSlice) {
|
|
dest.state.AssertMutable()
|
|
if es.orig == dest.orig {
|
|
return
|
|
}
|
|
*dest.orig = internal.CopySpanLinkPtrSlice(*dest.orig, *es.orig)
|
|
}
|
|
|
|
// Sort sorts the SpanLink elements within SpanLinkSlice given the
|
|
// provided less function so that two instances of SpanLinkSlice
|
|
// can be compared.
|
|
func (es SpanLinkSlice) Sort(less func(a, b SpanLink) bool) {
|
|
es.state.AssertMutable()
|
|
sort.SliceStable(*es.orig, func(i, j int) bool { return less(es.At(i), es.At(j)) })
|
|
}
|