(int hash, BConcurrentKey keyHint, long roleId, OutObject<BRankValue> outExist)
| 241 | } |
| 242 | |
| 243 | private BRankList _removeRank(int hash, BConcurrentKey keyHint, long roleId, OutObject<BRankValue> outExist) { |
| 244 | int concurrentLevel = getConcurrentLevel(keyHint.getRankType()); |
| 245 | |
| 246 | var concurrentKey = new BConcurrentKey(keyHint.getRankType(), |
| 247 | Integer.remainderUnsigned(hash, concurrentLevel), |
| 248 | keyHint.getTimeType(), keyHint.getYear(), keyHint.getOffset()); |
| 249 | |
| 250 | var rank = _trank.getOrAdd(concurrentKey); |
| 251 | // remove if role exist. 看看有没有更快的算法。 |
| 252 | BRankValue exist = null; |
| 253 | for (int i = 0; i < rank.getRankList().size(); ++i) { |
| 254 | var rankValue = rank.getRankList().get(i); |
| 255 | if (rankValue.getRoleId() == roleId) { |
| 256 | exist = rankValue; |
| 257 | rank.getRankList().remove(i); |
| 258 | break; |
| 259 | } |
| 260 | } |
| 261 | if (null != outExist) |
| 262 | outExist.value = exist; |
| 263 | return rank; |
| 264 | } |
| 265 | |
| 266 | /** |
| 267 | * 根据 value 设置到排行榜中 |
no test coverage detected