This is a complete Common Lisp program that minimizes Boolean functions expressed as a sum of minterms. It is easy to use and runs quickly, given that it must perform a tree search. By Vitit Kantabutra, Idaho State University Computer Science.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.002675s ]
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.119212s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.002386s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001944s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.002256s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003794s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001960s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003254s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014842s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.002368s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 212316 [ RunTime:0.001065s ]
