NO5/MyUtf8.cpp at master · fioresoft/NO5 · GitHub

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
// MyUtf8.cpp: implementation of the MyUtf8 class.
//
//////////////////////////////////////////////////////////////////////

#include "stdafx.h"
#include "MyUtf8.h"

/*
0000-0000-0000-007F	=> 0xxxxxxx
0000-0080-0000-07FF	=> 110xxxxx 10xxxxxx
0000-0800-0000-FFFF	=> 1110xxxx 10xxxxxx 10xxxxxx
0001-0000-0010-FFFF	=> 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx
*/

int UTF8_GetBytes(unsigned short ch)
{
	int res = -1;

	if(ch < (unsigned short)0x0000007F)
		res = 1;
	else if(ch < (unsigned short)0x000007FF)
		res = 2;
	else if(ch < (unsigned short)0x0000FFFF)
		res = 3;
	else if(ch < (unsigned short)0x0010FFFF)
		res = 4;

	return res;
}


bool utf_isUnary(unsigned char ch)
{
	return ch <= (unsigned char)0x7f;
}

bool utf_isBinary(unsigned char ch)
{
	return ch <= (unsigned char)0xDF;
}
bool utf_isTrinary(unsigned char ch)
{
	return ch <= (unsigned char)0xEF;
}
bool utf_isQuaternary(unsigned char ch)
{
	return ch <= (unsigned char)0xF7;
}

bool utf_isTrailing(unsigned char ch)
{
	return ch <= (unsigned char)0xBF && ch > 0;
}

bool utf_isValidString(const char *p,int len)
{
	bool res = true;

	for(int i=0,count=1;i<len && count && res;i+=count){
		count = 0;

		unsigned  char ch = p[i];
		if(utf_isUnary(p[i])){
			count = 1;
			continue;
		}
		else if(utf_isBinary(p[i])){
			if(i + 1 > len ){
				res = false;
				continue;
			}
			if(utf_isTrailing(p[i+1])){
				count = 2;
				continue;
			}
			else{
				res = false;
				break;
			}
		}
		else if(utf_isTrinary(p[i])){
			if(i + 2 > len ){
				res = false;
				continue;
			}
			if(utf_isTrailing(p[i+1])){
				if(utf_isTrailing(p[i+2])){
					count = 3;
					continue;
				}
				else{
					res = false;
					break;
				}
			}
			else{
				res = false;
				break;
			}
		}
		else if(utf_isQuaternary(p[i])){
			if(i + 3 > len ){
				res = false;
				continue;
			}
			if(utf_isTrailing(p[i+1])){
				if(utf_isTrailing(p[i+2])){
					if(utf_isTrailing(p[i+3])){
						count = 4;
						continue;
					}
					else{
						res = false;
						break;
					}
				}
				else{
					res = false;
					break;
				}
			}
			else{
				res = false;
				break;
			}
		}
	}
	return res;
}