Head

GCC Code Coverage Report

Directory:	.		Exec	Total	Coverage
File:	src/util/bin_heap.h	Lines:	163	165	98.8 %
Date:	2021-11-06	Branches:	123	564	21.8 %


/******************************************************************************
 * Top contributors (to current version):
 *   Tim King, Morgan Deters, Mathias Preiner
 *
 * This file is part of the cvc5 project.
 *
 * Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
 * in the top-level source directory and their institutional affiliations.
 * All rights reserved.  See the file COPYING in the top-level source
 * directory for licensing information.
 * ****************************************************************************
 *
 * An implementation of a binary heap
 *
 * Attempts to roughly follow the contract of Boost's d_ary_heap.
 * (http://www.boost.org/doc/libs/1_49_0/doc/html/boost/heap/d_ary_heap.html)
 * Also attempts to generalize ext/pd_bs/priority_queue.
 * (http://gcc.gnu.org/onlinedocs/libstdc++/ext/pb_ds/priority_queue.html)
 */

#include "cvc5_private.h"

#ifndef CVC5__BIN_HEAP_H
#define CVC5__BIN_HEAP_H

#include <limits>
#include <functional>

#include "base/check.h"
#include "base/exception.h"

namespace cvc5 {

/**
 * BinaryHeap that orders its elements greatest-first (i.e., in the opposite
 * direction of the provided comparator).  Update of elements is permitted
 * via handles, which are not invalidated by mutation (pushes and pops etc.).
 * Handles are invalidted when their element is no longer a member of the
 * heap.  Iteration over elements is supported but iteration is unsorted and
 * iterators are immutable.
 */
template <class Elem, class CmpFcn = std::less<Elem> >
class BinaryHeap {
private:
  typedef Elem T;
  struct HElement;

  typedef std::vector<HElement*> ElementVector;

  struct HElement {
    HElement(size_t pos, const T& elem): d_pos(pos), d_elem(elem) {}
    size_t d_pos;
    T d_elem;
  };/* struct HElement */

  /** A 0 indexed binary heap. */
  ElementVector d_heap;

  /** The comparator. */
  CmpFcn d_cmp;

  // disallow copy and assignment
  BinaryHeap(const BinaryHeap&) = delete;
  BinaryHeap& operator=(const BinaryHeap&) = delete;

public:
  BinaryHeap(const CmpFcn& c = CmpFcn())
    : d_heap()
    , d_cmp(c)
  {}

  ~BinaryHeap(){
    clear();
  }

  class handle {
  private:
    HElement* d_pointer;
    handle(HElement* p) : d_pointer(p){}
    friend class BinaryHeap;
  public:
    handle() : d_pointer(NULL) {}
    const T& operator*() const {
      Assert(d_pointer != NULL);
      return d_pointer->d_elem;
    }

    bool operator==(const handle& h) const {
      return d_pointer == h.d_pointer;
    }

    bool operator!=(const handle& h) const {
      return d_pointer != h.d_pointer;
    }

  }; /* BinaryHeap<>::handle */

  class const_iterator {
  public:
    /* The following types are required by trait std::iterator_traits */

    /** Iterator tag */
    using iterator_category = std::forward_iterator_tag;

    /** The type of the item */
    using value_type = Elem;

    /** The pointer type of the item */
    using pointer = const Elem*;

    /** The reference type of the item */
    using reference = const Elem&;

    /** The type returned when two iterators are subtracted */
    using difference_type = std::ptrdiff_t;

    /* End of std::iterator_traits required types */

  private:
    typename ElementVector::const_iterator d_iter;
    friend class BinaryHeap;
    const_iterator(const typename ElementVector::const_iterator& iter)
      : d_iter(iter)
    {}
  public:
    const_iterator(){}
    inline bool operator==(const const_iterator& ci) const{
      return d_iter == ci.d_iter;
    }
    inline bool operator!=(const const_iterator& ci) const{
      return d_iter != ci.d_iter;
    }
    inline const_iterator& operator++(){
      ++d_iter;
      return *this;
    }
    inline const_iterator operator++(int){
      const_iterator i = *this;
      ++d_iter;
      return i;
    }
    inline const T& operator*() const{
      const HElement* he = *d_iter;
      return he->d_elem;
    }

  };/* BinaryHeap<>::const_iterator */

  typedef const_iterator iterator;

  inline size_t size() const { return d_heap.size(); }
  inline bool empty() const { return d_heap.empty(); }

  inline const_iterator begin() const {
    return const_iterator(d_heap.begin());
  }

  inline const_iterator end() const {
    return const_iterator(d_heap.end());
  }

  void clear(){
    typename ElementVector::iterator i=d_heap.begin(), iend=d_heap.end();
    for(; i!=iend; ++i){
      HElement* he = *i;
      delete he;
    }
    d_heap.clear();
  }

  void swap(BinaryHeap& heap){
    std::swap(d_heap, heap.d_heap);
    std::swap(d_cmp, heap.d_cmp);
  }

  handle push(const T& toAdded){
    Assert(size() < MAX_SIZE);
    HElement* he = new HElement(size(), toAdded);
    d_heap.push_back(he);
    up_heap(he);
    return handle(he);
  }

  void erase(handle h){
    Assert(!empty());
    Assert(debugHandle(h));

    HElement* he = h.d_pointer;
    size_t pos = he->d_pos;
    if(pos == root()){
      // the top element can be efficiently removed by pop
      pop();
    }else if(pos == last()){
      // the last element can be safely removed
      d_heap.pop_back();
      delete he;
    }else{
      // This corresponds to
      // 1) swapping the elements at pos with the element at last:
      // 2) deleting the new last element
      // 3) updating the position of the new element at pos
      swapIndices(pos, last());
      d_heap.pop_back();
      delete he;
      update(handle(d_heap[pos]));
    }
  }

  void pop(){
    Assert(!empty());
    swapIndices(root(), last());
    HElement* b = d_heap.back();
    d_heap.pop_back();
    delete b;

    if(!empty()){
      down_heap(d_heap.front());
    }
  }

  const T& top() const {
    Assert(!empty());
    return (d_heap.front())->d_elem;
  }

private:
  void update(handle h){
    Assert(!empty());
    Assert(debugHandle(h));

    // The relationship between h and its parent, left and right has become unknown.
    // But it is assumed that parent <= left, and parent <= right still hold.
    // Figure out whether to up_heap or down_heap.

    Assert(!empty());
    HElement* he = h.d_pointer;

    size_t pos = he->d_pos;
    if(pos == root()){
      // no parent
      down_heap(he);
    }else{
      size_t par = parent(pos);
      HElement* at_parent = d_heap[par];
      if(gt(he->d_elem, at_parent->d_elem)){
        // he > parent
        up_heap(he);
      }else{
        down_heap(he);
      }
    }
  }

public:
  void update(handle h, const T& val){
    Assert(!empty());
    Assert(debugHandle(h));
    h.d_pointer->d_elem = val;
    update(h);
  }

  /** (std::numeric_limits<size_t>::max()-2)/2; */
  static const size_t MAX_SIZE;

private:
  inline bool gt(const T& a, const T& b) const{
    // cmp acts like an operator<
    return d_cmp(b, a);
  }

  inline bool lt(const T& a, const T& b) const{
    return d_cmp(a, b);
  }

  inline static size_t parent(size_t p){
    Assert(p != root());
    return (p-1)/2;
  }
  inline static size_t right(size_t p){ return 2*p+2; }
  inline static size_t left(size_t p){ return 2*p+1; }
  inline static size_t root(){ return 0; }
  inline size_t last() const{
    Assert(!empty());
    return size() - 1;
  }

  inline void swapIndices(size_t i, size_t j){
    HElement* at_i = d_heap[i];
    HElement* at_j = d_heap[j];
    swap(i,j,at_i,at_j);
  }

  inline void swapPointers(HElement* at_i, HElement* at_j){
    // still works if at_i == at_j
    size_t i = at_i->d_pos;
    size_t j = at_j->d_pos;
    swap(i,j,at_i,at_j);
  }

  inline void swap(size_t i, size_t j, HElement* at_i, HElement* at_j){
    // still works if i == j
    Assert(i == at_i->d_pos);
    Assert(j == at_j->d_pos);
    d_heap[i] = at_j;
    d_heap[j] = at_i;
    at_i->d_pos = j;
    at_j->d_pos = i;
  }

  void up_heap(HElement* he){
    const size_t& curr = he->d_pos;
    // The value of curr changes implicitly during swap operations.
    while(curr != root()){
      // he->d_elem > parent
      size_t par = parent(curr);
      HElement* at_parent = d_heap[par];
      if(gt(he->d_elem, at_parent->d_elem)){
        swap(curr, par, he, at_parent);
      }else{
        break;
      }
    }
  }

  void down_heap(HElement* he){
    const size_t& curr = he->d_pos;
    // The value of curr changes implicitly during swap operations.
    size_t N = size();
    size_t r, l;

    while((r = right(curr)) < N){
      l = left(curr);

      // if at_left == at_right, favor left
      HElement* at_left = d_heap[l];
      HElement* at_right = d_heap[r];
      if(lt(he->d_elem, at_left->d_elem)){
        // he < at_left
        if(lt(at_left->d_elem, at_right->d_elem)){
          // he < at_left < at_right
          swap(curr, r, he, at_right);
        }else{
          //       he <  at_left
          // at_right <= at_left
          swap(curr, l, he, at_left);
        }
      }else{
        // at_left <= he
        if(lt(he->d_elem, at_right->d_elem)){
          // at_left <= he < at_right
          swap(curr, r, he, at_right);
        }else{
          // at_left  <= he
          // at_right <= he
          break;
        }
      }
    }
    l = left(curr);
    if(r >= N && l < N){
      // there is a left but not a right
      HElement* at_left = d_heap[l];
      if(lt(he->d_elem, at_left->d_elem)){
        // he < at_left
        swap(curr, l, he, at_left);
      }
    }
  }

  bool debugHandle(handle h) const{
    HElement* he = h.d_pointer;
    if( he == NULL ){
      return true;
    }else if(he->d_pos >= size()){
      return false;
    }else{
      return he == d_heap[he->d_pos];
    }
  }

}; /* class BinaryHeap<> */

template <class Elem, class CmpFcn>
const size_t BinaryHeap<Elem,CmpFcn>::MAX_SIZE = (std::numeric_limits<size_t>::max()-2)/2;

}  // namespace cvc5

#endif /* CVC5__BIN_HEAP_H */


Generated by: GCOVR (Version 3.2)

Line	Exec	Source
1		/******************************************************************************
2		* Top contributors (to current version):
3		* Tim King, Morgan Deters, Mathias Preiner
4		*
5		* This file is part of the cvc5 project.
6		*
7		* Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
8		* in the top-level source directory and their institutional affiliations.
9		* All rights reserved. See the file COPYING in the top-level source
10		* directory for licensing information.
11		* ****************************************************************************
12		*
13		* An implementation of a binary heap
14		*
15		* Attempts to roughly follow the contract of Boost's d_ary_heap.
16		* (http://www.boost.org/doc/libs/1_49_0/doc/html/boost/heap/d_ary_heap.html)
17		* Also attempts to generalize ext/pd_bs/priority_queue.
18		* (http://gcc.gnu.org/onlinedocs/libstdc++/ext/pb_ds/priority_queue.html)
19		*/
20
21		#include "cvc5_private.h"
22
23		#ifndef CVC5__BIN_HEAP_H
24		#define CVC5__BIN_HEAP_H
25
26		#include <limits>
27		#include <functional>
28
29		#include "base/check.h"
30		#include "base/exception.h"
31
32		namespace cvc5 {
33
34		/**
35		* BinaryHeap that orders its elements greatest-first (i.e., in the opposite
36		* direction of the provided comparator). Update of elements is permitted
37		* via handles, which are not invalidated by mutation (pushes and pops etc.).
38		* Handles are invalidted when their element is no longer a member of the
39		* heap. Iteration over elements is supported but iteration is unsorted and
40		* iterators are immutable.
41		*/
42		template <class Elem, class CmpFcn = std::less<Elem> >
43		class BinaryHeap {
44		private:
45		typedef Elem T;
46		struct HElement;
47
48		typedef std::vector<HElement*> ElementVector;
49
50		struct HElement {
51	745707	HElement(size_t pos, const T& elem): d_pos(pos), d_elem(elem) {}
52		size_t d_pos;
53		T d_elem;
54		};/* struct HElement */
55
56		/** A 0 indexed binary heap. */
57		ElementVector d_heap;
58
59		/** The comparator. */
60		CmpFcn d_cmp;
61
62		// disallow copy and assignment
63		BinaryHeap(const BinaryHeap&) = delete;
64		BinaryHeap& operator=(const BinaryHeap&) = delete;
65
66		public:
67	222136	BinaryHeap(const CmpFcn& c = CmpFcn())
68		: d_heap()
69	222136	, d_cmp(c)
70	222136	{}
71
72	222131	~BinaryHeap(){
73	222131	clear();
74	222131	}
75
76		class handle {
77		private:
78		HElement* d_pointer;
79	846267	handle(HElement* p) : d_pointer(p){}
80		friend class BinaryHeap;
81		public:
82	1173601	handle() : d_pointer(NULL) {}
83	60022	const T& operator*() const {
84	60022	Assert(d_pointer != NULL);
85	60022	return d_pointer->d_elem;
86		}
87
88	2	bool operator==(const handle& h) const {
89	2	return d_pointer == h.d_pointer;
90		}
91
92	12	bool operator!=(const handle& h) const {
93	12	return d_pointer != h.d_pointer;
94		}
95
96		}; /* BinaryHeap<>::handle */
97
98		class const_iterator {
99		public:
100		/* The following types are required by trait std::iterator_traits */
101
102		/** Iterator tag */
103		using iterator_category = std::forward_iterator_tag;
104
105		/** The type of the item */
106		using value_type = Elem;
107
108		/** The pointer type of the item */
109		using pointer = const Elem*;
110
111		/** The reference type of the item */
112		using reference = const Elem&;
113
114		/** The type returned when two iterators are subtracted */
115		using difference_type = std::ptrdiff_t;
116
117		/* End of std::iterator_traits required types */
118
119		private:
120		typename ElementVector::const_iterator d_iter;
121		friend class BinaryHeap;
122	413768	const_iterator(const typename ElementVector::const_iterator& iter)
123	413768	: d_iter(iter)
124	413768	{}
125		public:
126		const_iterator(){}
127	6	inline bool operator==(const const_iterator& ci) const{
128	6	return d_iter == ci.d_iter;
129		}
130	421970	inline bool operator!=(const const_iterator& ci) const{
131	421970	return d_iter != ci.d_iter;
132		}
133	215092	inline const_iterator& operator++(){
134	215092	++d_iter;
135	215092	return *this;
136		}
137	8	inline const_iterator operator++(int){
138	8	const_iterator i = *this;
139	8	++d_iter;
140	8	return i;
141		}
142	215110	inline const T& operator*() const{
143	215110	const HElement* he = *d_iter;
144	215110	return he->d_elem;
145		}
146
147		};/* BinaryHeap<>::const_iterator */
148
149		typedef const_iterator iterator;
150
151	3154013	inline size_t size() const { return d_heap.size(); }
152	3135712	inline bool empty() const { return d_heap.empty(); }
153
154	206884	inline const_iterator begin() const {
155	206884	return const_iterator(d_heap.begin());
156		}
157
158	206884	inline const_iterator end() const {
159	206884	return const_iterator(d_heap.end());
160		}
161
162	1257343	void clear(){
163	1257343	typename ElementVector::iterator i=d_heap.begin(), iend=d_heap.end();
164	1946423	for(; i!=iend; ++i){
165	344540	HElement* he = *i;
166	344540	delete he;
167		}
168	1257343	d_heap.clear();
169	1257343	}
170
171	206860	void swap(BinaryHeap& heap){
172	206860	std::swap(d_heap, heap.d_heap);
173	206860	std::swap(d_cmp, heap.d_cmp);
174	206860	}
175
176	745707	handle push(const T& toAdded){
177	745707	Assert(size() < MAX_SIZE);
178	745707	HElement* he = new HElement(size(), toAdded);
179	745707	d_heap.push_back(he);
180	745707	up_heap(he);
181	745707	return handle(he);
182		}
183
184	377157	void erase(handle h){
185	377157	Assert(!empty());
186	377157	Assert(debugHandle(h));
187
188	377157	HElement* he = h.d_pointer;
189	377157	size_t pos = he->d_pos;
190	377157	if(pos == root()){
191		// the top element can be efficiently removed by pop
192	235833	pop();
193	141324	}else if(pos == last()){
194		// the last element can be safely removed
195	40764	d_heap.pop_back();
196	40764	delete he;
197		}else{
198		// This corresponds to
199		// 1) swapping the elements at pos with the element at last:
200		// 2) deleting the new last element
201		// 3) updating the position of the new element at pos
202	100560	swapIndices(pos, last());
203	100560	d_heap.pop_back();
204	100560	delete he;
205	100560	update(handle(d_heap[pos]));
206		}
207	377157	}
208
209	259843	void pop(){
210	259843	Assert(!empty());
211	259843	swapIndices(root(), last());
212	259843	HElement* b = d_heap.back();
213	259843	d_heap.pop_back();
214	259843	delete b;
215
216	259843	if(!empty()){
217	159605	down_heap(d_heap.front());
218		}
219	259843	}
220
221	301348	const T& top() const {
222	301348	Assert(!empty());
223	301348	return (d_heap.front())->d_elem;
224		}
225
226		private:
227	244761	void update(handle h){
228	244761	Assert(!empty());
229	244761	Assert(debugHandle(h));
230
231		// The relationship between h and its parent, left and right has become unknown.
232		// But it is assumed that parent <= left, and parent <= right still hold.
233		// Figure out whether to up_heap or down_heap.
234
235	244761	Assert(!empty());
236	244761	HElement* he = h.d_pointer;
237
238	244761	size_t pos = he->d_pos;
239	244761	if(pos == root()){
240		// no parent
241	6007	down_heap(he);
242		}else{
243	238754	size_t par = parent(pos);
244	238754	HElement* at_parent = d_heap[par];
245	238754	if(gt(he->d_elem, at_parent->d_elem)){
246		// he > parent
247	31239	up_heap(he);
248		}else{
249	207515	down_heap(he);
250		}
251		}
252	244761	}
253
254		public:
255	144201	void update(handle h, const T& val){
256	144201	Assert(!empty());
257	144201	Assert(debugHandle(h));
258	144201	h.d_pointer->d_elem = val;
259	144201	update(h);
260	144201	}
261
262		/** (std::numeric_limits<size_t>::max()-2)/2; */
263		static const size_t MAX_SIZE;
264
265		private:
266	1089335	inline bool gt(const T& a, const T& b) const{
267		// cmp acts like an operator<
268	1089335	return d_cmp(b, a);
269		}
270
271	1060449	inline bool lt(const T& a, const T& b) const{
272	1060449	return d_cmp(a, b);
273		}
274
275	1089335	inline static size_t parent(size_t p){
276	1089335	Assert(p != root());
277	1089335	return (p-1)/2;
278		}
279	812923	inline static size_t right(size_t p){ return 2*p+2; }
280	876219	inline static size_t left(size_t p){ return 2*p+1; }
281	3209392	inline static size_t root(){ return 0; }
282	501727	inline size_t last() const{
283	501727	Assert(!empty());
284	501727	return size() - 1;
285		}
286
287	360403	inline void swapIndices(size_t i, size_t j){
288	360403	HElement* at_i = d_heap[i];
289	360403	HElement* at_j = d_heap[j];
290	360403	swap(i,j,at_i,at_j);
291	360403	}
292
293		inline void swapPointers(HElement* at_i, HElement* at_j){
294		// still works if at_i == at_j
295		size_t i = at_i->d_pos;
296		size_t j = at_j->d_pos;
297		swap(i,j,at_i,at_j);
298		}
299
300	1280463	inline void swap(size_t i, size_t j, HElement* at_i, HElement* at_j){
301		// still works if i == j
302	1280463	Assert(i == at_i->d_pos);
303	1280463	Assert(j == at_j->d_pos);
304	1280463	d_heap[i] = at_j;
305	1280463	d_heap[j] = at_i;
306	1280463	at_i->d_pos = j;
307	1280463	at_j->d_pos = i;
308	1280463	}
309
310	776946	void up_heap(HElement* he){
311	776946	const size_t& curr = he->d_pos;
312		// The value of curr changes implicitly during swap operations.
313	1699646	while(curr != root()){
314		// he->d_elem > parent
315	850581	size_t par = parent(curr);
316	850581	HElement* at_parent = d_heap[par];
317	850581	if(gt(he->d_elem, at_parent->d_elem)){
318	461350	swap(curr, par, he, at_parent);
319		}else{
320	389231	break;
321		}
322		}
323	776946	}
324
325	373127	void down_heap(HElement* he){
326	373127	const size_t& curr = he->d_pos;
327		// The value of curr changes implicitly during swap operations.
328	373127	size_t N = size();
329		size_t r, l;
330
331	1252719	while((r = right(curr)) < N){
332	503092	l = left(curr);
333
334		// if at_left == at_right, favor left
335	503092	HElement* at_left = d_heap[l];
336	503092	HElement* at_right = d_heap[r];
337	503092	if(lt(he->d_elem, at_left->d_elem)){
338		// he < at_left
339	418250	if(lt(at_left->d_elem, at_right->d_elem)){
340		// he < at_left < at_right
341	182277	swap(curr, r, he, at_right);
342		}else{
343		// he < at_left
344		// at_right <= at_left
345	235973	swap(curr, l, he, at_left);
346		}
347		}else{
348		// at_left <= he
349	84842	if(lt(he->d_elem, at_right->d_elem)){
350		// at_left <= he < at_right
351	21546	swap(curr, r, he, at_right);
352		}else{
353		// at_left <= he
354		// at_right <= he
355	63296	break;
356		}
357		}
358		}
359	373127	l = left(curr);
360	373127	if(r >= N && l < N){
361		// there is a left but not a right
362	54265	HElement* at_left = d_heap[l];
363	54265	if(lt(he->d_elem, at_left->d_elem)){
364		// he < at_left
365	18914	swap(curr, l, he, at_left);
366		}
367		}
368	373127	}
369
370	766119	bool debugHandle(handle h) const{
371	766119	HElement* he = h.d_pointer;
372	766119	if( he == NULL ){
373		return true;
374	766119	}else if(he->d_pos >= size()){
375		return false;
376		}else{
377	766119	return he == d_heap[he->d_pos];
378		}
379		}
380
381		}; /* class BinaryHeap<> */
382
383		template <class Elem, class CmpFcn>
384		const size_t BinaryHeap<Elem,CmpFcn>::MAX_SIZE = (std::numeric_limits<size_t>::max()-2)/2;
385
386		} // namespace cvc5
387
388		#endif /* CVC5__BIN_HEAP_H */