/* * QUANTCONNECT.COM - Democratizing Finance, Empowering Individuals. * Lean Algorithmic Trading Engine v2.0. Copyright 2014 QuantConnect Corporation. * * Licensed 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. */ using QuantConnect.Orders; using System; using System.Collections.Generic; using System.Linq; namespace QuantConnect.Algorithm.CSharp { /// /// Regression algorithm to test combo leg limit orders /// public class ComboLegLimitOrderAlgorithm : ComboOrderAlgorithm { private List _originalLimitPrices = new(); protected override IEnumerable PlaceComboOrder(List legs, int quantity, decimal? limitPrice = null) { foreach (var leg in legs) { _originalLimitPrices.Add(leg.OrderPrice.Value); leg.OrderPrice *= 2; // Won't fill } return ComboLegLimitOrder(legs, quantity); } protected override void UpdateComboOrder(List tickets) { // Let's updated the limit prices to the original values for (int i = 0; i < tickets.Count; i++) { tickets[i].Update(new UpdateOrderFields { LimitPrice = _originalLimitPrices[i] }); } } public override void OnEndOfAlgorithm() { base.OnEndOfAlgorithm(); if (FillOrderEvents.Zip(OrderLegs).Any(x => x.Second.OrderPrice < x.First.FillPrice)) { throw new RegressionTestException($"Limit price expected to be greater that the fill price for each order. Limit prices: {string.Join(",", OrderLegs.Select(x => x.OrderPrice))} Fill prices: {string.Join(",", FillOrderEvents.Select(x => x.FillPrice))}"); } } /// /// This is used by the regression test system to indicate if the open source Lean repository has the required data to run this algorithm. /// public override bool CanRunLocally => true; /// /// This is used by the regression test system to indicate which languages this algorithm is written in. /// public override List Languages { get; } = new() { Language.CSharp }; /// /// Data Points count of all timeslices of algorithm /// public override long DataPoints => 15023; /// /// Data Points count of the algorithm history /// public override int AlgorithmHistoryDataPoints => 0; /// /// Final status of the algorithm /// public override AlgorithmStatus AlgorithmStatus => AlgorithmStatus.Completed; /// /// This is used by the regression test system to indicate what the expected statistics are from running the algorithm /// public override Dictionary ExpectedStatistics => new Dictionary { {"Total Orders", "3"}, {"Average Win", "0%"}, {"Average Loss", "0%"}, {"Compounding Annual Return", "0%"}, {"Drawdown", "0%"}, {"Expectancy", "0"}, {"Start Equity", "200000"}, {"End Equity", "198524"}, {"Net Profit", "0%"}, {"Sharpe Ratio", "0"}, {"Sortino Ratio", "0"}, {"Probabilistic Sharpe Ratio", "0%"}, {"Loss Rate", "0%"}, {"Win Rate", "0%"}, {"Profit-Loss Ratio", "0"}, {"Alpha", "0"}, {"Beta", "0"}, {"Annual Standard Deviation", "0"}, {"Annual Variance", "0"}, {"Information Ratio", "0"}, {"Tracking Error", "0"}, {"Treynor Ratio", "0"}, {"Total Fees", "$26.00"}, {"Estimated Strategy Capacity", "$58000.00"}, {"Lowest Capacity Asset", "GOOCV W78ZERHAOVVQ|GOOCV VP83T1ZUHROL"}, {"Portfolio Turnover", "30.22%"}, {"Drawdown Recovery", "0"}, {"OrderListHash", "ab6171073cd96df46fd9d7bce62f5594"} }; } }