Fixed flakiness in GetMostRecentlyAddedUserNodeForURLSkipsManagedNodes.

components/bookmarks/browser/bookmark_model_unittest.cc

 // Copyright 2014 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.
 
 #include "components/bookmarks/browser/bookmark_model.h"
 
 #include <set>
 #include <string>
 
 #include "base/base_paths.h"
@@ skipping 1155 matching lines @@
   // Having a managed node doesn't count.
   model_->AddURL(managed_parent, 0, title, url);
   EXPECT_TRUE(model_->GetMostRecentlyAddedUserNodeForURL(url) == NULL);
 
   // Now add a user node.
   const BookmarkNode* user = model_->AddURL(user_parent, 0, title, url);
   EXPECT_EQ(user, model_->GetMostRecentlyAddedUserNodeForURL(url));
 
   // Having a more recent managed node doesn't count either.
   const BookmarkNode* managed = model_->AddURL(managed_parent, 0, title, url);
-  EXPECT_GT(managed->date_added(), user->date_added());
+  EXPECT_GE(managed->date_added(), user->date_added());
   EXPECT_EQ(user, model_->GetMostRecentlyAddedUserNodeForURL(url));
 }
 
 TEST(BookmarkNodeTest, NodeMetaInfo) {
   GURL url;
   BookmarkNode node(url);
   EXPECT_FALSE(node.GetMetaInfoMap());
 
   EXPECT_TRUE(node.SetMetaInfo("key1", "value1"));
   std::string out_value;
@@ skipping 16 matching lines @@
   EXPECT_TRUE(node.DeleteMetaInfo("key2.subkey2.leaf"));
   EXPECT_FALSE(node.DeleteMetaInfo("key3"));
   EXPECT_FALSE(node.GetMetaInfo("key1", &out_value));
   EXPECT_FALSE(node.GetMetaInfo("key2.subkey1", &out_value));
   EXPECT_FALSE(node.GetMetaInfo("key2.subkey2", &out_value));
   EXPECT_FALSE(node.GetMetaInfo("key2.subkey2.leaf", &out_value));
   EXPECT_FALSE(node.GetMetaInfoMap());
 }
 
 }  // namespace