|
| 1 | +/* |
| 2 | + * Copyright 2023 Google LLC |
| 3 | + * |
| 4 | + * Licensed under the Apache License, Version 2.0 (the "License"); |
| 5 | + * you may not use this file except in compliance with the License. |
| 6 | + * You may obtain a copy of the License at |
| 7 | + * |
| 8 | + * http://www.apache.org/licenses/LICENSE-2.0 |
| 9 | + * |
| 10 | + * Unless required by applicable law or agreed to in writing, software |
| 11 | + * distributed under the License is distributed on an "AS IS" BASIS, |
| 12 | + * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 13 | + * See the License for the specific language governing permissions and |
| 14 | + * limitations under the License. |
| 15 | + */ |
| 16 | + |
| 17 | +#include "firestore/src/android/filter_android.h" |
| 18 | + |
| 19 | +#include "firestore/src/android/converter_android.h" |
| 20 | +#include "firestore/src/android/firestore_android.h" |
| 21 | +#include "firestore/src/android/field_path_android.h" |
| 22 | +#include "firestore/src/android/field_value_android.h" |
| 23 | + |
| 24 | +#include "firestore/src/jni/array.h" |
| 25 | +#include "firestore/src/jni/array_list.h" |
| 26 | +#include "firestore/src/jni/compare.h" |
| 27 | +#include "firestore/src/jni/env.h" |
| 28 | +#include "firestore/src/jni/loader.h" |
| 29 | + |
| 30 | +namespace firebase { |
| 31 | +namespace firestore { |
| 32 | +namespace { |
| 33 | + |
| 34 | +using jni::Array; |
| 35 | +using jni::ArrayList; |
| 36 | +using jni::Env; |
| 37 | +using jni::Local; |
| 38 | +using jni::StaticMethod; |
| 39 | +using jni::Object; |
| 40 | + |
| 41 | +constexpr char kClassName[] = |
| 42 | + PROGUARD_KEEP_CLASS "com/google/firebase/firestore/Filter"; |
| 43 | +StaticMethod<Object> kEqualTo( |
| 44 | + "equalTo", |
| 45 | + "(Lcom/google/firebase/firestore/FieldPath;Ljava/lang/Object;)" |
| 46 | + "Lcom/google/firebase/firestore/Filter;"); |
| 47 | +StaticMethod<Object> kNotEqualTo( |
| 48 | + "notEqualTo", |
| 49 | + "(Lcom/google/firebase/firestore/FieldPath;Ljava/lang/Object;)" |
| 50 | + "Lcom/google/firebase/firestore/Filter;"); |
| 51 | +StaticMethod<Object> kLessThan( |
| 52 | + "lessThan", |
| 53 | + "(Lcom/google/firebase/firestore/FieldPath;Ljava/lang/Object;)" |
| 54 | + "Lcom/google/firebase/firestore/Filter;"); |
| 55 | +StaticMethod<Object> kLessThanOrEqualTo( |
| 56 | + "lessThanOrEqualTo", |
| 57 | + "(Lcom/google/firebase/firestore/FieldPath;Ljava/lang/Object;)" |
| 58 | + "Lcom/google/firebase/firestore/Filter;"); |
| 59 | +StaticMethod<Object> kGreaterThan( |
| 60 | + "greaterThan", |
| 61 | + "(Lcom/google/firebase/firestore/FieldPath;Ljava/lang/Object;)" |
| 62 | + "Lcom/google/firebase/firestore/Filter;"); |
| 63 | +StaticMethod<Object> kGreaterThanOrEqualTo( |
| 64 | + "greaterThanOrEqualTo", |
| 65 | + "(Lcom/google/firebase/firestore/FieldPath;Ljava/lang/Object;)" |
| 66 | + "Lcom/google/firebase/firestore/Filter;"); |
| 67 | +StaticMethod<Object> kArrayContains( |
| 68 | + "arrayContains", |
| 69 | + "(Lcom/google/firebase/firestore/FieldPath;Ljava/lang/Object;)" |
| 70 | + "Lcom/google/firebase/firestore/Filter;"); |
| 71 | +StaticMethod<Object> kArrayContainsAny( |
| 72 | + "arrayContainsAny", |
| 73 | + "(Lcom/google/firebase/firestore/FieldPath;Ljava/util/List;)" |
| 74 | + "Lcom/google/firebase/firestore/Filter;"); |
| 75 | +StaticMethod<Object> kIn("in", |
| 76 | + "(Lcom/google/firebase/firestore/FieldPath;Ljava/util/List;)" |
| 77 | + "Lcom/google/firebase/firestore/Filter;"); |
| 78 | +StaticMethod<Object> kNotIn( |
| 79 | + "notIn", |
| 80 | + "(Lcom/google/firebase/firestore/FieldPath;Ljava/util/List;)" |
| 81 | + "Lcom/google/firebase/firestore/Filter;"); |
| 82 | +StaticMethod<Object> kAnd( |
| 83 | + "and", |
| 84 | + "([Lcom/google/firebase/firestore/Filter;)" |
| 85 | + "Lcom/google/firebase/firestore/Filter;"); |
| 86 | +StaticMethod<Object> kOr( |
| 87 | + "or", |
| 88 | + "([Lcom/google/firebase/firestore/Filter;)" |
| 89 | + "Lcom/google/firebase/firestore/Filter;"); |
| 90 | +} |
| 91 | + |
| 92 | +void FilterInternal::Initialize(jni::Loader& loader) { |
| 93 | + loader.LoadClass( |
| 94 | + kClassName, kEqualTo, kNotEqualTo, kLessThan, kLessThanOrEqualTo, |
| 95 | + kGreaterThan, kGreaterThanOrEqualTo, kArrayContains, kArrayContainsAny, |
| 96 | + kIn, kNotIn, kAnd, kOr); |
| 97 | +} |
| 98 | + |
| 99 | +FilterInternal::FilterInternal(jni::Object&& object, bool is_empty) |
| 100 | + : object_(object), is_empty_(is_empty) {} |
| 101 | + |
| 102 | +Filter FilterInternal::EqualTo(const FieldPath& field, |
| 103 | + const FieldValue& value) { |
| 104 | + return Where(field, kEqualTo, value); |
| 105 | +} |
| 106 | + |
| 107 | +Filter FilterInternal::NotEqualTo(const FieldPath& field, |
| 108 | + const FieldValue& value) { |
| 109 | + return Where(field, kNotEqualTo, value); |
| 110 | +} |
| 111 | + |
| 112 | +Filter FilterInternal::LessThan(const FieldPath& field, |
| 113 | + const FieldValue& value) { |
| 114 | + return Where(field, kLessThan, value); |
| 115 | +} |
| 116 | + |
| 117 | +Filter FilterInternal::LessThanOrEqualTo(const FieldPath& field, |
| 118 | + const FieldValue& value) { |
| 119 | + return Where(field, kLessThanOrEqualTo, value); |
| 120 | +} |
| 121 | + |
| 122 | +Filter FilterInternal::GreaterThan(const FieldPath& field, |
| 123 | + const FieldValue& value) { |
| 124 | + return Where(field, kGreaterThan, value); |
| 125 | +} |
| 126 | + |
| 127 | +Filter FilterInternal::GreaterThanOrEqualTo(const FieldPath& field, |
| 128 | + const FieldValue& value) { |
| 129 | + return Where(field, kGreaterThanOrEqualTo, value); |
| 130 | +} |
| 131 | + |
| 132 | +Filter FilterInternal::ArrayContains(const FieldPath& field, |
| 133 | + const FieldValue& value) { |
| 134 | + return Where(field, kArrayContains, value); |
| 135 | +} |
| 136 | + |
| 137 | +Filter FilterInternal::ArrayContainsAny( |
| 138 | + const FieldPath& field, const std::vector<FieldValue>& values) { |
| 139 | + return Where(field, kArrayContainsAny, values); |
| 140 | +} |
| 141 | + |
| 142 | +Filter FilterInternal::In(const FieldPath& field, |
| 143 | + const std::vector<FieldValue>& values) { |
| 144 | + return Where(field, kIn, values); |
| 145 | +} |
| 146 | + |
| 147 | +Filter FilterInternal::NotIn(const FieldPath& field, |
| 148 | + const std::vector<FieldValue>& values) { |
| 149 | + return Where(field, kNotIn, values); |
| 150 | +} |
| 151 | + |
| 152 | +Filter FilterInternal::And(const std::vector<const Filter>& filters) { |
| 153 | + return Where(kAnd, filters); |
| 154 | +} |
| 155 | + |
| 156 | +Filter FilterInternal::Or(const std::vector<const Filter>& filters) { |
| 157 | + return Where(kOr, filters); |
| 158 | +} |
| 159 | + |
| 160 | +Env FilterInternal::GetEnv() { return FirestoreInternal::GetEnv(); } |
| 161 | + |
| 162 | +Filter FilterInternal::Where(const FieldPath& field, |
| 163 | + const StaticMethod<Object>& method, |
| 164 | + const FieldValue& value) { |
| 165 | + Env env = GetEnv(); |
| 166 | + Local<Object> java_field = FieldPathConverter::Create(env, field); |
| 167 | + Object filter = env.Call(method, java_field, FieldValueInternal::ToJava(value)); |
| 168 | + return Filter(new FilterInternal(std::move(filter), false)); |
| 169 | +} |
| 170 | + |
| 171 | +Filter FilterInternal::Where(const FieldPath& field, |
| 172 | + const jni::StaticMethod<Object>& method, |
| 173 | + const std::vector<FieldValue>& values) { |
| 174 | + Env env = GetEnv(); |
| 175 | + size_t size = values.size(); |
| 176 | + Local<ArrayList> java_values = ArrayList::Create(env, size); |
| 177 | + for (size_t i = 0; i < size; ++i) { |
| 178 | + java_values.Add(env, FieldValueInternal::ToJava(values[i])); |
| 179 | + } |
| 180 | + |
| 181 | + Local<Object> java_field = FieldPathConverter::Create(env, field); |
| 182 | + Object filter = env.Call(method, java_field, java_values); |
| 183 | + return Filter(new FilterInternal(std::move(filter), false)); |
| 184 | +} |
| 185 | + |
| 186 | +Filter FilterInternal::Where(const StaticMethod<Object>& method, |
| 187 | + const std::vector<const Filter>& filters) { |
| 188 | + Env env = GetEnv(); |
| 189 | + size_t size = filters.size(); |
| 190 | + Local<Array<Object>> java_filters = env.NewArray(size, Object::GetClass()); |
| 191 | + bool is_empty = true; |
| 192 | + for (int i = 0; i < size; ++i) { |
| 193 | + FilterInternal* internal_filter = filters[i].internal_; |
| 194 | + if (!internal_filter->IsEmpty()) { |
| 195 | + is_empty = false; |
| 196 | + } |
| 197 | + java_filters.Set(env, i, internal_filter->object_); |
| 198 | + } |
| 199 | + Object filter = env.Call(method, java_filters); |
| 200 | + return Filter(new FilterInternal(std::move(filter), is_empty)); |
| 201 | +} |
| 202 | + |
| 203 | +bool operator==(const FilterInternal& lhs, const FilterInternal& rhs) { |
| 204 | + return jni::EqualityCompareJni(lhs, rhs); |
| 205 | +} |
| 206 | + |
| 207 | +} // namespace firestore |
| 208 | +} // namespace firebase |
0 commit comments