You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+3-3Lines changed: 3 additions & 3 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -23,13 +23,13 @@ Sometimes is not easy to achive high cache hit ratio. Sometimes you have to _thi
23
23
24
24
**I don't want to think how to use memoization, I want to use memoization!**
25
25
26
-
Memoize-state is built to memoize more complex situations, even the ones which are faster to recomoute, than to deside that recalculation is not needed.
26
+
Memoize-state is built to memoize more complex situations, even the ones which are faster to recompute, than to deside that recalculation is not needed.
27
27
Just because one cheap computation can cause a redraw/reflow/recomputation cascade for a whole application.
@@ -40,7 +40,7 @@ All _ordinal_ memoization libraries will drop cache each time, as long `state` i
40
40
More of it - they will return a unique object each time, as long the function is returning a new object each time.
41
41
But not today!
42
42
43
-
Memoize-state memoizes tracks used __state__ parts, using the same __magic__, as you can found in __MobX__ or __immer__.
43
+
Memoize-state memoizes tracks used __state__ parts, using the same __magic__, as you can find in __MobX__ or __immer__.
44
44
It will know, that it should react only on some `state.value1` change, but not `value2`. _Perfect_.
45
45
46
46
Now you able just to write functions AS YOU WANT. Memoize-state will detect all _really_ used arguments, variables and keys, and then - react only to the _right_ changes.
0 commit comments