Dragonestia/RoomPicker
3
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fixed noiser

Browse Source
This commit is contained in:
Andrey Terentev 2024-05-27 01:14:58 +07:00 committed by Andrey Terentev
parent 284e1938ed
commit 5935bc715f
1 changed files with 18 additions and 32 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

50
noiser/src/main/java/ru/dragonestia/picker/noiser/Main.java
View File

@ -1,14 +1,10 @@
package ru.dragonestia.picker.noiser; package ru.dragonestia.picker.noiser;
import ru.dragonestia.picker.api.impl.RoomPickerClient; import ru.dragonestia.picker.api.impl.RoomPickerClient;
import ru.dragonestia.picker.api.model.node.NodeDefinition; import ru.dragonestia.picker.api.model.entity.EntityId;
import ru.dragonestia.picker.api.model.node.PickingMethod; import ru.dragonestia.picker.api.model.instance.InstanceId;
import ru.dragonestia.picker.api.model.room.RoomDefinition; import ru.dragonestia.picker.api.model.instance.type.PickingMethod;
import ru.dragonestia.picker.api.repository.query.node.GetAllNodes; import ru.dragonestia.picker.api.model.room.RoomId;
import ru.dragonestia.picker.api.repository.query.user.UnlinkUsersFromRoom;
import ru.dragonestia.picker.api.repository.type.NodeIdentifier;
import ru.dragonestia.picker.api.repository.type.RoomIdentifier;
import ru.dragonestia.picker.api.repository.type.EntityIdentifier;
import java.util.*; import java.util.*;
import java.util.concurrent.ConcurrentHashMap; import java.util.concurrent.ConcurrentHashMap;
@ -23,9 +19,9 @@ public class Main {
private final ScheduledExecutorService scheduler = new ScheduledThreadPoolExecutor(8); private final ScheduledExecutorService scheduler = new ScheduledThreadPoolExecutor(8);
private final Random random = new Random(); private final Random random = new Random();
private final RoomPickerClient client; private final RoomPickerClient client;
private final List<NodeIdentifier> nodes; private final List<InstanceId> nodes;
private final Map<NodeIdentifier, AtomicInteger> totalUsers = new ConcurrentHashMap<>(); private final Map<InstanceId, AtomicInteger> totalUsers = new ConcurrentHashMap<>();
private final int expectedUsers = 10000; private final int expectedUsers = 10000;
public Main() { public Main() {
@ -34,22 +30,18 @@ public class Main {
} }
private void removeAll() { private void removeAll() {
client.getInstanceRepository().allNodes(GetAllNodes.JUST) client.getInstanceRepository().allInstancesIds()
.forEach(node -> client.getInstanceRepository().removeNode(node)); .forEach(node -> client.getInstanceRepository().deleteInstance(node));
} }
private List<NodeIdentifier> initNodes() { private List<InstanceId> initNodes() {
removeAll(); removeAll();
var list = new ArrayList<NodeIdentifier>(); var list = new ArrayList<InstanceId>();
for (int i = 0; i < 5; i++) { for (int i = 0; i < 5; i++) {
var node = new NodeDefinition(NodeIdentifier.of("test-node-" + i)) var nodeId = InstanceId.of("test-node-" + i);
.setPickingMethod(PickingMethod.values()[i % PickingMethod.values().length]); client.getInstanceRepository().createInstance(nodeId, PickingMethod.values()[i % PickingMethod.values().length], false);
client.getInstanceRepository().saveNode(node);
var nodeId = node.getIdentifierObject();
totalUsers.put(nodeId, new AtomicInteger(0)); totalUsers.put(nodeId, new AtomicInteger(0));
list.add(nodeId); list.add(nodeId);
} }
@ -61,11 +53,9 @@ public class Main {
final int perNode = expectedUsers / nodes.size(); final int perNode = expectedUsers / nodes.size();
final int roomsPerNode = perNode / 10; final int roomsPerNode = perNode / 10;
for (var nodeId: nodes) { for (var instanceId: nodes) {
for (int i = 0; i < roomsPerNode; i++) { for (int i = 0; i < roomsPerNode; i++) {
client.getRoomRepository().saveRoom( client.getRoomRepository().createRoom(instanceId, RoomId.of(UUID.randomUUID().toString()), 50, "", false, false);
new RoomDefinition(nodeId, RoomIdentifier.of(UUID.randomUUID().toString())).setMaxSlots(50)
);
} }
} }
} }
@ -76,28 +66,24 @@ public class Main {
try { try {
synchronized (usersInNode) { synchronized (usersInNode) {
var users = new HashSet<EntityIdentifier>(); var users = new HashSet<EntityId>();
var maxAdd = Math.min(10, (expectedUsers / nodes.size()) - usersInNode.get()); var maxAdd = Math.min(10, (expectedUsers / nodes.size()) - usersInNode.get());
if (maxAdd == 0) return; if (maxAdd == 0) return;
var add = maxAdd == 1 ? 1 : (random.nextInt(maxAdd - 1) + 1); var add = maxAdd == 1 ? 1 : (random.nextInt(maxAdd - 1) + 1);
for (int i = 0; i < add; i++) { for (int i = 0; i < add; i++) {
users.add(EntityIdentifier.of(UUID.randomUUID().toString())); users.add(EntityId.of(UUID.randomUUID().toString()));
} }
var request = client.getInstanceRepository().pickRoom(nodeId, users); var request = client.getInstanceRepository().pickRoom(nodeId, users);
usersInNode.addAndGet(add); usersInNode.addAndGet(add);
var roomId = RoomIdentifier.of(request.roomId()); var roomId = request.getRoom().id();
System.out.printf("Added %s(total %s) users to %s/%s%n", add, usersInNode.get(), nodeId.getValue(), roomId.getValue()); System.out.printf("Added %s(total %s) users to %s/%s%n", add, usersInNode.get(), nodeId.getValue(), roomId.getValue());
scheduler.schedule(() -> { scheduler.schedule(() -> {
try { try {
client.getEntityRepository().unlinkUsersFromRoom(UnlinkUsersFromRoom.builder() client.getEntityRepository().unlinkEntitiesFromRoom(nodeId, roomId, users);
.setNodeId(nodeId)
.setRoomId(roomId)
.setUsers(users)
.build());
usersInNode.addAndGet(-add); usersInNode.addAndGet(-add);
System.out.printf("Reduced %s users from %s/%s%n", add, nodeId.getValue(), roomId.getValue()); System.out.printf("Reduced %s users from %s/%s%n", add, nodeId.getValue(), roomId.getValue());