ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/main/java/util/PriorityQueue.java
(Generate patch)

Comparing jsr166/src/main/java/util/PriorityQueue.java (file contents):
Revision 1.130 by jsr166, Sun Nov 11 16:27:28 2018 UTC vs.
Revision 1.131 by jsr166, Wed May 22 17:36:58 2019 UTC

# Line 1 | Line 1
1   /*
2 < * Copyright (c) 2003, 2018, Oracle and/or its affiliates. All rights reserved.
2 > * Copyright (c) 2003, 2019, Oracle and/or its affiliates. All rights reserved.
3   * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4   *
5   * This code is free software; you can redistribute it and/or modify it
# Line 28 | Line 28 | package java.util;
28   import java.util.function.Consumer;
29   import java.util.function.Predicate;
30   // OPENJDK import jdk.internal.access.SharedSecrets;
31 + import jdk.internal.util.ArraysSupport;
32  
33   /**
34   * An unbounded priority {@linkplain Queue queue} based on a priority heap.
# Line 282 | Line 283 | public class PriorityQueue<E> extends Ab
283      }
284  
285      /**
285 –     * The maximum size of array to allocate.
286 –     * Some VMs reserve some header words in an array.
287 –     * Attempts to allocate larger arrays may result in
288 –     * OutOfMemoryError: Requested array size exceeds VM limit
289 –     */
290 –    private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;
291 –
292 –    /**
286       * Increases the capacity of the array.
287       *
288       * @param minCapacity the desired minimum capacity
# Line 297 | Line 290 | public class PriorityQueue<E> extends Ab
290      private void grow(int minCapacity) {
291          int oldCapacity = queue.length;
292          // Double size if small; else grow by 50%
293 <        int newCapacity = oldCapacity + ((oldCapacity < 64) ?
294 <                                         (oldCapacity + 2) :
295 <                                         (oldCapacity >> 1));
296 <        // overflow-conscious code
304 <        if (newCapacity - MAX_ARRAY_SIZE > 0)
305 <            newCapacity = hugeCapacity(minCapacity);
293 >        int newCapacity = ArraysSupport.newLength(oldCapacity,
294 >                minCapacity - oldCapacity, /* minimum growth */
295 >                oldCapacity < 64 ? oldCapacity + 2 : oldCapacity >> 1
296 >                                           /* preferred growth */);
297          queue = Arrays.copyOf(queue, newCapacity);
298      }
299  
309 –    private static int hugeCapacity(int minCapacity) {
310 –        if (minCapacity < 0) // overflow
311 –            throw new OutOfMemoryError();
312 –        return (minCapacity > MAX_ARRAY_SIZE) ?
313 –            Integer.MAX_VALUE :
314 –            MAX_ARRAY_SIZE;
315 –    }
316 –
300      /**
301       * Inserts the specified element into this priority queue.
302       *

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines