2001-06-27 Dave Peticolas <dave@krondo.com>

* src/register/QuickFill.c: same as below

	* src/register/quickfillcell.c: use wide character conversion
	functions


git-svn-id: svn+ssh://svn.gnucash.org/repo/gnucash/trunk@4829 57a11ea4-9604-0410-9ed3-97b8803252fd
This commit is contained in:
Dave Peticolas 2001-06-28 00:34:09 +00:00
parent 5d81d26c3f
commit 4dd1e8f845
3 changed files with 13 additions and 6 deletions

View File

@ -1,5 +1,10 @@
2001-06-27 Dave Peticolas <dave@krondo.com>
* src/register/QuickFill.c: same as below
* src/register/quickfillcell.c: use wide character conversion
functions
* AUTHORS: credits
* doc/sgml/C/xacc-about.sgml: credits

View File

@ -27,6 +27,7 @@
#include <ctype.h>
#include <string.h>
#include <wctype.h>
#include "QuickFill.h"
#include "basiccell.h"
@ -140,7 +141,7 @@ gnc_quickfill_string (QuickFill *qf)
QuickFill *
gnc_quickfill_get_char_match (QuickFill *qf, GdkWChar wc)
{
guint key = islower (wc) ? toupper (wc) : wc;
guint key = iswlower (wc) ? towupper (wc) : wc;
if (qf == NULL)
return NULL;
@ -282,7 +283,7 @@ quickfill_insert_recursive (QuickFill *qf, const GdkWChar *text, int depth,
if ((text == NULL) || (text[depth] == 0))
return;
key = islower (text[depth]) ? toupper (text[depth]) : text[depth];
key = iswlower (text[depth]) ? towupper (text[depth]) : text[depth];
match_qf = g_hash_table_lookup (qf->matches, GUINT_TO_POINTER (key));
if (match_qf == NULL)

View File

@ -40,6 +40,7 @@
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <wctype.h>
#include "basiccell.h"
#include "quickfillcell.h"
@ -101,8 +102,8 @@ wcstrcaseequal (const GdkWChar *s1, const GdkWChar *s2)
if (s1[i] == 0 || s2[i] == 0)
return s1[i] == s2[i];
a = islower (s1[i]) ? toupper (s1[i]) : s1[i];
b = islower (s2[i]) ? toupper (s2[i]) : s2[i];
a = iswlower (s1[i]) ? towupper (s1[i]) : s1[i];
b = iswlower (s2[i]) ? towupper (s2[i]) : s2[i];
if (a != b)
return FALSE;
@ -130,8 +131,8 @@ wcstrncaseequal (const GdkWChar *s1, const GdkWChar *s2, int len)
if (s1[i] == 0 || s2[i] == 0)
return FALSE;
a = islower (s1[i]) ? toupper (s1[i]) : s1[i];
b = islower (s2[i]) ? toupper (s2[i]) : s2[i];
a = iswlower (s1[i]) ? towupper (s1[i]) : s1[i];
b = iswlower (s2[i]) ? towupper (s2[i]) : s2[i];
if (a != b)
return FALSE;