| /packages/providers/ContactsProvider/src/com/android/providers/contacts/ |
| CommonNicknameCache.java | 101 String[] clusters = null; local
108 clusters = ref.get();
112 if (clusters == null) {
113 clusters = loadNicknameClusters(normalizedName);
114 ref = clusters == null ? null : new SoftReference<String[]>(clusters);
119 return clusters;
133 String[] clusters = null; local
140 clusters = new String[count];
143 clusters[i] = cursor.getString(NicknameLookupQuery.CLUSTER)
[all...] |
| NameLookupBuilder.java | 89 * clusters, e.g. Leo could be Leonard or Leopold.
134 // Phase I: insert all variants not involving nickname clusters
280 * For all tokens that correspond to nickname clusters, substitutes each cluster key
286 String[] clusters = mNicknameClusters[i]; local
287 if (clusters != null) {
289 for (int j = 0; j < clusters.length; j++) {
290 mNames[i] = clusters[j];
295 // Repeat recursively for other nickname clusters
|
| /external/libvpx/nestegg/ |
| TODO | 12 - Optionally build a Cue index as Clusters are parsed.
14 - Avoid building a list of Clusters as they are parsed and retain only the
|
| /external/fsck_msdos/ |
| dosfs.h | 64 cl_t FSFree; /* Number of free clusters acc. FSInfo */
85 u_int NumFree; /* # of free clusters */
86 u_int NumBad; /* # of bad clusters */
92 u_int32_t length; /* number of clusters on chain */
98 #define CLUST_RSRVD 0xfffffff6 /* start of reserved clusters */
|
| check.c | 186 pwarn("%d files, %d free (%d clusters), %d bad (%d clusters)\n",
191 pwarn("%d files, %d free (%d clusters)\n",
|
| dir.c | 418 pwarn("%s has too many clusters allocated\n",
420 if (ask(1, "Drop superfluous clusters")) {
769 pwarn("%s has clusters, but size 0\n",
771 if (ask(1, "Drop allocated clusters")) {
795 pwarn("%s has no clusters\n",
|
| /external/webkit/WebCore/platform/graphics/win/ |
| UniscribeController.cpp | 222 Vector<WORD> clusters; local
224 clusters.resize(len);
232 if (!shape(str, len, item, fontData, glyphs, clusters, visualAttributes))
277 glyphs[clusters[k]] = fontData->spaceGlyph();
278 advances[clusters[k]] = logicalSpaceWidth;
279 spaceCharacters[clusters[k]] = m_currentCharacter + k + item.iCharPos;
283 roundingHackCharacters[clusters[k]] = m_currentCharacter + k + item.iCharPos;
288 roundingHackWordBoundaries[clusters[k]] = boundary;
385 ScriptXtoCP(m_offsetX - leftEdge, clusters.size(), glyphs.size(), clusters.data(), visualAttributes.data()
[all...] |
| UniscribeController.h | 58 Vector<WORD>& glyphs, Vector<WORD>& clusters,
|
| /external/webkit/WebCore/platform/text/ |
| TextBreakIterator.h | 33 // Iterates over "extended grapheme clusters", as defined in UAX #29.
35 // version 4.0 only supports "legacy grapheme clusters".
|
| /external/expat/lib/ |
| internal.h | 42 the compiler cannot perform stack optimizations for call clusters.
|
| /packages/apps/Gallery3D/src/com/cooliris/media/ |
| MediaFeed.java | 228 ArrayList<Cluster> clusters = null; local
232 clusters = mediaClustering.getClusters();
235 return clusters;
370 final ArrayList<Cluster> clusters = clustering.getClustersForDisplay(); local
371 int numClusters = clusters.size();
375 size += clusters.get(i).getItems().size();
414 ArrayList<MediaClustering.Cluster> clusters = clustering.getClustersForDisplay(); local
415 if (clusters.size() > slotIndex) {
416 MediaClustering.Cluster cluster = clusters.get(slotIndex);
703 ArrayList<Cluster> clusters = clustering.getClustersForDisplay() local
[all...] |
| MediaClustering.java | 33 * clusters are merged and large individual clusters are considered for
43 // clusters.
52 // Try and get around 9 clusters (best-effort for the common case).
55 // Try and merge 2 clusters if they are both smaller than min cluster size.
|
| /external/webkit/WebKit/chromium/src/js/ |
| HeapProfilerPanel.js | 847 snapshotEntry = { cons: baseEntry.cons, count: 0, clusters: {} };
850 this.retainers = this._calculateRetainers(this.snapshotView.profile, snapshotEntry.clusters);
853 baseEntry = { count: 0, clusters: {} };
856 this.baseRetainers = this._calculateRetainers(this.snapshotView.baseSnapshot, baseEntry.clusters);
875 _calculateRetainers: function(snapshot, clusters) {
877 if (this.isEmptySet(clusters)) {
881 // In case when an entry is retained by clusters, we need to gather up the list
[all...] |
| ProfilerProcessor.js | 459 clusters: {},
503 entry.retainers[consName] = { cons: consName, count: 0, clusters: {} };
507 retainer.clusters[rawRetainer] = true;
513 if (!(item in this.currentHeapSnapshot_.clusters)) {
514 this.currentHeapSnapshot_.clusters[item] = {
518 mergeRetainers(this.currentHeapSnapshot_.clusters[item]);
|
| /external/qemu/block/ |
| qcow2-cluster.c | 384 * on entry, *num is the number of contiguous clusters we'd like to
387 * on exit, *num is the number of contiguous clusters we can read.
451 /* how many empty clusters ? */
454 /* how many allocated clusters ? */
569 /* compressed clusters never have the copied flag */
698 /* We keep all QCOW_OFLAG_COPIED clusters */
710 /* for the moment, multiple compressed clusters are not managed */
715 /* how many available clusters ? */
|
| qcow2-refcount.c | 233 /* XXX: cache several refcount block clusters ? */
413 * free clusters according to its type: compressed or not
515 /* compressed clusters are never modified */
583 * Increases the refcount for a range of clusters in a given refcount table.
624 * Increases the refcount in the given refcount table for the all clusters
652 /* Compressed clusters don't have QCOW_OFLAG_COPIED */
656 "clusters\n", offset >> s->cluster_bits);
708 * clusters in the given refcount table. While doing so, performs some checks
|
| qcow2.h | 58 uint32_t l1_size; /* XXX: save number of clusters instead ? */
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/ |
| msdos_fs.h | 65 /* start of data cluster's entry (number of reserved clusters) */
68 /* maximum number of clusters */
|
| ufs_fs.h | 300 __fs64 cs_numclusters; /* number of free clusters */
309 __u64 cs_numclusters; /* number of free clusters */
542 __fs32 cg_clustersumoff; /* (u_int32) counts of avail clusters */
544 __fs32 cg_nclusterblks; /* number of clusters this cg */
548 __fs32 cg_clustersumoff;/* (u_int32) counts of avail clusters */
550 __fs32 cg_nclusterblks;/* number of clusters this cg */
707 __u32 c_clustersumoff;/* (u_int32) counts of avail clusters */
709 __u32 c_nclusterblks; /* number of clusters this cg */
[all...] |
| /external/v8/src/ |
| heap-profiler.cc | 43 // object references into clusters.
229 // Visitor for aggregating references count of equivalent clusters.
255 // Visitor for printing retainers tree. Aggregates equivalent retainer clusters.
284 // all equivalent clusters.
495 // Return true for coarsible clusters that have a non-identical equivalent.
567 // Print clusters that have no equivalents, aggregating their retainers.
570 // Now aggregate clusters that have equivalents...
|
| /external/neven/Embedded/common/src/b_TensorEm/ |
| IdCluster2D.h | 132 /* This function extracts equivalent 2d sub clusters which positions
134 * in both input clusters.
148 * an destination clusters. Nodes with negative id values are ignored. Id values >= 0 must be unique
|
| /system/core/toolbox/ |
| newfs_msdos.c | 73 #define MINCLS12 1 /* minimum FAT12 clusters */
74 #define MINCLS16 0x1000 /* minimum FAT16 clusters */
75 #define MINCLS32 2 /* minimum FAT32 clusters */
76 #define MAXCLS12 0xfed /* maximum FAT12 clusters */
77 #define MAXCLS16 0xfff5 /* maximum FAT16 clusters */
78 #define MAXCLS32 0xffffff5 /* maximum FAT32 clusters */
587 warnx("warning: sectors/FAT limits file system to %u clusters",
590 errx(1, "%u clusters too few clusters for FAT%u, need %u", cls, fat,
|
| /frameworks/base/media/libstagefright/matroska/ |
| mkvparser.hpp | 362 //reference = clusters containing req'd referenced blocks
501 long Load(); //loads headers and all clusters
|
| /sdk/emulator/mksdcard/ |
| mksdcard.c | 158 POKEW( info + 488, free_count ); /* number of free clusters */
159 POKEW( info + 492, 3 ); /* next free clusters, 0-1 reserved, 2 is used for the root dir */
|
| /external/chromium/third_party/icu/public/common/unicode/ |
| ubrk.h | 59 * "Extended Grapheme Clusters", which are groupings of codepoints
63 * on grapheme clusters and guidelines on their use.
|
