MCPcopy Create free account
hub / github.com/cameron314/concurrentqueue / swap

Method swap

benchmarks/boost/array.hpp:165–168  ·  view source on GitHub ↗

swap (note: linear complexity)

Source from the content-addressed store, hash-verified

163
164 // swap (note: linear complexity)
165 void swap (array<T,N>& y) {
166 for (size_type i = 0; i < N; ++i)
167 boost::swap(elems[i],y.elems[i]);
168 }
169
170 // direct access to data (read-only)
171 const T* data() const { return elems; }

Callers 1

swapFunction · 0.45

Calls 1

swapFunction · 0.70

Tested by

no test coverage detected