Home
last modified time | relevance | path

Searched refs:topKQueue (Results 1 – 2 of 2) sorted by relevance

/dports/misc/glow/glow-f24d960e3cc80db95ac0bc17b1900dbf60ca044a/tools/loader/
H A DImageClassifier.cpp91 topKQueue; in getTopKPairs() local
96 if (topKQueue.size() < topKCount) { in getTopKPairs()
98 topKQueue.push(std::make_pair(currProbability, i)); in getTopKPairs()
99 } else if (topKQueue.top().first < currProbability) { in getTopKPairs()
102 topKQueue.pop(); in getTopKPairs()
103 topKQueue.push(std::make_pair(currProbability, i)); in getTopKPairs()
110 res[topKCount - i - 1] = topKQueue.top(); in getTopKPairs()
111 topKQueue.pop(); in getTopKPairs()
/dports/misc/glow/glow-f24d960e3cc80db95ac0bc17b1900dbf60ca044a/examples/training/resnet50/
H A Dmain.cpp130 topKQueue; in getTopKPairs() local
135 if (topKQueue.size() < topKCount) { in getTopKPairs()
137 topKQueue.push(std::make_pair(currProbability, i)); in getTopKPairs()
138 } else if (topKQueue.top().first < currProbability) { in getTopKPairs()
141 topKQueue.pop(); in getTopKPairs()
142 topKQueue.push(std::make_pair(currProbability, i)); in getTopKPairs()
149 res[topKCount - i - 1] = topKQueue.top(); in getTopKPairs()
150 topKQueue.pop(); in getTopKPairs()