Leahnaya/butterfly
1
0
Fork 0
mirror of https://github.com/skogaby/butterfly.git synced 2026-09-09 00:35:10 -05:00
Code Issues Actions Packages Projects Releases Wiki Activity

Use a basic cache for global high scores so we don't need to fetch the records from the DB

Browse Source
This commit is contained in:
skogaby
2019-01-21 14:40:17 -06:00
parent b60269f6e0
commit f84b9dba88
1 changed files with 43 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

45
src/main/java/com/buttongames/butterfly/http/handlers/impl/PlayerDataRequestHandler.java
View File

@@ -52,6 +52,7 @@ import java.util.Arrays;
import java.util.Base64;
import java.util.List;
import java.util.Random;
import java.util.concurrent.ConcurrentHashMap;
/**
* Handler for any requests that come to the <code>playerdata</code> module.
@@ -136,6 +137,11 @@ public class PlayerDataRequestHandler extends BaseRequestHandler {
*/
private static List<Song> SONGS_2018042300;
/**
* In-memory cache of the global high scores.
*/
private static ConcurrentHashMap<Integer, ConcurrentHashMap<Integer, UserSongRecord>> GLOBAL_HIGH_SCORES_CACHE;
static {
loadEvents();
loadMusicDb();
@@ -148,6 +154,9 @@ public class PlayerDataRequestHandler extends BaseRequestHandler {
this.profileDao = profileDao;
this.ghostDataDao = ghostDataDao;
this.songRecordDao = songRecordDao;
// cache the global high scores
this.loadGlobalHighScores();
}
/**
@@ -191,6 +200,30 @@ public class PlayerDataRequestHandler extends BaseRequestHandler {
}
}
/**
* Loads the global high scores into memory so we can use this cache for the
* high scores requests and not hit the DB every time.
*/
private void loadGlobalHighScores() {
GLOBAL_HIGH_SCORES_CACHE = new ConcurrentHashMap<>();
UserSongRecord record;
// we need to return the top score for every song/difficulty
for (Song song : SONGS_2018042300) {
// create the internal maps now
GLOBAL_HIGH_SCORES_CACHE.put(song.getMcode(), new ConcurrentHashMap<>());
for (int i = 0; i < 8; i++) {
record = this.songRecordDao.findTopScoreForSongDifficulty(song.getMcode(), i);
if (record != null) {
GLOBAL_HIGH_SCORES_CACHE.get(song.getMcode()).put(i, record);
}
}
}
}
/**
* Handles an incoming request for the <code>playerdata</code> module.
* @param requestBody The XML document of the incoming request.
@@ -297,9 +330,9 @@ public class PlayerDataRequestHandler extends BaseRequestHandler {
// we need to return the top score for every song/difficulty
for (Song song : SONGS_2018042300) {
for (int i = 0; i < 8; i++) {
record = this.songRecordDao.findTopScoreForSongDifficulty(song.getMcode(), i);
if (GLOBAL_HIGH_SCORES_CACHE.get(song.getMcode()).containsKey(i)) {
record = GLOBAL_HIGH_SCORES_CACHE.get(song.getMcode()).get(i);
if (record != null) {
respBuilder = respBuilder.e("record")
.u32("mcode", song.getMcode()).up()
.u8("notetype", i).up()
@@ -897,6 +930,14 @@ public class PlayerDataRequestHandler extends BaseRequestHandler {
showFastSlow, songBaseName, songTitle, songArtist, bpmMin, bpmMax, level, series, bemaniFlag, genreFlag,
limited, region, grVoltage, grStream, grChaos, grFreeze, grAir, share, endtime, folder);
this.songRecordDao.create(newRecord);
// make sure we don't also need to update the global high score cache
ConcurrentHashMap<Integer, UserSongRecord> songRecords = GLOBAL_HIGH_SCORES_CACHE.get(songId);
if (!songRecords.containsKey(noteType) ||
songRecords.get(noteType).getScore() < score) {
GLOBAL_HIGH_SCORES_CACHE.get(songId).put(noteType, newRecord);
}
}
final KXmlBuilder builder = KXmlBuilder.create("response")