/*
* Copyright (c) 2014, 2019, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*
*/
#ifndef SHARE_JFR_LEAKPROFILER_SAMPLING_SAMPLEPRIORITYQUEUE_HPP
#define SHARE_JFR_LEAKPROFILER_SAMPLING_SAMPLEPRIORITYQUEUE_HPP
#include "memory/allocation.hpp"
class ObjectSample;
// Priority queue that keeps object samples ordered
// by the amount of allocation they span.
class SamplePriorityQueue : public CHeapObj<mtTracing> {
private:
ObjectSample** _items;
size_t _allocated_size;
int _count;
size_t _total;
void swap(int i, int j);
void moveDown(int index);
void moveUp(int index);
public:
SamplePriorityQueue(size_t size);
~SamplePriorityQueue();
void push(ObjectSample* sample);
ObjectSample* pop();
/**代码未完, 请加载全部代码(NowJava.com).**/