What does PHP Infinitus classification mean?-PHP Problem-php.cn

What does PHP Infinitus classification mean?

(*-*)浩

Release： 2023-02-24 07:58:01

Original

3609 people have browsed it

php Infinitus Classification To put it simply, a category can be divided into multiple subcategories, and then one subcategory can be divided into multiple other subcategories and so on indefinitely, just like Windows can create a new folder, and then in You can create some folders in this folder, and you can also create some folders under the folder.

What does PHP Infinitus classification mean?

Database Storage

Infinitus classification is actually a tree, with all nodes as one storage element. Each node can have any number of child nodes and only one parent node.

MySQL data storage, combined with the project's data table storage structure is as follows: (Recommended learning: PHP programming from entry to proficiency)

CREATE TABLE t_tree_info (  `Fid` bigint(20) unsigned NOT NULL AUTO_INCREMENT COMMENT &#39;标签自增ID&#39;,    `Fname` 
varchar(255)  NOT NULL DEFAULT &#39;&#39; COMMENT &#39;节点名称&#39;,    `Fpid` bigint(20) unsigned NOT NULL DEFAULT 0  
COMMENT &#39;父节点id&#39;,    `Fadd_time` TIMESTAMP NOT NULL DEFAULT &#39;0000-00-00 00:00:00&#39;  COMMENT &#39;创建时间&#39;,  
`Fmodify_time` TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP COMMENT &#39;修改时间&#39;,
  PRIMARY KEY (`Fid`)
) ENGINE=InnoDB DEFAULT CHARSET=utf8 COMMENT=&#39;无限极分类菜单存储表&#39;;

Copy after login

The core field is the unique identifier of the node itself Fid, and the corresponding parent node identifier Fpid.

Technical implementation

Global data storage node

The node data is stored in MySQL in the project. Now for testing, the MySQL data is stored directly in In the array, it is used globally. The data is stored as follows:

private static $listData = [
    [
        "Fid" => 1,
        "Fpid" => 8,
        "Fname" => &#39;首页&#39;,
    ],
    [
        "Fid" => 2,
        "Fpid" => 8,
        "Fname" => &#39;博客&#39;,
    ],
    [
        "Fid" => 3,
        "Fpid" => 8,
        "Fname" => &#39;官网&#39;,
    ],
    [
        "Fid" => 4,
        "Fpid" => 2,
        "Fname" => &#39;个人博客&#39;,
    ],
    [
        "Fid" => 5,
        "Fpid" => 2,
        "Fname" => &#39;他人博客&#39;,
    ],
    [
        "Fid" => 6,
        "Fpid" => 8,
        "Fname" => &#39;测试1&#39;,
    ],
    [
        "Fid" => 7,
        "Fpid" => 8,
        "Fname" => &#39;测试2&#39;,
    ],
    [
        "Fid" => 8,
        "Fpid" => 0,
        "Fname" => &#39;无限极分类&#39;,
    ],
    [
        "Fid" => 9,
        "Fpid" => 5,
        "Fname" => &#39;女性栏目&#39;,
    ],
    [
        "Fid" => 10,
        "Fpid" => 5,
        "Fname" => &#39;男性栏目&#39;,
    ],
];

Copy after login

Reference method to achieve infinite classification

Idea:

1, that is, all pending The data is packaged into an array subscripted with the primary key Fid (pk), so that Fpid can be used to obtain the corresponding parent column.

2. Loop through the packaged data. If it is the root node, add its reference to the tree. Otherwise, add its reference to the child element of its parent class. In this way, although only the root node is added to the tree, if each root node has child elements, it contains references to the child elements. Therefore, it can form a tree shape.

Personally, I feel that the quoted design ideas are easier to understand and more intuitive than the recursive ideas.

The code is as follows:

/**
 * 把返回的数据集转换成Tree
 * @param array $list 要转换的数据集
 * @param string $pk 自增字段（栏目Fid）
 * @param string $pid parent标记字段
 * @return array
 */
public static function quote_make_tree($list, $pk = &#39;Fid&#39;, $pid = &#39;Fpid&#39;,$child = &#39;_child&#39;, $root = 0)
{
    $tree = $packData = [];
    foreach ($list as $data) {
        $packData[$data[$pk]] = $data;
    }
    foreach ($packData as $key =>$val) {
        if ($val[$pid] == $root) {//代表跟节点
          $tree[] = & $packData[$key];
        } else {
          //找到其父类
          $packData[$val[$pid]][$child][] = & $packData[$key];
        }
    }
    return $tree;
}

Copy after login

Reference call tree:

/**
 * 引用生成树
 * @return
 */
public static function quote_tree_test()
{
    $tree = self::make_tree(self::$listData, $pk = &#39;id&#39;, $pid = &#39;pid&#39;, $child = &#39;_child&#39;, $root = 0);
    echo json_encode($tree);
}

Copy after login

The return result is as follows:

[
    {
        "Fid": 8,
        "Fpid": 0,
        "Fname": "无限极分类",
        "_child": [
            {
                "Fid": 1,
                "Fpid": 8,
                "Fname": "首页"
            },
            {
                "Fid": 2,
                "Fpid": 8,
                "Fname": "博客",
                "_child": [
                    {
                        "Fid": 4,
                        "Fpid": 2,
                        "Fname": "个人博客"
                    },
                    {
                        "Fid": 5,
                        "Fpid": 2,
                        "Fname": "他人博客",
                        "_child": [
                            {
                                "Fid": 9,
                                "Fpid": 5,
                                "Fname": "女性栏目"
                            },
                            {
                                "Fid": 10,
                                "Fpid": 5,
                                "Fname": "男性栏目"
                            }
                        ]
                    }
                ]
            },
            {
                "Fid": 3,
                "Fpid": 8,
                "Fname": "官网"
            },
            {
                "Fid": 6,
                "Fpid": 8,
                "Fname": "测试1"
            },
            {
                "Fid": 7,
                "Fpid": 8,
                "Fname": "测试2"
            }
        ]
    }
]

Copy after login

The above is the detailed content of What does PHP Infinitus classification mean?. For more information, please follow other related articles on the PHP Chinese website!