implementation of red-black tree, backing Map template class :)

git-svn-id: https://server.scottellis.com.au/svn/mim_plugs@353 4f64403b-2f21-0410-a795-97e2b3489a10

1 files changed, 4 insertions, 0 deletions

diff --git a/meta2/common.cpp b/meta2/common.cpp
index fe22092..17418fd 100644
--- a/meta2/common.cpp
+++ b/meta2/common.cpp
@@ -5,7 +5,11 @@ bool ContactHandle::operator==(const ContactHandle &other) const {
 }

 

 bool ContactHandle::operator<(const ContactHandle &other) const {

+	// these don't work, 'cause the comparison is not constant

 	//return CallService(MS_CLIST_CONTACTSCOMPARE, (WPARAM)hContact, (LPARAM)other.handle()) < 0;

+	//return _tcscmp(ContactName(hContact), ContactName(other.handle()));

+

+	// will produce a *very* unbalanced binary tree (metaMap) when contacts are added in order of handle - which they most likely are

 	return hContact < other.handle();

 }