001 /* 002 * Copyright (C) 2008-2010 by Holger Arndt 003 * 004 * This file is part of the Universal Java Matrix Package (UJMP). 005 * See the NOTICE file distributed with this work for additional 006 * information regarding copyright ownership and licensing. 007 * 008 * UJMP is free software; you can redistribute it and/or modify 009 * it under the terms of the GNU Lesser General Public License as 010 * published by the Free Software Foundation; either version 2 011 * of the License, or (at your option) any later version. 012 * 013 * UJMP is distributed in the hope that it will be useful, 014 * but WITHOUT ANY WARRANTY; without even the implied warranty of 015 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 016 * GNU Lesser General Public License for more details. 017 * 018 * You should have received a copy of the GNU Lesser General Public 019 * License along with UJMP; if not, write to the 020 * Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, 021 * Boston, MA 02110-1301 USA 022 */ 023 024 package org.ujmp.core.stringmatrix.calculation; 025 026 import java.util.Collection; 027 import java.util.HashSet; 028 import java.util.Set; 029 030 import org.ujmp.core.Matrix; 031 import org.ujmp.core.exceptions.MatrixException; 032 033 public class RemoveWords extends AbstractStringCalculation { 034 private static final long serialVersionUID = 4976043243302036392L; 035 036 public Set<String> wordsToRemove = null; 037 038 public RemoveWords(Matrix m, Collection<String> words) { 039 super(m); 040 if (words instanceof Set) { 041 this.wordsToRemove = (Set<String>) words; 042 } else { 043 this.wordsToRemove = new HashSet<String>(words); 044 } 045 } 046 047 public String getString(long... coordinates) throws MatrixException { 048 String s = getSource().getAsString(coordinates); 049 if (s != null) { 050 StringBuilder result = new StringBuilder(s.length()); 051 String[] words = s.split("\\s+"); 052 for (int i = 0; i < words.length; i++) { 053 String w = words[i]; 054 if (w.length() == 0) { 055 continue; 056 } 057 if (!wordsToRemove.contains(w)) { 058 result.append(w); 059 } 060 if (i < words.length - 1) { 061 result.append(" "); 062 } 063 } 064 return result.toString(); 065 } else { 066 return ""; 067 } 068 } 069 070 }