mirror of
https://github.com/GothenburgBitFactory/timewarrior.git
synced 2025-06-26 10:54:28 +02:00
301 lines
18 KiB
C++
301 lines
18 KiB
C++
////////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// Copyright 2016 - 2019, Thomas Lauf, Paul Beckingham, Federico Hernandez.
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
// of this software and associated documentation files (the "Software"), to deal
|
|
// in the Software without restriction, including without limitation the rights
|
|
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
// copies of the Software, and to permit persons to whom the Software is
|
|
// furnished to do so, subject to the following conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be included
|
|
// in all copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
// SOFTWARE.
|
|
//
|
|
// https://www.opensource.org/licenses/mit-license.php
|
|
//
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
#include <cmake.h>
|
|
#include <Range.h>
|
|
#include <test.h>
|
|
#include <iostream>
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
int main (int, char**)
|
|
{
|
|
UnitTest t (101);
|
|
|
|
// bool is_started () const;
|
|
// bool is_ended () const;
|
|
Range i1;
|
|
t.is (i1.is_started (), false, "Range().is_started -> false");
|
|
t.is (i1.is_ended (), false, "Range().is_ended -> false");
|
|
t.is (i1.is_open (), false, "Range().is_open -> false");
|
|
|
|
// void start (Datetime);
|
|
i1.start = Datetime ();
|
|
t.is (i1.is_started (), true, "Range(start=now).is_started -> true");
|
|
t.is (i1.is_ended (), false, "Range(start=now).is_ended -> false");
|
|
t.is (i1.is_open (), true, "Range(start=now).is_open -> true");
|
|
|
|
// void end (Datetime);
|
|
i1.end = Datetime ();
|
|
t.is (i1.is_started (), true, "Range(start=now,end=now).is_started -> true");
|
|
t.is (i1.is_ended (), true, "Range(start=now,end=now).is_ended -> true");
|
|
t.is (i1.is_open (), false, "Range(start=now,end=now).is_open -> false");
|
|
|
|
// this [--------)
|
|
// A [--------)
|
|
// B [--------)
|
|
// C [----)
|
|
// D [--------)
|
|
// E [--------)
|
|
// F [-------------)
|
|
// G [...
|
|
// H [...
|
|
// I [...
|
|
Range refClosed (Datetime (2016, 6, 1), Datetime (2016, 6, 30));
|
|
|
|
Range testA; testA.start = Datetime (2016, 4, 1); testA.end = Datetime (2016, 4, 30);
|
|
Range testB; testB.start = Datetime (2016, 5, 15); testB.end = Datetime (2016, 6, 15);
|
|
Range testC; testC.start = Datetime (2016, 6, 10); testC.end = Datetime (2016, 6, 20);
|
|
Range testD; testD.start = Datetime (2016, 6, 15); testD.end = Datetime (2016, 7, 15);
|
|
Range testE; testE.start = Datetime (2016, 8, 1); testE.end = Datetime (2016, 8, 31);
|
|
Range testF; testF.start = Datetime (2016, 5, 15); testF.end = Datetime (2016, 7, 15);
|
|
Range testG; testG.start = Datetime (2016, 5, 15);
|
|
Range testH; testH.start = Datetime (2016, 6, 15);
|
|
Range testI; testI.start = Datetime (2016, 7, 15);
|
|
|
|
t.notok (refClosed.overlaps (testA), "Range: ! refClosed.overlaps(testA)");
|
|
t.ok (refClosed.overlaps (testB), "Range: refClosed.overlaps(testB)");
|
|
t.ok (refClosed.overlaps (testC), "Range: refClosed.overlaps(testC)");
|
|
t.ok (refClosed.overlaps (testD), "Range: refClosed.overlaps(testD)");
|
|
t.notok (refClosed.overlaps (testE), "Range: ! refClosed.overlaps(testE)");
|
|
t.ok (refClosed.overlaps (testF), "Range: refClosed.overlaps(testF)");
|
|
t.ok (refClosed.overlaps (testG), "Range: refClosed.overlaps(testG)");
|
|
t.ok (refClosed.overlaps (testH), "Range: refClosed.overlaps(testH)");
|
|
t.notok (refClosed.overlaps (testI), "Range: ! refClosed.overlaps(testI)");
|
|
|
|
// this [...
|
|
// A [--------)
|
|
// B [--------)
|
|
// C [----)
|
|
// D [--------)
|
|
// E [--------)
|
|
// F [-------------)
|
|
// G [...
|
|
// H [...
|
|
// I [...
|
|
Range refOpen (Datetime (2016, 6, 1), Datetime (0));
|
|
|
|
t.notok (refOpen.overlaps (testA), "Range: ! refOpen.overlaps(testA)");
|
|
t.ok (refOpen.overlaps (testB), "Range: refOpen.overlaps(testB)");
|
|
t.ok (refOpen.overlaps (testC), "Range: refOpen.overlaps(testC)");
|
|
t.ok (refOpen.overlaps (testD), "Range: refOpen.overlaps(testD)");
|
|
t.ok (refOpen.overlaps (testE), "Range: refOpen.overlaps(testE)");
|
|
t.ok (refOpen.overlaps (testF), "Range: refOpen.overlaps(testF)");
|
|
t.ok (refOpen.overlaps (testG), "Range: refOpen.overlaps(testG)");
|
|
t.ok (refOpen.overlaps (testH), "Range: refOpen.overlaps(testH)");
|
|
t.ok (refOpen.overlaps (testI), "Range: refOpen.overlaps(testI)");
|
|
|
|
// this [--------)
|
|
// A [--------)
|
|
// B [--------)
|
|
// C [----)
|
|
// D [--------)
|
|
// E [--------)
|
|
// F [-------------)
|
|
// G [...
|
|
// H [...
|
|
// I [...
|
|
Range empty;
|
|
t.ok (refClosed.intersect (testA) == empty, "Range: refClosed.intersect(testA) == empty");
|
|
t.ok (refClosed.intersect (testB) == Range (refClosed.start, testB.end), "Range: refClosed.intersect(testB) == Range(refClosed.start,testB.end)");
|
|
t.ok (refClosed.intersect (testC) == testC, "Range: refClosed.intersect(testC) == testC");
|
|
t.ok (refClosed.intersect (testD) == Range (testD.start, refClosed.end), "Range: refClosed.intersect(testD) == Range(testD.start,refClosed.end)");
|
|
t.ok (refClosed.intersect (testE) == empty, "Range: refClosed.intersect(testE) == empty");
|
|
t.ok (refClosed.intersect (testF) == refClosed, "Range: refClosed.intersect(testF) == refClosed");
|
|
t.ok (refClosed.intersect (testG) == refClosed, "Range: refClosed.intersect(testG) == refClosed");
|
|
t.ok (refClosed.intersect (testH) == Range (testH.start, refClosed.end), "Range: refClosed.intersect(testH) == Range(testH.start,refClosed.end)");
|
|
t.ok (refClosed.intersect (testI) == empty, "Range: refClosed.intersect(testI) == empty");
|
|
|
|
// this [...
|
|
// A [--------)
|
|
// B [--------)
|
|
// C [----)
|
|
// D [--------)
|
|
// E [--------)
|
|
// F [-------------)
|
|
// G [...
|
|
// H [...
|
|
// I [...
|
|
t.ok (refOpen.intersect (testA) == empty, "Range: refOpen.intersect(testA) == empty");
|
|
t.ok (refOpen.intersect (testB) == Range (refOpen.start, testB.end), "Range: refOpen.intersect(testB) == Range(refOpen.start,testB.end)");
|
|
t.ok (refOpen.intersect (testC) == testC, "Range: refOpen.intersect(testC) == testC");
|
|
t.ok (refOpen.intersect (testD) == testD, "Range: refOpen.intersect(testD) == testD");
|
|
t.ok (refOpen.intersect (testE) == testE, "Range: refOpen.intersect(testE) == testE");
|
|
t.ok (refOpen.intersect (testF) == Range (refOpen.start, testF.end), "Range: refOpen.intersect(testF) == Range(refOpen.start,testF.end");
|
|
t.ok (refOpen.intersect (testG) == refOpen, "Range: refOpen.intersect(testG) == refOpen");
|
|
t.ok (refOpen.intersect (testH) == testH, "Range: refOpen.intersect(testH) == testH");
|
|
t.ok (refOpen.intersect (testI) == testI, "Range: refOpen.intersect(testI) == testI");
|
|
|
|
// this [--------)
|
|
// A [--------)
|
|
// B [--------)
|
|
// C [----)
|
|
// D [--------)
|
|
// E [--------)
|
|
// F [-------------)
|
|
// G [...
|
|
// H [...
|
|
// I [...
|
|
std::vector <Range> closedSubtractA {refClosed};
|
|
std::vector <Range> closedSubtractB {Range (testB.end, refClosed.end)};
|
|
std::vector <Range> closedSubtractC {Range (refClosed.start, testC.start), Range (testC.end, refClosed.end)};
|
|
std::vector <Range> closedSubtractD {Range (refClosed.start, testD.start)};
|
|
std::vector <Range> closedSubtractE {refClosed};
|
|
std::vector <Range> closedSubtractF {};
|
|
std::vector <Range> closedSubtractG {};
|
|
std::vector <Range> closedSubtractH {Range (refClosed.start, testH.start)};
|
|
std::vector <Range> closedSubtractI {refClosed};
|
|
|
|
t.ok (refClosed.subtract (testA) == closedSubtractA, "Range: refClosed.subtract(testA) == {refClosed}");
|
|
t.ok (refClosed.subtract (testB) == closedSubtractB, "Range: refClosed.subtract(testB) == {Range(testB.end,refClosed.end)}");
|
|
t.ok (refClosed.subtract (testC) == closedSubtractC, "Range: refClosed.subtract(testC) == {Range(refClosed.start,testC.start),"
|
|
"Range(testC.end,refClosed.end}");
|
|
t.ok (refClosed.subtract (testD) == closedSubtractD, "Range: refClosed.subtract(testD) == {Range(refClosed.start,testD.start)}");
|
|
t.ok (refClosed.subtract (testE) == closedSubtractE, "Range: refClosed.subtract(testE) == {refClosed}");
|
|
t.ok (refClosed.subtract (testF) == closedSubtractF, "Range: refClosed.subtract(testF) == {}");
|
|
t.ok (refClosed.subtract (testG) == closedSubtractG, "Range: refClosed.subtract(testG) == {}");
|
|
t.ok (refClosed.subtract (testH) == closedSubtractH, "Range: refClosed.subtract(testH) == {refClosed.start,testH.start}");
|
|
t.ok (refClosed.subtract (testI) == closedSubtractI, "Range: refClosed.subtract(testI) == {refClosed}");
|
|
|
|
// this [...
|
|
// A [--------)
|
|
// B [--------)
|
|
// C [----)
|
|
// D [--------)
|
|
// E [--------)
|
|
// F [-------------)
|
|
// G [...
|
|
// H [...
|
|
// I [...
|
|
std::vector <Range> openSubtractA {refOpen};
|
|
std::vector <Range> openSubtractB {Range (testB.end, refOpen.end)};
|
|
std::vector <Range> openSubtractC {Range (refOpen.start, testC.start), Range (testC.end, refOpen.end)};
|
|
std::vector <Range> openSubtractD {Range (refOpen.start, testD.start), Range (testD.end, refOpen.end)};
|
|
std::vector <Range> openSubtractE {Range (refOpen.start, testE.start), Range (testE.end, refOpen.end)};
|
|
std::vector <Range> openSubtractF {Range (testF.end, refOpen.end)};
|
|
std::vector <Range> openSubtractG {};
|
|
std::vector <Range> openSubtractH {Range (refOpen.start, testH.start)};
|
|
std::vector <Range> openSubtractI {Range (refOpen.start, testI.start)};
|
|
|
|
t.ok (refOpen.subtract (testA) == openSubtractA, "Range: refOpen.subtract(testA) == {refOpen}");
|
|
t.ok (refOpen.subtract (testB) == openSubtractB, "Range: refOpen.subtract(testB) == {Range(testB.end,refOpen.end}");
|
|
t.ok (refOpen.subtract (testC) == openSubtractC, "Range: refOpen.subtract(testC) == {Range(refOpen.start,testC.start),"
|
|
"Range(testC.end,refOpen.end}");
|
|
t.ok (refOpen.subtract (testD) == openSubtractD, "Range: refOpen.subtract(testD) == {Range(refOpen.start,testD.start),"
|
|
"Range(testD.end,refOpen.end}");
|
|
t.ok (refOpen.subtract (testE) == openSubtractE, "Range: refOpen.subtract(testE) == {Range(refOpen.start,testE.start),"
|
|
"Range(testE.end,refOpen.end}");
|
|
t.ok (refOpen.subtract (testF) == openSubtractF, "Range: refOpen.subtract(testF) == {Range(testF.end,refOpen.end}");
|
|
t.ok (refOpen.subtract (testG) == openSubtractG, "Range: refOpen.subtract(testG) == {}");
|
|
t.ok (refOpen.subtract (testH) == openSubtractH, "Range: refOpen.subtract(testH) == {Range(refOpen.start,testH.start}");
|
|
t.ok (refOpen.subtract (testI) == openSubtractI, "Range: refOpen.subtract(testI) == {Range(refOpen.start,testI.start}");
|
|
|
|
// bool encloses (const Range&) const;
|
|
|
|
// this [--------)
|
|
// C [----)
|
|
t.notok (refClosed.encloses (testA), "Range: ! refClosed.encloses(testA)");
|
|
t.notok (refClosed.encloses (testB), "Range: ! refClosed.encloses(testB)");
|
|
t.ok (refClosed.encloses (testC), "Range: refClosed.encloses(testC)");
|
|
t.notok (refClosed.encloses (testD), "Range: ! refClosed.encloses(testD)");
|
|
t.notok (refClosed.encloses (testE), "Range: ! refClosed.encloses(testE)");
|
|
t.notok (refClosed.encloses (testF), "Range: ! refClosed.encloses(testF)");
|
|
t.notok (refClosed.encloses (testG), "Range: ! refClosed.encloses(testG)");
|
|
t.notok (refClosed.encloses (testH), "Range: ! refClosed.encloses(testH)");
|
|
t.notok (refClosed.encloses (testI), "Range: ! refClosed.encloses(testI)");
|
|
|
|
// this [...
|
|
// C [----)
|
|
// D [--------)
|
|
// E [--------)
|
|
// H [...
|
|
// I [...
|
|
t.notok (refOpen.encloses (testA), "Range: ! refOpen.encloses(testA)");
|
|
t.notok (refOpen.encloses (testB), "Range: ! refOpen.encloses(testB)");
|
|
t.ok (refOpen.encloses (testC), "Range: refOpen.encloses(testC)");
|
|
t.ok (refOpen.encloses (testD), "Range: refOpen.encloses(testD)");
|
|
t.ok (refOpen.encloses (testE), "Range: refOpen.encloses(testE)");
|
|
t.notok (refOpen.encloses (testF), "Range: ! refOpen.encloses(testF)");
|
|
t.notok (refOpen.encloses (testG), "Range: ! refOpen.encloses(testG)");
|
|
t.ok (refOpen.encloses (testH), "Range: refOpen.encloses(testH)");
|
|
t.ok (refOpen.encloses (testI), "Range: refOpen.encloses(testI)");
|
|
|
|
// Adjacent ranges.
|
|
Range left (Datetime ("20160425T110000"), Datetime ("20160425T120000"));
|
|
Range right (Datetime ("20160425T120000"), Datetime ("20160425T130000"));
|
|
t.notok (left.overlaps (right), "Range: left (11am - 12pm) does not overlaps with right (12pm - 1pm)");
|
|
|
|
auto intersection = left.intersect (right);
|
|
t.ok (intersection.start.toEpoch () == 0, "Range: adjacent ranges do not intersect");
|
|
t.ok (intersection.end.toEpoch () == 0, "Range: adjacent ranges do not intersect");
|
|
|
|
// Range length.
|
|
t.ok (Range (Datetime (2016, 1, 1), Datetime (2016, 1, 3)).total () == (2 * 86400),
|
|
"Range (Datetime (2016, 1, 1), Datetime (2016, 1, 3)).total () == (2 * 86400)");
|
|
|
|
Range oldClosed (Datetime (2016, 1, 1), Datetime (2016, 1, 3));
|
|
Range oldOpen (Datetime (2016, 1, 1), Datetime (0));
|
|
Range oldClosedNow (Datetime (2016, 1, 1), Datetime ());
|
|
|
|
t.ok (oldClosed.total () < oldOpen.total (), "Range: total for closed range < open range with same start time");
|
|
t.ok (oldOpen.total () <= oldClosedNow.total (), "Range: total for open range predictable");
|
|
|
|
// this [--------)
|
|
// B [--------)
|
|
// C [----)
|
|
// D [--------)
|
|
// F [-------------)
|
|
// G [...
|
|
// H [...
|
|
t.ok (refClosed.combine (testB) == Range (testB.start, refClosed.end), "Range: refClosed.combine(testB) == Range(testB.start,refClosed.end)");
|
|
t.ok (refClosed.combine (testC) == refClosed, "Range: refClosed.combine(testC) == refClosed");
|
|
t.ok (refClosed.combine (testD) == Range (refClosed.start, testD.end), "Range: refClosed.combine(testD) == Range(refClosed.start,testD.end)");
|
|
t.ok (refClosed.combine (testF) == testF, "Range: refClosed.combine(testF) == testF");
|
|
t.ok (refClosed.combine (testG) == testG, "Range: refClosed.combine(testG) == testG");
|
|
t.ok (refClosed.combine (testH) == Range (refClosed.start, {0}), "Range: refClosed.combine(testH) == Range(refClosed.start,{0})");
|
|
|
|
// this [...
|
|
// B [--------)
|
|
// C [----)
|
|
// D [--------)
|
|
// E [--------)
|
|
// F [-------------)
|
|
// G [...
|
|
// H [...
|
|
// I [...
|
|
t.ok (refOpen.combine (testB) == Range (testB.start, {0}), "Range: refOpen.combine(testB) == Range(testB.start,{0})");
|
|
t.ok (refOpen.combine (testC) == refOpen, "Range: refOpen.combine(testC) == refOpen");
|
|
t.ok (refOpen.combine (testD) == refOpen, "Range: refOpen.combine(testD) == refOpen");
|
|
t.ok (refOpen.combine (testE) == refOpen, "Range: refOpen.combine(testE) == refOpen");
|
|
t.ok (refOpen.combine (testF) == Range (testF.start, {0}), "Range: refOpen.combine(testF) == Range(testF.start,{0})");
|
|
t.ok (refOpen.combine (testG) == testG, "Range: refOpen.combine(testG) == testG");
|
|
t.ok (refOpen.combine (testH) == refOpen, "Range: refOpen.combine(testH) == refOpen");
|
|
t.ok (refOpen.combine (testI) == refOpen, "Range: refOpen.combine(testI) == refOpen");
|
|
|
|
return 0;
|
|
}
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|