Searched refs:recencyMinHeap (Results 1 – 1 of 1) sorted by relevance
79 PriorityQueue<Pair<ShareTargetRankingScore, Range<Long>>> recencyMinHeap = in computeScore() local117 if (recencyMinHeap.size() < RECENCY_SCORE_COUNT in computeScore()118 || mostRecentTimeSlot.getUpper() > recencyMinHeap.peek().second.getUpper()) { in computeScore()119 if (recencyMinHeap.size() == RECENCY_SCORE_COUNT) { in computeScore()120 recencyMinHeap.poll(); in computeScore()122 recencyMinHeap.offer(new Pair(shareTargetScore, mostRecentTimeSlot)); in computeScore()126 while (!recencyMinHeap.isEmpty()) { in computeScore()128 if (recencyMinHeap.size() > 1) { in computeScore()130 - RECENCY_SCORE_SUBSEQUENT_DECAY * (recencyMinHeap.size() - 2); in computeScore()132 recencyMinHeap.poll().first.setRecencyScore(recencyScore); in computeScore()