Cleanup namespace usage in Source/core/platform/[A-Z]*.h

Source/platform/PODRedBlackTree.h

 /*
  * Copyright (C) 2010 Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  *
  * 1.  Redistributions of source code must retain the above copyright
  *     notice, this list of conditions and the following disclaimer.
  * 2.  Redistributions in binary form must reproduce the above copyright
@@ skipping 26 matching lines @@
 // having its destructor called. This implementation internally
 // allocates storage in large chunks and does not call the destructor
 // on each object.
 //
 // Type T must supply a default constructor, a copy constructor, and
 // the "<" and "==" operators.
 //
 // In debug mode, printing of the data contained in the tree is
 // enabled. This requires the template specialization to be available:
 //
-//   template<> struct blink::ValueToString<T> {
+//   template<> struct ValueToString<T> {
 //       static String string(const T& t);
 //   };
 //
 // Note that when complex types are stored in this red/black tree, it
 // is possible that single invocations of the "<" and "==" operators
 // will be insufficient to describe the ordering of elements in the
 // tree during queries. As a concrete example, consider the case where
 // intervals are stored in the tree sorted by low endpoint. The "<"
 // operator on the Interval class only compares the low endpoint, but
 // the "==" operator takes into account the high endpoint as well.
@@ skipping 761 matching lines @@
     Node* m_root;
     bool m_needsFullOrderingComparisons;
 #ifndef NDEBUG
     bool m_verboseDebugging;
 #endif
 };
 
 } // namespace blink
 
 #endif // PODRedBlackTree_h