mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-03-04 05:31:51 +00:00
More eye-candy stuff :)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@45247 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
08b934edc6
commit
54c005f465
@ -147,7 +147,7 @@ public:
|
||||
inline const Node* &front() const { return Children.front(); }
|
||||
inline Node* &front() { return Children.front(); }
|
||||
inline const Node* &back() const { return Children.back(); }
|
||||
inline Node* &back() { return Children.back(); }
|
||||
inline Node* &back() { return Children.back(); }
|
||||
|
||||
};
|
||||
|
||||
@ -275,26 +275,21 @@ const Payload& Trie<Payload>::lookup(const std::string& s) const {
|
||||
|
||||
template<class Payload>
|
||||
struct GraphTraits<Trie<Payload> > {
|
||||
typedef typename Trie<Payload>::Node NodeType;
|
||||
typedef typename Trie<Payload>::Node::iterator ChildIteratorType;
|
||||
typedef Trie<Payload> TrieType;
|
||||
typedef typename TrieType::Node NodeType;
|
||||
typedef typename NodeType::iterator ChildIteratorType;
|
||||
|
||||
static inline NodeType *getEntryNode(const Trie<Payload>& T) {
|
||||
return T.getRoot();
|
||||
}
|
||||
static inline NodeType *getEntryNode(const TrieType& T) { return T.getRoot(); }
|
||||
|
||||
static inline ChildIteratorType child_begin(NodeType *N) {
|
||||
return N->begin();
|
||||
}
|
||||
static inline ChildIteratorType child_end(NodeType *N) {
|
||||
return N->end();
|
||||
}
|
||||
static inline ChildIteratorType child_begin(NodeType *N) { return N->begin(); }
|
||||
static inline ChildIteratorType child_end(NodeType *N) { return N->end(); }
|
||||
|
||||
typedef typename std::vector<NodeType*>::const_iterator nodes_iterator;
|
||||
|
||||
static inline nodes_iterator nodes_begin(const Trie<Payload>& G) {
|
||||
static inline nodes_iterator nodes_begin(const TrieType& G) {
|
||||
return G.Nodes.begin();
|
||||
}
|
||||
static inline nodes_iterator nodes_end(const Trie<Payload>& G) {
|
||||
static inline nodes_iterator nodes_end(const TrieType& G) {
|
||||
return G.Nodes.end();
|
||||
}
|
||||
|
||||
|
Loading…
x
Reference in New Issue
Block a user