Joseph Doherty
56bb4855bb
M1: the time-weighted family (incl. Total, formerly a pushed-down SUM) streams raw window rows into the C# evaluator. New shared knob ServerHistorian:MaxTimeWeightedRawRows (default 1,000,000; <=0 unbounded with a Validate warning) flows through HistorianBackendRegistry into both providers. The window query is capped at cap+1 (SQL Server TOP (@maxRows), QuestDB LIMIT $4); one row past the cap throws the new Core.Abstractions HistoryReadLimitExceededException, which the node manager maps to BadTooManyOperations for that node. Not counted as a backend health failure; bound rows are not counted; per-sample aggregates are not capped. M2: reverse Interpolative is anchored at the later time (Part 13): points at End - i*interval, emitted latest first. 10:00->09:00 @1h yields 10:00. L1: Partial bit (0x4, = Opc.Ua.AggregateBits.Partial) on non-Bad results of a truncated last interval (time-weighted family; per-sample family is a follow-up). L2/L3: aligned with the SDK AggregateCalculator.GetTimeBasedStatusCode (decompiled from Opc.Ua.Server 1.5.378.106): TreatUncertainAsBad=false counts Uncertain time (Uncertain samples, held-into-outage, extrapolation) as Good time; data but no non-Bad time => generic Bad (0x80000000); BadNoData only when there is no data at all. Consequence: a live tag's latest interval reads Good (documented). L5: release note no longer claims Total matches the Gateway Integral exactly (AVEVA's divisor is unverified); it notes Total is now evaluated in C# and subject to the cap. Tests: unit (reverse Interpolative x3, Partial, Bad vs BadNoData incl. an open-ended outage, cap helpers, SDK bit oracles); conformance (reverse Interpolative, raw-row cap at/over/0, bounds not counted, health unaffected); node manager BadTooManyOperations; options default + warning. Each new behaviour falsified by mutation (aggregator x9, data-source cap checks on both backends against the real DBs, node-manager catch).
431 lines
20 KiB
C#
431 lines
20 KiB
C#
using Shouldly;
|
||
using Xunit;
|
||
using ZB.MOM.WW.OtOpcUa.Core.Abstractions;
|
||
using static ZB.MOM.WW.OtOpcUa.Driver.Historian.Sql.Common.Tests.Fixture;
|
||
|
||
namespace ZB.MOM.WW.OtOpcUa.Driver.Historian.Sql.Common.Tests;
|
||
|
||
/// <summary>
|
||
/// The Part 13 time-weighted aggregates (#671) over hand-built sample streams. Every literal is hand-computed in the
|
||
/// comment above it (areas in value·seconds; "raw" = the simple-bounding signal, "bridged" = interpolated bounding).
|
||
/// </summary>
|
||
public sealed class TimeWeightedAggregatorTests
|
||
{
|
||
private static readonly DateTime Now = At(3600);
|
||
private const uint GoodRaw = 0x00000000u;
|
||
private const uint NoData = 0x809B0000u;
|
||
private const uint InvalidInputs = 0x80D60000u;
|
||
private const uint BadCalc = 0x80000401u; // generic Bad | Calculated (an all-outage interval)
|
||
private const uint GoodCalcPartial = 0x00000405u; // Good | Calculated | Partial (truncated last interval)
|
||
|
||
private static IReadOnlyList<DataValueSnapshot> Run(HistoryAggregateType agg, double from, double to, double intervalS,
|
||
params StoredSample[] samples) =>
|
||
TimeWeightedAggregator.Evaluate(agg, BucketPlan.Create(At(from), At(to), TimeSpan.FromSeconds(intervalS)), samples, Now);
|
||
|
||
private static void Values(IReadOnlyList<DataValueSnapshot> s, params double?[] expected)
|
||
{
|
||
s.Count.ShouldBe(expected.Length);
|
||
for (var i = 0; i < expected.Length; i++)
|
||
{
|
||
if (expected[i] is { } e) ((double)s[i].Value!).ShouldBe(e, 1e-9, $"bucket {i}");
|
||
else s[i].Value.ShouldBeNull($"bucket {i}");
|
||
}
|
||
}
|
||
|
||
// ---------------------------------------------------------------- tag A: +0=10 G, +10=20 G, +20=Bad, +30=40 G, +40=50 G
|
||
// Window [0,80), 20 s buckets. Raw: [0,10) 10→20 Good (150); [10,20) 20 held into the outage, Uncertain (200);
|
||
// [20,30) Bad; [30,40) 40→50 Good (450); [40,80) 50 extrapolated, Uncertain (2000).
|
||
// Bridged: [0,10) 150; [10,30) 20→40 = 250 in B0 + 350 in B1; [30,40) 450; [40,80) 50 held.
|
||
|
||
[Fact]
|
||
public void TimeAverage_bridges_the_outage_on_tag_A()
|
||
{
|
||
// B0 (150+250)/20 = 20; B1 (350+450)/20 = 40; B2, B3 = 50. Status (SDK rule, Uncertain time counts as Good):
|
||
// B0 is non-Bad throughout (held-into-outage time is Uncertain) ⇒ Good; B1 has the Bad [20,30) ⇒ Uncertain;
|
||
// B2, B3 are extrapolated (Uncertain) throughout ⇒ Good.
|
||
var s = Run(HistoryAggregateType.TimeAverage, 0, 80, 20, A);
|
||
Values(s, 20, 40, 50, 50);
|
||
s.Select(x => x.StatusCode).ShouldBe([GoodCalc, UncertainCalc, GoodCalc, GoodCalc]);
|
||
s.Select(x => x.SourceTimestampUtc).ShouldBe([At(0), At(20), At(40), At(60)]);
|
||
}
|
||
|
||
[Fact]
|
||
public void Total_is_TimeAverage_times_interval_seconds_on_tag_A()
|
||
{
|
||
// 20×20, 40×20, 50×20, 50×20.
|
||
Values(Run(HistoryAggregateType.Total, 0, 80, 20, A), 400, 800, 1000, 1000);
|
||
}
|
||
|
||
[Fact]
|
||
public void TimeAverage2_excludes_the_bad_interval_on_tag_A()
|
||
{
|
||
// B0 350/20 = 17.5; B1 450/10 = 45 (the Bad [20,30) excluded); B2, B3 = 50.
|
||
var s = Run(HistoryAggregateType.TimeAverage2, 0, 80, 20, A);
|
||
Values(s, 17.5, 45, 50, 50);
|
||
s.Select(x => x.StatusCode).ShouldBe([GoodCalc, UncertainCalc, GoodCalc, GoodCalc]);
|
||
}
|
||
|
||
[Fact]
|
||
public void Total2_integrates_only_the_non_bad_data_on_tag_A()
|
||
{
|
||
// B0 150+200 = 350; B1 450; B2, B3 1000.
|
||
Values(Run(HistoryAggregateType.Total2, 0, 80, 20, A), 350, 450, 1000, 1000);
|
||
}
|
||
|
||
[Fact]
|
||
public void Interpolative_on_tag_A()
|
||
{
|
||
// +0 exact Good 10 (raw status); +20 sits on the Bad sample ⇒ bridged 20→40 at the midpoint = 30, Uncertain;
|
||
// +40 exact Good 50; +60 past the last sample ⇒ 50 extrapolated, Uncertain.
|
||
var s = Run(HistoryAggregateType.Interpolative, 0, 80, 20, A);
|
||
Values(s, 10, 30, 50, 50);
|
||
s.Select(x => x.StatusCode).ShouldBe([GoodRaw, UncertainInterpolated, GoodRaw, UncertainInterpolated]);
|
||
s.Select(x => x.SourceTimestampUtc).ShouldBe([At(0), At(20), At(40), At(60)]);
|
||
s.ShouldAllBe(x => x.ServerTimestampUtc == Now);
|
||
}
|
||
|
||
// ---------------------------------------------------------------- bounding values on both sides, crossing segments
|
||
|
||
private static readonly StoredSample[] Bounded =
|
||
[
|
||
S(-10, HistorianValue.FromDouble(0), Good), // bound before the window
|
||
S(10, HistorianValue.FromDouble(20), Good),
|
||
S(30, HistorianValue.FromDouble(20), Good), // bound after the window
|
||
];
|
||
|
||
[Theory]
|
||
// Window [0,20), 10 s. Segment -10..10 (0→20) crosses the window start: B0 [0,10) = 10→20, mean 15.
|
||
// B1 [10,20) = 20 flat (crossing the window end into the bound). All Good.
|
||
[InlineData(HistoryAggregateType.TimeAverage, 15d, 20d)]
|
||
[InlineData(HistoryAggregateType.TimeAverage2, 15d, 20d)]
|
||
[InlineData(HistoryAggregateType.Total, 150d, 200d)]
|
||
[InlineData(HistoryAggregateType.Total2, 150d, 200d)]
|
||
public void Bounding_values_before_and_after_the_window_are_used(HistoryAggregateType agg, double b0, double b1)
|
||
{
|
||
var s = Run(agg, 0, 20, 10, Bounded);
|
||
Values(s, b0, b1);
|
||
s.ShouldAllBe(x => x.StatusCode == GoodCalc);
|
||
}
|
||
|
||
[Fact]
|
||
public void Interpolative_interpolates_from_the_bound_before_the_window()
|
||
{
|
||
// +0: 0 + (20−0)·(10/20) = 10, Good both ends; +10 exact Good 20.
|
||
var s = Run(HistoryAggregateType.Interpolative, 0, 20, 10, Bounded);
|
||
Values(s, 10, 20);
|
||
s.Select(x => x.StatusCode).ShouldBe([GoodInterpolated, GoodRaw]);
|
||
}
|
||
|
||
[Fact]
|
||
public void A_segment_spanning_several_buckets_is_split_at_every_edge()
|
||
{
|
||
// One segment 0..40 (0→40), window [0,40), 10 s: bucket means 5, 15, 25, 35; Total2 50, 150, 250, 350.
|
||
StoredSample[] line = [S(0, HistorianValue.FromDouble(0), Good), S(40, HistorianValue.FromDouble(40), Good)];
|
||
Values(Run(HistoryAggregateType.TimeAverage2, 0, 40, 10, line), 5, 15, 25, 35);
|
||
Values(Run(HistoryAggregateType.Total2, 0, 40, 10, line), 50, 150, 250, 350);
|
||
Values(Run(HistoryAggregateType.Interpolative, 0, 40, 10, line), 0, 10, 20, 30);
|
||
}
|
||
|
||
// ---------------------------------------------------------------- empty buckets between bounds
|
||
|
||
[Fact]
|
||
public void An_empty_bucket_with_bounds_on_both_sides_is_interpolated_not_no_data()
|
||
{
|
||
// -5 = 0, +25 = 30 (slope 1/s); window [0,20), 10 s holds no sample at all.
|
||
StoredSample[] sparse = [S(-5, HistorianValue.FromDouble(0), Good), S(25, HistorianValue.FromDouble(30), Good)];
|
||
var interp = Run(HistoryAggregateType.Interpolative, 0, 20, 10, sparse);
|
||
Values(interp, 5, 15);
|
||
interp.ShouldAllBe(x => x.StatusCode == GoodInterpolated);
|
||
// B0 5→15 mean 10; B1 15→25 mean 20.
|
||
var avg = Run(HistoryAggregateType.TimeAverage, 0, 20, 10, sparse);
|
||
Values(avg, 10, 20);
|
||
avg.ShouldAllBe(x => x.StatusCode == GoodCalc);
|
||
Values(Run(HistoryAggregateType.Total, 0, 20, 10, sparse), 100, 200);
|
||
}
|
||
|
||
[Fact]
|
||
public void Past_the_last_sample_the_value_is_extrapolated_stepped()
|
||
{
|
||
// -5 = 7 and nothing later: held at 7 over [0,10). The extrapolated time is Uncertain, which the SDK rule
|
||
// (TreatUncertainAsBad = false) counts as Good time ⇒ the interval is Good; the Interpolative point is Uncertain.
|
||
StoredSample[] one = [S(-5, HistorianValue.FromDouble(7), Good)];
|
||
var s = Run(HistoryAggregateType.TimeAverage2, 0, 10, 0, one).Single();
|
||
((double)s.Value!).ShouldBe(7d);
|
||
s.StatusCode.ShouldBe(GoodCalc);
|
||
var i = Run(HistoryAggregateType.Interpolative, 0, 10, 0, one).Single();
|
||
((double)i.Value!).ShouldBe(7d);
|
||
i.StatusCode.ShouldBe(UncertainInterpolated);
|
||
}
|
||
|
||
[Theory]
|
||
[InlineData(HistoryAggregateType.TimeAverage)]
|
||
[InlineData(HistoryAggregateType.TimeAverage2)]
|
||
[InlineData(HistoryAggregateType.Total)]
|
||
[InlineData(HistoryAggregateType.Total2)]
|
||
public void No_data_at_all_is_BadNoData_with_the_calculated_bit(HistoryAggregateType agg)
|
||
{
|
||
var s = Run(agg, 0, 20, 10);
|
||
s.ShouldAllBe(x => x.StatusCode == NoDataCalc && x.Value == null);
|
||
}
|
||
|
||
[Fact]
|
||
public void Interpolative_with_no_data_is_plain_BadNoData()
|
||
{
|
||
// The only sample is at +15: nothing at or before either bucket start (+0, +10).
|
||
var s = Run(HistoryAggregateType.Interpolative, 0, 20, 10, S(15, HistorianValue.FromDouble(1), Good));
|
||
s.ShouldAllBe(x => x.StatusCode == NoData && x.Value == null);
|
||
}
|
||
|
||
// ---------------------------------------------------------------- Bad intervals: TimeAverage vs TimeAverage2/Total2
|
||
|
||
private static readonly StoredSample[] Outage =
|
||
[
|
||
S(0, HistorianValue.FromDouble(10), Good),
|
||
S(5, HistorianValue.Empty, BadNoCommunication),
|
||
S(15, HistorianValue.FromDouble(30), Good),
|
||
S(25, HistorianValue.FromDouble(30), Good), // bound after the window
|
||
];
|
||
|
||
[Fact]
|
||
public void TimeAverage2_and_Total2_exclude_the_bad_interval()
|
||
{
|
||
// Window [0,20) one bucket. Raw: [0,5) 10 held into the outage (50, Uncertain); [5,15) Bad; [15,20) 30 Good (150).
|
||
// TimeAverage2 = 200 / 10 s = 20; Total2 = 200.
|
||
var ta2 = Run(HistoryAggregateType.TimeAverage2, 0, 20, 0, Outage).Single();
|
||
((double)ta2.Value!).ShouldBe(20d);
|
||
ta2.StatusCode.ShouldBe(UncertainCalc);
|
||
((double)Run(HistoryAggregateType.Total2, 0, 20, 0, Outage).Single().Value!).ShouldBe(200d);
|
||
}
|
||
|
||
[Fact]
|
||
public void TimeAverage_and_Total_interpolate_across_the_bad_interval()
|
||
{
|
||
// Bridged: [0,15) 10→30, mean 20 ⇒ 300; [15,20) 30 ⇒ 150. TimeAverage = 450/20 = 22.5; Total = 22.5 × 20 = 450.
|
||
var ta = Run(HistoryAggregateType.TimeAverage, 0, 20, 0, Outage).Single();
|
||
((double)ta.Value!).ShouldBe(22.5d);
|
||
ta.StatusCode.ShouldBe(UncertainCalc);
|
||
((double)Run(HistoryAggregateType.Total, 0, 20, 0, Outage).Single().Value!).ShouldBe(450d);
|
||
}
|
||
|
||
[Fact]
|
||
public void An_interval_entirely_inside_an_outage_is_Bad_but_Interpolative_bridges_it()
|
||
{
|
||
// Window [10,15): raw is Bad throughout ⇒ data but no non-Bad time ⇒ generic Bad (the SDK rule; BadNoData is
|
||
// reserved for no data at all). Interpolative at +10 = 10 + 20·(10/15).
|
||
var ta = Run(HistoryAggregateType.TimeAverage, 10, 15, 0, Outage).Single();
|
||
ta.StatusCode.ShouldBe(BadCalc);
|
||
ta.Value.ShouldBeNull();
|
||
Run(HistoryAggregateType.TimeAverage2, 10, 15, 0, Outage).Single().StatusCode.ShouldBe(BadCalc);
|
||
Run(HistoryAggregateType.Total2, 10, 15, 0, Outage).Single().StatusCode.ShouldBe(BadCalc);
|
||
var i = Run(HistoryAggregateType.Interpolative, 10, 15, 0, Outage).Single();
|
||
((double)i.Value!).ShouldBe(10d + 20d * 10d / 15d, 1e-9);
|
||
i.StatusCode.ShouldBe(UncertainInterpolated);
|
||
}
|
||
|
||
[Fact]
|
||
public void Interpolative_on_a_segment_that_runs_into_an_outage_is_uncertain()
|
||
{
|
||
// +2 lies between the Good +0 and the Bad +5: bridged 10→30 over [0,15) ⇒ 10 + 20·(2/15); the simple-bounding
|
||
// signal there is held into an outage, so the point is Uncertain even though both bridging ends are Good.
|
||
var i = Run(HistoryAggregateType.Interpolative, 2, 20, 0, Outage).Single();
|
||
((double)i.Value!).ShouldBe(10d + 20d * 2d / 15d, 1e-9);
|
||
i.StatusCode.ShouldBe(UncertainInterpolated);
|
||
}
|
||
|
||
[Fact]
|
||
public void The_latest_usable_bound_is_found_behind_a_bad_bound()
|
||
{
|
||
// -10 = 0 G, -5 Bad, +10 = 20 G, +30 = 20 G. Window [0,20) one bucket.
|
||
// Bridged: -10..10 0→20 ⇒ [0,10) 10→20 (150); [10,20) 20 (200) ⇒ TimeAverage = 17.5.
|
||
// Raw: [-5,10) Bad; [10,20) 20 Good (200) ⇒ TimeAverage2 = 20. Good 10 s of 20 ⇒ Uncertain.
|
||
StoredSample[] s =
|
||
[
|
||
S(-10, HistorianValue.FromDouble(0), Good), S(-5, HistorianValue.Empty, BadNoCommunication),
|
||
S(10, HistorianValue.FromDouble(20), Good), S(30, HistorianValue.FromDouble(20), Good),
|
||
];
|
||
((double)Run(HistoryAggregateType.TimeAverage, 0, 20, 0, s).Single().Value!).ShouldBe(17.5d);
|
||
var ta2 = Run(HistoryAggregateType.TimeAverage2, 0, 20, 0, s).Single();
|
||
((double)ta2.Value!).ShouldBe(20d);
|
||
ta2.StatusCode.ShouldBe(UncertainCalc);
|
||
var i = Run(HistoryAggregateType.Interpolative, 0, 20, 0, s).Single();
|
||
((double)i.Value!).ShouldBe(10d); // inside the outage, bridged -10..10 at 0
|
||
i.StatusCode.ShouldBe(UncertainInterpolated);
|
||
}
|
||
|
||
// ---------------------------------------------------------------- stepped Boolean, Uncertain, invalid inputs
|
||
|
||
private static readonly StoredSample[] Switch =
|
||
[
|
||
S(0, HistorianValue.FromBoolean(true), Good),
|
||
S(5, HistorianValue.FromBoolean(false), Good),
|
||
S(15, HistorianValue.FromBoolean(true), Good),
|
||
S(25, HistorianValue.FromBoolean(true), Good), // bound after the window
|
||
];
|
||
|
||
[Fact]
|
||
public void Booleans_are_stepped_not_sloped()
|
||
{
|
||
// Window [0,20), 10 s. B0: 1 over [0,5), 0 over [5,10) ⇒ 0.5 (sloped would give 0.375). B1: 0 over [10,15),
|
||
// 1 over [15,20) ⇒ 0.5. All Good. Total: 5 and 5.
|
||
var s = Run(HistoryAggregateType.TimeAverage, 0, 20, 10, Switch);
|
||
Values(s, 0.5, 0.5);
|
||
s.ShouldAllBe(x => x.StatusCode == GoodCalc);
|
||
Values(Run(HistoryAggregateType.Total, 0, 20, 10, Switch), 5, 5);
|
||
// Interpolative at +10: stepped from +5 (false) ⇒ 0, Good.
|
||
var i = Run(HistoryAggregateType.Interpolative, 0, 20, 10, Switch);
|
||
Values(i, 1, 0);
|
||
i.Select(x => x.StatusCode).ShouldBe([GoodRaw, GoodInterpolated]);
|
||
}
|
||
|
||
[Fact]
|
||
public void Uncertain_time_counts_as_good_time()
|
||
{
|
||
// TreatUncertainAsBad = false (the SDK's time-based status rule): Uncertain time counts toward PercentDataGood.
|
||
// 0 = 4 Uncertain, 10 = 6 Good, 20 = 6 Good: [0,10) sloped 4→6 ⇒ mean 5; [10,20) 6. Window [0,20), 10 s.
|
||
StoredSample[] s =
|
||
[
|
||
S(0, HistorianValue.FromDouble(4), Uncertain), S(10, HistorianValue.FromDouble(6), Good),
|
||
S(20, HistorianValue.FromDouble(6), Good),
|
||
];
|
||
var r = Run(HistoryAggregateType.TimeAverage2, 0, 20, 10, s);
|
||
Values(r, 5, 6);
|
||
r.Select(x => x.StatusCode).ShouldBe([GoodCalc, GoodCalc]);
|
||
}
|
||
|
||
[Fact]
|
||
public void Int64_samples_are_sloped_like_doubles()
|
||
{
|
||
StoredSample[] s = [S(0, HistorianValue.FromInt64(0), Good), S(10, HistorianValue.FromInt64(10), Good)];
|
||
Values(Run(HistoryAggregateType.TimeAverage2, 0, 10, 0, s), 5);
|
||
}
|
||
|
||
[Theory]
|
||
[InlineData(HistoryAggregateType.TimeAverage)]
|
||
[InlineData(HistoryAggregateType.TimeAverage2)]
|
||
[InlineData(HistoryAggregateType.Total)]
|
||
[InlineData(HistoryAggregateType.Total2)]
|
||
public void A_usable_string_sample_makes_the_interval_invalid_inputs(HistoryAggregateType agg)
|
||
{
|
||
StoredSample[] s = [S(0, HistorianValue.FromString("a"), Good), S(10, HistorianValue.FromString("b"), Good)];
|
||
var r = Run(agg, 0, 20, 0, s).Single();
|
||
r.StatusCode.ShouldBe(InvalidInputsCalc);
|
||
r.Value.ShouldBeNull();
|
||
}
|
||
|
||
[Fact]
|
||
public void Interpolative_on_a_string_is_invalid_inputs()
|
||
{
|
||
StoredSample[] s = [S(0, HistorianValue.FromString("a"), Good), S(10, HistorianValue.FromString("b"), Good)];
|
||
Run(HistoryAggregateType.Interpolative, 0, 20, 10, s).ShouldAllBe(x => x.StatusCode == InvalidInputs);
|
||
}
|
||
|
||
// ---------------------------------------------------------------- plan shape
|
||
|
||
[Fact]
|
||
public void A_reverse_window_is_computed_forward_and_returned_descending()
|
||
{
|
||
var s = TimeWeightedAggregator.Evaluate(HistoryAggregateType.TimeAverage2,
|
||
BucketPlan.Create(At(80), At(0), TimeSpan.FromSeconds(20)), A, Now);
|
||
s.Select(x => x.SourceTimestampUtc).ShouldBe([At(60), At(40), At(20), At(0)]);
|
||
Values(s, 50, 50, 45, 17.5);
|
||
}
|
||
|
||
[Fact]
|
||
public void A_truncated_last_bucket_uses_its_own_duration_for_Total_and_is_Partial()
|
||
{
|
||
// Window [0,50), 20 s: B2 = [40,50) is 10 s of the extrapolated 50 ⇒ TimeAverage 50, Total 500.
|
||
var s = Run(HistoryAggregateType.Total, 0, 50, 20, A);
|
||
Values(s, 400, 800, 500);
|
||
// Only the truncated interval carries the Partial bit.
|
||
s.Select(x => x.StatusCode).ShouldBe([GoodCalc, UncertainCalc, GoodCalcPartial]);
|
||
}
|
||
|
||
[Fact]
|
||
public void An_outage_with_no_later_sample_is_Bad_to_the_window_end_not_no_data()
|
||
{
|
||
// 0 = 10 G, then an outage marker at +5 and nothing after: [10,20) lies wholly inside the still-open outage.
|
||
StoredSample[] open = [S(0, HistorianValue.FromDouble(10), Good), S(5, HistorianValue.Empty, BadNoCommunication)];
|
||
Run(HistoryAggregateType.TimeAverage2, 10, 20, 0, open).Single().StatusCode.ShouldBe(BadCalc);
|
||
}
|
||
|
||
[Fact]
|
||
public void A_bad_or_no_data_truncated_interval_carries_no_partial_bit()
|
||
{
|
||
// Window [0,15), 10 s: B1 = [10,15) is inside the outage ⇒ Bad without Partial.
|
||
Run(HistoryAggregateType.TimeAverage2, 0, 15, 10, Outage)[1].StatusCode.ShouldBe(BadCalc);
|
||
Run(HistoryAggregateType.TimeAverage2, 0, 15, 10)[1].StatusCode.ShouldBe(NoDataCalc);
|
||
}
|
||
|
||
// ---------------------------------------------------------------- reverse Interpolative (Part 13: anchored at the later time)
|
||
|
||
[Fact]
|
||
public void A_reverse_Interpolative_read_is_anchored_at_its_later_time()
|
||
{
|
||
// Request At(20) → At(0), 20 s: one point, at At(20) (not At(0)). Bounded: segment 10..30 is 20 flat, Good.
|
||
// A forward read of the same window would give the value at At(0) = 10.
|
||
var s = TimeWeightedAggregator.Evaluate(HistoryAggregateType.Interpolative,
|
||
BucketPlan.Create(At(20), At(0), TimeSpan.FromSeconds(20)), Bounded, Now);
|
||
s.Single().SourceTimestampUtc.ShouldBe(At(20));
|
||
((double)s.Single().Value!).ShouldBe(20d);
|
||
s.Single().StatusCode.ShouldBe(GoodInterpolated);
|
||
}
|
||
|
||
[Fact]
|
||
public void A_reverse_Interpolative_read_steps_back_from_the_later_time_latest_first()
|
||
{
|
||
// Tag A, At(80) → At(0), 20 s: points 80, 60, 40, 20 (latest first). 80 and 60 are past the last sample ⇒ 50
|
||
// extrapolated, Uncertain; 40 exact Good 50; 20 sits on the Bad sample ⇒ bridged 30, Uncertain.
|
||
var s = TimeWeightedAggregator.Evaluate(HistoryAggregateType.Interpolative,
|
||
BucketPlan.Create(At(80), At(0), TimeSpan.FromSeconds(20)), A, Now);
|
||
s.Select(x => x.SourceTimestampUtc).ShouldBe([At(80), At(60), At(40), At(20)]);
|
||
Values(s, 50, 50, 50, 30);
|
||
s.Select(x => x.StatusCode).ShouldBe([UncertainInterpolated, UncertainInterpolated, GoodRaw, UncertainInterpolated]);
|
||
}
|
||
|
||
[Fact]
|
||
public void A_reverse_Interpolative_read_with_a_partial_interval_ends_inside_the_window()
|
||
{
|
||
// At(25) → At(0), 10 s: three intervals ⇒ points 25, 15, 5 (never before the window start).
|
||
// Bounded: -10..10 slope 1/s from 0 ⇒ +5 = 15; 10..30 flat 20 ⇒ +15 = 20, +25 = 20.
|
||
var s = TimeWeightedAggregator.Evaluate(HistoryAggregateType.Interpolative,
|
||
BucketPlan.Create(At(25), At(0), TimeSpan.FromSeconds(10)), Bounded, Now);
|
||
s.Select(x => x.SourceTimestampUtc).ShouldBe([At(25), At(15), At(5)]);
|
||
Values(s, 20, 20, 15);
|
||
}
|
||
|
||
// ---------------------------------------------------------------- raw-row cap helpers
|
||
|
||
[Theory]
|
||
[InlineData(1_000_000, 1_000_001)]
|
||
[InlineData(1, 2)]
|
||
[InlineData(0, int.MaxValue)]
|
||
[InlineData(-5, int.MaxValue)]
|
||
[InlineData(int.MaxValue, int.MaxValue)]
|
||
public void The_window_fetch_limit_is_one_past_the_cap(int cap, int expected) =>
|
||
TimeWeightedAggregator.WindowFetchLimit(cap).ShouldBe(expected);
|
||
|
||
[Fact]
|
||
public void The_window_row_check_fails_only_past_a_positive_cap()
|
||
{
|
||
TimeWeightedAggregator.CheckWindowRows(4, 4, "T");
|
||
TimeWeightedAggregator.CheckWindowRows(5_000_000, 0, "T");
|
||
var ex = Should.Throw<HistoryReadLimitExceededException>(() => TimeWeightedAggregator.CheckWindowRows(5, 4, "T"));
|
||
ex.Limit.ShouldBe(4);
|
||
}
|
||
|
||
[Fact]
|
||
public void A_duplicate_bound_is_ignored()
|
||
{
|
||
// The same row fetched as both "latest usable" and "latest any" bound.
|
||
var dup = new[] { Bounded[0], Bounded[0], Bounded[1], Bounded[2], Bounded[2] };
|
||
Values(Run(HistoryAggregateType.TimeAverage2, 0, 20, 10, dup), 15, 20);
|
||
}
|
||
|
||
[Fact]
|
||
public void A_non_time_weighted_aggregate_is_refused()
|
||
{
|
||
Should.Throw<HistoryAggregateNotSupportedException>(() =>
|
||
new TimeWeightedAggregator(HistoryAggregateType.Average, BucketPlan.Create(At(0), At(10), TimeSpan.Zero)));
|
||
}
|
||
}
|