Searched refs:sortedValues (Results 1 – 3 of 3) sorted by relevance
837 final Set<T> sortedValues = totals.getKeysetSortedByCount(false, votesThenUcaCollator); in resolveVotes() local839 System.out.println("sortedValues :" + sortedValues.toString()); in resolveVotes()842 if (sortedValues.size() == 0) { in resolveVotes()864 HashMap<T, Long> voteCount = makeVoteCountMap(sortedValues); in resolveVotes()871 combineInheritanceWithBaileyForVoting(sortedValues, voteCount); in resolveVotes()877 adjustAnnotationVoteCounts(sortedValues, voteCount); in resolveVotes()883 long weights[] = setBestNextAndSameVoteValues(sortedValues, voteCount); in resolveVotes()908 private HashMap<T, Long> makeVoteCountMap(Set<T> sortedValues) { in makeVoteCountMap() argument910 for (T value : sortedValues) { in makeVoteCountMap()935 …private void combineInheritanceWithBaileyForVoting(Set<T> sortedValues, HashMap<T, Long> voteCount… in combineInheritanceWithBaileyForVoting() argument[all …]
87 vector<deUint64> sortedValues = values; in calculateStats() local89 std::sort(sortedValues.begin(), sortedValues.end()); in calculateStats()91 result.median = (double)sortedValues[n]; in calculateStats()
320 List<String[]> sortedValues = new ArrayList<String[]>(); in sortValues() local330 sortedValues.add(new String[] { value }); in sortValues()339 sortedValues.add(toArray(arrayValues)); in sortValues()344 return sortedValues; in sortValues()