We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see ourdocumentation.
There was an error while loading.Please reload this page.
2 parentscbf97c0 +1e6a304 commitd5d0720Copy full SHA for d5d0720
README.md
@@ -1,6 +1,6 @@
1
#Observable state tree
2
3
-##Problem statement
+###Problem statement
4
5
Create an observable state tree.
6
@@ -17,9 +17,9 @@ Examples of the above requirements are given below.
17
18
Performance requirements:
19
20
-- Modifying the tree shouldhappen in O(1) time
+- Modifying thestatetree shouldnot evaluate all listeners. It should only evalutate the subset of listeners which are relevant define above.
21
22
-##Suggested API
+###Suggested API
23
24
```js
25
consttree=createTree({ a: { b: { c:1, d:1 } } })
@@ -63,7 +63,7 @@ tree.a = { e: 1 }
63
// b, c and d have been deleted so we just notify with undefined
64
```
65
66
-##Implementation Sketch
+###Implementation Sketch
67
68
Use proxies for dot notation.
69
Data structure consists of two trees: