AndExpression.js 2.8 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768
  1. var AndExpression = module.exports = (function(){
  2. // CONSTRUCTOR
  3. /** Create an expression that finds the conjunction of n operands. The
  4. | conjunction uses short-circuit logic; the expressions are evaluated in the
  5. | order they were added to the conjunction, and the evaluation stops and
  6. | returns false on the first operand that evaluates to false.
  7. **/
  8. var klass = module.exports = function AndExpression(){
  9. if(arguments.length !== 0) throw new Error("zero args expected");
  10. base.call(this);
  11. }, base = require("./NaryExpression"), proto = klass.prototype = Object.create(base.prototype, {constructor:{value:klass}});
  12. // DEPENDENCIES
  13. var Value = require("../Value"),
  14. ConstantExpression = require("./ConstantExpression"),
  15. CoerceToBoolExpression = require("./CoerceToBoolExpression");
  16. // PROTOTYPE MEMBERS
  17. proto.getOpName = function getOpName(){
  18. return "$and";
  19. };
  20. proto.getFactory = function getFactory(){
  21. return klass; // using the ctor rather than a separate .create() method
  22. };
  23. /** Takes an array one or more values and returns true if all of the values in the array are true. Otherwise $and returns false. **/
  24. proto.evaluate = function evaluate(doc) {
  25. for (var i = 0, n = this.operands.length; i < n; ++i) {
  26. var value = this.operands[i].evaluate(doc);
  27. if (!Value.coerceToBool(value)) return false;
  28. }
  29. return true;
  30. };
  31. proto.optimize = function optimize() {
  32. var expr = base.prototype.optimize.call(this); //optimize the conjunction as much as possible
  33. // if the result isn't a conjunction, we can't do anything
  34. if (!(expr instanceof AndExpression)) return expr;
  35. var andExpr = expr;
  36. // Check the last argument on the result; if it's not constant (as promised by ExpressionNary::optimize(),) then there's nothing we can do.
  37. var n = andExpr.operands.length;
  38. // ExpressionNary::optimize() generates an ExpressionConstant for {$and:[]}.
  39. if (!n) throw new Error("requires operands!");
  40. var lastExpr = andExpr.operands[n - 1];
  41. if (!(lastExpr instanceof ConstantExpression)) return expr;
  42. // Evaluate and coerce the last argument to a boolean. If it's false, then we can replace this entire expression.
  43. var last = Value.coerceToBool(lastExpr.evaluate());
  44. if (!last) return new ConstantExpression(false);
  45. // If we got here, the final operand was true, so we don't need it anymore.
  46. // If there was only one other operand, we don't need the conjunction either.
  47. // Note we still need to keep the promise that the result will be a boolean.
  48. if (n == 2) return new CoerceToBoolExpression(andExpr.operands[0]);
  49. //Remove the final "true" value, and return the new expression.
  50. //CW TODO: Note that because of any implicit conversions, we may need to apply an implicit boolean conversion.
  51. andExpr.operands.length = n - 1; //truncate the array
  52. return expr;
  53. };
  54. //TODO: proto.toMatcherBson
  55. return klass;
  56. })();