001 //$HeadURL: svn+ssh://jwilden@svn.wald.intevation.org/deegree/base/branches/2.5_testing/src/org/deegree/portal/standard/gazetteer/HierarchyNode.java $
002 /*----------------------------------------------------------------------------
003 This file is part of deegree, http://deegree.org/
004 Copyright (C) 2001-2009 by:
005 - Department of Geography, University of Bonn -
006 and
007 - lat/lon GmbH -
008
009 This library is free software; you can redistribute it and/or modify it under
010 the terms of the GNU Lesser General Public License as published by the Free
011 Software Foundation; either version 2.1 of the License, or (at your option)
012 any later version.
013 This library is distributed in the hope that it will be useful, but WITHOUT
014 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
015 FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
016 details.
017 You should have received a copy of the GNU Lesser General Public License
018 along with this library; if not, write to the Free Software Foundation, Inc.,
019 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
020
021 Contact information:
022
023 lat/lon GmbH
024 Aennchenstr. 19, 53177 Bonn
025 Germany
026 http://lat-lon.de/
027
028 Department of Geography, University of Bonn
029 Prof. Dr. Klaus Greve
030 Postfach 1147, 53001 Bonn
031 Germany
032 http://www.geographie.uni-bonn.de/deegree/
033
034 e-mail: info@deegree.org
035 ----------------------------------------------------------------------------*/
036 package org.deegree.portal.standard.gazetteer;
037
038 import java.util.Map;
039
040 import org.deegree.datatypes.QualifiedName;
041
042 /**
043 * TODO add class documentation here
044 *
045 * @author <a href="mailto:name@deegree.org">Andreas Poth</a>
046 * @author last edited by: $Author: apoth $
047 *
048 * @version $Revision: 22457 $, $Date: 2010-02-09 12:58:22 +0100 (Di, 09 Feb 2010) $
049 */
050 public class HierarchyNode {
051
052 private QualifiedName featureType;
053
054 private String name;
055
056 private boolean freeSearch;
057
058 private HierarchyNode childNode;
059
060 private Map<String, String> properties;
061
062 private boolean stricMode = true;
063
064 private boolean matchCase = true;
065
066 /**
067 *
068 * @param featureType
069 * @param properties
070 * @param name
071 * @param freeSearch
072 */
073 public HierarchyNode( QualifiedName featureType, Map<String, String> properties, String name, boolean freeSearch ) {
074 this.featureType = featureType;
075 this.name = name;
076 this.freeSearch = freeSearch;
077 this.properties = properties;
078 }
079
080 /**
081 *
082 * @param featureType
083 * @param properties
084 * @param name
085 * @param freeSearch
086 * @param stricMode
087 * @param matchCase
088 */
089 public HierarchyNode( QualifiedName featureType, Map<String, String> properties, String name, boolean freeSearch,
090 boolean stricMode, boolean matchCase ) {
091 this( featureType, properties, name, freeSearch );
092 this.stricMode = stricMode;
093 this.matchCase = matchCase;
094 }
095
096 /**
097 * @return the featureType
098 */
099 public QualifiedName getFeatureType() {
100 return featureType;
101 }
102
103 /**
104 * @return the name
105 */
106 public String getName() {
107 return name;
108 }
109
110 /**
111 * @return the childNode
112 */
113 public HierarchyNode getChildNode() {
114 return childNode;
115 }
116
117 /**
118 * @param childNode
119 * the childNode to set
120 */
121 public void setChildNode( HierarchyNode childNode ) {
122 this.childNode = childNode;
123 }
124
125 /**
126 *
127 * @return true if type supports a free text search; false if just selection from a list is supported
128 */
129 public boolean supportFreeSearch() {
130 return freeSearch;
131 }
132
133 /**
134 *
135 * @return property names assigned to a well known gazetteer properties.
136 */
137 public Map<String, String> getProperties() {
138 return properties;
139 }
140
141 /**
142 * @return the stricMode
143 */
144 public boolean isStricMode() {
145 return stricMode;
146 }
147
148 /**
149 * @return the matchCase
150 */
151 public boolean isMatchCase() {
152 return matchCase;
153 }
154
155 }