@barchart/portfolio-api-common 1.0.248 → 1.0.252

package/lib/serialization/PositionSchema.js

@@ -88,7 +88,7 @@ module.exports = (() => {
 		.withField('open', DataType.BOOLEAN, true)
 		.withField('transaction', DataType.NUMBER)
 		.withField('valuation', DataType.forEnum(ValuationType, 'ValuationType'))
-		.withField('reinvest', DataType.BOOLEAN)
+		.withField('reinvest', DataType.BOOLEAN, true)
 		.withField('snapshot.date', DataType.DAY)
 		.withField('snapshot.open', DataType.DECIMAL)
 		.withField('snapshot.direction', DataType.forEnum(PositionDirection, 'PositionDirection'))
@@ -120,7 +120,7 @@ module.exports = (() => {
 		.withField('open', DataType.BOOLEAN, true)
 		.withField('transaction', DataType.NUMBER)
 		.withField('valuation', DataType.forEnum(ValuationType, 'ValuationType'))
-		.withField('reinvest', DataType.BOOLEAN)
+		.withField('reinvest', DataType.BOOLEAN, true)
 		.withField('snapshot.date', DataType.DAY)
 		.withField('snapshot.open', DataType.DECIMAL)
 		.withField('snapshot.direction', DataType.forEnum(PositionDirection, 'PositionDirection'))
@@ -135,6 +135,7 @@ module.exports = (() => {
 	);
 
 	const update = new PositionSchema(SchemaBuilder.withName('update')
+		.withField('portfolio', DataType.STRING)
 		.withField('position', DataType.STRING)
 		.withField('reinvest', DataType.BOOLEAN, true)
 		.schema

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@barchart/portfolio-api-common",
-  "version": "1.0.248",
+  "version": "1.0.252",
   "description": "Common classes used by the Portfolio system",
   "author": {
     "name": "Bryan Ingle",

package/test/SpecRunner.js

@@ -3830,6 +3830,33 @@ module.exports = function () {
 				}
 			}
 
+			/**
+    * Climbs the tree, evaluating each parent until a predicate is matched. Once matched,
+    * the {@link Tree} node is returned. Otherwise, if the predicate cannot be matched,
+    * a null value is returned.
+    *
+    * @public
+    * @param {Tree~nodePredicate} predicate - A predicate that tests each child node. The predicate takes two arguments -- the node's value, and the node itself.
+    * @param {boolean=} includeCurrentNode - If true, the predicate will be applied to the current node.
+    * @returns {Tree|null}
+    */
+
+		}, {
+			key: 'findParent',
+			value: function findParent(predicate, includeCurrentNode) {
+				var returnRef = void 0;
+
+				if (is.boolean(includeCurrentNode) && includeCurrentNode && predicate(this.getValue(), this)) {
+					returnRef = this;
+				} else if (this._parent !== null) {
+					returnRef = this._parent.findParent(predicate, true);
+				} else {
+					returnRef = null;
+				}
+
+				return returnRef;
+			}
+
 			/**
     * Creates a representation of the tree using JavaScript objects and arrays.
     *