001 //$HeadURL: https://svn.wald.intevation.org/svn/deegree/base/branches/2.3_testing/src/org/deegree/graphics/optimizers/OptimizerChain.java $
002 /*----------------------------------------------------------------------------
003 This file is part of deegree, http://deegree.org/
004 Copyright (C) 2001-2009 by:
005 Department of Geography, University of Bonn
006 and
007 lat/lon GmbH
008
009 This library is free software; you can redistribute it and/or modify it under
010 the terms of the GNU Lesser General Public License as published by the Free
011 Software Foundation; either version 2.1 of the License, or (at your option)
012 any later version.
013 This library is distributed in the hope that it will be useful, but WITHOUT
014 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
015 FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
016 details.
017 You should have received a copy of the GNU Lesser General Public License
018 along with this library; if not, write to the Free Software Foundation, Inc.,
019 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
020
021 Contact information:
022
023 lat/lon GmbH
024 Aennchenstr. 19, 53177 Bonn
025 Germany
026 http://lat-lon.de/
027
028 Department of Geography, University of Bonn
029 Prof. Dr. Klaus Greve
030 Postfach 1147, 53001 Bonn
031 Germany
032 http://www.geographie.uni-bonn.de/deegree/
033
034 e-mail: info@deegree.org
035 ----------------------------------------------------------------------------*/
036 package org.deegree.graphics.optimizers;
037
038 import java.awt.Graphics2D;
039 import java.util.ArrayList;
040
041 /**
042 * Allows the chaining of {@link Optimizer}s. Implements the {@link Optimizer} interface as well.
043 *
044 * @author <a href="mailto:mschneider@lat-lon.de">Markus Schneider</a>
045 * @author last edited by: $Author: mschneider $
046 *
047 * @version $Revision: 18195 $, $Date: 2009-06-18 17:55:39 +0200 (Do, 18. Jun 2009) $
048 */
049 public class OptimizerChain extends AbstractOptimizer {
050
051 // stores the Optimizers in the chain
052 private ArrayList<Optimizer> optimizers = new ArrayList<Optimizer>();
053
054 /**
055 * Creates an empty instance of {@link OptimizerChain}.
056 */
057 public OptimizerChain() {
058 // nothing to do
059 }
060
061 /**
062 * Constructs a new {@link OptimizerChain} that contains the given {@link Optimizer} instances.
063 *
064 * @param optimizers
065 */
066 public OptimizerChain( Optimizer[] optimizers ) {
067 for ( int i = 0; i < optimizers.length; i++ ) {
068 this.optimizers.add( optimizers[i] );
069 }
070 }
071
072 /**
073 * Appends an {@link Optimizer} to the end of the processing chain.
074 *
075 * @param optimizer
076 * {@link Optimizer} to be added
077 */
078 public void addOptimizer( Optimizer optimizer ) {
079 optimizers.add( optimizer );
080 }
081
082 /**
083 * Performs the optimization for all contained {@link Optimizer} instances. Calls
084 * {@link Optimizer#optimize(Graphics2D)} for all contained {@link Optimizer} instances. subsequently.
085 *
086 * @param g
087 */
088 public void optimize( Graphics2D g )
089 throws Exception {
090 for ( Optimizer optimizer : optimizers ) {
091 optimizer.optimize( g );
092 }
093 }
094 }