11d42882b5
* NEW: Update copyright years. * NEW: Have a stripped-down version of gb_common_string_temp.h to provide STRING_compare() without producing compilation problems. * NEW: AvlTree is a new Collection-like class implementing a balanced binary search tree. It does _not_ utilise hashing in order to maintain an order of the literal key strings given by the user (For Each thus traverses from smallest to greatest key). * NEW: Carry in a stripped-down version of Bob Jenkins' lookup3 hash algorithm from the Public Domain. It was a last-minute decision to not use it in AvlTree to maintain the literal key order. git-svn-id: svn://localhost/gambas/trunk@5812 867c0c6c-44f3-4631-809d-bfa615b0a4ec
43 lines
1.3 KiB
C
43 lines
1.3 KiB
C
/***************************************************************************
|
|
|
|
gb_common_string_temp.h
|
|
|
|
(c) 2000-2013 Benoît Minisini <gambas@users.sourceforge.net>
|
|
|
|
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, 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.
|
|
|
|
***************************************************************************/
|
|
|
|
#include "gambas.h"
|
|
|
|
int STRING_compare(const char *str1, int len1, const char *str2, int len2)
|
|
{
|
|
uint i;
|
|
int len = len1 < len2 ? len1 : len2;
|
|
int diff;
|
|
register unsigned char c1, c2;
|
|
|
|
for (i = 0; i < len; i++)
|
|
{
|
|
c1 = str1[i];
|
|
c2 = str2[i];
|
|
if (LIKELY(c1 > c2)) return 1;
|
|
if (LIKELY(c1 < c2)) return -1;
|
|
}
|
|
|
|
diff = len1 - len2;
|
|
return LIKELY(diff < 0) ? (-1) : LIKELY(diff > 0) ? 1 : 0;
|
|
}
|