Lines Matching full:triples
207 /* allocate temporary memory for combining triples */
208 combiningTriplesMem=utm_open("gennorm combining triples", 0x4000, 0x4000, sizeof(CombiningTriple));
452 CombiningTriple *triples;
457 triples=utm_getStart(combiningTriplesMem);
459 /* add lead and trail indexes to the triples for sorting */
463 triples[i].leadIndex=findCombiningCP(triples[i].lead, TRUE);
464 triples[i].trailIndex=findCombiningCP(triples[i].trail, FALSE);
468 qsort(triples, count, sizeof(CombiningTriple), compareTriples);
472 j=0; /* triples counter */
482 while(j<count && i==triples[j].leadIndex) {
484 combined=triples[j++].combined;
510 j=0; /* triples counter */
524 while(j<count && i==triples[j].leadIndex) {
526 finalIndex=combiningIndexes[triples[j].trailIndex];
527 combined=triples[j++].combined;
1414 CombiningTriple *triples;
1417 /* search for all triples with c as lead code point */
1418 triples=utm_getStart(combiningTriplesMem);
1421 /* triples are not sorted by code point but for each lead CP there is one contiguous block */
1422 for(i=0; i<count && lead!=triples[i].lead; ++i) {}
1425 for(; i<count && lead==triples[i].lead; ++i) {
1426 if(trail==triples[i].trail) {
1427 return (int32_t)triples[i].combined;
1525 CombiningTriple *triples;
1529 /* search for all triples with c as lead code point */
1530 triples=utm_getStart(combiningTriplesMem);
1534 /* triples are not sorted by code point but for each lead CP there is one contiguous block */
1535 for(i=0; i<count && c!=triples[i].lead; ++i) {}
1538 triples[i].lead; ++i) {
1539 cc=getCCFromCP(triples[i].trail);
