author | qdii <qdii@reblochon.be> | 2012-11-02 19:46:03 (UTC) |
---|---|---|
committer | Michael Krelin <hacker@klever.net> | 2012-11-02 19:49:46 (UTC) |
commit | 9ff6244998b0d41e71f7cc7351403ad590e990e4 (patch) (unidiff) | |
tree | 4945d4bba357e8103bd61eb5c6be3600ef2e83be | |
parent | 648ae5dbd90e062f3432f809a846d50d994b86d4 (diff) | |
download | libopkele-9ff6244998b0d41e71f7cc7351403ad590e990e4.zip libopkele-9ff6244998b0d41e71f7cc7351403ad590e990e4.tar.gz libopkele-9ff6244998b0d41e71f7cc7351403ad590e990e4.tar.bz2 |
Fix argument-lookup failure on GCC 4.7.1, causing compilation to crash.
Modified-by: Michael Krelin <hacker@klever.net>
Signed-off-by: Michael Krelin <hacker@klever.net>
-rw-r--r-- | include/opkele/discovery.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/include/opkele/discovery.h b/include/opkele/discovery.h index f2721a6..985eef6 100644 --- a/include/opkele/discovery.h +++ b/include/opkele/discovery.h | |||
@@ -8,33 +8,33 @@ namespace opkele { | |||
8 | using std::string; | 8 | using std::string; |
9 | 9 | ||
10 | namespace xrd { | 10 | namespace xrd { |
11 | 11 | ||
12 | struct priority_compare { | 12 | struct priority_compare { |
13 | inline bool operator()(long a,long b) const { | 13 | inline bool operator()(long a,long b) const { |
14 | return (a<0) ? false : (b<0) ? true : (a<b); | 14 | return (a<0) ? false : (b<0) ? true : (a<b); |
15 | } | 15 | } |
16 | }; | 16 | }; |
17 | 17 | ||
18 | template <typename _DT> | 18 | template <typename _DT> |
19 | class priority_map : public multimap<long,_DT,priority_compare> { | 19 | class priority_map : public multimap<long,_DT,priority_compare> { |
20 | typedef multimap<long,_DT,priority_compare> map_type; | 20 | typedef multimap<long,_DT,priority_compare> map_type; |
21 | public: | 21 | public: |
22 | 22 | ||
23 | inline _DT& add(long priority,const _DT& d) { | 23 | inline _DT& add(long priority,const _DT& d) { |
24 | return insert(typename map_type::value_type(priority,d))->second; | 24 | return this->insert(typename map_type::value_type(priority,d))->second; |
25 | } | 25 | } |
26 | 26 | ||
27 | bool has_value(const _DT& d) const { | 27 | bool has_value(const _DT& d) const { |
28 | for(typename map_type::const_iterator i=this->begin();i!=this->end();++i) | 28 | for(typename map_type::const_iterator i=this->begin();i!=this->end();++i) |
29 | if(i->second==d) return true; | 29 | if(i->second==d) return true; |
30 | return false; | 30 | return false; |
31 | } | 31 | } |
32 | }; | 32 | }; |
33 | 33 | ||
34 | typedef priority_map<string> canonical_ids_t; | 34 | typedef priority_map<string> canonical_ids_t; |
35 | typedef priority_map<string> local_ids_t; | 35 | typedef priority_map<string> local_ids_t; |
36 | typedef set<string> types_t; | 36 | typedef set<string> types_t; |
37 | struct uri_t { | 37 | struct uri_t { |
38 | string uri; | 38 | string uri; |
39 | string append; | 39 | string append; |
40 | 40 | ||