/Users/fpy/titan-1-5-MBARI/Mers/Generators/BFIG/BFIGImplicantHeap.h

// BFIGImplicantHeap.h: interface for the BFIGImplicantHeap class.
//
// Copyright (c) 2002           Model-based Embedded and Robotic Systems Group
// All Rights Reserved          Massachusetts Institute of Technology
//
// This software is provided as is. Model-based Embedded and Robotic Systems
// (MERS) group does not assume any responsibility.
//
// Author:                      Paul H. Elliott
// Organization:        Model-based Embedded and Robotic Systems Group
//                                      Massachusetts Institute of Technology
//
// A heap that stores Implicants in best first order.
//

#if !defined(AFX_BFIGIMPLICANTHEAP_H__7CC40E22_8CA3_4DCD_ABE4_3E86F956A0FE__INCLUDED_)
#define AFX_BFIGIMPLICANTHEAP_H__7CC40E22_8CA3_4DCD_ABE4_3E86F956A0FE__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000

#include <Mers/Utils/Containers/DynamicHeap.h>

namespace Mers {
        namespace Generators {
                namespace BFIG {

                        class BFIGImplicant;

                        class BFIGImplicantHeap : public Mers::Utils::Containers::DynamicHeap
                        {
                        public:
                                typedef BFIGImplicant HeapElement;

                                //-----------------------------------------
                                // Constructors
                                //-----------------------------------------

                                BFIGImplicantHeap(bool greatestOnTop, double maximumCost, bool owner);

                                BFIGImplicantHeap(bool greatestOnTop, bool owner);

                                //-----------------------------------------
                                // Destructors
                                //-----------------------------------------

                                virtual ~BFIGImplicantHeap();

                                //-----------------------------------------
                                // Functions
                                //-----------------------------------------

                                int insert(HeapElement * element);

                                int peekFirst(HeapElement * &element);
                                int getFirst(HeapElement * &element);

                                HeapElement * &operator[](int elementIndex)
                                {
                                        return (HeapElement * &) DynamicHeap::operator[](elementIndex); 
                                }
                                HeapElement * &operator[](unsigned int elementIndex)
                                {
                                        return (HeapElement * &) DynamicHeap::operator[](elementIndex); 
                                }
                                HeapElement const * &operator[](int elementIndex) const
                                {
                                        return (HeapElement const * &) DynamicHeap::operator[](elementIndex);   
                                }
                                HeapElement const * &operator[](unsigned int elementIndex) const
                                {
                                        return (HeapElement const * &) DynamicHeap::operator[](elementIndex);   
                                }

                        protected:
                                //-----------------------------------------
                                // Functions
                                //-----------------------------------------
#ifndef EMBEDDED

                                virtual void printElement(std::ostream &out, void const * element) const;
#endif

                                virtual void deleteElement(void * element) const;
                                virtual void * newElement(void const * element) const;

                                virtual bool greaterThan(void const * e1, void const * e2) const;
                                virtual bool lessThan(void const * e1, void const * e2) const;

                                //-----------------------------------------
                                // Data
                                //-----------------------------------------

                                const bool mPruneByCost;

                                const double mMaximumCost;
                        };
                }
        }
}

#endif // !defined(AFX_BFIGIMPLICANTHEAP_H__7CC40E22_8CA3_4DCD_ABE4_3E86F956A0FE__INCLUDED_)

---