Searched refs:compositions (Results 1 – 20 of 20) sorted by relevance
83 delete norms[i].compositions; in ~Norms()204 UVector32 *compositions=leadNorm->compositions; in rangeHandler() local206 if(compositions==nullptr) { in rangeHandler()207 compositions=leadNorm->compositions=new UVector32(errorCode); in rangeHandler()226 compositions->insertElementAt(trail, 2*i, errorCode); in rangeHandler()227 compositions->insertElementAt(start, 2*i+1, errorCode); in rangeHandler()
74 if(compositions==nullptr) { in getCompositionPairs()78 length=compositions->size()/2; in getCompositionPairs()79 return reinterpret_cast<const CompositionPair *>(compositions->getBuffer()); in getCompositionPairs()90 UVector32 *compositions; // (trail, composite) pairs member
257 (starterNorm==nullptr || starterNorm->compositions==nullptr)) { in mappingHasCompBoundaryAfter()273 (starterNorm==nullptr || starterNorm->compositions==nullptr)) { in mappingHasCompBoundaryAfter()280 (starterNorm==nullptr || starterNorm->compositions==nullptr)) { in mappingHasCompBoundaryAfter()358 norm.compositions==nullptr && mappingHasCompBoundaryAfter(buffer, norm.mappingType); in postProcess()363 if(norm.compositions!=NULL) { in postProcess()369 if(norm.compositions!=NULL) { in postProcess()389 norm.cc==0 && !norm.combinesBack && norm.compositions==nullptr; in postProcess()392 if(norm.compositions!=nullptr) { in postProcess()398 } else if(norm.compositions!=nullptr) { in postProcess()
140 if(norms.getNormRef(pair.composite).compositions!=NULL) { in writeCompositions()
1882 private static int combine(String compositions, int list, int trail) { in combine() argument1888 while(key1>(firstUnit=compositions.charAt(list))) { in combine()1893 return (compositions.charAt(list+1)<<16)|compositions.charAt(list+2); in combine()1895 return compositions.charAt(list+1); in combine()1905 if(key1>(firstUnit=compositions.charAt(list))) { in combine()1908 if(key2>(secondUnit=compositions.charAt(list+1))) { in combine()1915 return ((secondUnit&~COMP_2_TRAIL_MASK)<<16)|compositions.charAt(list+2); in combine()
1873 private static int combine(String compositions, int list, int trail) { in combine() argument1879 while(key1>(firstUnit=compositions.charAt(list))) { in combine()1884 return (compositions.charAt(list+1)<<16)|compositions.charAt(list+2); in combine()1886 return compositions.charAt(list+1); in combine()1896 if(key1>(firstUnit=compositions.charAt(list))) { in combine()1899 if(key2>(secondUnit=compositions.charAt(list+1))) { in combine()1906 return ((secondUnit&~COMP_2_TRAIL_MASK)<<16)|compositions.charAt(list+2); in combine()
2 ; This tests a fragment that partially covers subregister compositions.
9 // will produce the sequence of compositions: f, g(f), h(g(f)) and print the
3 // Identity maps used in trivial compositions in MemRefs are optimized away.
81 // Test memref affine map compositions.92 // Test memref inline affine map compositions, minding that identity maps are removed.
182 // CheckAny. It allows to describe compositions of predicates.
187 // CheckAny. It allows to describe compositions of predicates.
40 complex compositions and renderings.
49 transformations and their compositions, and because of their simplicity, we can
378 * Improved the performance of very large compositions by scaling them down to the screen size.
9266 compositions
108 `tf.while_loop`, and compositions like `tf.foldl`) computed with
META-INF/ META-INF/MANIFEST.MF com/ com/ibm/ com/ ...
19044 …the generation of the combinations of n things taken k at a time, the compositions of integers, an…19050 …rithm theory; codes, symbolic; combinations; combinatorial computing; compositions; computer progr…