Searched refs:strengths (Results 1 - 3 of 3) sorted by relevance

/macosx-10.10.1/ICU-531.30/icuSources/test/intltest/
H A Dssearch.cpp1399 UCollationStrength strengths[] = {UCOL_PRIMARY, UCOL_SECONDARY, UCOL_TERTIARY}; local
1401 int32_t strengthCount = sizeof(strengths) / sizeof(strengths[0]);
1446 ucol_setStrength(coll, strengths[s]);
/macosx-10.10.1/ICU-531.30/icuSources/test/cintltst/
H A Dcmsccoll.c298 UColAttributeValue strengths[] = { variable
369 for(k = 0; k<sizeof(strengths)/sizeof(strengths[0]); k++) {
370 ucol_setAttribute(coll, UCOL_STRENGTH, strengths[k], &status);
/macosx-10.10.1/Heimdal-398.1.2/lib/hcrypto/libtommath/
H A Dtommath.tex4663 So far three very different algorithms for modular reduction have been discussed. Each of the algorithms have their own strengths and weaknesses

Completed in 144 milliseconds