AVL Tree implementation:
I also included a test function to compare the AVL Tree performance with STL Set and Map.
Compile the source mavltree.cpp and run it to see the result!
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.000962s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.073809s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.000942s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001154s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001028s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003642s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000924s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.004204s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015650s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001262s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 539688 [ RunTime:0.014438s ]
