2020-01-18 08:38:21 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are met:
|
|
|
|
*
|
|
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
|
|
* list of conditions and the following disclaimer.
|
|
|
|
*
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
|
|
* and/or other materials provided with the distribution.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
2019-12-04 13:51:43 +00:00
|
|
|
#include <LibCore/CArgsParser.h>
|
2019-12-02 14:22:55 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <time.h>
|
|
|
|
|
2019-12-04 13:51:43 +00:00
|
|
|
const int line_width = 70;
|
|
|
|
const int line_count = 8;
|
|
|
|
const int column_width = 22;
|
|
|
|
|
|
|
|
char print_buffer[line_width * line_count];
|
|
|
|
char temp_buffer[line_width * 8];
|
|
|
|
|
|
|
|
int target_year;
|
|
|
|
int target_month;
|
|
|
|
int target_day;
|
|
|
|
|
|
|
|
int current_year;
|
|
|
|
int current_month;
|
|
|
|
|
2019-12-02 14:22:55 +00:00
|
|
|
int day_of_week(int day, int month, int year)
|
|
|
|
{
|
|
|
|
static const int seek_table[] = { 0, 3, 2, 5, 0, 3, 5, 1, 4, 6, 2, 4 };
|
|
|
|
if (month < 3)
|
|
|
|
--year;
|
|
|
|
|
|
|
|
return (year + year / 4 - year / 100 + year / 400 + seek_table[month - 1] + day) % 7;
|
|
|
|
}
|
|
|
|
|
|
|
|
int get_number_of_days(int month, int year)
|
|
|
|
{
|
|
|
|
bool is_leap_year = ((year % 400 == 0) || (year % 4 == 0 && year % 100 != 0));
|
|
|
|
bool is_long_month = (month == 1 || month == 3 || month == 5 || month == 7 || month == 8 || month == 10 || month == 12);
|
|
|
|
|
|
|
|
if (month == 2)
|
|
|
|
return is_leap_year ? 29 : 28;
|
|
|
|
|
|
|
|
return is_long_month ? 31 : 30;
|
|
|
|
}
|
|
|
|
|
2019-12-04 13:51:43 +00:00
|
|
|
void append_to_print(char* buffer, int row, int column, char* text)
|
|
|
|
{
|
|
|
|
int starting_point = (line_width * row) + (column * column_width);
|
|
|
|
for (int i = 0; text[i] != '\0'; i++) {
|
|
|
|
buffer[starting_point + i] = text[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void insert_month_to_print(int column, int month, int year)
|
|
|
|
{
|
|
|
|
int printing_column = column;
|
|
|
|
int printing_row = 0;
|
|
|
|
|
|
|
|
// FIXME: Both the month name and month header text should be provided by a locale
|
|
|
|
sprintf(temp_buffer, " %02u - %04u ", month, year);
|
|
|
|
append_to_print(print_buffer, printing_row, printing_column, temp_buffer);
|
|
|
|
printing_row++;
|
|
|
|
|
|
|
|
sprintf(temp_buffer, "Su Mo Tu We Th Fr Sa");
|
|
|
|
append_to_print(print_buffer, printing_row, printing_column, temp_buffer);
|
|
|
|
printing_row++;
|
|
|
|
|
|
|
|
int day_to_print = 1;
|
|
|
|
int first_day_of_week_for_month = day_of_week(1, month, year);
|
|
|
|
int days_in_the_month = get_number_of_days(month, year);
|
|
|
|
int last_written_chars = 0;
|
|
|
|
for (int i = 1; day_to_print <= days_in_the_month; ++i) {
|
|
|
|
if (i - 1 < first_day_of_week_for_month) {
|
|
|
|
last_written_chars += sprintf(temp_buffer + last_written_chars, " ");
|
|
|
|
} else {
|
|
|
|
if (year == current_year && month == current_month && target_day == day_to_print) {
|
|
|
|
// FIXME: To replicate Unix cal it would be better to use "\x1b[30;47m%2d\x1b[0m " in here instead of *.
|
|
|
|
// However, doing that messes up the layout.
|
|
|
|
last_written_chars += sprintf(temp_buffer + last_written_chars, "%2d*", day_to_print);
|
|
|
|
} else {
|
|
|
|
last_written_chars += sprintf(temp_buffer + last_written_chars, "%2d ", day_to_print);
|
|
|
|
}
|
|
|
|
day_to_print++;
|
|
|
|
}
|
|
|
|
|
|
|
|
append_to_print(print_buffer, printing_row, printing_column, temp_buffer);
|
|
|
|
|
|
|
|
if (i % 7 == 0) {
|
|
|
|
printing_row++;
|
|
|
|
memset(temp_buffer, ' ', line_width * 8);
|
|
|
|
temp_buffer[line_width * 8 - 1] = '\0';
|
|
|
|
last_written_chars = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void clean_buffers()
|
|
|
|
{
|
|
|
|
for (int i = 1; i < line_width * line_count; ++i) {
|
|
|
|
print_buffer[i - 1] = i % line_width == 0 ? '\n' : ' ';
|
|
|
|
}
|
|
|
|
print_buffer[line_width * line_count - 1] = '\0';
|
|
|
|
|
|
|
|
for (int i = 0; i < line_width; ++i) {
|
|
|
|
temp_buffer[i] = ' ';
|
|
|
|
}
|
|
|
|
temp_buffer[line_width - 1] = '\0';
|
|
|
|
}
|
|
|
|
|
2019-12-02 14:22:55 +00:00
|
|
|
int main(int argc, char** argv)
|
|
|
|
{
|
2019-12-04 13:51:43 +00:00
|
|
|
CArgsParser args_parser("cal");
|
|
|
|
// FIXME: This i a bit of a cheat, as no nested optional args are available on CArgsParser
|
|
|
|
args_parser.add_single_value("[[day] month] year");
|
|
|
|
|
|
|
|
CArgsParserResult args = args_parser.parse(argc, argv);
|
|
|
|
Vector<String> values = args.get_single_values();
|
|
|
|
|
|
|
|
if (values.size() > 3) {
|
|
|
|
printf("Invalid number of values\n");
|
|
|
|
args_parser.print_usage();
|
|
|
|
return 0;
|
|
|
|
}
|
2019-12-02 14:22:55 +00:00
|
|
|
|
|
|
|
time_t now = time(nullptr);
|
|
|
|
auto* tm = localtime(&now);
|
|
|
|
|
2019-12-04 13:51:43 +00:00
|
|
|
target_year = tm->tm_year + 1900;
|
|
|
|
target_month = tm->tm_mon + 1;
|
|
|
|
target_day = tm->tm_mday;
|
2019-12-02 14:22:55 +00:00
|
|
|
|
2019-12-04 13:51:43 +00:00
|
|
|
current_year = target_year;
|
|
|
|
current_month = target_month;
|
|
|
|
|
|
|
|
bool year_mode = false;
|
|
|
|
switch (values.size()) {
|
|
|
|
case 3:
|
|
|
|
target_day = atoi(values[0].characters());
|
|
|
|
target_month = atoi(values[1].characters());
|
|
|
|
target_year = atoi(values[2].characters());
|
2019-12-02 14:22:55 +00:00
|
|
|
|
2019-12-04 13:51:43 +00:00
|
|
|
// When passing the 3 parameters (day, month and year) we assume we're there.
|
|
|
|
current_year = target_year;
|
|
|
|
current_month = target_month;
|
|
|
|
break;
|
|
|
|
case 2:
|
|
|
|
target_month = atoi(values[0].characters());
|
|
|
|
target_year = atoi(values[1].characters());
|
|
|
|
break;
|
|
|
|
case 1:
|
|
|
|
target_year = atoi(values[0].characters());
|
|
|
|
year_mode = true;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
break;
|
2019-12-02 14:22:55 +00:00
|
|
|
}
|
2019-12-04 13:51:43 +00:00
|
|
|
|
|
|
|
clean_buffers();
|
|
|
|
|
|
|
|
if (year_mode) {
|
|
|
|
printf(" ");
|
|
|
|
printf("Year %4d", target_year);
|
|
|
|
printf(" \n\n");
|
|
|
|
|
|
|
|
for (int i = 1; i < 12; ++i) {
|
|
|
|
insert_month_to_print(0, i++, target_year);
|
|
|
|
insert_month_to_print(1, i++, target_year);
|
|
|
|
insert_month_to_print(2, i, target_year);
|
|
|
|
printf(print_buffer);
|
|
|
|
printf("\n");
|
|
|
|
clean_buffers();
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
insert_month_to_print(0, target_month, target_year);
|
|
|
|
printf(print_buffer);
|
|
|
|
printf("\n\n");
|
|
|
|
clean_buffers();
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
2019-12-02 14:22:55 +00:00
|
|
|
}
|