mirror of
https://github.com/GothenburgBitFactory/timewarrior.git
synced 2025-07-07 20:06:39 +02:00
Move debug output about overlaps where it matters
This commit is contained in:
parent
f640eb4bc5
commit
592e2853e0
1 changed files with 9 additions and 5 deletions
|
@ -1,6 +1,6 @@
|
||||||
////////////////////////////////////////////////////////////////////////////////
|
////////////////////////////////////////////////////////////////////////////////
|
||||||
//
|
//
|
||||||
// Copyright 2015 - 2016, Thomas Lauf, Paul Beckingham, Federico Hernandez.
|
// Copyright 2015 - 2018, Thomas Lauf, Paul Beckingham, Federico Hernandez.
|
||||||
//
|
//
|
||||||
// Permission is hereby granted, free of charge, to any person obtaining a copy
|
// Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||||
// of this software and associated documentation files (the "Software"), to deal
|
// of this software and associated documentation files (the "Software"), to deal
|
||||||
|
@ -98,13 +98,17 @@ static void autoAdjust (
|
||||||
Interval& interval)
|
Interval& interval)
|
||||||
{
|
{
|
||||||
auto overlaps = getOverlaps (database, rules, interval);
|
auto overlaps = getOverlaps (database, rules, interval);
|
||||||
debug ("Input " + interval.dump ());
|
|
||||||
debug ("Overlaps with");
|
|
||||||
for (auto& overlap : overlaps)
|
|
||||||
debug (" " + overlap.dump ());
|
|
||||||
|
|
||||||
if (! overlaps.empty ())
|
if (! overlaps.empty ())
|
||||||
{
|
{
|
||||||
|
debug ("Input " + interval.dump ());
|
||||||
|
debug ("Overlaps with");
|
||||||
|
|
||||||
|
for (auto& overlap : overlaps)
|
||||||
|
{
|
||||||
|
debug (" " + overlap.dump ());
|
||||||
|
}
|
||||||
|
|
||||||
if (! adjust)
|
if (! adjust)
|
||||||
throw std::string("You cannot overlap intervals. Correct the start/end "
|
throw std::string("You cannot overlap intervals. Correct the start/end "
|
||||||
"time, or specify the :adjust hint.");
|
"time, or specify the :adjust hint.");
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue