Searched refs:recencyMinHeap (Results 1 – 1 of 1) sorted by relevance
76 PriorityQueue<Pair<ShareTargetRankingScore, Range<Long>>> recencyMinHeap = in computeScore() local114 if (recencyMinHeap.size() < RECENCY_SCORE_COUNT in computeScore()115 || mostRecentTimeSlot.getUpper() > recencyMinHeap.peek().second.getUpper()) { in computeScore()116 if (recencyMinHeap.size() == RECENCY_SCORE_COUNT) { in computeScore()117 recencyMinHeap.poll(); in computeScore()119 recencyMinHeap.offer(new Pair(shareTargetScore, mostRecentTimeSlot)); in computeScore()123 while (!recencyMinHeap.isEmpty()) { in computeScore()125 if (recencyMinHeap.size() > 1) { in computeScore()127 - RECENCY_SCORE_SUBSEQUENT_DECAY * (recencyMinHeap.size() - 2); in computeScore()129 recencyMinHeap.poll().first.setRecencyScore(recencyScore); in computeScore()