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
|
/* $Id: $ */
/* Copyright (C) 1997 Sverre Hvammen Johansen,
* Department of Informatics, University of Oslo.
*
* 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; version 2.
*
* 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., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include "cim.h"
/******************************************************************************
Rutine for t1 < t2 */
char
__rlttext (t1x, t2x)
__txtvp t1x,
t2x;
{
long i = 0,
j = 0;
register unsigned char *p1x,
*p2x;
if (t1x->obj == __NULL && t2x->obj == __NULL)
return (__FALSE);
if (t1x->obj == __NULL)
return (__TRUE);
p1x = (unsigned char *) &(t1x->obj->string[t1x->start - 1]);
p2x = (unsigned char *) &(t2x->obj->string[t2x->start - 1]);
while (i < t1x->length && j < t2x->length)
{
i++;
j++;
if (*p1x < *p2x)
return (__TRUE);
if (*p1x++ > *p2x++)
return (__FALSE);
}
if (i == t1x->length && j == t2x->length)
return (__FALSE); /* Like */
if (i == t1x->length)
return (__TRUE); /* t1 < t2 */
return (__FALSE); /* t1 > t2 */
}
|
