Do not check phrase longer than MAX_PHRASE_LEN

Part of #73

src/tree.c

@@ -315,9 +315,9 @@ static void FindInterval( ChewingData *pgdata, TreeDataType *ptd )
 	uint16_t new_phoneSeq[ MAX_PHONE_SEQ_LEN ];
 
 	for ( begin = 0; begin < pgdata->nPhoneSeq; begin++ ) {
-		for ( end = begin; end < pgdata->nPhoneSeq; end++ ) {
+		for ( end = begin; end < min( pgdata->nPhoneSeq, begin + MAX_PHRASE_LEN ); end++ ) {
 			if ( ! CheckBreakpoint( begin, end + 1, pgdata->bArrBrkpt ) )
-				continue;
+				break;
 
 			/* set new_phoneSeq */
 			memcpy(

test/test-bopomofo.c

@@ -656,6 +656,28 @@ void test_zuin_buffer()
 	chewing_delete( ctx );
 }
 
+void test_longest_phrase()
+{
+	ChewingContext *ctx;
+	IntervalType it;
+
+	ctx = chewing_new();
+
+	type_keystroke_by_string( ctx, "rup ji up6ji 1j4bj6y4ru32k7e.3ji "
+		/* ㄐㄧㄣ ㄨㄛ ㄧㄣˊ ㄨㄛ ㄅㄨˋ ㄖㄨˊ ㄗˋ ㄐㄧˇ ㄉㄜ˙ ㄍㄡˇ ㄨㄛ */ );
+	ok_preedit_buffer( ctx, "\xE9\x87\x91\xE7\xAA\xA9\xE9\x8A\x80\xE7\xAA\xA9\xE4\xB8\x8D\xE5\xA6\x82\xE8\x87\xAA\xE5\xB7\xB1\xE7\x9A\x84\xE7\x8B\x97\xE7\xAA\xA9"
+		/* 金窩銀窩不如自己的狗窩 */ );
+
+	chewing_interval_Enumerate( ctx );
+
+	ok( chewing_interval_hasNext( ctx ) == 1, "shall have next interval" );
+	chewing_interval_Get( ctx, &it );
+	ok( it.from == 0 && it.to == 11, "interval (%d, %d) shall be (0, 11)",
+		it.from, it.to );
+
+	chewing_delete( ctx );
+}
+
 int main()
 {
 	putenv( "CHEWING_PATH=" CHEWING_DATA_PREFIX );
@@ -680,5 +702,7 @@ int main()
 	test_get_phoneSeq();
 	test_zuin_buffer();
 
+	test_longest_phrase();
+
 	return exit_status();
 }