Spaces:
Sleeping
Sleeping
File size: 8,913 Bytes
be5030f |
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 |
"use strict";
// 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.
Object.defineProperty(exports, "__esModule", { value: true });
const dictionary_1 = require("../vector/dictionary");
/** @ignore */
class Value {
eq(other) {
if (!(other instanceof Value)) {
other = new Literal(other);
}
return new Equals(this, other);
}
le(other) {
if (!(other instanceof Value)) {
other = new Literal(other);
}
return new LTeq(this, other);
}
ge(other) {
if (!(other instanceof Value)) {
other = new Literal(other);
}
return new GTeq(this, other);
}
lt(other) {
return new Not(this.ge(other));
}
gt(other) {
return new Not(this.le(other));
}
ne(other) {
return new Not(this.eq(other));
}
}
exports.Value = Value;
/** @ignore */
class Literal extends Value {
constructor(v) {
super();
this.v = v;
}
}
exports.Literal = Literal;
/** @ignore */
class Col extends Value {
constructor(name) {
super();
this.name = name;
}
bind(batch) {
if (!this.colidx) {
// Assume column index doesn't change between calls to bind
//this.colidx = cols.findIndex(v => v.name.indexOf(this.name) != -1);
this.colidx = -1;
const fields = batch.schema.fields;
for (let idx = -1; ++idx < fields.length;) {
if (fields[idx].name === this.name) {
this.colidx = idx;
break;
}
}
if (this.colidx < 0) {
throw new Error(`Failed to bind Col "${this.name}"`);
}
}
const vec = this.vector = batch.getChildAt(this.colidx);
return (idx) => vec.get(idx);
}
}
exports.Col = Col;
/** @ignore */
class Predicate {
and(...expr) { return new And(this, ...expr); }
or(...expr) { return new Or(this, ...expr); }
not() { return new Not(this); }
}
exports.Predicate = Predicate;
/** @ignore */
class ComparisonPredicate extends Predicate {
constructor(left, right) {
super();
this.left = left;
this.right = right;
}
bind(batch) {
if (this.left instanceof Literal) {
if (this.right instanceof Literal) {
return this._bindLitLit(batch, this.left, this.right);
}
else { // right is a Col
return this._bindLitCol(batch, this.left, this.right);
}
}
else { // left is a Col
if (this.right instanceof Literal) {
return this._bindColLit(batch, this.left, this.right);
}
else { // right is a Col
return this._bindColCol(batch, this.left, this.right);
}
}
}
}
exports.ComparisonPredicate = ComparisonPredicate;
/** @ignore */
class CombinationPredicate extends Predicate {
constructor(...children) {
super();
this.children = children;
}
}
exports.CombinationPredicate = CombinationPredicate;
// add children to prototype so it doesn't get mangled in es2015/umd
CombinationPredicate.prototype.children = Object.freeze([]); // freeze for safety
/** @ignore */
class And extends CombinationPredicate {
constructor(...children) {
// Flatten any Ands
children = children.reduce((accum, p) => {
return accum.concat(p instanceof And ? p.children : p);
}, []);
super(...children);
}
bind(batch) {
const bound = this.children.map((p) => p.bind(batch));
return (idx, batch) => bound.every((p) => p(idx, batch));
}
}
exports.And = And;
/** @ignore */
class Or extends CombinationPredicate {
constructor(...children) {
// Flatten any Ors
children = children.reduce((accum, p) => {
return accum.concat(p instanceof Or ? p.children : p);
}, []);
super(...children);
}
bind(batch) {
const bound = this.children.map((p) => p.bind(batch));
return (idx, batch) => bound.some((p) => p(idx, batch));
}
}
exports.Or = Or;
/** @ignore */
class Equals extends ComparisonPredicate {
_bindLitLit(_batch, left, right) {
const rtrn = left.v == right.v;
return () => rtrn;
}
_bindColCol(batch, left, right) {
const left_func = left.bind(batch);
const right_func = right.bind(batch);
return (idx, batch) => left_func(idx, batch) == right_func(idx, batch);
}
_bindColLit(batch, col, lit) {
const col_func = col.bind(batch);
if (col.vector instanceof dictionary_1.DictionaryVector) {
let key;
const vector = col.vector;
if (vector.dictionary !== this.lastDictionary) {
key = vector.reverseLookup(lit.v);
this.lastDictionary = vector.dictionary;
this.lastKey = key;
}
else {
key = this.lastKey;
}
if (key === -1) {
// the value doesn't exist in the dictionary - always return
// false
// TODO: special-case of PredicateFunc that encapsulates this
// "always false" behavior. That way filtering operations don't
// have to bother checking
return () => false;
}
else {
return (idx) => {
return vector.getKey(idx) === key;
};
}
}
else {
return (idx, cols) => col_func(idx, cols) == lit.v;
}
}
_bindLitCol(batch, lit, col) {
// Equals is commutative
return this._bindColLit(batch, col, lit);
}
}
exports.Equals = Equals;
/** @ignore */
class LTeq extends ComparisonPredicate {
_bindLitLit(_batch, left, right) {
const rtrn = left.v <= right.v;
return () => rtrn;
}
_bindColCol(batch, left, right) {
const left_func = left.bind(batch);
const right_func = right.bind(batch);
return (idx, cols) => left_func(idx, cols) <= right_func(idx, cols);
}
_bindColLit(batch, col, lit) {
const col_func = col.bind(batch);
return (idx, cols) => col_func(idx, cols) <= lit.v;
}
_bindLitCol(batch, lit, col) {
const col_func = col.bind(batch);
return (idx, cols) => lit.v <= col_func(idx, cols);
}
}
exports.LTeq = LTeq;
/** @ignore */
class GTeq extends ComparisonPredicate {
_bindLitLit(_batch, left, right) {
const rtrn = left.v >= right.v;
return () => rtrn;
}
_bindColCol(batch, left, right) {
const left_func = left.bind(batch);
const right_func = right.bind(batch);
return (idx, cols) => left_func(idx, cols) >= right_func(idx, cols);
}
_bindColLit(batch, col, lit) {
const col_func = col.bind(batch);
return (idx, cols) => col_func(idx, cols) >= lit.v;
}
_bindLitCol(batch, lit, col) {
const col_func = col.bind(batch);
return (idx, cols) => lit.v >= col_func(idx, cols);
}
}
exports.GTeq = GTeq;
/** @ignore */
class Not extends Predicate {
constructor(child) {
super();
this.child = child;
}
bind(batch) {
const func = this.child.bind(batch);
return (idx, batch) => !func(idx, batch);
}
}
exports.Not = Not;
/** @ignore */
class CustomPredicate extends Predicate {
constructor(next, bind_) {
super();
this.next = next;
this.bind_ = bind_;
}
bind(batch) {
this.bind_(batch);
return this.next;
}
}
exports.CustomPredicate = CustomPredicate;
function lit(v) { return new Literal(v); }
exports.lit = lit;
function col(n) { return new Col(n); }
exports.col = col;
function and(...p) { return new And(...p); }
exports.and = and;
function or(...p) { return new Or(...p); }
exports.or = or;
function custom(next, bind) {
return new CustomPredicate(next, bind);
}
exports.custom = custom;
//# sourceMappingURL=predicate.js.map
|