(elements []*cachedThunk)
| 302 | } |
| 303 | |
| 304 | func makeValueArray(elements []*cachedThunk) *valueArray { |
| 305 | // We don't want to keep a bigger array than necessary |
| 306 | // so we create a new one with minimal capacity |
| 307 | var arrayElems []*cachedThunk |
| 308 | if len(elements) == cap(elements) { |
| 309 | arrayElems = elements |
| 310 | } else { |
| 311 | arrayElems = make([]*cachedThunk, len(elements)) |
| 312 | copy(arrayElems, elements) |
| 313 | } |
| 314 | return &valueArray{ |
| 315 | elements: arrayElems, |
| 316 | } |
| 317 | } |
| 318 | |
| 319 | func concatArrays(a, b *valueArray) *valueArray { |
| 320 | result := make([]*cachedThunk, 0, len(a.elements)+len(b.elements)) |
no outgoing calls
no test coverage detected
searching dependent graphs…