Repository navigation
Expand file tree
/
Copy pathAbstractArrayStorage.java
More file actions
69 lines (55 loc) · 1.6 KB
/
Copy pathAbstractArrayStorage.java
File metadata and controls
69 lines (55 loc) · 1.6 KB
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
package com.javaops.storage;
import com.javaops.exception.OverflowStorageException;
import com.javaops.model.Resume;
import java.util.Arrays;
import java.util.List;
/**
* @author Vasichkin Pavel
* Abstract storage based on arrays for Resume
*/
public abstract class AbstractArrayStorage extends AbstractStorage<Integer> {
protected static final int STORAGE_LIMIT = 10_000;
protected static final Resume[] storage = new Resume[STORAGE_LIMIT];
protected static int size;
@Override
public int size() {
return size;
}
@Override
public void clear() {
Arrays.fill(storage, 0, size, null);
size = 0;
}
@Override
protected List<Resume> getAll() {
return Arrays.asList(Arrays.copyOfRange(storage, 0, size));
}
@Override
protected Resume doGet(Integer index) {
return storage[(index)];
}
@Override
protected void doSave(Resume resume, Integer index) {
if (size == STORAGE_LIMIT) {
throw new OverflowStorageException(resume.getUuid());
}
insertElement(resume, -(index) - 1);
size++;
}
@Override
protected void doUpdate(Integer index, Resume resume) {
storage[(index)] = resume;
}
@Override
protected void doDelete(Integer index) {
removeElement((index));
storage[size - 1] = null;
size--;
}
@Override
protected boolean isExist(Integer searchKey) {
return (searchKey) > -1;
}
protected abstract void insertElement(Resume resume, int index);
protected abstract void removeElement(int index);
}