src/share/classes/java/util/PriorityQueue.java

rev 12533 : 8174109: Better queuing priorities
Reviewed-by: smarks

*** 1,7 ****
  /*
!  * Copyright (c) 2003, 2013, Oracle and/or its affiliates. All rights reserved.
   * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   *
   * This code is free software; you can redistribute it and/or modify it
   * under the terms of the GNU General Public License version 2 only, as
   * published by the Free Software Foundation.  Oracle designates this
--- 1,7 ----
  /*
!  * Copyright (c) 2003, 2017, Oracle and/or its affiliates. All rights reserved.
   * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   *
   * This code is free software; you can redistribute it and/or modify it
   * under the terms of the GNU General Public License version 2 only, as
   * published by the Free Software Foundation.  Oracle designates this
*** 24,33 ****
--- 24,34 ----
   */
  
  package java.util;
  
  import java.util.function.Consumer;
+ import sun.misc.SharedSecrets;
  
  /**
   * An unbounded priority {@linkplain Queue queue} based on a priority heap.
   * The elements of the priority queue are ordered according to their
   * {@linkplain Comparable natural ordering}, or by a {@link Comparator}
*** 782,791 ****
--- 783,793 ----
          s.defaultReadObject();
  
          // Read in (and discard) array length
          s.readInt();
  
+         SharedSecrets.getJavaOISAccess().checkArray(s, Object[].class, size);
          queue = new Object[size];
  
          // Read in all elements.
          for (int i = 0; i < size; i++)
              queue[i] = s.readObject();