Loading include/utils/KeyedVector.h +0 −7 Original line number Diff line number Diff line Loading @@ -97,13 +97,6 @@ private: SortedVector< key_value_pair_t<KEY, VALUE> > mVector; }; // KeyedVector<KEY, VALUE> can be trivially moved using memcpy() because its // underlying SortedVector can be trivially moved. template<typename KEY, typename VALUE> struct trait_trivial_move<KeyedVector<KEY, VALUE> > { enum { value = trait_trivial_move<SortedVector< key_value_pair_t<KEY, VALUE> > >::value }; }; // --------------------------------------------------------------------------- /** Loading include/utils/SortedVector.h +0 −4 Original line number Diff line number Diff line Loading @@ -133,10 +133,6 @@ protected: virtual int do_compare(const void* lhs, const void* rhs) const; }; // SortedVector<T> can be trivially moved using memcpy() because moving does not // require any change to the underlying SharedBuffer contents or reference count. template<typename T> struct trait_trivial_move<SortedVector<T> > { enum { value = true }; }; // --------------------------------------------------------------------------- // No user serviceable parts from here... // --------------------------------------------------------------------------- Loading include/utils/Vector.h +0 −4 Original line number Diff line number Diff line Loading @@ -207,10 +207,6 @@ protected: virtual void do_move_backward(void* dest, const void* from, size_t num) const; }; // Vector<T> can be trivially moved using memcpy() because moving does not // require any change to the underlying SharedBuffer contents or reference count. template<typename T> struct trait_trivial_move<Vector<T> > { enum { value = true }; }; // --------------------------------------------------------------------------- // No user serviceable parts from here... // --------------------------------------------------------------------------- Loading Loading
include/utils/KeyedVector.h +0 −7 Original line number Diff line number Diff line Loading @@ -97,13 +97,6 @@ private: SortedVector< key_value_pair_t<KEY, VALUE> > mVector; }; // KeyedVector<KEY, VALUE> can be trivially moved using memcpy() because its // underlying SortedVector can be trivially moved. template<typename KEY, typename VALUE> struct trait_trivial_move<KeyedVector<KEY, VALUE> > { enum { value = trait_trivial_move<SortedVector< key_value_pair_t<KEY, VALUE> > >::value }; }; // --------------------------------------------------------------------------- /** Loading
include/utils/SortedVector.h +0 −4 Original line number Diff line number Diff line Loading @@ -133,10 +133,6 @@ protected: virtual int do_compare(const void* lhs, const void* rhs) const; }; // SortedVector<T> can be trivially moved using memcpy() because moving does not // require any change to the underlying SharedBuffer contents or reference count. template<typename T> struct trait_trivial_move<SortedVector<T> > { enum { value = true }; }; // --------------------------------------------------------------------------- // No user serviceable parts from here... // --------------------------------------------------------------------------- Loading
include/utils/Vector.h +0 −4 Original line number Diff line number Diff line Loading @@ -207,10 +207,6 @@ protected: virtual void do_move_backward(void* dest, const void* from, size_t num) const; }; // Vector<T> can be trivially moved using memcpy() because moving does not // require any change to the underlying SharedBuffer contents or reference count. template<typename T> struct trait_trivial_move<Vector<T> > { enum { value = true }; }; // --------------------------------------------------------------------------- // No user serviceable parts from here... // --------------------------------------------------------------------------- Loading