1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
|
/*
* Copyright (C) 2013 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.android.camera.data;
import android.net.Uri;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.LinkedList;
/**
* Fast access data structure for an ordered LocalData list.
*/
public class LocalDataList {
/**
* We use this as a way to compare a Uri to LocalData instances inside a
* LinkedList. A linked list in indexOf does a other.equals(get(i)).
*/
private static class UriWrapper {
private final Uri mUri;
public UriWrapper(Uri uri) {
mUri = uri;
}
@Override
public boolean equals(Object o) {
if (!(o instanceof LocalData)) {
return false;
}
return mUri.equals(((LocalData) o).getContentUri());
}
}
private LinkedList<LocalData> mList = new LinkedList<LocalData>();
private HashMap<Uri, LocalData> mUriMap = new HashMap<Uri, LocalData>();
public LocalData get(int index) {
return mList.get(index);
}
public LocalData remove(int index) {
LocalData removedItem = mList.remove(index);
mUriMap.remove(removedItem);
return removedItem;
}
public LocalData get(Uri uri) {
return mUriMap.get(uri);
}
public void set(int pos, LocalData data) {
mList.set(pos, data);
mUriMap.put(data.getContentUri(), data);
}
public void add(LocalData data) {
mList.add(data);
mUriMap.put(data.getContentUri(), data);
}
public void add(int pos, LocalData data) {
mList.add(pos, data);
mUriMap.put(data.getContentUri(), data);
}
public int size() {
return mList.size();
}
public void sort(Comparator<LocalData> comparator) {
Collections.sort(mList, comparator);
}
/**
* This implementation routes through to LinkedList.indexOf, so performs in
* O(n) but has a fast exit path for when the uri is not contained in the
* list, and immediately returns -1;
*/
public int indexOf(Uri uri) {
if (!mUriMap.containsKey(uri)) {
return -1;
}
return mList.indexOf(new UriWrapper(uri));
}
}
|
