src/share/classes/java/util/LinkedHashMap.java

rev 4788 : Fix bunch of generics warnings

*** 244,258 ****
      /**
       * Transfers all entries to new table array.  This method is called
       * by superclass resize.  It is overridden for performance, as it is
       * faster to iterate using our linked list.
       */
      void transfer(HashMap.Entry[] newTable) {
          int newCapacity = newTable.length;
          for (Entry<K,V> e = header.after; e != header; e = e.after) {
              int index = indexFor(e.hash, newCapacity);
!             e.next = newTable[index];
              newTable[index] = e;
          }
      }
  
  
--- 244,259 ----
      /**
       * Transfers all entries to new table array.  This method is called
       * by superclass resize.  It is overridden for performance, as it is
       * faster to iterate using our linked list.
       */
+     @SuppressWarnings("unchecked")
      void transfer(HashMap.Entry[] newTable) {
          int newCapacity = newTable.length;
          for (Entry<K,V> e = header.after; e != header; e = e.after) {
              int index = indexFor(e.hash, newCapacity);
!             e.next = (HashMap.Entry<K,V>)newTable[index];
              newTable[index] = e;
          }
      }
  
  
*** 265,279 ****
       *         specified value
       */
      public boolean containsValue(Object value) {
          // Overridden to take advantage of faster iterator
          if (value==null) {
!             for (Entry e = header.after; e != header; e = e.after)
                  if (e.value==null)
                      return true;
          } else {
!             for (Entry e = header.after; e != header; e = e.after)
                  if (value.equals(e.value))
                      return true;
          }
          return false;
      }
--- 266,280 ----
       *         specified value
       */
      public boolean containsValue(Object value) {
          // Overridden to take advantage of faster iterator
          if (value==null) {
!             for (Entry<?,?> e = header.after; e != header; e = e.after)
                  if (e.value==null)
                      return true;
          } else {
!             for (Entry<?,?> e = header.after; e != header; e = e.after)
                  if (value.equals(e.value))
                      return true;
          }
          return false;
      }
*** 435,445 ****
      /**
       * This override differs from addEntry in that it doesn't resize the
       * table or remove the eldest entry.
       */
      void createEntry(int hash, K key, V value, int bucketIndex) {
!         HashMap.Entry<K,V> old = table[bucketIndex];
          Entry<K,V> e = new Entry<>(hash, key, value, old);
          table[bucketIndex] = e;
          e.addBefore(header);
          size++;
      }
--- 436,447 ----
      /**
       * This override differs from addEntry in that it doesn't resize the
       * table or remove the eldest entry.
       */
      void createEntry(int hash, K key, V value, int bucketIndex) {
!         @SuppressWarnings("unchecked")
!             HashMap.Entry<K,V> old = (HashMap.Entry<K,V>)table[bucketIndex];
          Entry<K,V> e = new Entry<>(hash, key, value, old);
          table[bucketIndex] = e;
          e.addBefore(header);
          size++;
      }