From 26a23d11ed473563344d16a5b643795628e1b990 Mon Sep 17 00:00:00 2001
From: David Malcolm <dmalcolm@redhat.com>
Date: Fri, 27 Sep 2019 18:24:44 +0000
Subject: [PATCH] Const-correctness fixes for fibonacci_heap.h
gcc/ChangeLog:
* fibonacci_heap.h (fibonacci_heap::empty): Make const.
(fibonacci_heap::nodes): Likewise.
(fibonacci_heap::min_key): Likewise.
(fibonacci_heap::min): Likewise.
From-SVN: r276193
---
gcc/ChangeLog | 7 +++++++
gcc/fibonacci_heap.h | 8 ++++----
2 files changed, 11 insertions(+), 4 deletions(-)
diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 05ba915193e9..37037ab4cc60 100644
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,10 @@
+2019-09-27 David Malcolm <dmalcolm@redhat.com>
+
+ * fibonacci_heap.h (fibonacci_heap::empty): Make const.
+ (fibonacci_heap::nodes): Likewise.
+ (fibonacci_heap::min_key): Likewise.
+ (fibonacci_heap::min): Likewise.
+
2019-09-27 David Malcolm <dmalcolm@redhat.com>
* cgraph.c (cgraph_node::get_fun): Make const.
diff --git a/gcc/fibonacci_heap.h b/gcc/fibonacci_heap.h
index 6e0a2166c86f..3bd0a9f8af1e 100644
--- a/gcc/fibonacci_heap.h
+++ b/gcc/fibonacci_heap.h
@@ -162,19 +162,19 @@ public:
fibonacci_node_t *insert (K key, V *data);
/* Return true if no entry is present. */
- bool empty ()
+ bool empty () const
{
return m_nodes == 0;
}
/* Return the number of nodes. */
- size_t nodes ()
+ size_t nodes () const
{
return m_nodes;
}
/* Return minimal key presented in the heap. */
- K min_key ()
+ K min_key () const
{
if (m_min == NULL)
gcc_unreachable ();
@@ -206,7 +206,7 @@ public:
V *extract_min (bool release = true);
/* Return value associated with minimum node in the heap. */
- V *min ()
+ V *min () const
{
if (m_min == NULL)
return NULL;
--
GitLab