Fix move.h's to use a concrete RValue carrier object rather than hacking a RValue&.

base/memory/scoped_vector.h

 // Copyright (c) 2012 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #ifndef BASE_MEMORY_SCOPED_VECTOR_H_
 #define BASE_MEMORY_SCOPED_VECTOR_H_
 
 #include <vector>
 
 #include "base/basictypes.h"
@@ skipping 16 matching lines @@
   typedef typename std::vector<T*>::const_reference const_reference;
   typedef typename std::vector<T*>::value_type value_type;
   typedef typename std::vector<T*>::iterator iterator;
   typedef typename std::vector<T*>::const_iterator const_iterator;
   typedef typename std::vector<T*>::reverse_iterator reverse_iterator;
   typedef typename std::vector<T*>::const_reverse_iterator
       const_reverse_iterator;
 
   ScopedVector() {}
   ~ScopedVector() { clear(); }
-  ScopedVector(RValue& other) { swap(other); }
+  ScopedVector(RValue other) { swap(*other.object); }
 
-  ScopedVector& operator=(RValue& rhs) {
-    swap(rhs);
+  ScopedVector& operator=(RValue rhs) {
+    swap(*rhs.object);
     return *this;
   }
 
   T*& operator[](size_t index) { return v_[index]; }
   const T* operator[](size_t index) const { return v_[index]; }
 
   bool empty() const { return v_.empty(); }
   size_t size() const { return v_.size(); }
 
   reverse_iterator rbegin() { return v_.rbegin(); }
@@ skipping 64 matching lines @@
   // Like |erase()|, but doesn't delete the elements in [first, last).
   iterator weak_erase(iterator first, iterator last) {
     return v_.erase(first, last);
   }
 
  private:
   std::vector<T*> v_;
 };
 
 #endif  // BASE_MEMORY_SCOPED_VECTOR_H_