001 //$HeadURL: svn+ssh://rbezema@svn.wald.intevation.org/deegree/base/branches/2.2_testing/src/org/deegree/model/metadata/iso19115/Keywords.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 ---------------------------------------------------------------------------*/
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: 9343 $, $Date: 2007-12-27 14:30:32 +0100 (Do, 27 Dez 2007) $
057 */
058 public class Keywords implements Serializable {
059
060 private static final long serialVersionUID = -2140118359320160159L;
061
062 private ArrayList<String> keywords;
063
064 private String thesaurusname;
065
066 private TypeCode typecode;
067
068 /**
069 * Creates a new instance of Keywords
070 *
071 */
072 private Keywords() {
073 this.keywords = new ArrayList<String>();
074 }
075
076 /**
077 * Creates a new instance of Keywords
078 *
079 * @param keywords
080 */
081 public Keywords( String[] keywords ) {
082 this();
083 this.setKeywords( keywords );
084 }
085
086 /**
087 * Creates a new instance of Keywords
088 *
089 * @param keywords
090 * @param thesaurusname
091 * @param typecode
092 */
093 public Keywords( String[] keywords, String thesaurusname, TypeCode typecode ) {
094 this( keywords );
095 this.setThesaurusName( thesaurusname );
096 this.setTypeCode( typecode );
097 }
098
099 /**
100 * @return keywords
101 *
102 */
103 public String[] getKeywords() {
104 return keywords.toArray( new String[keywords.size()] );
105 }
106
107 /**
108 * @see #getKeywords()
109 * @param keyword
110 */
111 public void addKeyword( String keyword ) {
112 this.keywords.add( keyword );
113 }
114
115 /**
116 * @see #getKeywords()
117 * @param keywords
118 */
119 public void setKeywords( String[] keywords ) {
120 this.keywords.clear();
121 for ( int i = 0; i < keywords.length; i++ ) {
122 this.keywords.add( keywords[i] );
123 }
124 }
125
126 /**
127 * @return thesaurus name
128 *
129 */
130 public String getThesaurusName() {
131 return thesaurusname;
132 }
133
134 /**
135 * @see #getThesaurusName()
136 * @param thesaurusname
137 */
138 public void setThesaurusName( String thesaurusname ) {
139 this.thesaurusname = thesaurusname;
140 }
141
142 /**
143 * @return type code
144 *
145 */
146 public TypeCode getTypeCode() {
147 return typecode;
148 }
149
150 /**
151 * @see #getTypeCode()
152 * @param typecode
153 */
154 public void setTypeCode( TypeCode typecode ) {
155 this.typecode = typecode;
156 }
157
158 /**
159 * to String method
160 *
161 * @return string representation
162 */
163 public String toString() {
164 String ret = null;
165 ret = "keywords = " + keywords + "\n";
166 ret += "thesaurusname = " + thesaurusname + "\n";
167 ret += "typecode = " + typecode + "\n";
168 return ret;
169 }
170 }