001 //$HeadURL: svn+ssh://rbezema@svn.wald.intevation.org/deegree/base/tags/2.1/src/org/deegree/model/metadata/iso19115/Keywords.java $
002 /*---------------- FILE HEADER ------------------------------------------
003
004 This file is part of deegree.
005 Copyright (C) 2001-2007 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 ---------------------------------------------------------------------------*/
044 package org.deegree.model.metadata.iso19115;
045
046 import java.io.Serializable;
047 import java.util.ArrayList;
048
049 /**
050 *
051 *
052 *
053 * @author <a href="mailto:poth@lat-lon.de">Andreas Poth</a>
054 * @author last edited by: $Author: apoth $
055 *
056 * @version. $Revision: 6704 $, $Date: 2007-04-26 21:43:13 +0200 (Do, 26 Apr 2007) $
057 */
058 public class Keywords implements Serializable {
059
060 private static final long serialVersionUID = -2140118359320160159L;
061 private ArrayList<String> keywords;
062 private String thesaurusname;
063 private TypeCode typecode;
064
065 /**
066 * Creates a new instance of Keywords
067 *
068 */
069 private Keywords() {
070 this.keywords = new ArrayList<String>();
071 }
072
073 /**
074 * Creates a new instance of Keywords
075 * @param keywords
076 */
077 public Keywords(String[] keywords) {
078 this();
079 this.setKeywords(keywords);
080 }
081
082 /**
083 * Creates a new instance of Keywords
084 * @param keywords
085 * @param thesaurusname
086 * @param typecode
087 */
088 public Keywords(String[] keywords, String thesaurusname, TypeCode typecode) {
089 this(keywords);
090 this.setThesaurusName(thesaurusname);
091 this.setTypeCode(typecode);
092 }
093
094 /**
095 * @return keywords
096 *
097 */
098 public String[] getKeywords() {
099 return keywords.toArray(new String[keywords.size()]);
100 }
101
102 /**
103 * @see #getKeywords()
104 * @param keyword
105 */
106 public void addKeyword(String keyword) {
107 this.keywords.add(keyword);
108 }
109
110 /**
111 * @see #getKeywords()
112 * @param keywords
113 */
114 public void setKeywords(String[] keywords) {
115 this.keywords.clear();
116 for (int i = 0; i < keywords.length; i++) {
117 this.keywords.add(keywords[i]);
118 }
119 }
120
121 /**
122 * @return thesaurus name
123 *
124 */
125 public String getThesaurusName() {
126 return thesaurusname;
127 }
128
129 /**
130 * @see #getThesaurusName()
131 * @param thesaurusname
132 */
133 public void setThesaurusName(String thesaurusname) {
134 this.thesaurusname = thesaurusname;
135 }
136
137 /**
138 * @return type code
139 *
140 */
141 public TypeCode getTypeCode() {
142 return typecode;
143 }
144
145 /**
146 * @see #getTypeCode()
147 * @param typecode
148 */
149 public void setTypeCode(TypeCode typecode) {
150 this.typecode = typecode;
151 }
152
153 /**
154 * to String method
155 * @return string representation
156 */
157 public String toString() {
158 String ret = null;
159 ret = "keywords = " + keywords + "\n";
160 ret += "thesaurusname = " + thesaurusname + "\n";
161 ret += "typecode = " + typecode + "\n";
162 return ret;
163 }
164 }