From: dmalcolm Date: Fri, 27 Sep 2019 18:24:44 +0000 (+0000) Subject: Const-correctness fixes for fibonacci_heap.h X-Git-Url: http://git.ipfire.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=27de09887e8d5193033a2d91d0c868754f9ba902;p=thirdparty%2Fgcc.git 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. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@276193 138bc75d-0d04-0410-961f-82ee72b054a4 --- 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 + + * 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 * 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;