Searched refs:algorithmic (Results 1 – 17 of 17) sorted by relevance
6 algorithmic:int{0}11 algorithmic:int{0}16 algorithmic:int{0}21 algorithmic:int{0}26 algorithmic:int{1}31 algorithmic:int{1}36 algorithmic:int{0}41 algorithmic:int{0}46 algorithmic:int{0}51 algorithmic:int{0}[all …]
46 algorithmic = false; in NumberingSystem()97 ns.algorithmic = isAlgorithmic_in; in getInstance()237 int algorithmic = nsAlgBundle.getInt(); in lookupInstanceByName() local239 isAlgorithmic = ( algorithmic == 1 ); in lookupInstanceByName()318 return algorithmic; in isAlgorithmic()323 private boolean algorithmic; field in NumberingSystem
45 algorithmic = false; in NumberingSystem()94 ns.algorithmic = isAlgorithmic_in; in getInstance()230 int algorithmic = nsAlgBundle.getInt(); in lookupInstanceByName() local232 isAlgorithmic = ( algorithmic == 1 ); in lookupInstanceByName()305 return algorithmic; in isAlgorithmic()310 private boolean algorithmic; field in NumberingSystem
61 algorithmic = FALSE; in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()177 int32_t algorithmic = 0; in createInstanceByName() local188 algorithmic = ures_getInt(nsCurrent,&status); in createInstanceByName()190 UBool isAlgorithmic = ( algorithmic == 1 ); in createInstanceByName()230 algorithmic = c; in setAlgorithmic()245 return ( algorithmic ); in isAlgorithmic()
189 UBool algorithmic; variable194 void setAlgorithmic(UBool algorithmic);
123 Despite these strengths, PTH's simple design suffers some algorithmic133 of PCH mitigates some of these algorithmic strengths via the use of135 an algorithmic level, especially when one considers header files of140 constant-time algorithmic advantages just mentioned but also retains some
7 and the tcindex classifier with some algorithmic mapping
86 more elegant algorithmic solution is available. Instead of typing
106 # or names of algorithmic converters, and their case must not140 # Fully algorithmic converters372 # GB 18030 is partly algorithmic, using the MBCS converter984 # Partially algorithmic converters
257 winner. The simplest algorithmic way to remove it and find the "next" winner is
22 An aware object has sufficient knowledge of applicable algorithmic and
118 - adjust preparseucd.py for Tangut algorithmic names1563 - No more manual changes for CJK ranges for algorithmic names;2174 - update ucdVersion in gennames.c if an algorithmic range changes2413 - update ucdVersion in gennames.c if an algorithmic range changes
969 algorithmic improvements make this release substantially faster than its
498 algorithmic efficiency. Also upped the limit on cache
767 thing when choosing a container is the algorithmic properties of how you plan to
25656 into several functions. There are no algorithmic changes.