如何使用Emacs Calendar在Lisp中实现24个节气

问题描述 投票:2回答:1

我试着在Emacs源代码中学习cal-china.el中的代码,发现以下代码:

;;;###holiday-autoload
(defun holiday-chinese-winter-solstice ()
  "Date of Chinese winter solstice, if visible in calendar.
Returns (((MONTH DAY YEAR) TEXT)), where the date is Gregorian."
  (when (memq displayed-month '(11 12 1)) ; is December visible?
    (list (list (calendar-gregorian-from-absolute
             (calendar-chinese-zodiac-sign-on-or-after
              (calendar-absolute-from-gregorian
               (list 12 15 (if (eq displayed-month 1)
                               (1- displayed-year)
                             displayed-year)))))
            "Winter Solstice Festival"))))

此代码用于计算winter solstice。我也知道计算solar terms需要这24个Chinese calendar。所以我想知道如何计算Lisp中的所有24个节气。

谢谢。

emacs calendar lisp elisp
1个回答
1
投票

如果您对中国日历感兴趣,请参阅此回购详情。

https://github.com/xwl/cal-china-x

安装cal-china-x后,可以使用以下代码计算节气

;;;###autoload
(defun holiday-solar-term (solar-term str)
  "A holiday(STR) on SOLAR-TERM day.
See `cal-china-x-solar-term-name' for a list of solar term names ."
  (cal-china-x-sync-solar-term displayed-year)
  (let ((terms cal-china-x-solar-term-alist)
        i date)
    (while terms
      (setq i (car terms)
            terms (cdr terms))
      (when (string= (cdr i) solar-term)
        (let ((m (caar i))
              (y (cl-caddar i)))
          ;; displayed-year, displayed-month is accurate for the centered month
          ;; only. Cross year view: '(11 12 1), '(12 1 2)
          (when (or (and (cal-china-x-cross-year-view-p)
                         (or (and (= displayed-month 12)
                                  (= m 1)
                                  (= y (1+ displayed-year)))
                             (and (= displayed-month 1)
                                  (= m 12)
                                  (= y (1- displayed-year)))))
                    (= y displayed-year))
            (setq terms '()
                  date (car i))))))
    (holiday-fixed (car date) (cadr date) str)))
© www.soinside.com 2019 - 2024. All rights reserved.