BestMatcher< T, S > Node1 BestMatcher< T, S > # m_d + BestMatcher() + ~BestMatcher() + match() + distance() # matcher() Node2 TIDA::Associator< T, T > + Associator() + ~Associator() + clone() + match() + matched() + matched() + revmatched() + revmatched() + clear() + size() Node2->Node1 Node3 std::map< T *, T * > Node3->Node2 #mmatched #mrevmatched Node4 T Node4->Node3 +elements +keys Node5 std::string Node5->Node2 #mname Node6 std::basic_string< char > Node6->Node5