显示无限的类别结构 -->子类别 --> ETC？

发布于 2024-11-13 06:53:45 字数 563 浏览 2 评论 0原文

我想这对人们来说是一个相当普遍的要求，当涉及到构建任何类型的依赖于分类和显示数据的应用程序时——任何 CMS/论坛/购物车等，我一直在绞尽脑汁地试图想出一个显示所有类别及其子级的方法无济于事 - 我管理的最好的方法是 while 循环中的 while 循环（无论我认为我可能需要多少级别），但这在我看来违背了编程的要点，它需要毫不费力可扩展的。

因此，给定：

Category 1
-Sub cat
-Sub cat
--Sub sub cat
--- Sub sub cat
-- Sub sub cat
-Sub cat
Category 2
-Sub cat
-Sub cat
--Sub sub cat
---sub sub sub cat
----sub sub sub sub cat
-sub cat
Category 3
-Sub cat

数据库字段：ID 名称 ParentIDS

您将如何从数据库中回显其层次结构中的每个类别？

我会发布我的代码，但显然它很大，考虑到嵌套循环的长期方式。

我考虑过编写一些代码来找到类别树的“深度”，但这仍然没有解决它..想法？

原文

I imagine this is a fairly common requirement for people when it comes to building any kind of application that relies on sorting and displaying data in categories - any CMS/Forums/Carts etc and I've been tearing my hair out trying to think of a way to show all categories and their children to no avail - the best I've managed is while loop within while loop (however many levels I think I may require) but this defeats the point of programming in my opinion, it needs to be effortlessly extensible.

So, given:

Category 1
-Sub cat
-Sub cat
--Sub sub cat
--- Sub sub cat
-- Sub sub cat
-Sub cat
Category 2
-Sub cat
-Sub cat
--Sub sub cat
---sub sub sub cat
----sub sub sub sub cat
-sub cat
Category 3
-Sub cat

Database fields: ID Name ParentIDS

How would you go about echoing each of the categories in their hierarchy from a database?

I'd post my code, but obviously its massive, given the long-hand way of nesting loops.

I've thought about writing bits of code that find the 'depth' of the category tree but that still isn't cutting it.. ideas?

分享到QQ

分享到微博

如果你对这篇内容有疑问，欢迎到本站社区发帖提问参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。

发布评论

需要登录才能够评论，你可以免费注册一个本站的账号。

很糊涂小朋友 2024-11-20 06:53:45

你所说的结构本质上是一棵树。如果使用递归，则迭代树相对简单。我不知道您正在使用什么数据库访问代码，但您应该能够从以下伪代码中进行相应推断：

function iterate_tree(arr) {
    foreach (item in arr) {
        print item;
        iterate_tree(item.children);
    }
}

用英语，这意味着打印列表中的一个项目，然后打印其子项，一旦所有子项（和他们的孩子）已打印，请转到列表中的下一项。

The structure you're talking about is essentially a tree. Iterating over a tree is relatively simple if you use recursion. I don't know what database access code you're using, but you should be able to extrapolate accordingly from the following psuedocode:

function iterate_tree(arr) {
    foreach (item in arr) {
        print item;
        iterate_tree(item.children);
    }
}

In english, that means print an item in the list, then print its children, and once all children (and their children) have printed, move on to the next item in the list.

回复收藏 0 原文