--- a/src/hotspot/share/utilities/growableArray.hpp	Fri Nov 03 17:09:25 2017 -0700
+++ b/src/hotspot/share/utilities/growableArray.hpp	Sun Nov 05 03:43:15 2017 +0100
@@ -402,7 +402,7 @@
   // matching key according to the static compare function.  Insert
   // that element is not already in the list.  Assumes the list is
   // already sorted according to compare function.
-  template <int compare(const E&, const E&)> E insert_sorted(E& key) {
+  template <int compare(const E&, const E&)> E insert_sorted(const E& key) {
     bool found;
     int location = find_sorted<E, compare>(key, found);
     if (!found) {