/* * The Apache Software License, Version 1.1 * * Copyright (c) 1999 The Apache Software Foundation. All rights * reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in * the documentation and/or other materials provided with the * distribution. * * 3. The end-user documentation included with the redistribution, if * any, must include the following acknowlegement: * "This product includes software developed by the * Apache Software Foundation (http://www.apache.org/)." * Alternately, this acknowlegement may appear in the software itself, * if and wherever such third-party acknowlegements normally appear. * * 4. The names "The Jakarta Project", "Tomcat", and "Apache Software * Foundation" must not be used to endorse or promote products derived * from this software without prior written permission. For written * permission, please contact apache@apache.org. * * 5. Products derived from this software may not be called "Apache" * nor may "Apache" appear in their names without prior written * permission of the Apache Group. * * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * ==================================================================== * * This software consists of voluntary contributions made by many * individuals on behalf of the Apache Software Foundation. For more * information on the Apache Software Foundation, please see * . */ package org.apache.tools.ant.taskdefs; import org.apache.tools.ant.*; import java.io.*; import java.util.*; /** * Replaces all the occurrences of the given string token with the given * string value of the indicated files. * * @author Stefano Mazzocchi stefano@apache.org * @author Erik Langenbach */ public class Replace extends MatchingTask { private File src = null; private NestedString token = null; private NestedString value = new NestedString(); private File dir = null; public class NestedString { private StringBuffer buf = new StringBuffer(); public void addText(String val) { buf.append(val); } public String getText() { return buf.toString(); } } /** * Do the execution. */ public void execute() throws BuildException { if (token == null) { throw new BuildException("replace token must not be null", location); } if (token.getText().equals("")) { throw new BuildException("replace token must not be empty", location); } if (src == null && dir == null) { throw new BuildException("Either the file or the dir attribute must be specified", location); } log("Replacing " + token.getText() + " --> " + value.getText()); if (src != null) { processFile(src); } if (dir != null) { DirectoryScanner ds = super.getDirectoryScanner(dir); String[] srcs = ds.getIncludedFiles(); for(int i=0; i element. */ public NestedString createReplaceToken() { if (token == null) { token = new NestedString(); } return token; } /** * Nested element. */ public NestedString createReplaceValue() { return value; } /** * Replace occurrences of str1 in string str with str2 */ private String stringReplace(String str, String str1, String str2) { StringBuffer ret = new StringBuffer(); int start = 0; int found = str.indexOf(str1); while (found >= 0) { // write everything up to the found str1 if (found > start) { ret.append(str.substring(start, found)); } // write the replacement str2 if (str2 != null) { ret.append(str2); } // search again start = found + str1.length(); found = str.indexOf(str1,start); } // write the remaining characters if (str.length() > start) { ret.append(str.substring(start, str.length())); } return ret.toString(); } }