001 //$HeadURL: svn+ssh://rbezema@svn.wald.intevation.org/deegree/base/branches/2.2_testing/src/org/deegree/graphics/optimizers/OptimizerChain.java $
002 /*---------------- FILE HEADER ------------------------------------------
003
004 This file is part of deegree.
005 Copyright (C) 2001-2008 by:
006 EXSE, Department of Geography, University of Bonn
007 http://www.giub.uni-bonn.de/deegree/
008 lat/lon GmbH
009 http://www.lat-lon.de
010
011 This library is free software; you can redistribute it and/or
012 modify it under the terms of the GNU Lesser General Public
013 License as published by the Free Software Foundation; either
014 version 2.1 of the License, or (at your option) any later version.
015
016 This library is distributed in the hope that it will be useful,
017 but WITHOUT ANY WARRANTY; without even the implied warranty of
018 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
019 Lesser General Public License for more details.
020
021 You should have received a copy of the GNU Lesser General Public
022 License along with this library; if not, write to the Free Software
023 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
024
025 Contact:
026
027 Andreas Poth
028 lat/lon GmbH
029 Aennchenstr. 19
030 53115 Bonn
031 Germany
032 E-Mail: poth@lat-lon.de
033
034 Prof. Dr. Klaus Greve
035 Department of Geography
036 University of Bonn
037 Meckenheimer Allee 166
038 53115 Bonn
039 Germany
040 E-Mail: greve@giub.uni-bonn.de
041
042 ---------------------------------------------------------------------------*/
043 package org.deegree.graphics.optimizers;
044
045 import java.awt.Graphics2D;
046 import java.util.ArrayList;
047
048 /**
049 * Allows the chaining of <tt>Optimizer<tt>s. Does implement the
050 * <tt>Optimizer<tt>-interface as well.
051 * <p>
052 * @author <a href="mailto:mschneider@lat-lon.de">Markus Schneider</a>
053 * @version $Revision: 9340 $ $Date: 2007-12-27 13:32:12 +0100 (Do, 27 Dez 2007) $
054 */
055 public class OptimizerChain extends AbstractOptimizer {
056
057 // stores the Optimizers
058 private ArrayList<AbstractOptimizer> optimizers = new ArrayList<AbstractOptimizer>();
059
060 /**
061 * Constructs a new empty <tt>OptimizerChain</tt>
062 */
063 public OptimizerChain() {
064 }
065
066 /**
067 * Constructs a new <tt>OptimizerChain</tt> that contains the submitted <tt>Optimizer</tt>
068 * instances.
069 * <p>
070 *
071 * @param optimizers
072 */
073 public OptimizerChain( AbstractOptimizer[] optimizers ) {
074 for ( int i = 0; i < optimizers.length; i++ ) {
075 this.optimizers.add( optimizers[i] );
076 }
077 }
078
079 /**
080 * Appends an <tt>Optimizer</tt> to the end of the processing chain.
081 * <p>
082 *
083 * @param optimizer
084 */
085 public void addOptimizer( AbstractOptimizer optimizer ) {
086 optimizers.add( optimizer );
087 }
088
089 /**
090 * Performs the optimization. Calls the optimize-method of all contained <tt>Optimizer</tt>
091 * instances subsequently.
092 * <p>
093 *
094 * @param g
095 */
096 public void optimize( Graphics2D g )
097 throws Exception {
098 for ( int i = 0; i < optimizers.size(); i++ ) {
099 optimizers.get( i ).optimize( g );
100 }
101 }
102 }