mirror of
				https://github.com/firefly-iii/firefly-iii.git
				synced 2025-10-31 18:54:58 +00:00 
			
		
		
		
	
		
			
				
	
	
		
			180 lines
		
	
	
		
			5.9 KiB
		
	
	
	
		
			PHP
		
	
	
	
	
	
			
		
		
	
	
			180 lines
		
	
	
		
			5.9 KiB
		
	
	
	
		
			PHP
		
	
	
	
	
	
| <?php
 | |
| 
 | |
| /**
 | |
|  * CalculateXOccurrences.php
 | |
|  * Copyright (c) 2019 james@firefly-iii.org
 | |
|  *
 | |
|  * This file is part of Firefly III (https://github.com/firefly-iii).
 | |
|  *
 | |
|  * This program is free software: you can redistribute it and/or modify
 | |
|  * it under the terms of the GNU Affero General Public License as
 | |
|  * published by the Free Software Foundation, either version 3 of the
 | |
|  * License, or (at your option) any later version.
 | |
|  *
 | |
|  * This program is distributed in the hope that it will be useful,
 | |
|  * but WITHOUT ANY WARRANTY; without even the implied warranty of
 | |
|  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 | |
|  * GNU Affero General Public License for more details.
 | |
|  *
 | |
|  * You should have received a copy of the GNU Affero General Public License
 | |
|  * along with this program.  If not, see <https://www.gnu.org/licenses/>.
 | |
|  */
 | |
| 
 | |
| declare(strict_types=1);
 | |
| 
 | |
| namespace FireflyIII\Support\Repositories\Recurring;
 | |
| 
 | |
| use Carbon\Carbon;
 | |
| 
 | |
| /**
 | |
|  * Class CalculateXOccurrences
 | |
|  */
 | |
| trait CalculateXOccurrences
 | |
| {
 | |
|     /**
 | |
|      * Calculates the number of daily occurrences for a recurring transaction, starting at the date, until $count is
 | |
|      * reached. It will skip over $skipMod -1 recurrences.
 | |
|      */
 | |
|     protected function getXDailyOccurrences(Carbon $date, int $count, int $skipMod): array
 | |
|     {
 | |
|         $return   = [];
 | |
|         $mutator  = clone $date;
 | |
|         $total    = 0;
 | |
|         $attempts = 0;
 | |
|         while ($total < $count) {
 | |
|             $mutator->addDay();
 | |
|             if (0 === $attempts % $skipMod) {
 | |
|                 $return[] = clone $mutator;
 | |
|                 ++$total;
 | |
|             }
 | |
|             ++$attempts;
 | |
|         }
 | |
| 
 | |
|         return $return;
 | |
|     }
 | |
| 
 | |
|     /**
 | |
|      * Calculates the number of monthly occurrences for a recurring transaction, starting at the date, until $count is
 | |
|      * reached. It will skip over $skipMod -1 recurrences.
 | |
|      */
 | |
|     protected function getXMonthlyOccurrences(Carbon $date, int $count, int $skipMod, string $moment): array
 | |
|     {
 | |
|         $return     = [];
 | |
|         $mutator    = clone $date;
 | |
|         $total      = 0;
 | |
|         $attempts   = 0;
 | |
|         $dayOfMonth = (int) $moment;
 | |
|         if ($mutator->day > $dayOfMonth) {
 | |
|             // day has passed already, add a month.
 | |
|             $mutator->addMonth();
 | |
|         }
 | |
| 
 | |
|         while ($total < $count) {
 | |
|             $domCorrected = min($dayOfMonth, $mutator->daysInMonth);
 | |
|             $mutator->day = $domCorrected;
 | |
|             if (0 === $attempts % $skipMod) {
 | |
|                 $return[] = clone $mutator;
 | |
|                 ++$total;
 | |
|             }
 | |
|             ++$attempts;
 | |
|             $mutator->endOfMonth()->addDay();
 | |
|         }
 | |
| 
 | |
|         return $return;
 | |
|     }
 | |
| 
 | |
|     /**
 | |
|      * Calculates the number of NDOM occurrences for a recurring transaction, starting at the date, until $count is
 | |
|      * reached. It will skip over $skipMod -1 recurrences.
 | |
|      */
 | |
|     protected function getXNDomOccurrences(Carbon $date, int $count, int $skipMod, string $moment): array
 | |
|     {
 | |
|         $return     = [];
 | |
|         $total      = 0;
 | |
|         $attempts   = 0;
 | |
|         $mutator    = clone $date;
 | |
|         $mutator->addDay(); // always assume today has passed.
 | |
|         $mutator->startOfMonth();
 | |
|         // this feels a bit like a cop out but why reinvent the wheel?
 | |
|         $counters   = [1 => 'first', 2 => 'second', 3 => 'third', 4 => 'fourth', 5 => 'fifth'];
 | |
|         $daysOfWeek = [1 => 'Monday', 2 => 'Tuesday', 3 => 'Wednesday', 4 => 'Thursday', 5 => 'Friday', 6 => 'Saturday', 7 => 'Sunday'];
 | |
|         $parts      = explode(',', $moment);
 | |
| 
 | |
|         while ($total < $count) {
 | |
|             $string    = sprintf('%s %s of %s %s', $counters[$parts[0]], $daysOfWeek[$parts[1]], $mutator->format('F'), $mutator->format('Y'));
 | |
|             $newCarbon = new Carbon($string);
 | |
|             if (0 === $attempts % $skipMod) {
 | |
|                 $return[] = clone $newCarbon;
 | |
|                 ++$total;
 | |
|             }
 | |
|             ++$attempts;
 | |
|             $mutator->endOfMonth()->addDay();
 | |
|         }
 | |
| 
 | |
|         return $return;
 | |
|     }
 | |
| 
 | |
|     /**
 | |
|      * Calculates the number of weekly occurrences for a recurring transaction, starting at the date, until $count is
 | |
|      * reached. It will skip over $skipMod -1 recurrences.
 | |
|      */
 | |
|     protected function getXWeeklyOccurrences(Carbon $date, int $count, int $skipMod, string $moment): array
 | |
|     {
 | |
|         $return        = [];
 | |
|         $total         = 0;
 | |
|         $attempts      = 0;
 | |
|         $mutator       = clone $date;
 | |
|         // monday = 1
 | |
|         // sunday = 7
 | |
|         $mutator->addDay(); // always assume today has passed.
 | |
|         $dayOfWeek     = (int) $moment;
 | |
|         if ($mutator->dayOfWeekIso > $dayOfWeek) {
 | |
|             // day has already passed this week, add one week:
 | |
|             $mutator->addWeek();
 | |
|         }
 | |
|         // today is wednesday (3), expected is friday (5): add two days.
 | |
|         // today is friday (5), expected is monday (1), subtract four days.
 | |
|         $dayDifference = $dayOfWeek - $mutator->dayOfWeekIso;
 | |
|         $mutator->addDays($dayDifference);
 | |
| 
 | |
|         while ($total < $count) {
 | |
|             if (0 === $attempts % $skipMod) {
 | |
|                 $return[] = clone $mutator;
 | |
|                 ++$total;
 | |
|             }
 | |
|             ++$attempts;
 | |
|             $mutator->addWeek();
 | |
|         }
 | |
| 
 | |
|         return $return;
 | |
|     }
 | |
| 
 | |
|     /**
 | |
|      * Calculates the number of yearly occurrences for a recurring transaction, starting at the date, until $count is
 | |
|      * reached. It will skip over $skipMod -1 recurrences.
 | |
|      */
 | |
|     protected function getXYearlyOccurrences(Carbon $date, int $count, int $skipMod, string $moment): array
 | |
|     {
 | |
|         $return     = [];
 | |
|         $mutator    = clone $date;
 | |
|         $total      = 0;
 | |
|         $attempts   = 0;
 | |
|         $date       = new Carbon($moment);
 | |
|         $date->year = $mutator->year;
 | |
|         if ($mutator > $date) {
 | |
|             $date->addYear();
 | |
|         }
 | |
|         $obj        = clone $date;
 | |
|         while ($total < $count) {
 | |
|             if (0 === $attempts % $skipMod) {
 | |
|                 $return[] = clone $obj;
 | |
|                 ++$total;
 | |
|             }
 | |
|             $obj->addYears();
 | |
|             ++$attempts;
 | |
|         }
 | |
| 
 | |
|         return $return;
 | |
|     }
 | |
| }
 |