(traces ...*Trace)
| 8 | ) |
| 9 | |
| 10 | func combineTraces(traces ...*Trace) *Trace { |
| 11 | if len(traces) == 1 { |
| 12 | return traces[0] |
| 13 | } |
| 14 | |
| 15 | c := NewCombiner() |
| 16 | for i := 0; i < len(traces); i++ { |
| 17 | c.ConsumeWithFinal(traces[i], i == len(traces)-1) |
| 18 | } |
| 19 | res, _, _ := c.Result() // for now ignore the connected return. see comment in walBlock.Iterator() |
| 20 | return res |
| 21 | } |
| 22 | |
| 23 | // Combiner combines multiple partial traces into one, deduping spans based on |
| 24 | // ID and kind. Note that it is destructive. There are design decisions for |
no test coverage detected