ruby-sdn 2.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: a68bc5e8882d9fd6cd7d53d6f8eff964f58063ba
+  data.tar.gz: 6672d0e346530f374134c4a2a5376cdabb7dffe7
+SHA512:
+  metadata.gz: e48e42cba2916aeb26229e8e282b9e594a938a91c6bf4f008ee0e28056cc6af699c8ba1bd2d7edf74556a2d7a465923c7655fe70c4cf85cb57eda886671a0874
+  data.tar.gz: daec1e96ac8dafdcf650acc15eb8167c6e09672311fa749f03d7a6c30d44baefdefcf8f63524139c25e68e4834f2e4e57adc5048563c9d6337f12a1f0b69f4a8

data/LICENSE

@@ -0,0 +1,26 @@
+Copyright (c) 1997-2014, Tadayoshi Funaba
+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.

data/README

@@ -0,0 +1,35 @@
+"Sdn" モジュール
+================
+
+これはこよみモジュールです。核となる元のコードは Scott E. Lee 氏による
+SDN こよみライブラリです。
+
+このモジュールはつぎの暦をあつかいます:
+
+    グレゴリオ暦 (いわゆる新暦)、ユリウス暦 (欧州旧暦)、フランス革命暦、
+    ユダヤ暦
+
+
+インストール
+------------
+
+スクリプト "install.rb" をつかいます。
+
+  $ ruby install.rb config
+  $ ruby install.rb setup
+ ($ su)
+  # ruby install.rb install
+
+くわしくは、"ruby install.rb --help" としてください。
+
+
+謝辞
+----
+
+さまざまなこよみ計算のためのコードを書かれた Scott E. Lee 氏に感謝しま
+す。
+
+
+ふなばただよし
+mailto:tadf@funaba.org
+http://www.funaba.org/

data/README.en

@@ -0,0 +1,33 @@
+An "Sdn" module
+===============
+
+This is a calendar module.  The original core code from SDN calendar
+library which is written by Scott E. Lee.
+
+This module supports the following calendars:
+
+    Gregorian, Julian, French Republican, Jewish
+
+
+Install
+-------
+
+Use the script "install.rb".
+
+  $ ruby install.rb config
+  $ ruby install.rb setup
+ ($ su)
+  # ruby install.rb install
+
+For more information, type "ruby install.rb --help".
+
+
+Acknowledgments
+---------------
+
+I thank Scott E. Lee who wrote various calendar code.
+
+
+Tadayoshi Funaba
+mailto:tadf@funaba.org
+http://www.funaba.org/

data/ext/sdn/MANIFEST

@@ -0,0 +1,10 @@
+MANIFEST
+depend
+dow.c
+extconf.rb
+french.c
+gregor.c
+jewish.c
+julian.c
+sdncal.h
+sdnmodule.c

data/ext/sdn/README.sdncal20

@@ -0,0 +1,31 @@
+This package contains the source code of C language functions for date
+arithmetic and for converting between the following calendar types:
+
+    Gregorian
+    Julian
+    French Republican
+    Jewish
+
+Other calendars may be supported in the future.  Let me know what other
+calendars you would like to see added.
+
+There are also verification programs for each calendar (file names starting
+with "v").
+
+There are general comments about using the software in the header file
+(sdncal.h) and specific comments on each calendar in its source code file
+(e.g., julian.c).
+
+If you find bugs, have suggestions for improvement, etc., the author
+welcomes your comments:
+
+    Scott E. Lee
+    scottlee@pobox.com
+    lees@dg-rtp.dg.com
+    CompuServe: 74223,1301
+
+If you cannot find me at the above addresses, try looking for me in the
+Internet White Page Directory at:
+
+    http://www.Four11.com/
+

data/ext/sdn/depend

@@ -0,0 +1,6 @@
+dow.o: dow.c sdncal.h
+french.o: french.c sdncal.h
+gregor.o: gregor.c sdncal.h
+jewish.o: jewish.c sdncal.h
+julian.o: julian.c sdncal.h
+sdnmodule.o: sdnmodule.c sdncal.h

data/ext/sdn/dow.c

@@ -0,0 +1,65 @@
+/* $selId: dow.c,v 2.0 1995/10/24 01:13:06 lees Exp $
+ * Copyright 1993-1995, Scott E. Lee, all rights reserved.
+ * Permission granted to use, copy, modify, distribute and sell so long as
+ * the above copyright and this permission statement are retained in all
+ * copies.  THERE IS NO WARRANTY - USE AT YOUR OWN RISK.
+ */
+
+/**************************************************************************
+ *
+ * These are the externally visible components of this file:
+ *
+ *     int
+ *     DayOfWeek(
+ *         long int sdn);
+ *
+ * Convert a SDN to a day-of-week number (0 to 6).  Where 0 stands for
+ * Sunday, 1 for Monday, etc. and 6 stands for Saturday.
+ *
+ *     char *DayNameShort[7];
+ *
+ * Convert a day-of-week number (0 to 6), as returned from DayOfWeek(), to
+ * the abbreviated (three character) name of the day.
+ *
+ *     char *DayNameLong[7];
+ *
+ * Convert a day-of-week number (0 to 6), as returned from DayOfWeek(), to
+ * the name of the day.
+ *
+ **************************************************************************/
+
+#include "sdncal.h"
+
+int
+DayOfWeek(
+    long int sdn)
+{
+    int dow;
+
+    dow = (sdn + 1) % 7;
+    if (dow >= 0) {
+	return(dow);
+    } else {
+	return(dow + 7);
+    }
+}
+
+const char *DayNameShort[7] = {
+    "Sun",
+    "Mon",
+    "Tue",
+    "Wed",
+    "Thu",
+    "Fri",
+    "Sat"
+};
+
+const char *DayNameLong[7] = {
+    "Sunday",
+    "Monday",
+    "Tuesday",
+    "Wednesday",
+    "Thursday",
+    "Friday",
+    "Saturday"
+};

data/ext/sdn/extconf.rb

@@ -0,0 +1,2 @@
+require 'mkmf'
+create_makefile('sdn')

data/ext/sdn/french.c

@@ -0,0 +1,154 @@
+/* $selId: french.c,v 2.0 1995/10/24 01:13:06 lees Exp $
+ * Copyright 1993-1995, Scott E. Lee, all rights reserved.
+ * Permission granted to use, copy, modify, distribute and sell so long as
+ * the above copyright and this permission statement are retained in all
+ * copies.  THERE IS NO WARRANTY - USE AT YOUR OWN RISK.
+ */
+
+/**************************************************************************
+ *
+ * These are the externally visible components of this file:
+ *
+ *     void
+ *     SdnToFrench(
+ *         long int  sdn,
+ *         int      *pYear,
+ *         int      *pMonth,
+ *         int      *pDay);
+ *
+ * Convert a SDN to a French republican calendar date.  If the input SDN is
+ * before the first day of year 1 or after the last day of year 14, the
+ * three output values will all be set to zero, otherwise *pYear will be in
+ * the range 1 to 14 inclusive; *pMonth will be in the range 1 to 13
+ * inclusive; *pDay will be in the range 1 to 30 inclusive.  If *pMonth is
+ * 13, the SDN represents one of the holidays at the end of the year and
+ * *pDay will be in the range 1 to 6 inclusive.
+ *
+ *     long int
+ *     FrenchToSdn(
+ *         int year,
+ *         int month,
+ *         int day);
+ *
+ * Convert a French republican calendar date to a SDN.  Zero is returned
+ * when the input date is detected as invalid or out of the supported
+ * range.  The return value will be > 0 for all valid, supported dates, but
+ * there are some invalid dates that will return a positive value.  To
+ * verify that a date is valid, convert it to SDN and then back and compare
+ * with the original.
+ *
+ *     char *FrenchMonthName[14];
+ *
+ * Convert a French republican month number (1 to 13) to the name of the
+ * French republican month (null terminated).  An index of 13 (for the
+ * "extra" days at the end of the year) will return the string "Extra".  An
+ * index of zero will return a zero length string.
+ *
+ * VALID RANGE
+ *
+ *     These routines only convert dates in years 1 through 14 (Gregorian
+ *     dates 22 September 1792 through 22 September 1806).  This more than
+ *     covers the period when the calendar was in use.
+ *
+ *     I would support a wider range of dates, but I have not been able to
+ *     find an authoritative definition of when leap years were to have
+ *     occurred.  There are suggestions that it was to skip a leap year ever
+ *     100 years like the Gregorian calendar.
+ *
+ * CALENDAR OVERVIEW
+ *
+ *     The French republican calendar was adopted in October 1793 during
+ *     the French Revolution and was abandoned in January 1806.  The intent
+ *     was to create a new calendar system that was based on scientific
+ *     principals, not religious traditions.
+ *
+ *     The year is divided into 12 months of 30 days each.  The remaining 5
+ *     to 6 days in the year are grouped at the end and are holidays.  Each
+ *     month is divided into three decades (instead of weeks) of 10 days
+ *     each.
+ *
+ *     The epoch (first day of the first year) is 22 September 1792 in the
+ *     Gregorian calendar.  Leap years are every fourth year (year 3, 7,
+ *     11, etc.)
+ *
+ * TESTING
+ *
+ *     This algorithm has been tested from the year 1 to 14.  The source
+ *     code of the verification program is included in this package.
+ *
+ * REFERENCES
+ *
+ *     I have found no detailed, authoritative reference on this calendar.
+ *     The algorithms are based on a preponderance of less authoritative
+ *     sources.
+ *
+ **************************************************************************/
+
+#include "sdncal.h"
+
+#define SDN_OFFSET         2375474
+#define DAYS_PER_4_YEARS   1461
+#define DAYS_PER_MONTH     30
+#define FIRST_VALID        2375840
+#define LAST_VALID         2380952
+
+void
+SdnToFrench(
+    long int  sdn,
+    int      *pYear,
+    int      *pMonth,
+    int      *pDay)
+{
+    long int  temp;
+    int       dayOfYear;
+
+    if (sdn < FIRST_VALID || sdn > LAST_VALID) {
+	*pYear = 0;
+	*pMonth = 0;
+	*pDay = 0;
+	return;
+    }
+
+    temp = (sdn - SDN_OFFSET) * 4 - 1;
+    *pYear = temp / DAYS_PER_4_YEARS;
+    dayOfYear = (temp % DAYS_PER_4_YEARS) / 4;
+    *pMonth = dayOfYear / DAYS_PER_MONTH + 1;
+    *pDay = dayOfYear % DAYS_PER_MONTH + 1;
+}
+
+long int
+FrenchToSdn(
+    int year,
+    int month,
+    int day)
+{
+    /* check for invalid dates */
+    if (year < 1 || year > 14 ||
+	month < 1 || month > 13 ||
+	day < 1 || day > 30)
+    {
+	return(0);
+    }
+
+    return( (year * DAYS_PER_4_YEARS) / 4
+	    + (month - 1) * DAYS_PER_MONTH
+	    + day
+	    + SDN_OFFSET );
+}
+
+const char *FrenchMonthName[14] = {
+    "",
+    "Vendemiaire",
+    "Brumaire",
+    "Frimaire",
+    "Nivose",
+    "Pluviose",
+    "Ventose",
+    "Germinal",
+    "Floreal",
+    "Prairial",
+    "Messidor",
+    "Thermidor",
+    "Fructidor",
+    "Extra"
+};

data/ext/sdn/gregor.c

@@ -0,0 +1,268 @@
+/* $selId: gregor.c,v 2.0 1995/10/24 01:13:06 lees Exp $
+ * Copyright 1993-1995, Scott E. Lee, all rights reserved.
+ * Permission granted to use, copy, modify, distribute and sell so long as
+ * the above copyright and this permission statement are retained in all
+ * copies.  THERE IS NO WARRANTY - USE AT YOUR OWN RISK.
+ */
+
+/**************************************************************************
+ *
+ * These are the externally visible components of this file:
+ *
+ *     void
+ *     SdnToGregorian(
+ *         long int  sdn,
+ *         int      *pYear,
+ *         int      *pMonth,
+ *         int      *pDay);
+ *
+ * Convert a SDN to a Gregorian calendar date.  If the input SDN is less
+ * than 1, the three output values will all be set to zero, otherwise
+ * *pYear will be >= -4714 and != 0; *pMonth will be in the range 1 to 12
+ * inclusive; *pDay will be in the range 1 to 31 inclusive.
+ *
+ *     long int
+ *     GregorianToSdn(
+ *         int inputYear,
+ *         int inputMonth,
+ *         int inputDay);
+ *
+ * Convert a Gregorian calendar date to a SDN.  Zero is returned when the
+ * input date is detected as invalid or out of the supported range.  The
+ * return value will be > 0 for all valid, supported dates, but there are
+ * some invalid dates that will return a positive value.  To verify that a
+ * date is valid, convert it to SDN and then back and compare with the
+ * original.
+ *
+ *     char *MonthNameShort[13];
+ *
+ * Convert a Gregorian month number (1 to 12) to the abbreviated (three
+ * character) name of the Gregorian month (null terminated).  An index of
+ * zero will return a zero length string.
+ *
+ *     char *MonthNameLong[13];
+ *
+ * Convert a Gregorian month number (1 to 12) to the name of the Gregorian
+ * month (null terminated).  An index of zero will return a zero length
+ * string.
+ *
+ * VALID RANGE
+ *
+ *     4714 B.C. to at least 10000 A.D.
+ *
+ *     Although this software can handle dates all the way back to 4714
+ *     B.C., such use may not be meaningful.  The Gregorian calendar was
+ *     not instituted until October 15, 1582 (or October 5, 1582 in the
+ *     Julian calendar).  Some countries did not accept it until much
+ *     later.  For example, Britain converted in 1752, The USSR in 1918 and
+ *     Greece in 1923.  Most European countries used the Julian calendar
+ *     prior to the Gregorian.
+ *
+ * CALENDAR OVERVIEW
+ *
+ *     The Gregorian calendar is a modified version of the Julian calendar.
+ *     The only difference being the specification of leap years.  The
+ *     Julian calendar specifies that every year that is a multiple of 4
+ *     will be a leap year.  This leads to a year that is 365.25 days long,
+ *     but the current accepted value for the tropical year is 365.242199
+ *     days.
+ *
+ *     To correct this error in the length of the year and to bring the
+ *     vernal equinox back to March 21, Pope Gregory XIII issued a papal
+ *     bull declaring that Thursday October 4, 1582 would be followed by
+ *     Friday October 15, 1582 and that centennial years would only be a
+ *     leap year if they were a multiple of 400.  This shortened the year
+ *     by 3 days per 400 years, giving a year of 365.2425 days.
+ *
+ *     Another recently proposed change in the leap year rule is to make
+ *     years that are multiples of 4000 not a leap year, but this has never
+ *     been officially accepted and this rule is not implemented in these
+ *     algorithms.
+ *
+ * ALGORITHMS
+ *
+ *     The calculations are based on three different cycles: a 400 year
+ *     cycle of leap years, a 4 year cycle of leap years and a 5 month
+ *     cycle of month lengths.
+ *
+ *     The 5 month cycle is used to account for the varying lengths of
+ *     months.  You will notice that the lengths alternate between 30
+ *     and 31 days, except for three anomalies: both July and August
+ *     have 31 days, both December and January have 31, and February
+ *     is less than 30.  Starting with March, the lengths are in a
+ *     cycle of 5 months (31, 30, 31, 30, 31):
+ *
+ *         Mar   31 days  \
+ *         Apr   30 days   |
+ *         May   31 days    > First cycle
+ *         Jun   30 days   |
+ *         Jul   31 days  /
+ *
+ *         Aug   31 days  \
+ *         Sep   30 days   |
+ *         Oct   31 days    > Second cycle
+ *         Nov   30 days   |
+ *         Dec   31 days  /
+ *
+ *         Jan   31 days  \
+ *         Feb 28/9 days   |
+ *                          > Third cycle (incomplete)
+ *
+ *     For this reason the calculations (internally) assume that the
+ *     year starts with March 1.
+ *
+ * TESTING
+ *
+ *     This algorithm has been tested from the year 4714 B.C. to 10000
+ *     A.D.  The source code of the verification program is included in
+ *     this package.
+ *
+ * REFERENCES
+ *
+ *     Conversions Between Calendar Date and Julian Day Number by Robert J.
+ *     Tantzen, Communications of the Association for Computing Machinery
+ *     August 1963.  (Also published in Collected Algorithms from CACM,
+ *     algorithm number 199).
+ *
+ **************************************************************************/
+
+#include "sdncal.h"
+
+#define SDN_OFFSET         32045
+#define DAYS_PER_5_MONTHS  153
+#define DAYS_PER_4_YEARS   1461
+#define DAYS_PER_400_YEARS 146097
+
+void
+SdnToGregorian(
+    long int  sdn,
+    int      *pYear,
+    int      *pMonth,
+    int      *pDay)
+{
+    int       century;
+    int       year;
+    int       month;
+    int       day;
+    long int  temp;
+    int       dayOfYear;
+
+    if (sdn <= 0) {
+	*pYear = 0;
+	*pMonth = 0;
+	*pDay = 0;
+	return;
+    }
+
+    temp = (sdn + SDN_OFFSET) * 4 - 1;
+
+    /* Calculate the century (year/100). */
+    century = temp / DAYS_PER_400_YEARS;
+
+    /* Calculate the year and day of year (1 <= dayOfYear <= 366). */
+    temp = ((temp % DAYS_PER_400_YEARS) / 4) * 4 + 3;
+    year = (century * 100) + (temp / DAYS_PER_4_YEARS);
+    dayOfYear = (temp % DAYS_PER_4_YEARS) / 4 + 1;
+
+    /* Calculate the month and day of month. */
+    temp = dayOfYear * 5 - 3;
+    month = temp / DAYS_PER_5_MONTHS;
+    day = (temp % DAYS_PER_5_MONTHS) / 5 + 1;
+
+    /* Convert to the normal beginning of the year. */
+    if (month < 10) {
+	month += 3;
+    } else {
+	year += 1;
+	month -= 9;
+    }
+
+    /* Adjust to the B.C./A.D. type numbering. */
+    year -= 4800;
+    if (year <= 0) year--;
+
+    *pYear = year;
+    *pMonth = month;
+    *pDay = day;
+}
+
+long int
+GregorianToSdn(
+    int inputYear,
+    int inputMonth,
+    int inputDay)
+{
+    int year;
+    int month;
+
+    /* check for invalid dates */
+    if (inputYear == 0 || inputYear < -4714 ||
+	inputMonth <= 0 || inputMonth > 12 ||
+	inputDay <= 0 || inputDay > 31)
+    {
+	return(0);
+    }
+
+    /* check for dates before SDN 1 (Nov 25, 4714 B.C.) */
+    if (inputYear == -4714) {
+	if (inputMonth < 11) {
+	    return(0);
+	}
+	if (inputMonth == 11 && inputDay < 25) {
+	    return(0);
+	}
+    }
+
+    /* Make year always a positive number. */
+    if (inputYear < 0) {
+	year = inputYear + 4801;
+    } else {
+	year = inputYear + 4800;
+    }
+
+    /* Adjust the start of the year. */
+    if (inputMonth > 2) {
+	month = inputMonth - 3;
+    } else {
+	month = inputMonth + 9;
+	year--;
+    }
+
+    return( ((year / 100) * DAYS_PER_400_YEARS) / 4
+	    + ((year % 100) * DAYS_PER_4_YEARS) / 4
+	    + (month * DAYS_PER_5_MONTHS + 2) / 5
+	    + inputDay
+	    - SDN_OFFSET );
+}
+
+const char *MonthNameShort[13] = {
+    "",
+    "Jan",
+    "Feb",
+    "Mar",
+    "Apr",
+    "May",
+    "Jun",
+    "Jul",
+    "Aug",
+    "Sep",
+    "Oct",
+    "Nov",
+    "Dec"
+};
+
+const char *MonthNameLong[13] = {
+    "",
+    "January",
+    "February",
+    "March",
+    "April",
+    "May",
+    "June",
+    "July",
+    "August",
+    "September",
+    "October",
+    "November",
+    "December"
+};