/external/chromium_org/third_party/harfbuzz-ng/src/ |
hb-graphite2.cc | 293 ALLOCATE_ARRAY (hb_graphite2_cluster_t, clusters, buffer->len); 296 memset (clusters, 0, sizeof (clusters[0]) * buffer->len); 305 while (clusters[ci].base_char > before && ci) 307 clusters[ci-1].num_chars += clusters[ci].num_chars; 308 clusters[ci-1].num_glyphs += clusters[ci].num_glyphs; 312 if (gr_slot_can_insert_before (is) && clusters[ci].num_chars && before >= clusters[ci].base_char + clusters[ci].num_chars [all...] |
hb-icu-le.cc | 139 ALLOCATE_ARRAY (unsigned int, clusters, buffer->len); 144 clusters[i] = buffer->info[i].cluster; 190 info[j].cluster = clusters[indices[i]];
|
/external/harfbuzz_ng/src/ |
hb-graphite2.cc | 293 ALLOCATE_ARRAY (hb_graphite2_cluster_t, clusters, buffer->len); 296 memset (clusters, 0, sizeof (clusters[0]) * buffer->len); 305 while (clusters[ci].base_char > before && ci) 307 clusters[ci-1].num_chars += clusters[ci].num_chars; 308 clusters[ci-1].num_glyphs += clusters[ci].num_glyphs; 312 if (gr_slot_can_insert_before (is) && clusters[ci].num_chars && before >= clusters[ci].base_char + clusters[ci].num_chars [all...] |
hb-icu-le.cc | 139 ALLOCATE_ARRAY (unsigned int, clusters, buffer->len); 144 clusters[i] = buffer->info[i].cluster; 190 info[j].cluster = clusters[indices[i]];
|
/packages/providers/ContactsProvider/src/com/android/providers/contacts/aggregation/util/ |
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...] |
/external/harfbuzz_ng/util/ |
helper-cairo.hh | 55 cairo_text_cluster_t *clusters; member in struct:helper_cairo_line_t 62 if (clusters) 63 cairo_text_cluster_free (clusters);
|
helper-cairo.cc | 415 l->clusters = cairo_text_cluster_allocate (l->num_clusters); 420 (l->num_clusters && !l->clusters)) 443 memset ((void *) l->clusters, 0, l->num_clusters * sizeof (l->clusters[0])); 448 l->clusters[cluster].num_glyphs++; 457 l->clusters[cluster].num_bytes = end - start; 461 l->clusters[cluster].num_glyphs++; 463 l->clusters[cluster].num_bytes = l->utf8 + text_len - start; 472 l->clusters[cluster].num_bytes = end - start; 476 l->clusters[cluster].num_glyphs++ [all...] |
/frameworks/ml/bordeaux/service/src/android/bordeaux/services/ |
ClusterManager.java | 31 * ClusterManager incrementally indentify representitve clusters from the input location 32 * stream. Clusters are updated online using leader based clustering algorithm. The input 33 * locations initially are kept by the clusters. Periodially, a cluster consolidating 45 // Consoliate location clusters (and check for new semantic clusters) 122 ", number of clusters: " + mLocationClusters.size()); 140 // if it is far away from all existing clusters, create a new cluster. 181 // merge clusters whose regions are overlapped. note that after merge 194 Log.v(TAG, mLocationClusters.size() + " location clusters after consolidate"); 197 // clusters are foun 330 ArrayList<String> clusters = new ArrayList<String>(); local [all...] |
/external/chromium_org/ui/gfx/ |
color_analysis.h | 56 // This uses a KMean clustering algorithm to find clusters of pixel colors in 64 // RGB KMean Algorithm (N clusters, M iterations): 67 // just remove the cluster and continue with N = N-1 clusters (for an image 69 // centers of your N clusters. 77 // a) If this is the case for all N clusters than we have converged and 81 // 5.Once the clusters have converged or M iterations have been tried, sort 82 // the clusters by weight (where weight is the number of pixels that make up 84 // 6.Going through the sorted list of clusters, pick the first cluster with the
|
color_analysis.cc | 159 // image with 4 clusters would be sampled like this: 222 std::vector<KMeanCluster> clusters; local 223 clusters.resize(kNumberOfClusters, KMeanCluster()); 226 std::vector<KMeanCluster>::iterator cluster = clusters.begin(); 227 while (cluster != clusters.end()) { 244 // Loop through the previous clusters and check to see if we have seen 248 cluster_check = clusters.begin(); 266 cluster = clusters.erase(cluster); 275 // If all pixels in the image are transparent we will have no clusters. 276 if (clusters.empty() [all...] |
/external/libvpx/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
|
/tools/external/fat32lib/src/main/java/de/waldheinz/fs/fat/ |
ClusterChain.java | 28 * A chain of clusters as stored in a {@link Fat}. 41 * Creates a new {@code ClusterChain} that contains no clusters. 85 * not contain any clusters 118 * {@code ClusterChain} can only contain full clusters, the new size 130 throw new IOException("too many clusters"); 138 * Determines the length of this {@code ClusterChain} in clusters. 150 * Sets the length of this cluster chain in clusters. 152 * @param nrClusters the new number of clusters this chain should contain,
|
Fat.java | 127 new IOException("too many data clusters"); 130 new IOException("no data clusters"); 139 "clusters but only " + entries.length + " FAT entries"); 274 * @throws IOException if there are no free clusters 312 * Returns the number of clusters that are currently not in use by this FAT. 313 * This estimate does only account for clusters that are really available in 314 * the data portion of the file system, not for clusters that might only 342 * Allocate a series of clusters for a new file. 344 * @param nrClusters when number of clusters to allocate 346 * @throws IOException if there are no free clusters [all...] |
Fat16BootSector.java | 45 * The maximum number of clusters for a FAT12 file system. This is actually 46 * the number of clusters where mkdosfs stop complaining about a FAT16 169 "too many clusters for FAT12/16: " + clusterCount);
|
FsInfoSector.java | 98 * Sets the number of free clusters on the file system stored at 111 * Returns the number of free clusters on the file system as sepcified by 114 * @return the number of free clusters
|
/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",
|
/external/ceres-solver/internal/ceres/ |
visibility_based_preconditioner.h | 92 // clusters. Thus in analogy with the Jacobi preconditioner we refer 96 // preconditioner by considering the interaction between clusters and 98 // by constructing a weighted graph on the clusters, with the weight 99 // on the edges connecting two clusters proportional to the number of 100 // 3D points visible to cameras in both the clusters. A degree-2 174 // Mapping from cameras to clusters.
|
visibility_based_preconditioner.cc | 132 // preconditioner. It clusters cameras using their scene 133 // visibility. The clusters form the diagonal blocks of the 148 // preconditioner. It clusters cameras using using the scene 150 // clusters by constructing another graph with the clusters as 160 // Construct a weighted graph on the set of clusters, where the 162 // clusters at the ends of the edge. Return an approximate degree-2 213 // are part of the same cluster or if the the two clusters that they 378 // blocks correspond to the clusters. Then cluster pairs corresponding 512 // Construct a graph whose vertices are the clusters, and the edg [all...] |
/packages/providers/ContactsProvider/src/com/android/providers/contacts/ |
NameLookupBuilder.java | 88 * clusters, e.g. Leo could be Leonard or Leopold. 133 // Phase I: insert all variants not involving nickname clusters 299 * For all tokens that correspond to nickname clusters, substitutes each cluster key 305 String[] clusters = mNicknameClusters[i]; local 306 if (clusters != null) { 308 for (int j = 0; j < clusters.length; j++) { 309 mNames[i] = clusters[j]; 314 // Repeat recursively for other nickname clusters
|
/external/chromium_org/chrome/tools/ |
history-viz.py | 118 clusters = {} 121 clusters[cluster] = clusters.get(cluster, []) 122 clusters[cluster].append(obj) 123 return clusters 184 # Output all the nodes within graph clusters.
|
/external/expat/lib/ |
internal.h | 42 the compiler cannot perform stack optimizations for call clusters.
|
/external/chromium_org/third_party/WebKit/Source/core/platform/text/ |
TextBreakIterator.h | 175 // Iterates over "extended grapheme clusters", as defined in UAX #29. 177 // version 4.0 only supports "legacy grapheme clusters". 232 // Counts the number of grapheme clusters. A surrogate pair or a sequence
|
/external/qemu/block/ |
qcow2-refcount.c | 211 * Note that allocating clusters here needs some special care: 219 * and doing the initial refcount increase. This means that some clusters 222 * as long as we don't overwrite it by freeing clusters. 457 /* XXX: cache several refcount block clusters ? */ 686 /* TODO Remember the clusters to free them later and avoid leaking */ 693 * free clusters according to its type: compressed or not 805 /* compressed clusters are never modified */ 883 * Increases the refcount for a range of clusters in a given refcount table. 927 * Increases the refcount in the given refcount table for the all clusters 954 /* Compressed clusters don't have QCOW_OFLAG_COPIED * [all...] |
qcow2-cluster.c | 430 * on entry, *num is the number of contiguous clusters we'd like to 433 * on exit, *num is the number of contiguous clusters we can read. 500 /* how many empty clusters ? */ 503 /* how many allocated clusters ? */ 630 /* compressed clusters never have the copied flag */ 741 * contiguous clusters that have been allocated. This may be 0 if the request 771 /* We keep all QCOW_OFLAG_COPIED clusters */ 784 /* for the moment, multiple compressed clusters are not managed */ 789 /* how many available clusters ? */
|