src/java.xml/share/classes/com/sun/org/apache/xpath/internal/NodeSet.java

*** 1,8 ****
  /*
!  * reserved comment block
!  * DO NOT REMOVE OR ALTER!
   */
  /*
   * Licensed to the Apache Software Foundation (ASF) under one or more
   * contributor license agreements.  See the NOTICE file distributed with
   * this work for additional information regarding copyright ownership.
--- 1,8 ----
  /*
!  * Copyright (c) 2017, Oracle and/or its affiliates. All rights reserved.
!  * @LastModified: Nov 2017
   */
  /*
   * Licensed to the Apache Software Foundation (ASF) under one or more
   * contributor license agreements.  See the NOTICE file distributed with
   * this work for additional information regarding copyright ownership.
*** 348,358 ****
    public Node item(int index)
    {
  
      runTo(index);
  
!     return (Node) this.elementAt(index);
    }
  
    /**
     * The number of nodes in the list. The range of valid child node indices is
     * 0 to <code>length-1</code> inclusive. Note that this operation requires
--- 348,358 ----
    public Node item(int index)
    {
  
      runTo(index);
  
!     return this.elementAt(index);
    }
  
    /**
     * The number of nodes in the list. The range of valid child node indices is
     * 0 to <code>length-1</code> inclusive. Note that this operation requires
*** 580,590 ****
      int i;
      Node node = nodelist.item(testIndex);
  
      for (i = end; i >= start; i--)
      {
!       Node child = (Node) elementAt(i);
  
        if (child == node)
        {
          i = -2;  // Duplicate, suppress insert
  
--- 580,590 ----
      int i;
      Node node = nodelist.item(testIndex);
  
      for (i = end; i >= start; i--)
      {
!       Node child = elementAt(i);
  
        if (child == node)
        {
          i = -2;  // Duplicate, suppress insert
  
*** 646,656 ****
        // two nodes.
        int size = size(), i;
  
        for (i = size - 1; i >= 0; i--)
        {
!         Node child = (Node) elementAt(i);
  
          if (child == node)
          {
            i = -2;  // Duplicate, suppress insert
  
--- 646,656 ----
        // two nodes.
        int size = size(), i;
  
        for (i = size - 1; i >= 0; i--)
        {
!         Node child = elementAt(i);
  
          if (child == node)
          {
            i = -2;  // Duplicate, suppress insert