-
Notifications
You must be signed in to change notification settings - Fork 0
/
ObjectStore.java
131 lines (106 loc) · 4.48 KB
/
ObjectStore.java
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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
/*
* Copyright 2021 Nandan Desai
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
* */
import android.content.Context;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.ObjectInputStream;
import java.io.ObjectOutputStream;
import java.io.Serializable;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.Map;
public class ObjectStore<T> {
private LRUMap<String, T> lruMap=null;
private String storeName;
private String cacheStoragePath;
public ObjectStore(Context context, String storeName, int size) throws IOException {
this.cacheStoragePath=context.getCacheDir()+"/.mycachestore";
File cacheDir = new File(cacheStoragePath);
if(cacheDir.exists()){
System.out.println("Cache dir exists!");
loadStoreFile(storeName, size);
}else{
System.out.println("Cache dir doesn't exists. Creating a new one.");
if(cacheDir.mkdirs()) {
loadStoreFile(storeName, size);
}else{
throw new IOException("couldn't create cache directory");
}
}
this.storeName=storeName;
}
private void loadStoreFile(String storeName, int size){
File storeFile=new File(cacheStoragePath+"/"+storeName);
lruMap=new LRUMap<>(size);
if(storeFile.exists()) {
System.out.println("cache store file already exists! Loading it to memory now.");
try {
FileInputStream file = new FileInputStream(cacheStoragePath+"/"+storeName);
ObjectInputStream in = new ObjectInputStream(file);
// Method for deserialization of object
lruMap = (LRUMap<String, T>)in.readObject();
in.close();
file.close();
} catch (Exception e) {
e.printStackTrace();
}
;
}
}
public void persist(){
new Thread(new Runnable() {
@Override
public void run() {
try {
FileOutputStream file = new FileOutputStream(cacheStoragePath + "/" + storeName);
ObjectOutputStream out = new ObjectOutputStream(file);
out.writeObject(lruMap);
out.close();
file.close();
} catch (Exception e) {
e.printStackTrace();
}
System.out.println("wrote cache data from memory to disk and closed it!");
}
}).start();
}
public T get(String key){
return lruMap.get(key);
}
public ArrayList<T> getAll(){
ArrayList<T> list=new ArrayList<>();
Iterator<T> iterator=lruMap.values().iterator();
while (iterator.hasNext()){
list.add(iterator.next());
}
Collections.reverse(list);
return list;
}
public void put(String key, T value){
lruMap.put(key, value);
}
public void delete(String key){
lruMap.remove(key);
}
private static class LRUMap<K, V> extends LinkedHashMap<K, V> implements Serializable {
private int size=10;
LRUMap(int size) {
super(size, 0.75f, true);
this.size = size;
}
LRUMap() {}
@Override
protected boolean removeEldestEntry(Map.Entry<K, V> eldest) {
return size() > size;
}
}
}