Searched refs:u_n (Results 1 – 3 of 3) sorted by relevance
420 u_n=0x6e, enumerator477 trie->next(u_n); in TestHasUniqueValue()487 if(trie->next(u_n)!=USTRINGTRIE_INTERMEDIATE_VALUE || 6!=trie->getValue()) { in TestHasUniqueValue()515 trie->next(u_n); in TestGetNextUChars()560 trie->next(u_n); in TestIteratorFromBranch()609 trie->next(u_n); in TestIteratorFromLinearMatch()
220 // Let abs(e_n) <= u_n * U,221 // then abs(e_{n+1}) <= 2 * u_n * U^2 + max(2 * u_n^2 * U^2 + U, 2 * U)222 // u_{n+1} <= 2 * u_n * U + max(2 * u_n^2 * U + 1, 2)302 // u_n for different precisions (with N-1 half-width iterations):
67 static const UChar u_n=0x6E; variable1084 ((c=msg.charAt(index++))==u_n || c==u_N) && in isOrdinal()