这个编译实验把一个正则表达式转化为不确定的有穷自动机NFA算法，有兴趣的朋友可以看看哦。 -The experiment to compile a regular expression into an uncertain finite automata NFA algorithm, interested friends can see Oh.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001150s ]
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.067220s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001106s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001237s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001111s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003249s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001001s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003704s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014633s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001126s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 162774 [ RunTime:0.016005s ]
