Home
last modified time | relevance | path

Searched refs:PriorityMap (Results 1 – 6 of 6) sorted by relevance

/external/chromium/net/tools/flip_server/
Doutput_ordering.h24 typedef std::map<uint32, PriorityRing> PriorityMap; typedef
37 PriorityMap priority_map_;
Doutput_ordering.cc123 PriorityMap::iterator pmi = priority_map_.find(mci.priority); in SpliceToPriorityRing()
/external/chromium_org/net/tools/flip_server/
Doutput_ordering.h25 typedef std::map<uint32, PriorityRing> PriorityMap; typedef
39 PriorityMap priority_map_;
Doutput_ordering.cc124 PriorityMap::iterator pmi = priority_map_.find(mci.priority); in SpliceToPriorityRing()
/external/clang/lib/StaticAnalyzer/Core/
DBugReporter.cpp2789 PriorityMapTy PriorityMap; member in __anond1fd6f0c0311::TrimmedGraph
2799 const PriorityMapTy &PriorityMap; member in __anond1fd6f0c0311::TrimmedGraph::PriorityCompare
2802 PriorityCompare(const PriorityMapTy &M) : PriorityMap(M) {} in PriorityCompare()
2805 PriorityMapTy::const_iterator LI = PriorityMap.find(LHS); in operator ()()
2806 PriorityMapTy::const_iterator RI = PriorityMap.find(RHS); in operator ()()
2807 PriorityMapTy::const_iterator E = PriorityMap.end(); in operator ()()
2866 PriorityMap.insert(std::make_pair(Node, Priority)); in TrimmedGraph()
2886 PriorityCompare<true>(PriorityMap)); in TrimmedGraph()
2895 assert(PriorityMap.find(OrigN) != PriorityMap.end() && in popNextReportGraph()
2935 PriorityCompare<false>(PriorityMap)); in popNextReportGraph()
/external/chromium/chrome/browser/chromeos/cros/
Dnetwork_library.cc3040 typedef std::map<std::string, int> PriorityMap; typedef in chromeos::NetworkLibraryImpl
3648 PriorityMap::iterator found2 = network_update_requests_.find(service_path); in ParseNetwork()
4258 PriorityMap network_update_requests_;