Searched refs:algorithmic (Results 1 – 14 of 14) sorted by relevance
12 algorithmic:int{0}17 algorithmic:int{0}22 algorithmic:int{0}27 algorithmic:int{1}32 algorithmic:int{1}37 algorithmic:int{0}42 algorithmic:int{0}47 algorithmic:int{0}52 algorithmic:int{0}57 algorithmic:int{0}[all …]
43 algorithmic = false; in NumberingSystem()94 ns.algorithmic = isAlgorithmic_in; in getInstance()223 int algorithmic = nsAlgBundle.getInt(); in getInstanceByName() local225 isAlgorithmic = ( algorithmic == 1 ); in getInstanceByName()321 return algorithmic; in isAlgorithmic()326 private boolean algorithmic; field in NumberingSystem
42 algorithmic = false; in NumberingSystem()91 ns.algorithmic = isAlgorithmic_in; in getInstance()216 int algorithmic = nsAlgBundle.getInt(); in getInstanceByName() local218 isAlgorithmic = ( algorithmic == 1 ); in getInstanceByName()308 return algorithmic; in isAlgorithmic()313 private boolean algorithmic; field in NumberingSystem
59 algorithmic = FALSE; in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()175 int32_t algorithmic = 0; in createInstanceByName() local186 algorithmic = ures_getInt(nsCurrent,&status); in createInstanceByName()188 UBool isAlgorithmic = ( algorithmic == 1 ); in createInstanceByName()228 algorithmic = c; in setAlgorithmic()243 return ( algorithmic ); in isAlgorithmic()
187 UBool algorithmic; variable192 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
15 The :class:`altgraph.Graph.Graph` class is loosely modeled after the `LEDA <http://www.algorithmic-…
7 and the tcindex classifier with some algorithmic mapping
83 more elegant algorithmic solution is available. Instead of typing
104 # or names of algorithmic converters, and their case must not138 # Fully algorithmic converters370 # GB 18030 is partly algorithmic, using the MBCS converter980 # Partially algorithmic converters
1120 - No more manual changes for CJK ranges for algorithmic names;1731 - update ucdVersion in gennames.c if an algorithmic range changes1970 - update ucdVersion in gennames.c if an algorithmic range changes
834 algorithmic improvements make this release substantially faster than its
498 algorithmic efficiency. Also upped the limit on cache
578 thing when choosing a container is the algorithmic properties of how you plan to