summaryrefslogtreecommitdiff
path: root/java/client/src/main/java/org/apache/qpid/filter/UnaryExpression.java
blob: 0fc3382b7e5080c1015f79da0b557e9dfc3755b9 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
/* Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 * 
 *   http://www.apache.org/licenses/LICENSE-2.0
 * 
 * Unless required by applicable law or agreed to in writing,
 * software distributed under the License is distributed on an
 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
 * KIND, either express or implied.  See the License for the
 * specific language governing permissions and limitations
 * under the License.
 */
package org.apache.qpid.filter;

import java.math.BigDecimal;
import java.util.Collection;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;

import org.apache.qpid.AMQInternalException;
import org.apache.qpid.client.message.AbstractJMSMessage;

/**
 * An expression which performs an operation on two expression values
 */
public abstract class UnaryExpression implements Expression
{

    private static final BigDecimal BD_LONG_MIN_VALUE = BigDecimal.valueOf(Long.MIN_VALUE);
    protected Expression right;

    public static Expression createNegate(Expression left)
    {
        return new UnaryExpression(left)
        {
            public Object evaluate(AbstractJMSMessage message) throws AMQInternalException
            {
                Object rvalue = right.evaluate(message);
                if (rvalue == null)
                {
                    return null;
                }

                if (rvalue instanceof Number)
                {
                    return UnaryExpression.negate((Number) rvalue);
                }

                return null;
            }

            public String getExpressionSymbol()
            {
                return "-";
            }
        };
    }

    public static BooleanExpression createInExpression(PropertyExpression right, List elements, final boolean not)
    {

        // Use a HashSet if there are many elements.
        Collection t;
        if (elements.size() == 0)
        {
            t = null;
        }
        else if (elements.size() < 5)
        {
            t = elements;
        }
        else
        {
            t = new HashSet(elements);
        }

        final Collection inList = t;

        return new BooleanUnaryExpression(right)
        {
            public Object evaluate(AbstractJMSMessage message) throws AMQInternalException
            {

                Object rvalue = right.evaluate(message);
                if (rvalue == null)
                {
                    return null;
                }

                if (rvalue.getClass() != String.class)
                {
                    return null;
                }

                if (((inList != null) && inList.contains(rvalue)) ^ not)
                {
                    return Boolean.TRUE;
                }
                else
                {
                    return Boolean.FALSE;
                }

            }

            public String toString()
            {
                StringBuffer answer = new StringBuffer();
                answer.append(right);
                answer.append(" ");
                answer.append(getExpressionSymbol());
                answer.append(" ( ");

                int count = 0;
                for (Iterator i = inList.iterator(); i.hasNext();)
                {
                    Object o = (Object) i.next();
                    if (count != 0)
                    {
                        answer.append(", ");
                    }

                    answer.append(o);
                    count++;
                }

                answer.append(" )");

                return answer.toString();
            }

            public String getExpressionSymbol()
            {
                if (not)
                {
                    return "NOT IN";
                }
                else
                {
                    return "IN";
                }
            }
        };
    }

    abstract static class BooleanUnaryExpression extends UnaryExpression implements BooleanExpression
    {
        public BooleanUnaryExpression(Expression left)
        {
            super(left);
        }

        public boolean matches(AbstractJMSMessage message) throws AMQInternalException
        {
            Object object = evaluate(message);

            return (object != null) && (object == Boolean.TRUE);
        }
    }

    ;

    public static BooleanExpression createNOT(BooleanExpression left)
    {
        return new BooleanUnaryExpression(left)
        {
            public Object evaluate(AbstractJMSMessage message) throws AMQInternalException
            {
                Boolean lvalue = (Boolean) right.evaluate(message);
                if (lvalue == null)
                {
                    return null;
                }

                return lvalue.booleanValue() ? Boolean.FALSE : Boolean.TRUE;
            }

            public String getExpressionSymbol()
            {
                return "NOT";
            }
        };
    }
    public static BooleanExpression createBooleanCast(Expression left)
    {
        return new BooleanUnaryExpression(left)
        {
            public Object evaluate(AbstractJMSMessage message) throws AMQInternalException
            {
                Object rvalue = right.evaluate(message);
                if (rvalue == null)
                {
                    return null;
                }

                if (!rvalue.getClass().equals(Boolean.class))
                {
                    return Boolean.FALSE;
                }

                return ((Boolean) rvalue).booleanValue() ? Boolean.TRUE : Boolean.FALSE;
            }

            public String toString()
            {
                return right.toString();
            }

            public String getExpressionSymbol()
            {
                return "";
            }
        };
    }

    private static Number negate(Number left)
    {
        Class clazz = left.getClass();
        if (clazz == Integer.class)
        {
            return new Integer(-left.intValue());
        }
        else if (clazz == Long.class)
        {
            return new Long(-left.longValue());
        }
        else if (clazz == Float.class)
        {
            return new Float(-left.floatValue());
        }
        else if (clazz == Double.class)
        {
            return new Double(-left.doubleValue());
        }
        else if (clazz == BigDecimal.class)
        {
            // We ussually get a big deciamal when we have Long.MIN_VALUE constant in the
            // Selector.  Long.MIN_VALUE is too big to store in a Long as a positive so we store it
            // as a Big decimal.  But it gets Negated right away.. to here we try to covert it back
            // to a Long.
            BigDecimal bd = (BigDecimal) left;
            bd = bd.negate();

            if (UnaryExpression.BD_LONG_MIN_VALUE.compareTo(bd) == 0)
            {
                return new Long(Long.MIN_VALUE);
            }

            return bd;
        }
        else
        {
            throw new RuntimeException("Don't know how to negate: " + left);
        }
    }

    public UnaryExpression(Expression left)
    {
        this.right = left;
    }

    public Expression getRight()
    {
        return right;
    }

    public void setRight(Expression expression)
    {
        right = expression;
    }

    /**
     * @see Object#toString()
     */
    public String toString()
    {
        return "(" + getExpressionSymbol() + " " + right.toString() + ")";
    }

    /**
     * TODO: more efficient hashCode()
     *
     * @see Object#hashCode()
     */
    public int hashCode()
    {
        return toString().hashCode();
    }

    /**
     * TODO: more efficient hashCode()
     *
     * @see Object#equals(Object)
     */
    public boolean equals(Object o)
    {

        if ((o == null) || !this.getClass().equals(o.getClass()))
        {
            return false;
        }

        return toString().equals(o.toString());

    }

    /**
     * Returns the symbol that represents this binary expression.  For example, addition is
     * represented by "+"
     *
     * @return
     */
    public abstract String getExpressionSymbol();

}