summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/doc/latex/songs/songidx/songsort.c
blob: 22825733727d1ad85fd7e552153fe16aade90e71 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
/* Copyright (C) 2012 Kevin W. Hamlen
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
 * MA  02110-1301, USA.
 *
 * The latest version of this program can be obtained from
 * http://songs.sourceforge.net.
 */


#if HAVE_CONFIG_H
#  include "config.h"
#else
#  include "vsconfig.h"
#endif

#include "chars.h"
#include "songidx.h"
#include "fileio.h"

/* skipesc_sp(<ptr>,<flag>)
 *   Walk <ptr> past any LaTeX macros or braces until we reach the next "real"
 *   character.  If <flag> is 1, then make an exception for space-macros.
 *   The space macro "\ " causes p to stop on the space. */
void
skipesc_sp(p, stop_on_space)
  const WCHAR **p;
  int stop_on_space;
{
  for (;;)
  {
    if (**p == wc_backslash)
    {
      ++(*p);
      if (stop_on_space && wc_isspace(**p)) return;
      if (wc_isalpha(**p)) while (wc_isalpha(**p)) ++(*p);
      else if (**p) ++(*p);
      while (wc_isspace(**p)) ++(*p);
    }
    else if (**p == wc_lbrace)
    {
      ++(*p);
      while (wc_isspace(**p)) ++(*p);
    }
    else if (**p == wc_rbrace)
      ++(*p);
    else
      break;
  }
}

/* skipesc(<ptr>)
 *   Walk <ptr> past any LaTeX macros or braces until we reach the next "real"
 *   character. */
void
skipesc(p)
  const WCHAR **p;
{
  skipesc_sp(p,0);
}

/* inword(<char>)
 *   Return 0 if <char> is a word-delimiter (for sorting purposes) and 1
 *   otherwise.  Other than TeX macros (which are handled by skipesc above),
 *   words only have alphabetics and apostrophes. */
static int
inword(c)
  WCHAR c;
{
  return (wc_isalpha(c) || (c==wc_apostrophe) || (c==wc_backquote));
}

/* songcmp(<song1>,<song2>)
 *   Return a negative number if <song1> is less than <song2>, a positive
 *   number if <song1> is greater than <song2>, and 0 if <song1> and <song2>
 *   are equal.  The ordering is first by title, then by index.  This function
 *   is suitable for use with qsort(). */
int
songcmp(s1,s2)
  const void *s1;
  const void *s2;
{
  static WCHAR buf1[MAXLINELEN+1], *bp1;
  static WCHAR buf2[MAXLINELEN+1], *bp2;
  const WCHAR *t1 = (*((const SONGENTRY **) s1))->title;
  const WCHAR *t2 = (*((const SONGENTRY **) s2))->title;
  int diff;

  for (;;)
  {
    /* Find the next word or number in each string. */
    skipesc(&t1);
    while(*t1 && !wc_isalpha(*t1) && !wc_isdigit(*t1))
    {
      ++t1;
      skipesc(&t1);
    }
    skipesc(&t2);
    while(*t2 && !wc_isalpha(*t2) && !wc_isdigit(*t2))
    {
      ++t2;
      skipesc(&t2);
    }

    /* If there is no next word/number in one or both, sort the shorter
     * string before the longer one. */
    if ((*t1==wc_null) || (*t2==wc_null))
    {
      if ((*t1==wc_null) && (*t2==wc_null)) break;
      return (t1!=wc_null) ? 1 : -1;
    }

    /* If one is a number, sort the number before the word.  If both are
     * numbers, sort in numerical order. */
    if (wc_isdigit(*t1) || wc_isdigit(*t2))
    {
      long n1, n2;
      WCHAR *p1, *p2;
      if (!wc_isdigit(*t1)) return 1;
      if (!wc_isdigit(*t2)) return -1;
      n1 = ws_strtol(t1, &p1, 10);
      t1 = p1;
      n2 = ws_strtol(t2, &p2, 10);
      t2 = p2;
      if (n1 == n2) continue;
      return n1-n2;
    }

    /* Otherwise, both are words.  Copy the words into scratch buffers,
     * omitting any macros or braces.  Then lexographically compare the buffer
     * contents to determine how the original strings should be sorted. */
    for (bp1=buf1; inword(*t1); skipesc_sp(&t1,1)) *bp1++=wc_tolower(*t1++);
    for (bp2=buf2; inword(*t2); skipesc_sp(&t2,1)) *bp2++=wc_tolower(*t2++);
    *bp1 = *bp2 = wc_null;
    if ((diff = ws_coll(buf1,buf2)) != 0) return diff;
  }

  /* If each corresponding word/number is identical, then sort alternate-
   * form entries (e.g., lyrics) after normal entries (e.g., titles). */
  if (((*((const SONGENTRY **) s1))->title[0] == wc_asterisk)
      && ((*((const SONGENTRY **) s2))->title[0] != wc_asterisk))
    return 1;
  if (((*((const SONGENTRY **) s1))->title[0] != wc_asterisk)
      && ((*((const SONGENTRY **) s2))->title[0] == wc_asterisk))
    return -1;

  /* If everything is the same, sort by the right-hand sides of the index
   * entries (e.g., the song or page numbers). */
  return (*((const SONGENTRY **) s1))->idx - (*((const SONGENTRY **) s2))->idx;
}