Less recursive and stepless classification code for ThinkPHP

This article uses a short piece of code to implement ThinkPHP to implement recursive stepless classification. For more information, see

This article uses a short piece of code to implement ThinkPHP to implement recursive stepless classification. For more information, see

The Code is as follows:

/*** Stepless recursive classification ** @ param int $ assortPid the parent id of the category to be queried * @ param mixed $ delimiter between the upper and lower levels of the tag * @ return string $ tree returned category tree structure result **/function recursiveAssort ($ assortPid, $ tag = '') {$ assort = M ('goods _ class')-> where (" class_pid = $ assortPid ")-> field ('class _ id, class_name ')-> select (); foreach ($ assort as $ value) {$ tree. =''. $ Tag. $ value ['class _ name'].''; $ Tree. = recursiveAssort ($ value ['class _ id'], $ tag. 'category');} return $ tree ;}

The above Code uses ThinkPHP to implement recursive stepless classification. I hope you will like it.

,