equal
deleted
inserted
replaced
104 /* Search for the first entry associated with (i.e. with key ==) identifier_str. Will return end() if not found (NOTE: end() != end_value()) */ |
104 /* Search for the first entry associated with (i.e. with key ==) identifier_str. Will return end() if not found (NOTE: end() != end_value()) */ |
105 iterator lower_bound(const char *identifier_str) {return ((count(identifier_str) == 0)? _base.end() : _base.lower_bound(identifier_str));} |
105 iterator lower_bound(const char *identifier_str) {return ((count(identifier_str) == 0)? _base.end() : _base.lower_bound(identifier_str));} |
106 iterator lower_bound(const symbol_c *symbol) {return lower_bound(symbol_to_string(symbol));} |
106 iterator lower_bound(const symbol_c *symbol) {return lower_bound(symbol_to_string(symbol));} |
107 |
107 |
108 /* Search for the first entry with key greater than identifier_str. Will return end() if not found */ |
108 /* Search for the first entry with key greater than identifier_str. Will return end() if not found */ |
109 iterator upper_bound(const char *identifier_str) {return _base.upper_bound(identifier_str);} |
109 iterator upper_bound(const char *identifier_str) {return ((count(identifier_str) == 0)? _base.end() : _base.upper_bound(identifier_str));} |
110 iterator upper_bound(const symbol_c *symbol) {return upper_bound(symbol_to_string(symbol));} |
110 iterator upper_bound(const symbol_c *symbol) {return upper_bound(symbol_to_string(symbol));} |
111 |
111 |
112 /* get the value to which an iterator is pointing to... */ |
112 /* get the value to which an iterator is pointing to... */ |
113 value_t get_value(const iterator i) {return i->second;} |
113 value_t get_value(const iterator i) {return i->second;} |
114 |
114 |