Small changes such as spacing and adding [in/out] identifiers after @params.

ppapi/cpp/rect.h

 // Copyright (c) 2011 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 PPAPI_CPP_RECT_H_
 #define PPAPI_CPP_RECT_H_
 
 #include "ppapi/c/pp_rect.h"
 #include "ppapi/cpp/point.h"
 #include "ppapi/cpp/size.h"
@@ skipping 281 matching lines @@
   ///
   /// @param[in] point A pointer to a <code>Point</code> representing the
   /// horizontal and vertical move distances.
   void Offset(const Point& point) {
     Offset(point.x(), point.y());
   }
 
   /// IsEmpty() determines if the area of a rectangle is zero. Returns true if
   /// the area of the rectangle is zero.
   ///
-  /// @return True if the area of the rectangle is zero.
+  /// @return true if the area of the rectangle is zero.
   bool IsEmpty() const {
     return rect_.size.width == 0 && rect_.size.height == 0;
   }
 
   /// Contains() determines if the point identified by point_x and point_y
   /// falls inside this rectangle. The point (x, y) is inside the rectangle,
   /// but the point (x + width, y + height) is not.
   ///
   /// @param[in] point_x An int32_t value representing a x value.
   /// @param[in] point_y An int32_t value representing a y value.
   ///
-  /// @return True if the point_x and point_y fall inside the rectangle.
+  /// @return true if the point_x and point_y fall inside the rectangle.
   bool Contains(int32_t point_x, int32_t point_y) const;
 
   /// Contains() determines if the specified point is contained by this
   /// rectangle.
   ///
   /// @param[in] point A pointer to a Point representing a 2D coordinate.
   ///
-  /// @return True if the point_x and point_y fall inside the rectangle.
+  /// @return true if the point_x and point_y fall inside the rectangle.
   bool Contains(const Point& point) const {
     return Contains(point.x(), point.y());
   }
 
   /// Contains() determines if this rectangle contains the specified rectangle.
   ///
   /// @param[in] rect A pointer to a <code>Rect</code>.
   ///
-  /// @return True if the rectangle fall inside this rectangle.
+  /// @return true if the rectangle fall inside this rectangle.
   bool Contains(const Rect& rect) const;
 
   /// Insersects() determines if this rectangle intersects the specified
   /// rectangle.
   ///
   /// @param[in] rect A pointer to a <code>Rect</code>.
   ///
-  /// @return True if the rectangle intersects  this rectangle.
+  /// @return true if the rectangle intersects  this rectangle.
   bool Intersects(const Rect& rect) const;
 
   /// Intersect() computes the intersection of this rectangle with the given
   /// rectangle.
   ///
   /// @param[in] rect A pointer to a <code>Rect</code>.
   ///
   /// @return A <code>Rect</code> representing the intersection.
   Rect Intersect(const Rect& rect) const;
 
@@ skipping 68 matching lines @@
 /// @param[in] rhs The <code>Rect</code> on the right-hand side of the
 /// equation.
 ///
 /// @return true if the given Rects are equal, otherwise false.
 inline bool operator!=(const pp::Rect& lhs, const pp::Rect& rhs) {
   return !(lhs == rhs);
 }
 
 #endif