ChallengeRecent Comments with Future Posts

time to read 3 min | 575 words

We were asked to implement comments RSS for this blog, and many people asked about the recent comments widget. That turned out to be quite a bit more complicated than it appeared on first try, and I thought it would make a great challenge.

On the face of it, it looks like a drop dead simple feature, right? Show me the last 5 comments in the blog.

The problem with that is that it ignores something that is very important to me, the notion of future posts. One of the major advantages of RaccoonBlog is that I am able to post stuff that would go on the queue (for example, this post would be scheduled for about a month from the date of writing it), but still share that post with other people. Moreover, those other people can also comment on the post. To make things interesting, it is quite common for me to re-schedule posts, moving them from one date to another.

Given that complication, let us try to define how we want the Recent Comments feature to behave with regards to future posts. The logic is fairly simple:

  • Until the post is public, do not show the post comments.
  • If a post had comments on it while it was a future post, when it becomes public, the comments that were already posted there, should also be included.

The last requirement is a bit tricky. Allow me to explain. It would be easier to understand with an example, which luckily I have:

image_thumb[2]

As you can see, this is a post that was created on the 1st of July, but was published on the 12th. Mike and me have commented on the post shortly after it was published (while it was still hidden from the general public). Then, after it was published, grega_g and Jonty have commented on that.

Now, let us assume that we query at 12 Jul, 08:55 AM, we will not get any comments from this post, but on 12 Jul, 09:01 AM, we should get both comments from this post. To make things more interesting, those should come after comments that were posted (chronologically) after them. Confusing, isn’t it? Again, let us go with a visual aid for explaining things.

In other words, let us say that we also have this as well:

image

Here is what we should see in the Recent Comments:

12 Jul, 2011 – 08:55 AM 12 Jul, 2011 – 09:05 AM
  1. 07/07/2011 07:42 PM – jdn
  2. 07/08/2011 07:34 PM – Matt Warren
  1. 07/03/2011 05:26 PM – Ayende Rahien
  2. 07/03/2011 05:07 PM - Mike Minutillo
  3. 07/07/2011 07:42 PM – jdn
  4. 07/08/2011 07:34 PM – Matt Warren

Note that the 1st and 2snd location on 9:05 are should sort after 3rd and 4th, but are sorted before them, because of the post publish date, which we also take into account.

Given all of that, and regardless of the actual technology that you use, how would you implement this feature?

More posts in "Challenge" series:

  1. (06 May 2022) Spot the optimization–solution
  2. (05 May 2022) Spot the optimization
  3. (06 Apr 2022) Why is this code broken?
  4. (16 Dec 2021) Find the slow down–answer
  5. (15 Dec 2021) Find the slow down
  6. (03 Nov 2021) The code review bug that gives me nightmares–The fix
  7. (02 Nov 2021) The code review bug that gives me nightmares–the issue
  8. (01 Nov 2021) The code review bug that gives me nightmares
  9. (16 Jun 2021) Detecting livelihood in a distributed cluster
  10. (21 Apr 2020) Generate matching shard id–answer
  11. (20 Apr 2020) Generate matching shard id
  12. (02 Jan 2020) Spot the bug in the stream
  13. (28 Sep 2018) The loop that leaks–Answer
  14. (27 Sep 2018) The loop that leaks
  15. (03 Apr 2018) The invisible concurrency bug–Answer
  16. (02 Apr 2018) The invisible concurrency bug
  17. (31 Jan 2018) Find the bug in the fix–answer
  18. (30 Jan 2018) Find the bug in the fix
  19. (19 Jan 2017) What does this code do?
  20. (26 Jul 2016) The race condition in the TCP stack, answer
  21. (25 Jul 2016) The race condition in the TCP stack
  22. (28 Apr 2015) What is the meaning of this change?
  23. (26 Sep 2013) Spot the bug
  24. (27 May 2013) The problem of locking down tasks…
  25. (17 Oct 2011) Minimum number of round trips
  26. (23 Aug 2011) Recent Comments with Future Posts
  27. (02 Aug 2011) Modifying execution approaches
  28. (29 Apr 2011) Stop the leaks
  29. (23 Dec 2010) This code should never hit production
  30. (17 Dec 2010) Your own ThreadLocal
  31. (03 Dec 2010) Querying relative information with RavenDB
  32. (29 Jun 2010) Find the bug
  33. (23 Jun 2010) Dynamically dynamic
  34. (28 Apr 2010) What killed the application?
  35. (19 Mar 2010) What does this code do?
  36. (04 Mar 2010) Robust enumeration over external code
  37. (16 Feb 2010) Premature optimization, and all of that…
  38. (12 Feb 2010) Efficient querying
  39. (10 Feb 2010) Find the resource leak
  40. (21 Oct 2009) Can you spot the bug?
  41. (18 Oct 2009) Why is this wrong?
  42. (17 Oct 2009) Write the check in comment
  43. (15 Sep 2009) NH Prof Exporting Reports
  44. (02 Sep 2009) The lazy loaded inheritance many to one association OR/M conundrum
  45. (01 Sep 2009) Why isn’t select broken?
  46. (06 Aug 2009) Find the bug fixes
  47. (26 May 2009) Find the bug
  48. (14 May 2009) multi threaded test failure
  49. (11 May 2009) The regex that doesn’t match
  50. (24 Mar 2009) probability based selection
  51. (13 Mar 2009) C# Rewriting
  52. (18 Feb 2009) write a self extracting program
  53. (04 Sep 2008) Don't stop with the first DSL abstraction
  54. (02 Aug 2008) What is the problem?
  55. (28 Jul 2008) What does this code do?
  56. (26 Jul 2008) Find the bug fix
  57. (05 Jul 2008) Find the deadlock
  58. (03 Jul 2008) Find the bug
  59. (02 Jul 2008) What is wrong with this code
  60. (05 Jun 2008) why did the tests fail?
  61. (27 May 2008) Striving for better syntax
  62. (13 Apr 2008) calling generics without the generic type
  63. (12 Apr 2008) The directory tree
  64. (24 Mar 2008) Find the version
  65. (21 Jan 2008) Strongly typing weakly typed code
  66. (28 Jun 2007) Windsor Null Object Dependency Facility