Pure pedantry: Replace all ".size() == 0" with ".empty()".

o3d/core/cross/gpu2d/interval_tree_test.cc

 /*
  * Copyright 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:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
@@ skipping 158 matching lines @@
   // Churn the tree's contents.
   // First remove half of the elements in random order.
   for (int i = 0; i < tree_size / 2; i++) {
     int idx = NextRandom(added_elements.size());
     tree.Insert(added_elements[idx]);
     EXPECT_TRUE(tree.Verify()) << "Test failed for seed " << seed;
     added_elements.erase(added_elements.begin() + idx);
   }
   // Now randomly add or remove elements.
   for (int i = 0; i < 2 * tree_size; i++) {
     bool add = false;

[Peter Kasting, 2011/03/02 00:02:42]

Nit: Eliminate |add| and condense to:

    if (added_elements.empty() ||
        (!removed_elements.empty() && (NextRandom(2) == 1))) {
      ...
    } else {
      ...

-    if (added_elements.size() == 0) {
+    if (added_elements.empty()) {
       add = true;
-    } else if (removed_elements.size() == 0) {
+    } else if (removed_elements.empty()) {
       add = false;
     } else {
       add = (NextRandom(2) == 1);
     }
     if (add) {
       int idx = NextRandom(removed_elements.size());
       tree.Insert(removed_elements[idx]);
       added_elements.push_back(removed_elements[idx]);
       removed_elements.erase(removed_elements.begin() + idx);
     } else {
@@ skipping 13 matching lines @@
   InsertionAndDeletionTest((unsigned) 13972, 100);
 }
 
 TEST(IntervalTreeTest, TestRandomDeletionAndInsertion) {
   InsertionAndDeletionTest((unsigned) GenerateSeed(), 1000);
 }
 
 }  // namespace gpu2d
 }  // namespace o3d