Fix incorrect usage of std::is_heap in blink::scheduler::IntrusiveHeap.

third_party/WebKit/Source/platform/scheduler/base/intrusive_heap.h

 // Copyright 2016 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 THIRD_PARTY_WEBKIT_SOURCE_PLATFORM_SCHEDULER_BASE_INTRUSIVE_HEAP_H_
 #define THIRD_PARTY_WEBKIT_SOURCE_PLATFORM_SCHEDULER_BASE_INTRUSIVE_HEAP_H_
 
 #include <algorithm>
 #include <vector>
 
@@ skipping 111 matching lines @@
   const T* end() const { return begin() + size_; }
 
  private:
   enum {
     // The majority of sets in the scheduler have 0-3 items in them (a few will
     // have perhaps up to 100), so this means we usually only have to allocate
     // memory once.
     kMinimumHeapSize = 4u
   };
 
+  friend class IntrusiveHeapTest;
+
   size_t MoveHole(size_t new_hole_pos, size_t old_hole_pos) {
     DCHECK_GT(new_hole_pos, 0u);
     DCHECK_LE(new_hole_pos, size_);
     DCHECK_GT(new_hole_pos, 0u);
     DCHECK_LE(new_hole_pos, size_);
     DCHECK_NE(old_hole_pos, new_hole_pos);
     nodes_[old_hole_pos] = std::move(nodes_[new_hole_pos]);
     nodes_[old_hole_pos].SetHeapHandle(HeapHandle(old_hole_pos));
     return new_hole_pos;
   }
 
   // Notionally creates a hole in the tree at |index|.
   void MakeHole(size_t index) {
     DCHECK_GT(index, 0u);
     DCHECK_LE(index, size_);
     nodes_[index].ClearHeapHandle();
   }
 
   void FillHole(size_t hole, T&& element) {
     DCHECK_GT(hole, 0u);
     DCHECK_LE(hole, size_);
     nodes_[hole] = std::move(element);
     nodes_[hole].SetHeapHandle(HeapHandle(hole));
     DCHECK(std::is_heap(begin(), end(), CompareNodes));
   }
 
-  static bool CompareNodes(const T& a, const T& b) { return b <= a; }
+  // is_heap requires a strict comparator.
+  static bool CompareNodes(const T& a, const T& b) { return !(a <= b); }
 
   // Moves the |hole| up the tree and when the right position has been found
   // |element| is moved in.
   void MoveHoleUpAndFillWithElement(size_t hole, T&& element) {
     DCHECK_GT(hole, 0u);
     DCHECK_LE(hole, size_);
     while (hole >= 2u) {
       size_t parent_pos = hole / 2;
       if (nodes_[parent_pos] <= element)
         break;
@@ skipping 46 matching lines @@
   }
 
   std::vector<T> nodes_;  // NOTE we use 1-based indexing
   size_t size_;
 };
 
 }  // namespace scheduler
 }  // namespace blink
 
 #endif  // THIRD_PARTY_WEBKIT_SOURCE_PLATFORM_SCHEDULER_BASE_INTRUSIVE_HEAP_H_