Home | History | Annotate | Download | only in media

Lines Matching full:cluster

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 regular
75 // cluster.
78 private ArrayList<Cluster> mClusters;
79 private Cluster mCurrCluster;
87 mClusters = new ArrayList<Cluster>();
89 mCurrCluster = new Cluster(mIsPicassaAlbum);
95 Cluster cluster = mClusters.get(i);
96 cluster.clear();
106 // Heuristic to get min and max cluster size - half and double the
107 // desired items per cluster.
123 // Find the cluster that contains this item.
129 Cluster cluster = mClusters.get(i);
130 if (cluster.removeItem(mediaItem)) {
131 if (cluster.mNumItemsLoaded == 0) {
132 mClusters.remove(cluster);
146 // Determine if this item should go in the current cluster or be the
147 // start of a new cluster.
167 // Creating a new cluster and adding the current item to it.
169 mCurrCluster = new Cluster(mIsPicassaAlbum);
182 // The last cluster may potentially be too big or too small.
191 mCurrCluster = new Cluster(mIsPicassaAlbum);
200 Cluster partitionedCluster = new Cluster(mIsPicassaAlbum);
205 partitionedCluster = new Cluster(mIsPicassaAlbum);
250 Cluster prevCluster = mClusters.get(numClusters - 1);
263 public synchronized ArrayList<Cluster> getClusters() {
268 ArrayList<Cluster> mergedClusters = new ArrayList<Cluster>();
276 public ArrayList<Cluster> getClustersForDisplay() {
280 public static final class Cluster extends MediaSet {
286 public Cluster(boolean isPicassaAlbum) {