From b62f2257eb85f84e24b9de8f00e5dfd7c27a2ce1 Mon Sep 17 00:00:00 2001 From: Andre Z Sanchez Date: Mon, 11 Aug 2014 22:57:33 -0400 Subject: [PATCH] Fix typo --- docs/ref-08-reconciliation.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/ref-08-reconciliation.md b/docs/ref-08-reconciliation.md index fbd342ef0..56c943687 100644 --- a/docs/ref-08-reconciliation.md +++ b/docs/ref-08-reconciliation.md @@ -129,5 +129,5 @@ Because we rely on two heuristics, if the assumptions behind them are not met, p 1. The algorithm will not try to match sub-trees of different components classes. If you see yourself alternating between two components classes with very similar output, you may want to make it the same class. In practice, we haven't found this to be an issue. -2. If you don't provide stable keys (by using Math.random() for example), all the sub-trees are going to be re-rendered every single time. By giving the users the choice to chose the key, they have the ability to shoot themselves in the foot. +2. If you don't provide stable keys (by using Math.random() for example), all the sub-trees are going to be re-rendered every single time. By giving the users the choice to choose the key, they have the ability to shoot themselves in the foot.