Threaded discussion is ultimately too complex to survive on the public Internet?

@Sailsman63,

You shouldn’t need to, because a new post notification should direct the user to it, like Threaded discussion is ultimately too complex to survive on the public Internet? - #62 by Sailsman63 does to your comment.

As an example, every time I receive a message via e-mail about a new notification on Reddit, I merely click the button to take me to the comment, rather than trawl through thousands of comments manually.

Would you elaborate on this?

Do you mean that because the sorting is necessarily applied to each hierarchy individually, it produces problems like a file manager can cause:

  1. You’ve a list of files, and want to sort them by modification date to find some old logs. However, because these logs are in a directory of multiple file types (some irrelevant) they’re grouped by type (which is alphabetical) meaning that although they’re generally chronological, the chance for something new to be at the bottom is non-0.

  2. You’ve a list of music. You want to remove some songs you don’t like, but you can’t order them by rating, because too many have identical ratings. You’ve grouped them by rating consequently, and have ordered them by access date, so that you use when you last accessed them as a determiner, too. However, this means that some seriously old songs are missed even if you rated them highly when you were young.

I understand that, but I can’t think of a solution. Discourse implements the sole alternative that I’ve considered, but (of course) I consider it inferior due Threaded discussion is ultimately too complex to survive on the public Internet? - #61 by vel.

@Sailsman63,

你不需要这样做,因为新帖子的通知应该会引导用户找到它,就像 Threaded discussion is ultimately too complex to survive on the public Internet? - #62 by Sailsman63 指向你的评论一样。

举个例子,每次我在Reddit上收到关于新通知的电子邮件时,我只需点击按钮即可转到该评论,而不是手动浏览成千上万条评论。

你能详细说明一下吗?

你的意思是,因为排序必然应用于每个层级,所以会产生文件管理器可能导致的问题:

  1. 你有一系列文件,想按修改日期排序以查找一些旧日志。但是,由于这些日志位于一个包含多种文件类型(有些不相关)的目录中,它们会按类型(按字母顺序)分组,这意味着虽然它们总体上是按时间顺序排列的,但新文件出现在底部的几率并非为0。

  2. 你有一系列音乐。你想删除一些你不喜欢的歌曲,但你无法按评分排序,因为有太多歌曲的评分相同。因此,你按评分将它们分组,并按访问日期排序,以便使用你上次访问它们的时间作为决定因素。然而,这意味着即使你年轻时给它们打了高分,一些非常老的歌曲也会被遗漏。

我明白这一点,但我无法想到一个解决方案。Discourse实现了我考虑过的唯一替代方案,但(当然)我认为它不如 Threaded discussion is ultimately too complex to survive on the public Internet? - #61 by vel

2 个赞