Skip to content

1 #1904

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
VadimN637 wants to merge 2 commits into
base: master
Choose a base branch
from
Open

1 #1904

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
1de4e2e
1
VadimN637 Apr 7, 2026
516b228
2
VadimN637 Apr 7, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
37 changes: 37 additions & 0 deletions src/main/java/core/basesyntax/impl/StorageImpl.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,17 +3,54 @@
import core.basesyntax.Storage;

public class StorageImpl<K, V> implements Storage<K, V> {
private static final int MAX_SIZE = 10;
private K[] keys;
private V[] values;
private int size;

public StorageImpl() {
keys = (K[]) new Object[MAX_SIZE];
values = (V[]) new Object[MAX_SIZE];
size = 0;
}

@Override
public void put(K key, V value) {
int index = findKey(key);
if (index != -1) {
values[index] = value;
return;
}

if (size < MAX_SIZE) {
keys[size] = key;
values[size] = value;
size++;
} else {
throw new RuntimeException("Storage is full");
}
}

@Override
public V get(K key) {
int index = findKey(key);
if (index != -1) {
return values[index];
}
return null;
}

@Override
public int size() {
return size;
}

private int findKey(K key) {
for (int i = 0; i < size; i++) {
if (keys[i] == null && key == null || (keys[i] != null && keys[i].equals(key))) {
return i;
}
}
return -1;
}
}
Loading