Spot.IM is a social networking layer over some of the worlds largest publishers, such as Fox News, TechCrunch, MSN, and more. Our main product is our Conversation Module, which allows people to write messages about articles where the conversation is found.
In conversation, we need a way to represent our Message Stack that you see on the page. We have comments, replies, and replies to replies. Your mission, should you choose to accept it, is to build functionality that will allow us to store a tree of messages, with replies being connected to parents, etc.
We have started you off with a basic build:
- In
node.go, you'll find anodestruct, containing the actual message inside - In
tree.go, you'll find atreestruct, containing the slice of nodes, which should represent the Message Stack - In
tree_test.go, you'll find a few different tests which we will run to ensure that the data structure is correctTestNewTreeis the basic test, which will ensure a small data structureTestNewTreeLargecontains a much bigger sample with more depth
Our product has billions of requests per day, and our scale means we must work in highly concurrent environments. Your bonus mission is to ensure that the data structure that you've created will fit the needs of a highly concurrent environment as well.
- In
concurrent_tree_test.go, you'll find a few different tests which we will run to ensure that the data structure is correctTestNewTreeConcurrentis the basic test, which will ensure a small data structureTestNewTreeLargeConcurrentcontains a much bigger sample with more depth