Searched refs:levels (Results 1 - 25 of 50) sorted by relevance

12

/external/replicaisland/src/com/replica/replicaisland/
H A DLevelTree.java28 public ArrayList<Level> levels = new ArrayList<Level>(); field in class:LevelTree.LevelGroup
64 public final static ArrayList<LevelGroup> levels = new ArrayList<LevelGroup>(); field in class:LevelTree
69 return levels.get(row).levels.get(index);
77 if (levels.size() > 0 && mLoadedResource == resource) {
84 levels.clear();
96 levels.add(currentGroup);
138 currentGroup.levels.add(currentLevel);
197 final int levelGroupCount = levels.size();
199 final ArrayList<Level> row = levels
[all...]
H A DLevelSelectActivity.java201 final int count = LevelTree.levels.size();
205 final LevelTree.LevelGroup group = LevelTree.levels.get(x);
206 for (int y = 0; y < group.levels.size(); y++) {
207 LevelTree.Level level = group.levels.get(y);
224 final int count = LevelTree.levels.size();
226 final LevelTree.LevelGroup group = LevelTree.levels.get(x);
227 for (int y = 0; y < group.levels.size(); y++) {
228 LevelTree.Level level = group.levels.get(y);
H A DAndouKun.java528 final LevelTree.LevelGroup currentGroup = LevelTree.levels.get(mLevelRow);
529 final int count = currentGroup.levels.size();
541 if (currentGroup.levels.get(x).completed == false) {
559 if (mLevelRow < LevelTree.levels.size()) {
561 if (currentLevel.inThePast || LevelTree.levels.get(mLevelRow).levels.size() > 1) {
/external/llvm/utils/
H A Dclang-parse-diagnostics-file29 levels = {'error': False, 'fatal error': False, 'ignored': False,
32 levels['error'] = True
34 levels['fatal error'] = True
36 levels['ignored'] = True
38 levels['note'] = True
40 levels['warning'] = True
72 if levels[d.get('level')] or opts.all:
/external/valgrind/main/memcheck/tests/
H A Dmempool.c25 level_list *levels; member in struct:_pool
48 p->levels = NULL;
64 l->next = p->levels;
67 p->levels = l;
72 level_list *l = p->levels;
73 p->levels = l->next;
85 level_list *l = p->levels;
105 VALGRIND_MEMPOOL_ALLOC(p->levels->where, where, size);
H A Dmempool2.c28 level_list *levels; member in struct:_pool
51 p->levels = NULL;
67 l->next = p->levels;
70 p->levels = l;
75 level_list *l = p->levels;
76 p->levels = l->next;
88 level_list *l = p->levels;
108 VALGRIND_MEMPOOL_ALLOC(p->levels->where, where, size);
/external/icu4c/common/
H A Dubidiln.c35 * This means that there is a UBiDi object with a levels
38 * Only if the length of the text is zero, then levels==dirProps==NULL.
51 * Here, the levels array is scanned as soon as necessary, and a vector of
60 * In a further attempt to save memory, the levels array is never changed
65 * which is not reflected in the levels array.
66 * This allows a line UBiDi object to use the same levels array as
70 * paragraph's levels and dirProps arrays are reused by way of setting
72 * change the now shared levels for (L1).
80 * the paragraph's levels array that we just point into.
94 UBiDiLevel *levels local
189 const UBiDiLevel *levels=pLineBiDi->levels; local
283 UBiDiLevel *levels=pBiDi->levelsMemory; local
437 UBiDiLevel *levels; local
564 UBiDiLevel *levels=pBiDi->levels; local
710 prepareReorder(const UBiDiLevel *levels, int32_t length, int32_t *indexMap, UBiDiLevel *pMinLevel, UBiDiLevel *pMaxLevel) argument
750 ubidi_reorderLogical(const UBiDiLevel *levels, int32_t length, int32_t *indexMap) argument
813 ubidi_reorderVisual(const UBiDiLevel *levels, int32_t length, int32_t *indexMap) argument
[all...]
H A Dubidi.c58 * For the purpose of conformance, the levels of all these codes
89 * and all levels are set to the paragraph level.
94 * If embedding levels are supplied as a parameter, then all
560 * Resolve the explicit levels as specified by explicit embedding codes.
565 * levels are externally specified (from "styled text", supposedly the preferred
594 * Handling the stack of explicit levels (Xn):
596 * With the BiDi stack of explicit levels,
606 * Popping levels with PDF must work in the opposite order so that level 61
614 UBiDiLevel *levels=pBiDi->levels; local
786 UBiDiLevel *levels=pBiDi->levels; local
1253 UBiDiLevel * levels=pBiDi->levels; local
1630 UBiDiLevel *levels=pBiDi->levels; local
1709 const UBiDiLevel *levels; local
2086 UBiDiLevel *levels=pBiDi->levels; local
[all...]
/external/icu4c/test/cintltst/
H A Dcbiditst.h68 const UBiDiLevel *levels; member in struct:__anon5969
/external/openssl/crypto/x509v3/
H A Dpcy_tree.c105 curr = tree->levels + tree->nlevel;
109 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels);
110 for (plev = tree->levels; plev != curr; plev++)
113 plev - tree->levels, plev->flags);
228 tree->levels = OPENSSL_malloc(sizeof(X509_POLICY_LEVEL) * n);
234 if (!tree->levels)
240 memset(tree->levels, 0, n * sizeof(X509_POLICY_LEVEL));
244 level = tree->levels;
545 if (curr == tree->levels)
593 curr = tree->levels
[all...]
H A Dpcy_lib.c82 return tree->levels + i;
H A Dpcy_int.h160 X509_POLICY_LEVEL *levels; member in struct:X509_POLICY_TREE_st
/external/icu4c/test/intltest/
H A Dbidiconf.cpp54 UBiDiLevel levels[1000]; member in class:BiDiConformanceTest
123 levels[levelsCount++]=UBIDI_DEFAULT_LTR;
132 levels[levelsCount++]=(UBiDiLevel)value;
395 if(levels[i]!=actualLevels[i] && levels[i]<UBIDI_DEFAULT_LTR) {
399 // levels but just returns all levels as the paragraph level 0 or 1.
404 (int)i, levels[i], actualLevels[i]);
413 UnicodeString els("Expected levels: ");
416 els.append((UChar)0x20).append(printLevel(levels[
[all...]
/external/ipsec-tools/
H A Dmain.c225 static int levels[6] = { local
231 __android_log_vprint(levels[level], "racoon", format, ap);
234 static char *levels = "EWNIDV";
235 fprintf(stderr, "%c: ", levels[level]);
/external/qemu/android/utils/
H A Dpath.h86 extern char* path_parent( const char* path, int levels );
H A Dpath.c65 path_parent( const char* path, int levels )
70 while (levels > 0) {
82 if (end == base+1 && base[0] == '.' && levels == 1)
92 levels += 1;
96 levels -= 1;
/external/mtpd/
H A Dmtpd.c241 static int levels[5] = { local
247 __android_log_vprint(levels[level], "mtpd", format, ap);
250 static char *levels = "DIWEF";
252 fprintf(stderr, "%c: ", levels[level]);
/external/libpcap/
H A Doptimize.c157 struct block **levels; variable in typeref:struct:block
235 b->link = levels[level];
236 levels[level] = b;
240 * Level graph. The levels go from 0 at the leaves to
241 * N_LEVELS at the root. The levels[] array points to the
249 memset((char *)levels, 0, n_blocks * sizeof(*levels));
279 for (b = levels[i]; b; b = b->link) {
320 for (b = levels[i]; b != 0; b = b->link) {
349 for (b = levels[
[all...]
/external/jmonkeyengine/engine/src/ogre/com/jme3/scene/plugins/ogre/
H A DMeshLoader.java532 List<VertexBuffer> levels = lodLevels.get(index);
533 if (levels == null) {
534 // Create the LOD levels list
535 levels = new ArrayList<VertexBuffer>();
538 levels.add(originalIndexBuffer);
539 lodLevels.put(index, levels);
541 levels.add(vb);
552 List<VertexBuffer> levels = entry.getValue();
553 VertexBuffer[] levelArray = new VertexBuffer[levels.size()];
554 levels
[all...]
/external/guava/guava/src/com/google/common/net/
H A DInternetDomainName.java468 * Returns the ancestor of the current domain at the given number of levels
469 * "higher" (rightward) in the subdomain list. The number of levels must be
475 private InternetDomainName ancestor(int levels) { argument
476 return from(DOT_JOINER.join(parts.subList(levels, parts.size())));
/external/icu4c/common/unicode/
H A Dubidi.h1144 * with or without externally specified embedding levels from <i>styled</i>
1149 * i.e., some levels may not be the same as if all steps were performed.
1153 * the algorithm. This implementation may set all resolved levels to
1166 * especially the resolved levels for all the characters in <code>text</code>.
1186 * is also valid, with odd levels indicating RTL.
1188 * @param embeddingLevels (in) may be used to preset the embedding and override levels,
1198 * <strong>Caution: </strong>A copy of this pointer, not of the levels,
1205 * <code>ubidi_setLine()</code> functions may modify some or all of the levels.<br><br>
1223 * contain the reordering information, especially the resolved levels,
1465 * Get an array of levels fo
[all...]
/external/quake/quake/src/WinQuake/
H A Dquake-rogue.spec.sh27 16 entirely new, and totally intense levels! The environmental experience of
31 of clone levels!
/external/dbus/dbus/
H A Ddbus-message-factory.c337 message_with_nesting_levels (int levels) argument
345 /* If levels is higher it breaks sig_refcount in DBusMessageRealIter
349 _dbus_assert (levels < 256);
351 parents = dbus_new(DBusMessageIter, levels + 1);
352 children = dbus_new(DBusMessageIter, levels + 1);
359 while (i < levels)
362 i == (levels - 1) ?
787 /* 64 levels of nesting is OK */
796 /* 65 levels of nesting is not OK */
/external/libvpx/examples/includes/HTML-Toc-0.91/
H A DTocGenerator.pm242 {levels}{$aClass}[$aLevel - 1] || 0;
292 # Loop through levels
347 # returns: Group id levels.
437 # Reset groups and levels
700 $groupIdManager->{levels}{$groupId}[$level - 1] += 1;
701 # Reset remaining levels of same group
702 for ($i = $level; $i < @{$groupIdManager->{levels}{$groupId}}; $i++) {
703 $groupIdManager->{levels}{$groupId}[$i] = 0;
718 $groupIdManager->{levels}{$groupId}[$level - 1] . " ";
966 $self->{levels}
[all...]
/external/skia/src/core/
H A DSkBitmap.cpp58 const MipLevel* levels() const { return (const MipLevel*)(this + 1); } function in struct:SkBitmap::MipMap
59 MipLevel* levels() { return (MipLevel*)(this + 1); } function in struct:SkBitmap::MipMap
61 const void* pixels() const { return levels() + fLevelCount; }
62 void* pixels() { return levels() + fLevelCount; }
1148 MipLevel* level = mm->levels();
1200 const MipLevel& mip = fMipMap->levels()[level - 1];

Completed in 513 milliseconds

12