remind-rb 6.2.10.1

data/remind-v06.02.10/src/rem2ps.h

@@ -0,0 +1,229 @@
+/***************************************************************/
+/*                                                             */
+/*  REM2PS.H                                                   */
+/*                                                             */
+/*  Define the PostScript prologue                             */
+/*                                                             */
+/*  This file is part of REMIND.                               */
+/*  Copyright (C) 1992-2026 by Dianne Skoll                    */
+/*  SPDX-License-Identifier: GPL-2.0-only                      */
+/*                                                             */
+/***************************************************************/
+
+char *PSProlog1[] =
+{
+    "% This file was produced by Remind and Rem2PS, written by",
+    "% Dianne Skoll.",
+    "% Remind and Rem2PS are Copyright (C) 1992-2026 Dianne Skoll.",
+    "/ISOLatin1Encoding where { pop save true }{ false } ifelse",
+    "  /ISOLatin1Encoding [ StandardEncoding 0 45 getinterval aload pop /minus",
+    "    StandardEncoding 46 98 getinterval aload pop /dotlessi /grave /acute",
+    "    /circumflex /tilde /macron /breve /dotaccent /dieresis /.notdef /ring",
+    "    /cedilla /.notdef /hungarumlaut /ogonek /caron /space /exclamdown /cent",
+    "    /sterling /currency /yen /brokenbar /section /dieresis /copyright",
+    "    /ordfeminine /guillemotleft /logicalnot /hyphen /registered /macron",
+    "    /degree /plusminus /twosuperior /threesuperior /acute /mu /paragraph",
+    "    /periodcentered /cedilla /onesuperior /ordmasculine /guillemotright",
+    "    /onequarter /onehalf /threequarters /questiondown /Agrave /Aacute",
+    "    /Acircumflex /Atilde /Adieresis /Aring /AE /Ccedilla /Egrave /Eacute",
+    "    /Ecircumflex /Edieresis /Igrave /Iacute /Icircumflex /Idieresis /Eth",
+    "    /Ntilde /Ograve /Oacute /Ocircumflex /Otilde /Odieresis /multiply",
+    "    /Oslash /Ugrave /Uacute /Ucircumflex /Udieresis /Yacute /Thorn",
+    "    /germandbls /agrave /aacute /acircumflex /atilde /adieresis /aring /ae",
+    "    /ccedilla /egrave /eacute /ecircumflex /edieresis /igrave /iacute",
+    "    /icircumflex /idieresis /eth /ntilde /ograve /oacute /ocircumflex",
+    "    /otilde /odieresis /divide /oslash /ugrave /uacute /ucircumflex",
+    "    /udieresis /yacute /thorn /ydieresis ] def",
+    "{ restore } if",
+    "",
+    "/reencodeISO { %def",
+    "    findfont dup length dict begin",
+    "    { 1 index /FID ne { def }{ pop pop } ifelse } forall",
+    "    /Encoding ISOLatin1Encoding def",
+    "    currentdict end definefont pop",
+    "} bind def",
+    "/copyFont { %def",
+    "    findfont dup length dict begin",
+    "    { 1 index /FID ne { def } { pop pop } ifelse } forall",
+    "    currentdict end definefont pop",
+    "} bind def",
+    "",
+    "% L - Draw a line",
+    "/L {",
+    "   newpath moveto lineto stroke",
+    "} bind def",
+    "% string1 string2 strcat string",
+    "% Function: Concatenates two strings together.",
+    "/strcat {",
+    "         2 copy length exch length add",
+    "         string dup",
+    "         4 2 roll",
+    "         2 index 0 3 index",
+    "         putinterval",
+    "         exch length exch putinterval",
+    "} bind def",
+    "% string doheading",
+    "/doheading",
+    "{",
+    "   /monthyr exch def",
+    "",
+    "   /TitleFont findfont",
+    "   TitleSize scalefont setfont",
+    "   monthyr stringwidth",
+    "   /hgt exch def",
+    "   2 div MaxX MinX add 2 div exch sub /x exch def",
+    "   MaxY Border sub TitleSize sub /y exch def",
+    "   newpath x y moveto monthyr show",
+    "   newpath x y moveto monthyr false charpath flattenpath pathbbox",
+    "   pop pop Border sub /y exch def pop",
+    "   MinX y MaxX y L",
+    "   /topy y def",
+    "   /HeadFont findfont HeadSize scalefont setfont",
+    "% Do the days of the week",
+    "   MaxX MinX sub 7 div /xincr exch def",
+    "   /x MinX def",
+    NULL
+};
+char *PSProlog2[] =
+{
+    "  {",
+    "     HeadSize x y HeadSize 2 mul sub x xincr add y CenterText",
+    "     x xincr add /x exch def",
+    "  } forall",
+    "  y HeadSize 2 mul sub /y exch def",
+    "  MinX y MaxX y L",
+    "  /ytop y def /ymin y def",
+    "}",
+    "def",
+    "/CenterText",
+    "{",
+    "   /maxy exch def",
+    "   /maxx exch def",
+    "   /miny exch def",
+    "   /minx exch def",
+    "   /sz exch def",
+    "   /str exch def",
+    "   str stringwidth pop",
+    "   2 div maxx minx add 2 div exch sub",
+    "   sz 2 div maxy miny add 2 div exch sub",
+    "   moveto str show",
+    "} def",
+    "% Variables:",
+    "% curline - a string holding the current line",
+    "% y - current y pos",
+    "% yincr - increment to next line",
+    "% xleft - left margin",
+    "% width - max width.",
+    "% EnterOneWord - given a word, enter it into the box.",
+    "% string EnterOneWord",
+    "/EnterOneWord {",
+    "   { EnterOneWordAux",
+    "     {exit} if }",
+    "   loop",
+    "} bind def",
+    "% EnterOneWordAux - if the word fits, enter it into box and return true.",
+    "% If it doesn't fit, put as much as will fit and return the string and false.",
+    "/EnterOneWordAux {",
+    "   /word exch def",
+    "   /tmpline curline word strcat def",
+    "   tmpline stringwidth pop width gt",
+    "   {MoveToNewLine}",
+    "   {/curline tmpline ( ) strcat def /word () def}",
+    "   ifelse",
+    "   word () eq",
+    "   {true}",
+    "   {word false}",
+    "   ifelse",
+    "} bind def",
+    "% MoveToNewLine - move to a new line, resetting word as appropriate",
+    "/MoveToNewLine {",
+    "   curline () ne",
+    "   {newpath xleft y moveto curline show /curline () def /y y yincr add def}   ",
+    "   {ChopWord}",
+    "   ifelse",
+    "} bind def",
+    "% ChopWord - word won't fit.  Chop it and find biggest piece that will fit",
+    "/ChopWord {",
+    "   /curline () def",
+    "   /len word length def",
+    "   /Fcount len 1 sub def",
+    "",
+    "   {",
+    "     word 0 Fcount getinterval stringwidth pop width le",
+    "     {exit} if",
+    "     /Fcount Fcount 1 sub def",
+    "   } loop",
+    "% Got the count.  Display it and reset word",
+    "   newpath xleft y moveto word 0 Fcount getinterval show",
+    "   /y y yincr add def",
+    "   /word word Fcount len Fcount sub getinterval def",
+    "} bind def",
+    "/FinishFormatting {",
+    "   word () ne",
+    "   {newpath xleft y moveto word show /word () def",
+    "    /curline () def /y y yincr add def}",
+    "   {curline () ne",
+    "     {newpath xleft y moveto curline show /word () def",
+    "      /curline () def /y y yincr add def} if}",
+    "   ifelse",
+    "} bind def",
+    "% FillBoxWithText - fill a box with text",
+    "% text-array xleft width yincr y FillBoxWithText new-y",
+    "% Returns the new Y-coordinate.",
+    "/FillBoxWithText {",
+    "   /y exch def",
+    "   /yincr exch def",
+    "   /width exch def",
+    "   /xleft exch def",
+    "   /curline () def",
+    "   % The last two strings in the word array are actually the PostScript",
+    "   % code to execute before and after the entry is printed.",
+    "   dup dup",
+    "   length 1 sub",
+    "   get",
+    "   exch",
+    "   dup dup",
+    "   length 2 sub",
+    "   get",
+    "   dup length 0 gt",
+    "   {cvx exec} {pop} ifelse",
+    "   dup length 2 sub 0 exch getinterval",
+    "   {EnterOneWord} forall",
+    "   FinishFormatting",
+    "   dup length 0 gt",
+    "   {cvx exec} {pop} ifelse",
+    "   y",
+    "} bind def",
+    "% Variables for calendar boxes:",
+    "% ytop - current top position",
+    "% ymin - minimum y reached for current row",
+    "% border ytop xleft width textarray daynum onright DoCalBox ybot",
+    "% Do the entries for one calendar box.  Returns lowest Y-coordinate reached",
+    "/DoCalBox {",
+    "   /onright exch def",
+    "   /daynum exch def",
+    "   /textarr exch def",
+    "   /wid exch def",
+    "   /xl exch def",
+    "   /yt exch def",
+    "   /border exch def",
+    "% Do the day number",
+    "   /DayFont findfont DaySize scalefont setfont",
+    "   onright 1 eq",
+    "   {xl wid add border sub daynum stringwidth pop sub yt border sub DaySize sub moveto daynum show}",
+    "   {xl border add yt border sub DaySize sub moveto daynum show}",
+    "   ifelse",
+    "% Do the text entries.  Precharge the stack with current y pos.",
+    "   /ycur yt border sub DaySize sub DaySize sub 2 add def",
+    "   /EntryFont findfont EntrySize scalefont setfont",
+    "   ycur",
+    "   textarr",
+    "   { exch 2 sub /ycur exch def xl border add wid border sub border sub EntrySize 2 add neg",
+    "     ycur FillBoxWithText }",
+    "    forall",
+    "} bind def",
+    "2 setlinecap",
+    "% Define a default PreCal procedure",
+    "/PreCal { pop pop } bind def",
+    NULL
+};

data/remind-v06.02.10/src/sort.c

@@ -0,0 +1,257 @@
+/***************************************************************/
+/*                                                             */
+/*  SORT.C                                                     */
+/*                                                             */
+/*  Routines for sorting reminders by trigger date             */
+/*                                                             */
+/*  This file is part of REMIND.                               */
+/*  Copyright (C) 1992-2026 by Dianne Skoll                    */
+/*  SPDX-License-Identifier: GPL-2.0-only                      */
+/*                                                             */
+/***************************************************************/
+
+#include "config.h"
+
+#include <stdio.h>
+#include <string.h>
+
+#include <stdlib.h>
+#include "types.h"
+#include "protos.h"
+#include "globals.h"
+#include "err.h"
+
+/* The structure of a sorted entry */
+typedef struct sortrem {
+    struct sortrem *next;
+    char const *text;
+    char const *url;
+    int trigdate;
+    int trigtime;
+    int typ;
+    int priority;
+} Sortrem;
+
+/* The sorted reminder queue */
+static Sortrem *SortedQueue = (Sortrem *) NULL;
+
+static Sortrem *MakeSortRem (int dse, int tim, char const *url, char const *body, int typ, int prio);
+static void IssueSortBanner (int dse);
+
+/***************************************************************/
+/*                                                             */
+/*  MakeSortRem                                                */
+/*                                                             */
+/*  Create a new Sortrem entry - return NULL on failure.       */
+/*                                                             */
+/***************************************************************/
+static Sortrem *MakeSortRem(int dse, int tim, char const *url, char const *body, int typ, int prio)
+{
+    Sortrem *srem = NEW(Sortrem);
+    if (!srem) return NULL;
+
+    srem->text = strdup(body);
+    if (!srem->text) {
+        free(srem);
+        return NULL;
+    }
+    if (url) {
+        srem->url = strdup(url);
+        if (!srem->url) {
+            free((char *) srem->text);
+            free(srem);
+            return NULL;
+        }
+    } else {
+        srem->url = NULL;
+    }
+
+    srem->trigdate = dse;
+    srem->trigtime = tim;
+    srem->typ = typ;
+    srem->priority = prio;
+    srem->next = NULL;
+    return srem;
+}
+
+/***************************************************************/
+/*                                                             */
+/*  InsertIntoSortBuffer                                       */
+/*                                                             */
+/*  Insert a reminder into the sort buffer                     */
+/*                                                             */
+/***************************************************************/
+int InsertIntoSortBuffer(int dse, int tim, char const *url, char const *body, int typ, int prio)
+{
+    Sortrem *srem = MakeSortRem(dse, tim, url, body, typ, prio);
+    Sortrem *cur = SortedQueue, *prev = NULL;
+    int ShouldGoAfter;
+
+    if (!srem) {
+        Eprint("%s", GetErr(E_NO_MEM));
+        IssueSortedReminders();
+        SortByDate = 0;
+        SortByTime = 0;
+        SortByPrio = 0;
+        UntimedBeforeTimed = 0;
+        return E_NO_MEM;
+    }
+
+    /* Find the correct place in the sorted list */
+    if (!SortedQueue) {
+        SortedQueue = srem;
+        return OK;
+    }
+    while (cur) {
+        ShouldGoAfter = CompareRems(srem->trigdate, srem->trigtime, srem->priority,
+                                    cur->trigdate, cur->trigtime, cur->priority,
+                                    SortByDate, SortByTime, SortByPrio, UntimedBeforeTimed);
+
+        if (ShouldGoAfter <= 0) {
+            prev = cur;
+            cur = cur->next;
+        } else {
+            if (prev) {
+                prev->next = srem;
+                srem->next = cur;
+            } else {
+                SortedQueue = srem;
+                srem->next = cur;
+            }
+            return OK;
+        }
+
+    }
+    prev->next = srem;
+    srem->next = cur;  /* For safety - actually redundant */
+    return OK;
+}
+
+/***************************************************************/
+/*                                                             */
+/*  IssueSortedReminders                                       */
+/*                                                             */
+/*  Issue all of the sorted reminders and free memory.         */
+/*                                                             */
+/***************************************************************/
+void IssueSortedReminders(void)
+{
+    Sortrem *cur = SortedQueue;
+    Sortrem *next;
+    int olddate = NO_DATE;
+
+    while (cur) {
+        next = cur->next;
+        switch(cur->typ) {
+        case MSG_TYPE:
+            if (MsgCommand && *MsgCommand) {
+                DoMsgCommand(MsgCommand, cur->text, 0);
+            } else {
+                if (cur->trigdate != olddate) {
+                    IssueSortBanner(cur->trigdate);
+                    olddate = cur->trigdate;
+                }
+                if (cur->url) {
+                    printf("\x1B]8;;%s\x1B\\", cur->url);
+                }
+                printf("%s", cur->text);
+                if (cur->url) {
+                    printf("\x1B]8;;\x1B\\");
+                }
+            }
+            break;
+
+        case MSF_TYPE:
+            if (cur->trigdate != olddate) {
+                IssueSortBanner(cur->trigdate);
+                olddate = cur->trigdate;
+            }
+            FillParagraph(cur->url, cur->text, NULL);
+            break;
+
+        case RUN_TYPE:
+            System(cur->text, 0);
+            break;
+        }
+
+        free((char *) cur->text);
+        if (cur->url) {
+            free((char *) cur->url);
+        }
+        free(cur);
+        cur = next;
+    }
+    SortedQueue = NULL;
+}
+/***************************************************************/
+/*                                                             */
+/*  IssueSortBanner                                            */
+/*                                                             */
+/*  Issue a daily banner if the function sortbanner() is       */
+/*  defined to take one argument.                              */
+/*                                                             */
+/***************************************************************/
+static void IssueSortBanner(int dse)
+{
+    char BanExpr[64];
+    int y, m, d;
+    Value v;
+    char const *s = BanExpr;
+    DynamicBuffer buf;
+
+    if (UserFuncExists("sortbanner") != 1) return;
+
+    FromDSE(dse, &y, &m, &d);
+    snprintf(BanExpr, sizeof(BanExpr), "sortbanner('%04d/%02d/%02d')", y, m+1, d);   
+    y = EvalExpr(&s, &v, NULL);
+    if (y) return;
+    if (DoCoerce(STR_TYPE, &v)) return;
+    DBufInit(&buf);
+    if (!DoSubstFromString(v.v.str, &buf, dse, NO_TIME)) {
+        if (*DBufValue(&buf)) printf("%s\n", DBufValue(&buf));
+        DBufFree(&buf);
+    }
+    DestroyValue(v);
+}
+
+/***************************************************************/
+/*                                                             */
+/*  CompareRems                                                */
+/*                                                             */
+/*  Compare two reminders for sorting.  Return 0 if they       */
+/*  compare equal; 1 if rem2 should come after rem1, -1 if     */
+/*  rem1 should come after rem2.  bydate and bytime control    */
+/*  sorting direction by date and time, resp.                  */
+/*                                                             */
+/***************************************************************/
+int CompareRems(int dat1, int tim1, int prio1,
+                int dat2, int tim2, int prio2,
+                int bydate, int bytime, int byprio,
+                int untimed_first)
+{
+    int dafter, tafter, pafter, uafter;
+
+    dafter = (bydate != SORT_DESCEND) ? 1 : -1;
+    tafter = (bytime != SORT_DESCEND) ? 1 : -1;
+    pafter = (byprio != SORT_DESCEND) ? 1 : -1;
+    uafter = (untimed_first) ? -1 : 1;
+
+    if (dat1 < dat2) return dafter;
+    if (dat1 > dat2) return -dafter;
+
+    if (tim1 == NO_TIME && tim2 != NO_TIME) {
+        return -uafter;
+    }
+
+    if (tim1 != NO_TIME && tim2 == NO_TIME) {
+        return uafter;
+    }
+
+    if (tim1 < tim2) return tafter;
+    if (tim1 > tim2) return -tafter;
+
+    if (prio1 < prio2) return pafter;
+    if (prio1 > prio2) return -pafter;
+
+    return 0;
+}