RGBCube/serenity
1
Fork 0
mirror of https://github.com/RGBCube/serenity synced 2025-10-31 22:02:44 +00:00
Code Issues Activity Actions

AK: Redeclare a few AK::Time helpers as constexpr

Browse source 
This is to allow using these methods within an upcoming constexpr
factory method.
This commit is contained in:
Timothy Flynn 2022-01-10 22:38:48 -05:00 • committed by Linus Groh
parent c7e021c1f1
commit 548643bcc9
2 changed files with 21 additions and 23 deletions
Download patch file Download diff file Expand all files Collapse all files

14
AK/Time.cpp
View file

@ -4,7 +4,6 @@
* SPDX-License-Identifier: BSD-2-Clause
*/
#include <AK/Array.h>
#include <AK/Checked.h>
#include <AK/Time.h>
@ -19,19 +18,6 @@
namespace AK {
int day_of_year(int year, unsigned month, int day)
{
VERIFY(month >= 1 && month <= 12);
constexpr Array seek_table = { 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334 };
int day_of_year = seek_table[month - 1] + day - 1;
if (is_leap_year(year) && month >= 3)
day_of_year++;
return day_of_year;
}
int days_in_month(int year, unsigned month)
{
VERIFY(month >= 1 && month <= 12);

30
AK/Time.h
View file

@ -6,6 +6,7 @@
#pragma once
#include <AK/Array.h>
#include <AK/Assertions.h>
#include <AK/Platform.h>
#include <AK/Types.h>
@ -25,6 +26,11 @@ concept TimeSpecType = requires(T t)
t.tv_nsec;
};
constexpr bool is_leap_year(int year)
{
return year % 4 == 0 && (year % 100 != 0 || year % 400 == 0);
}
// Month and day start at 1. Month must be >= 1 and <= 12.
// The return value is 0-indexed, that is 0 is Sunday, 1 is Monday, etc.
// Day may be negative or larger than the number of days
@ -36,22 +42,28 @@ unsigned day_of_week(int year, unsigned month, int day);
// Day may be negative or larger than the number of days
// in the given month. If day is negative enough, the result
// can be negative.
int day_of_year(int year, unsigned month, int day);
constexpr int day_of_year(int year, unsigned month, int day)
{
VERIFY(month >= 1 && month <= 12);
constexpr Array seek_table = { 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334 };
int day_of_year = seek_table[month - 1] + day - 1;
if (is_leap_year(year) && month >= 3)
day_of_year++;
return day_of_year;
}
// Month starts at 1. Month must be >= 1 and <= 12.
int days_in_month(int year, unsigned month);
inline bool is_leap_year(int year)
{
return year % 4 == 0 && (year % 100 != 0 || year % 400 == 0);
}
inline int days_in_year(int year)
constexpr int days_in_year(int year)
{
return 365 + (is_leap_year(year) ? 1 : 0);
}
inline int years_to_days_since_epoch(int year)
constexpr int years_to_days_since_epoch(int year)
{
int days = 0;
for (int current_year = 1970; current_year < year; ++current_year)
@ -61,7 +73,7 @@ inline int years_to_days_since_epoch(int year)
return days;
}
inline int days_since_epoch(int year, int month, int day)
constexpr int days_since_epoch(int year, int month, int day)
{
return years_to_days_since_epoch(year) + day_of_year(year, month, day);
}