src/share/tools/IdealGraphVisualizer/View/src/com/sun/hotspot/igv/view/DiagramViewModel.java

*** 1,7 ****
  /*
!  * Copyright (c) 1998, 2015, 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) 1998, 2016, 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
*** 443,449 ****
      }
  
      void close() {
          filterChain.getChangedEvent().removeListener(filterChainChangedListener);
          sequenceFilterChain.getChangedEvent().removeListener(filterChainChangedListener);
! }
  }
--- 443,492 ----
      }
  
      void close() {
          filterChain.getChangedEvent().removeListener(filterChainChangedListener);
          sequenceFilterChain.getChangedEvent().removeListener(filterChainChangedListener);
!     }
! 
!     Iterable<InputGraph> getGraphsForward() {
!         return new Iterable<InputGraph>() {
! 
!             @Override
!             public Iterator<InputGraph> iterator() {
!                 return new Iterator<InputGraph>() {
!                     int index = getFirstPosition();
! 
!                     @Override
!                     public boolean hasNext() {
!                         return index + 1 < graphs.size();
!                     }
! 
!                     @Override
!                     public InputGraph next() {
!                         return graphs.get(++index);
!                     }
!                 };
!             }
!         };
!     }
! 
!     Iterable<InputGraph> getGraphsBackward() {
!         return new Iterable<InputGraph>() {
!             @Override
!             public Iterator<InputGraph> iterator() {
!                 return new Iterator<InputGraph>() {
!                     int index = getFirstPosition();
! 
!                     @Override
!                     public boolean hasNext() {
!                         return index - 1 > 0;
!                     }
! 
!                     @Override
!                     public InputGraph next() {
!                         return graphs.get(--index);
!                     }
!                 };
!             }
!         };
!     }
  }