search

marat-rkh / ChromeHistoryExt

0 stars 0 forks source link

Design tree data structures with folding algorithms #2

Open Temp1ar opened 10 years ago

Temp1ar commented 10 years ago

Folding should be flexible. Fold by chain length, fold to leafs, fold by domain, fold by predicate e.g. ((currentNode.time - parent.time) < 30 seconds)

Answer these questions:

  1. What information can we get from history API?
  2. What information should contain tree node?
  3. What information do we need to perform foldings?
  4. How search will be implemented?

Using OOP draw diagrams for data structures and algoritms (without sticking to concrete programming language) and communications between them. Think about Input and output data for each class.

So, we have two subtasks:

  1. Draw interfaces of tree data structures/storage and API communication.
  2. Describe folding/search algorithms, interfaces and classes. Don't forget to talk to each other :)
marat-rkh commented 10 years ago

I choose the 2nd subtask (we have discussed it with Alex)