| /external/icu/icu4c/source/i18n/ |
| collationkeys.cpp | 233 // Set of levels to process and write.
234 uint32_t levels = levelMasks[CollationSettings::getStrength(options)]; local
236 levels |= Collation::CASE_LEVEL_FLAG;
238 // Minus the levels below minLevel.
239 levels &= ~(((uint32_t)1 << minLevel) - 1);
240 if(levels == 0) { return; }
286 if((levels & Collation::QUATERNARY_LEVEL_FLAG) != 0) {
305 // terminate compression on all levels and then exit the loop.
306 if(p > Collation::NO_CE_PRIMARY && (levels & Collation::PRIMARY_LEVEL_FLAG) != 0) {
349 if((levels & Collation::SECONDARY_LEVEL_FLAG) != 0)
[all...] |
| /external/icu/icu4c/source/test/intltest/ |
| bidiconf.cpp | 54 UBiDiLevel levels[1000]; member in class:BiDiConformanceTest
123 levels[levelsCount++]=UBIDI_DEFAULT_LTR;
130 errln("\nError on line %d: Levels parse error at %s", (int)lineNumber, start);
134 levels[levelsCount++]=(UBiDiLevel)value;
335 if(0==strncmp(start, "Levels:", 7)) {
433 Field 3: An ordered list of resulting levels for each token in field 0
435 The UBA does not assign levels to certain characters (e.g. LRO);
623 if(levels[i]!=actualLevels[i] && levels[i]<UBIDI_DEFAULT_LTR) {
627 // levels but just returns all levels as the paragraph level 0 or 1
[all...] |
| /development/samples/RenderScript/Levels/src/com/android/rs/levels/ |
| LevelsDalvikActivity.java | 17 package com.android.rs.levels;
|
| LevelsRSActivity.java | 17 package com.android.rs.levels;
|
| /external/chromium_org/third_party/icu/source/common/ |
| ubidiln.c | 39 * This means that there is a UBiDi object with a levels
42 * Only if the length of the text is zero, then levels==dirProps==NULL.
55 * Here, the levels array is scanned as soon as necessary, and a vector of
64 * In a further attempt to save memory, the levels array is never changed
69 * which is not reflected in the levels array.
70 * This allows a line UBiDi object to use the same levels array as
74 * paragraph's levels and dirProps arrays are reused by way of setting
76 * change the now shared levels for (L1).
84 * the paragraph's levels array that we just point into.
98 UBiDiLevel *levels=pBiDi->levels local
193 const UBiDiLevel *levels=pLineBiDi->levels; local
287 UBiDiLevel *levels=pBiDi->levelsMemory; local
441 UBiDiLevel *levels; local
568 UBiDiLevel *levels=pBiDi->levels; local
[all...] |
| ubidi.c | 60 * For the purpose of conformance, the levels of all these codes
93 * and all levels are set to the paragraph level.
98 * If embedding levels are supplied as a parameter, then all
995 UBiDiLevel *levels=pBiDi->levels; local
1271 UBiDiLevel *levels=pBiDi->levels; local
1749 UBiDiLevel * levels=pBiDi->levels; local
2170 UBiDiLevel *levels=pBiDi->levels; local
2250 const UBiDiLevel *levels; local
2630 UBiDiLevel *levels=pBiDi->levels; local
[all...] |
| ubidiimp.h | 303 UBiDiLevel *levels; member in struct:UBiDi
336 const struct ImpTabPair * pImpTabPair; /* pointer to levels state table pair */
348 /* implicitly at the paraLevel (rule (L1)) - levels may not reflect that */
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/base/ |
| low_level_alloc.cc | 77 int levels; // levels in skiplist used member in struct:low_level_alloc_internal::AllocList
78 AllocList *next[kMaxLevel]; // actually has levels elements.
115 // Return a number of skiplist levels for a node of size bytes, where
119 // Bigger nodes tend to have more skiplist levels due to the log2(size / base)
124 // max_fit is the maximum number of levels that will fit in a node for the
136 // For 0 <= i < head->levels, set prev[i] to "no_greater", where no_greater
142 for (int level = head->levels - 1; level >= 0; level--) {
147 return (head->levels == 0) ? 0 : prev[0]->next[0];
151 // Requires that e->levels be previously set by the caller (usin
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/base/ |
| low_level_alloc.cc | 77 int levels; // levels in skiplist used member in struct:low_level_alloc_internal::AllocList
78 AllocList *next[kMaxLevel]; // actually has levels elements.
115 // Return a number of skiplist levels for a node of size bytes, where
119 // Bigger nodes tend to have more skiplist levels due to the log2(size / base)
124 // max_fit is the maximum number of levels that will fit in a node for the
136 // For 0 <= i < head->levels, set prev[i] to "no_greater", where no_greater
142 for (int level = head->levels - 1; level >= 0; level--) {
147 return (head->levels == 0) ? 0 : prev[0]->next[0];
151 // Requires that e->levels be previously set by the caller (usin
[all...] |
| /external/eigen/demos/opengl/ |
| quaternion_demo.cpp | 37 const int levels = 4; local
67 // generate other levels
69 for (int l=1; l<levels; l++)
|
| /external/icu/icu4c/source/common/ |
| ubidiln.c | 39 * This means that there is a UBiDi object with a levels
42 * Only if the length of the text is zero, then levels==dirProps==NULL.
55 * Here, the levels array is scanned as soon as necessary, and a vector of
64 * In a further attempt to save memory, the levels array is never changed
69 * which is not reflected in the levels array.
70 * This allows a line UBiDi object to use the same levels array as
74 * paragraph's levels and dirProps arrays are reused by way of setting
76 * change the now shared levels for (L1).
84 * the paragraph's levels array that we just point into.
98 UBiDiLevel *levels=pBiDi->levels local
193 const UBiDiLevel *levels=pLineBiDi->levels; local
287 UBiDiLevel *levels=pBiDi->levelsMemory; local
441 UBiDiLevel *levels; local
568 UBiDiLevel *levels=pBiDi->levels; local
[all...] |
| ubidi.c | 60 * For the purpose of conformance, the levels of all these codes
91 * and all levels are set to the paragraph level.
96 * If embedding levels are supplied as a parameter, then all
1070 UBiDiLevel *levels=pBiDi->levels; local
1345 UBiDiLevel *levels=pBiDi->levels; local
1805 UBiDiLevel *levels=pBiDi->levels; local
1839 UBiDiLevel * levels=pBiDi->levels; local
2264 UBiDiLevel *levels=pBiDi->levels; local
2344 const UBiDiLevel *levels; local
2726 UBiDiLevel *levels=pBiDi->levels; local
[all...] |
| /cts/tests/tests/app/src/android/app/cts/ |
| AlertDialog_BuilderTest.java | 331 final CharSequence[] levels = mContext.getResources().getTextArray( local
333 assertEquals(levels[0], mListView.getItemAtPosition(0));
|
| /external/chromium_org/third_party/WebKit/Source/core/accessibility/ |
| AXObject.cpp | 772 size_t levels = objects.size() - 1; local
773 for (size_t i = 0; i < levels; i++) {
|
| /external/deqp/modules/gles31/functional/ |
| es31fStencilTexturingTests.cpp | 582 const int levels = 7; local
587 TextureLevel uploadLevel (glu::mapGLInternalFormat(m_format), width, height, levels); local
591 for (int levelNdx = 0; levelNdx < levels; levelNdx++)
602 gl.texStorage3D(GL_TEXTURE_2D_ARRAY, 1, m_format, width, height, levels);
617 for (int levelNdx = 0; levelNdx < levels; levelNdx++)
[all...] |
| es31fTextureLevelStateQueryTests.cpp | 69 std::vector<TextureLevelSpec> levels; member in struct:deqp::gles31::Functional::__anon24976::TextureGenerationSpec
388 texGen.levels.push_back(level);
410 texGen.levels.push_back(level);
458 texGen.levels.push_back(level);
538 texGen.levels.push_back(level);
561 texGen.levels.push_back(level);
583 texGen.levels.push_back(level);
632 texGen.levels.push_back(level);
639 DE_ASSERT(!(spec.immutable && spec.levels.size() > 1)); // !< immutable textures have only one level
641 for (int levelNdx = 0; levelNdx < (int)spec.levels.size(); ++levelNdx
[all...] |
| es31fTextureSpecificationTests.cpp | 26 * - Randomly re-specify levels to eventually reach mipmap-complete texture.
1072 int levels; member in struct:deqp::gles31::Functional::__anon24983
1093 int levels = texCubeArraySizes[ndx].levels; local
[all...] |
| es31fTextureGatherTests.cpp | 411 const tcu::ConstPixelBufferAccess* levels[tcu::CUBEFACE_LAST]; local
414 levels[face] = view.getFaceLevels((tcu::CubeFace)face) + level;
416 return tcu::TextureCubeView(1, levels);
[all...] |
| /external/checkpolicy/ |
| policy_parse.y | 243 mls : sensitivities dominance opt_categories levels mlspolicy
271 levels : level_def label
272 | levels level_def
|
| /external/libpcap/ |
| optimize.c | 133 struct block **levels; variable in typeref:struct:block
210 b->link = levels[level];
211 levels[level] = b;
215 * Level graph. The levels go from 0 at the leaves to
216 * N_LEVELS at the root. The levels[] array points to the
223 memset((char *)levels, 0, n_blocks * sizeof(*levels));
252 for (b = levels[i]; b; b = b->link) {
291 for (b = levels[i]; b != 0; b = b->link) {
319 for (b = levels[i]; b; b = b->link)
[all...] |
| /external/chromium_org/third_party/freetype/src/smooth/ |
| ftgrays.c | 75 /* - It can easily be modified to render to _any_ number of gray levels */
177 /* we don't handle tracing levels in stand-alone mode; */
920 int* levels; local
924 levels = ras.lev_stack;
964 levels[0] = level;
968 level = levels[top];
974 levels[top] = levels[top - 1] = level - 1;
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/d3d1x/gd3d11/ |
| d3d11_context.h | 1456 unsigned levels = resource->last_level + 1; local
1469 unsigned levels = resource->last_level + 1; local
[all...] |
| /external/deqp/modules/gles3/functional/ |
| es3fTextureSpecificationTests.cpp | 26 * - Randomly re-specify levels to eventually reach mipmap-complete texture.
847 vector<int> levels (m_numLevels);
850 levels[i] = i;
851 rnd.shuffle(levels.begin(), levels.end());
855 int levelNdx = levels[ndx];
4371 int levels; member in struct:deqp::gles3::Functional::__anon24740
4386 int levels; member in struct:deqp::gles3::Functional::__anon24741
4407 int levels = tex2DSizes[ndx].levels; local
4417 int levels = cubeSizes[ndx].levels; local
4470 int levels; member in struct:deqp::gles3::Functional::__anon24742
4487 int levels; member in struct:deqp::gles3::Functional::__anon24743
4510 int levels = tex2DArraySizes[ndx].levels; local
4522 int levels = tex3DSizes[ndx].levels; local
[all...] |
| /external/deqp/modules/glshared/ |
| glsTextureTestUtil.cpp | 131 const tcu::ConstPixelBufferAccess* levels[tcu::CUBEFACE_LAST]; local
134 levels[face] = view.getFaceLevels((tcu::CubeFace)face) + clampedBase;
136 return tcu::TextureCubeView(numLevels, levels);
[all...] |
| /external/freetype/src/smooth/ |
| ftgrays.c | 75 /* - It can easily be modified to render to _any_ number of gray levels */
180 /* we don't handle tracing levels in stand-alone mode; */
942 int* levels; local
946 levels = ras.lev_stack;
986 levels[0] = level;
990 level = levels[top];
996 levels[top] = levels[top - 1] = level - 1;
[all...] |
