001/* 002 * Licensed to the Apache Software Foundation (ASF) under one 003 * or more contributor license agreements. See the NOTICE file 004 * distributed with this work for additional information 005 * regarding copyright ownership. The ASF licenses this file 006 * to you under the Apache License, Version 2.0 (the 007 * "License"); you may not use this file except in compliance 008 * with the License. You may obtain a copy of the License at 009 * 010 * http://www.apache.org/licenses/LICENSE-2.0 011 * 012 * Unless required by applicable law or agreed to in writing, 013 * software distributed under the License is distributed on an 014 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY 015 * KIND, either express or implied. See the License for the 016 * specific language governing permissions and limitations 017 * under the License. 018 * 019 */ 020 021package org.apache.directory.api.ldap.model.filter; 022 023 024import java.util.List; 025 026 027/** 028 * Node representing an AND connector in a filter operation 029 * 030 * @author <a href="mailto:dev@directory.apache.org">Apache Directory Project</a> 031 */ 032public class AndNode extends BranchNode 033{ 034 /** 035 * Creates a AndNode using a logical operator and a list of children. 036 * 037 * @param childList the child nodes under this branch node. 038 */ 039 public AndNode( List<ExprNode> childList ) 040 { 041 super( AssertionType.AND, childList ); 042 } 043 044 045 /** 046 * Creates a AndNode using a logical operator and a list of children. 047 * 048 * @param childList the child nodes under this branch node. 049 */ 050 public AndNode( ExprNode... childList ) 051 { 052 super( AssertionType.AND, childList ); 053 } 054 055 056 /** 057 * Creates an empty AndNode 058 */ 059 public AndNode() 060 { 061 super( AssertionType.AND ); 062 } 063 064 065 /** 066 * Gets the operator for this branch node. 067 * 068 * @return the operator constant. 069 */ 070 public AssertionType getOperator() 071 { 072 return AssertionType.AND; 073 } 074 075 076 /** 077 * Tests whether or not this node is a disjunction (a OR'ed branch). 078 * 079 * @return true if the operation is a OR, false otherwise. 080 */ 081 public boolean isDisjunction() 082 { 083 return false; 084 } 085 086 087 /** 088 * Tests whether or not this node is a conjunction (a AND'ed branch). 089 * 090 * @return true if the operation is a AND, false otherwise. 091 */ 092 public boolean isConjunction() 093 { 094 return true; 095 } 096 097 098 /** 099 * Tests whether or not this node is a negation (a NOT'ed branch). 100 * 101 * @return true if the operation is a NOT, false otherwise. 102 */ 103 public boolean isNegation() 104 { 105 return false; 106 } 107 108 109 /** 110 * @see ExprNode#printRefinementToBuffer(StringBuffer) 111 * 112 * @param buf the buffer to append to. 113 * @return The buffer in which the refinement has been appended 114 * @throws UnsupportedOperationException if this node isn't a part of a refinement. 115 */ 116 public StringBuilder printRefinementToBuffer( StringBuilder buf ) 117 { 118 buf.append( "and: {" ); 119 boolean isFirst = true; 120 121 for ( ExprNode node : children ) 122 { 123 if ( isFirst ) 124 { 125 isFirst = false; 126 buf.append( ' ' ); 127 } 128 else 129 { 130 buf.append( ", " ); 131 } 132 133 node.printRefinementToBuffer( buf ); 134 } 135 136 buf.append( " }" ); 137 138 return buf; 139 } 140 141 142 /** 143 * Gets the recursive prefix string represent of the filter from this node 144 * down. 145 * 146 * @see java.lang.Object#toString() 147 * @return A string representing the AndNode 148 */ 149 public String toString() 150 { 151 StringBuffer buf = new StringBuffer(); 152 buf.append( "(&" ); 153 154 buf.append( super.toString() ); 155 156 for ( ExprNode child : getChildren() ) 157 { 158 buf.append( child ); 159 } 160 161 buf.append( ')' ); 162 163 return buf.toString(); 164 } 165 166 167 /** 168 * @see Object#hashCode() 169 * @return the instance's hash code 170 */ 171 public int hashCode() 172 { 173 int hash = 37; 174 hash = hash * 17 + AssertionType.AND.hashCode(); 175 hash = hash * 17 + ( annotations == null ? 0 : annotations.hashCode() ); 176 return hash; 177 } 178 179 180 /** 181 * @see java.lang.Object#equals(java.lang.Object) 182 */ 183 public boolean equals( Object other ) 184 { 185 if ( this == other ) 186 { 187 return true; 188 } 189 190 if ( !( other instanceof AndNode ) ) 191 { 192 return false; 193 } 194 195 AndNode otherExprNode = ( AndNode ) other; 196 197 List<ExprNode> otherChildren = otherExprNode.getChildren(); 198 199 if ( otherChildren == children ) 200 { 201 return true; 202 } 203 204 if ( children.size() != otherChildren.size() ) 205 { 206 return false; 207 } 208 209 for ( int i = 0; i < children.size(); i++ ) 210 { 211 ExprNode child = children.get( i ); 212 ExprNode otherChild = otherChildren.get( i ); 213 214 if ( !child.equals( otherChild ) ) 215 { 216 return false; 217 } 218 } 219 220 return true; 221 } 222}