HomeSort by relevance Sort by last modified time
    Searched full:cluster (Results 1 - 25 of 149) sorted by null

1 2 3 4 5 6

  /packages/apps/Gallery3D/src/com/cooliris/media/
MediaClustering.java 32 * certain time cutoff are grouped into the same cluster. Small adjacent
49 // Disregard a cluster split time of anything over 2 hours.
55 // Try and merge 2 clusters if they are both smaller than min cluster size.
56 // The min cluster size can range from 8 to 15.
60 // Try and split a cluster if it is bigger than max cluster size.
61 // The max cluster size can range from 20 to 50.
65 // Initially put 2 items in the same cluster as long as they are within
66 // 3 cluster frequencies of each other.
74 // Make the cluster split time of a large cluster half that of a regula
95 Cluster cluster = mClusters.get(i); local
129 Cluster cluster = mClusters.get(i); local
    [all...]
  /frameworks/base/media/libstagefright/matroska/
mkvparser.hpp 64 class Cluster;
78 long long GetTimeCode(Cluster*) const; //absolute, but not scaled
79 long long GetTime(Cluster*) const; //absolute, and scaled (ns units)
91 short m_timecode; //relative to cluster
107 virtual Cluster* GetCluster() const = 0;
124 SimpleBlock(Cluster*, size_t, long long start, long long size);
127 Cluster* GetCluster() const;
133 Cluster* const m_pCluster;
146 BlockGroup(Cluster*, size_t, long long, long long);
150 Cluster* GetCluster() const;
    [all...]
mkvparser.cpp 799 Cluster** i = m_clusters;
800 Cluster** j = m_clusters + count;
804 Cluster* const p = *i++;
1010 else if (id == 0x0F43B675) //Cluster ID
1032 long Segment::ParseCluster(Cluster*& pCluster, long long& pos_) const
1075 if (id == 0x0F43B675) //Cluster ID
1077 off = idpos - m_start; // >= 0 means we found a cluster
1087 //file position value just past the cluster we parsed.
1091 pos_ = stop; //pos_ >= 0 here means EOF (cluster is NULL)
1095 //We found a cluster. Now read something, to ensure that it is
    [all...]
  /external/chromium/net/data/ftp/
dir-listing-ls-2 5 lrwxrwxrwx 1 0 0 26 Sep 18 2008 pub -> vol/1/.CLUSTER/var_ftp/pub
6 lrwxrwxrwx 1 0 0 27 Oct 16 2007 site -> vol/1/.CLUSTER/var_ftp/site
  /external/v8/src/
heap-profiler.cc 52 const JSObjectsCluster& cluster) {
53 InsertIntoTree(tree, cluster, 0);
64 const JSObjectsCluster& cluster, int size);
92 JSObjectsCluster cluster = Clusterize(obj, fine_grain); local
93 if (cluster.is_null()) return;
94 InsertIntoTree(tree, cluster, GetObjectSize(obj));
99 const JSObjectsCluster& cluster, int size) {
101 tree->Insert(cluster, &loc);
136 ReferencesExtractor(const JSObjectsCluster& cluster,
138 : cluster_(cluster),
557 const JSObjectsCluster cluster = Clusterizer::Clusterize(obj); local
    [all...]
heap-profiler.h 137 virtual void Call(const JSObjectsCluster& cluster,
149 // Cluster -> (Cluster -> NumberAndSizeInfo)
173 // Returns an equivalent cluster (can be the cluster itself).
174 // If the given cluster doesn't have an equivalent, returns null cluster.
175 JSObjectsCluster GetCoarseEquivalent(const JSObjectsCluster& cluster);
176 // Returns whether a cluster can be substitued with an equivalent and thus,
178 bool HasAnEquivalent(const JSObjectsCluster& cluster);
196 JSObjectsCluster cluster; member in struct:v8::internal::BASE_EMBEDDED::ClusterBackRefs
    [all...]
  /external/iptables/extensions/
libipt_CLUSTERIP.man 1 This module allows you to configure a simple cluster of nodes that share
4 cluster.
18 Number of total nodes within this cluster.
21 Local node number within this cluster.
  /external/fsck_msdos/
dosfs.h 42 typedef u_int32_t cl_t; /* type holding a cluster number */
50 u_int SecPerClust; /* sectors per cluster */
65 cl_t FSNext; /* Next free cluster acc. FSInfo */
81 u_int ClusterSize; /* Cluster size in bytes */
90 cl_t next; /* pointer to next cluster */
96 #define CLUST_FREE 0 /* 0 means cluster is free */
97 #define CLUST_FIRST 2 /* 2 is the minimum valid cluster number */
99 #define CLUST_BAD 0xfffffff7 /* a cluster with a defect */
101 #define CLUST_EOF 0xffffffff /* standard value for last cluster */
104 * Masks for cluster value
    [all...]
fat.c 56 * The first 2 FAT entries contain pseudo-cluster numbers with the following
135 * Check a cluster number for valid value
152 pwarn("Cluster %u in FAT %d continues with %s cluster number %u\n",
322 * Get type of reserved cluster
344 pwarn("Cluster %u is marked %s with different indicators\n",
352 pwarn("Cluster %u is marked %s in FAT 0, %s in FAT %d\n",
364 pwarn("Cluster %u is marked %s in FAT 0, but continues with cluster %u in FAT %d\n",
377 pwarn("Cluster %u continues with cluster %u in FAT 0, but is marked %s in FAT %d\n"
    [all...]
ext.h 128 * Check for lost cluster chains
132 * Try to reconnect a lost cluster chain
141 * Return the type of a reserved cluster as text
146 * Clear a cluster chain in a FAT
  /external/libvpx/libmkv/
testlibmkv.c 48 Ebml_StartSubElement(&ebml, &clusterStart, Cluster); //cluster
54 } //end cluster
  /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) */
75 /* bad cluster mark */
117 __u8 sec_per_clus; /* sectors/cluster */
133 __le32 root_cluster; /* first cluster in root directory */
143 __le32 free_clusters; /* Free cluster count. -1 if unknown */
144 __le32 next_cluster; /* Most recently allocated cluster */
156 __le16 starthi; /* High 16 bits of cluster in FAT32 */
157 __le16 time,date,start;/* time, date and first cluster */
169 __le16 start; /* starting cluster number, 0 in long slots */
nfs_fs.h 19 * When flushing a cluster of dirty pages, there can be different
  /external/neven/Embedded/common/src/b_TensorEm/
Cluster2D.h 74 /** initializes cluster */
78 /** destroys cluster */
84 /** copies cluster */
89 /** compares cluster */
121 /** allocates cluster */
127 /** resize cluster (sizeA must be smaller or equal to allocated size)*/
132 /** transforms cluster according to alt (function does not change bbp of cluster) */
137 /** transforms cluster according to alt and set bbp of output cluster */
    [all...]
IdCluster2D.h 58 /** initializes cluster */
62 /** destroys cluster */
68 /** copies cluster */
73 /** compares cluster */
90 /** allocates cluster */
96 /** resize cluster (sizeA must be smaller or equal to allocated size)*/
101 /** transforms cluster according to alt (function does not change bbp of cluster) */
106 /** copies src cluster and simultaneously transforms vectors according to alt using dstBbpA as resulting cluster format *
    [all...]
Cluster3D.h 70 /** initializes cluster */
74 /** destroys cluster */
80 /** copies cluster */
85 /** compares cluster */
120 /** allocates cluster */
126 /** resize cluster (sizeA must be smaller or equal to allocated size)*/
131 /** allocates cluster with external memory */
137 /** transforms cluster according to alt (function does not change bbp of cluster) */
142 /** translates cluster such that gravity center is 0; returns former gravity center *
    [all...]
  /packages/providers/ContactsProvider/src/com/android/providers/contacts/
CommonNicknameCache.java 35 // We will use this much memory (in bits) to optimize the nickname cluster lookup
88 * Returns nickname cluster IDs or null. Maintains cache.
126 NicknameLookupColumns.CLUSTER
129 int CLUSTER = 0;
143 clusters[i] = cursor.getString(NicknameLookupQuery.CLUSTER);
  /external/kernel-headers/original/linux/
msdos_fs.h 65 /* start of data cluster's entry (number of reserved clusters) */
75 /* bad cluster mark */
118 __u8 sec_per_clus; /* sectors/cluster */
134 __le32 root_cluster; /* first cluster in root directory */
144 __le32 free_clusters; /* Free cluster count. -1 if unknown */
145 __le32 next_cluster; /* Most recently allocated cluster */
168 __le16 starthi; /* High 16 bits of cluster in FAT32 */
169 __le16 time,date,start;/* time, date and first cluster */
181 __le16 start; /* starting cluster number, 0 in long slots */
232 unsigned short sec_per_clus; /* sectors/cluster */
    [all...]
  /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/alsa/
seq_event.h 138 /** Sample cluster select; event data type = #snd_seq_ev_sample_control_t */
206 /** set cluster parameters */
208 /** get cluster parameters */
210 /** result of cluster parameters */
320 /** Instrument cluster type */
325 snd_seq_instr_cluster_t cluster; /**< cluster id */ member in struct:snd_seq_instr
338 /** sample cluster */
340 snd_seq_instr_cluster_t cluster; /**< cluster id * member in struct:snd_seq_ev_cluster
376 snd_seq_ev_cluster_t cluster; \/**< cluster number *\/ member in union:snd_seq_ev_sample_control::__anon14049
    [all...]
  /external/neven/Embedded/common/src/b_BitFeatureEm/
LocalScanDetector.h 45 /* maximum size of any cluster in all processing stages of landmarker */
64 /** temporary cluster */
67 /** temporary cluster */
70 /** temporary cluster */
73 /** temporary cluster */
111 /** reference cluster */
114 /** cluster with scan positions */
126 /** pca reference cluster */
194 /** processes image with cluster; produces output cluster and returns confidence (8.24)
    [all...]
  /external/e2fsprogs/e2fsck/
mtrace.h 133 /* Size (in blocks) of a large cluster. */
138 (that may be the first of a free cluster). */
141 size_t size; /* Size (in blocks) of a free cluster. */
142 size_t next; /* Index of next free cluster. */
143 size_t prev; /* Index of previous free cluster. */
  /external/qemu/block/
vvfat.c 284 /* begin is the first cluster, end is the last+1 */
293 * - the next cluster of the directory for a directory, and
340 unsigned char* cluster; /* points to current cluster */ member in struct:BDRVVVFATState
537 static inline void fat_set(BDRVVVFATState* s,unsigned int cluster,uint32_t value)
540 uint32_t* entry=array_get(&(s->fat),cluster);
543 uint16_t* entry=array_get(&(s->fat),cluster);
546 int offset = (cluster*3/2);
548 switch (cluster&1) {
561 static inline uint32_t fat_get(BDRVVVFATState* s,unsigned int cluster)
847 unsigned int cluster; local
1352 struct { uint32_t cluster; } rename; member in struct:commit_t::__anon5795::__anon5796
1355 struct { uint32_t cluster; } mkdir; member in struct:commit_t::__anon5795::__anon5799
1732 unsigned char* cluster = qemu_malloc(s->cluster_size); local
2055 uint32_t cluster = first_cluster; local
2215 char* cluster = qemu_malloc(s->cluster_size); local
    [all...]
qcow2-cluster.c 53 /* write new table (align to cluster) */
381 * For a given offset of the disk image, return cluster offset in
444 /* find the cluster offset for the given disk offset */
475 * the l2 table offset in the qcow2 file and the cluster index
516 /* find the cluster offset for the given disk offset */
530 * For a given offset of the disk image, return cluster offset in
533 * If the offset is not found, allocate a new compressed cluster.
535 * Return the cluster offset if successful,
637 /* if two concurrent writes happen to the same unallocated cluster
638 * each write allocates separate cluster and writes data concurrently
    [all...]
qcow2.h 38 /* indicate that the refcount of the referenced cluster is exactly one. */
40 /* indicate that the cluster is compressed (they never have the copied flag) */
127 /* XXX This could be private for qcow2-cluster.c */
172 /* qcow2-cluster.c functions */
  /external/grub/stage2/
fat.h 41 __u8 sects_per_clust;/* sectors/cluster */
57 __u32 root_cluster; /* first cluster in root directory */

Completed in 402 milliseconds

1 2 3 4 5 6