/packages/apps/Gallery2/src/com/android/gallery3d/data/ |
FilterSource.java | 68 MediaSet[] sets = dataManager.getMediaSetsFromString(setsName); local 69 return new FilterTypeSet(path, dataManager, sets[0], mediaType); 73 MediaSet[] sets = dataManager.getMediaSetsFromString(setsName); local 74 return new FilterDeleteSet(path, sets[0]); 78 MediaSet[] sets = dataManager.getMediaSetsFromString(setsName); local 79 return new FilterEmptyPromptSet(path, sets[0], mEmptyItem);
|
ClusterSource.java | 64 MediaSet[] sets = dataManager.getMediaSetsFromString(setsName); local 71 return new ClusterAlbumSet(path, mApplication, sets[0], matchType);
|
MediaSet.java | 185 // media sets), in an efficient order. ItemConsumer.consumer() will be 269 protected Future<Integer> requestSyncOnMultipleSets(MediaSet[] sets, SyncListener listener) { 270 return new MultiSetSyncFuture(sets, listener); 285 MultiSetSyncFuture(MediaSet[] sets, SyncListener listener) { 287 mPendingCount = sets.length; 288 mFutures = new Future[sets.length]; 291 for (int i = 0, n = sets.length; i < n; ++i) { 292 mFutures[i] = sets[i].requestSync(this); 293 Log.d(TAG, " request sync: " + Utils.maskDebugInfo(sets[i].getName()));
|
/external/llvm/lib/Support/ |
regfree.c | 65 if (g->sets != NULL) 66 free((char *)g->sets);
|
/external/qemu-pc-bios/bochs/bios/ |
notes | 24 * drive sets the busy bit in Status Reg to 1 26 > drive sets the aborted-command bit in the Error register and 28 > Drive also sets the busy bit in the Status register to 0. 34 transferred, the drive sets the data-request bit to 1, sets 37 the data, the drive sets the data-request bit and the busy bit to 0. 39 the first sector of data, the drive sets the data-request bit to 0, 41 transferred, the drive sets the data-request bit to 1, the busy bit to 0, 43 the drive sets the data-request bit and busy bit to 0.
|
/ndk/sources/host-tools/ndk-stack/regex/ |
regfree.c | 66 if (g->sets != NULL) 67 free((char *)g->sets);
|
/external/antlr/antlr-3.4/runtime/Python/antlr3/ |
compat.py | 37 from sets import Set as set, ImmutableSet as frozenset
|
/bionic/libc/upstream-netbsd/libc/regex/ |
regfree.c | 122 if (g->sets != NULL) 123 free(g->sets);
|
/external/icu4c/test/intltest/ |
usettest.h | 167 void testSpan(const UnicodeSetWithStrings *sets[4], const void *s, int32_t length, UBool isUTF16, 171 void testSpan(const UnicodeSetWithStrings *sets[4], const void *s, int32_t length, UBool isUTF16, 174 void testSpanBothUTFs(const UnicodeSetWithStrings *sets[4], 178 void testSpanContents(const UnicodeSetWithStrings *sets[4], uint32_t whichSpans, const char *testName); 179 void testSpanUTF16String(const UnicodeSetWithStrings *sets[4], uint32_t whichSpans, const char *testName); 180 void testSpanUTF8String(const UnicodeSetWithStrings *sets[4], uint32_t whichSpans, const char *testName);
|
/external/valgrind/main/cachegrind/ |
cg_sim.c | 45 Int sets; member in struct:__anon16618 62 c->sets = (c->size / c->line_size) / c->assoc; 63 c->sets_min_1 = c->sets - 1; 65 c->tag_shift = c->line_size_bits + VG_(log2)(c->sets); 76 sizeof(UWord) * c->sets * c->assoc); 78 for (i = 0; i < c->sets * c->assoc; i++) 141 /* Nb: this is a fast way of doing ((set1+1) % L.sets) */ \ 185 VG_(printf)("addr: %lx size: %u sets: %d %d", a, size, set1, set2);\ 186 VG_(tool_panic)("item straddles more than two cache sets"); \
|
/external/clang/utils/ |
token-delta.py | 49 """split(set) -> [sets] 63 def delta(self, c, sets): 64 # assert(reduce(set.union, sets, set()) == c) 67 if len(sets) <= 1: 71 res = self.search(c, sets) 75 # Otherwise, partition sets if possible; if not we are done. 76 refined = sum(map(list, map(self.split, sets)), []) 77 if len(refined) == len(sets): 82 def search(self, c, sets): 83 for i,S in enumerate(sets) [all...] |
/bionic/libc/kernel/arch-mips/asm/ |
cpu-info.h | 25 unsigned short sets; member in struct:cache_desc
|
/development/ndk/platforms/android-9/arch-mips/include/asm/ |
cpu-info.h | 25 unsigned short sets; member in struct:cache_desc
|
/external/smack/src/org/xbill/DNS/ |
Zone.java | 44 RRset [] sets = allRRsets(originNode); local 45 current = new RRset[sets.length]; 46 for (int i = 0, j = 2; i < sets.length; i++) { 47 int type = sets[i].getType(); 49 current[0] = sets[i]; 51 current[1] = sets[i]; 53 current[j++] = sets[i]; 78 RRset [] sets = allRRsets(entry.getValue()); local 79 if (sets.length == 0) 81 current = sets; 372 RRset [] sets = allRRsets(types); local 523 RRset [] sets = allRRsets(node); local [all...] |
/prebuilts/ndk/8/platforms/android-14/arch-mips/usr/include/asm/ |
cpu-info.h | 25 unsigned short sets; member in struct:cache_desc
|
/prebuilts/ndk/8/platforms/android-9/arch-mips/usr/include/asm/ |
cpu-info.h | 25 unsigned short sets; member in struct:cache_desc
|
/frameworks/base/cmds/bmgr/src/com/android/commands/bmgr/ |
Bmgr.java | 206 String arg = nextArg(); // sets, transports, packages set# 220 if ("sets".equals(arg)) { 257 System.out.println("Unable to request restore sets"); 260 printRestoreSets(observer.sets); 268 private void printRestoreSets(RestoreSet[] sets) { 269 if (sets == null || sets.length == 0) { 270 System.out.println("No restore sets"); 273 for (RestoreSet s : sets) { 280 RestoreSet[] sets = null field in class:Bmgr.RestoreObserver 384 RestoreSet[] sets = null; local [all...] |
/external/eigen/bench/ |
check_cache_queries.cpp | 68 int sets = (abcd[2]); // C[31:0] local 69 int cache_size = (ways+1) * (partitions+1) * (line_size+1) * (sets+1); 76 cout << "cache[" << cache_id << "].sets = " << sets << "\n"; local
|
/external/chromium/testing/gmock/scripts/generator/cpp/ |
keywords.py | 33 from sets import Set as set
|
/external/kernel-headers/original/asm-mips/ |
cpu-info.h | 22 unsigned short sets; /* Number of lines per set */ member in struct:cache_desc 57 int srsets; /* Shadow register sets */
|
/external/llvm/lib/DebugInfo/ |
DWARFDebugAranges.cpp | 71 SetCollection sets; local 76 sets.push_back(set); 80 std::for_each(sets.begin(), sets.end(), CountArangeDescriptors(count)); 85 std::for_each(sets.begin(), sets.end(), range_adder);
|
/packages/apps/Gallery2/src/com/android/gallery3d/app/ |
FilterUtils.java | 30 // A clustered album (not including album set) and its base sets are fixed. 35 // This set and all sets inside base_set (recursively) are fixed because 124 // Recurse into sub media sets. 127 String[] sets = Path.splitSequence(segments[i]); local 128 for (int j = 0; j < sets.length; j++) { 129 Path sub = Path.fromString(sets[j]); 243 String[] sets = Path.splitSequence(segments[i]); local 244 for (int j = 0; j < sets.length; j++) { 248 sb.append(removeOneClusterFromPath(sets[j], done));
|
/external/valgrind/main/callgrind/ |
threads.c | 113 t->lastdump_cost = CLG_(get_eventset_cost)( CLG_(sets).full ); 114 t->sighandler_cost = CLG_(get_eventset_cost)( CLG_(sets).full ); 115 CLG_(init_cost)( CLG_(sets).full, t->lastdump_cost ); 116 CLG_(init_cost)( CLG_(sets).full, t->sighandler_cost ); 211 CLG_(zero_cost)( CLG_(sets).full, es->cost ); 280 CLG_(add_and_zero_cost)( CLG_(sets).full, 330 es->cost = CLG_(get_eventset_cost)(CLG_(sets).full); 331 CLG_(zero_cost)( CLG_(sets).full, es->cost ); 424 CLG_(print_cost)(-9, CLG_(sets).full, es->cost); 451 CLG_(print_cost)(-9, CLG_(sets).full, es->cost) [all...] |
/external/guava/guava-testlib/src/com/google/common/collect/testing/features/ |
FeatureUtil.java | 293 * of the given sets. 304 * of all the given sets. 305 * @param sets the sets to intersect 306 * @return the intersection of the sets 307 * @throws java.lang.IllegalArgumentException if there are no sets to 310 public static <T> Set<T> intersection(Set<? extends T> ... sets) { 311 if (sets.length == 0) { 313 "Can't intersect no sets; would have to return the universe."); 315 Set<T> results = Helpers.copyToSet(sets[0]) [all...] |
/external/chromium/testing/gmock/scripts/ |
fuse_gmock_files.py | 66 import sets namespace 123 processed_files = sets.Set() # Holds all gmock headers we've processed. 162 processed_files = sets.Set()
|