feat(util/name): add name_pair, and lex order
Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
This commit is contained in:
parent
f9d81c24d3
commit
50806314d4
1 changed files with 10 additions and 0 deletions
|
@ -9,6 +9,7 @@ Author: Leonardo de Moura
|
|||
#include <iostream>
|
||||
#include <functional>
|
||||
#include <algorithm>
|
||||
#include <utility>
|
||||
#include "util/lua.h"
|
||||
#include "util/serializer.h"
|
||||
#include "util/optional.h"
|
||||
|
@ -167,6 +168,15 @@ inline bool independent(name const & a, name const & b) {
|
|||
return !is_prefix_of(a, b) && !is_prefix_of(b, a);
|
||||
}
|
||||
|
||||
typedef std::pair<name, name> name_pair;
|
||||
struct name_pair_quick_cmp {
|
||||
int operator()(name_pair const & p1, name_pair const & p2) const {
|
||||
int r = cmp(p1.first, p2.first);
|
||||
if (r != 0) return r;
|
||||
return cmp(p1.second, p2.second);
|
||||
}
|
||||
};
|
||||
|
||||
serializer & operator<<(serializer & s, name const & n);
|
||||
name read_name(deserializer & d);
|
||||
inline deserializer & operator>>(deserializer & d, name & n) { n = read_name(d); return d; }
|
||||
|
|
Loading…
Reference in a new issue