From dbda3e975622c9ba8133a1010c08d9df8cc9d290 Mon Sep 17 00:00:00 2001 From: Thomas Hintz Date: Tue, 6 Oct 2020 08:23:04 -0700 Subject: [PATCH] Fixing notes. --- foundations-high-performance-react.org | 8 ++++---- manuscript/reconciliation.markua | 2 +- manuscript/render.markua | 2 +- 3 files changed, 6 insertions(+), 6 deletions(-) diff --git a/foundations-high-performance-react.org b/foundations-high-performance-react.org index 2efb4ac..37cb160 100644 --- a/foundations-high-performance-react.org +++ b/foundations-high-performance-react.org @@ -362,10 +362,10 @@ the pseudocode until we have our own fully functional ~render~ method using the same general algorithm React uses. In our first pass we will focus on the initial render and ignore reconciliation. -#+BEGIN_NOTE +#+begin_note Reconciliation is basically React's "diffing" algorithm. We will be exploring it after we work out the initial render. -#+END_NOTE +#+end_note #+BEGIN_SRC javascript function render(element, container) { @@ -445,11 +445,11 @@ and based on two major components: In this section we will focus on the first part: differing types. -#+BEGIN_NOTE +#+begin_note In this book we won't be covering keys in depth but you will see why it's very important to follow the guidance from React's documentation that keys be: stable, predictable, and unique. -#+END_NOTE +#+end_note The approach we will take here is to integrate the heuristics that React uses into our ~render~ method. Our implementation will be very diff --git a/manuscript/reconciliation.markua b/manuscript/reconciliation.markua index 0a7c8d3..da2f9ce 100644 --- a/manuscript/reconciliation.markua +++ b/manuscript/reconciliation.markua @@ -15,7 +15,7 @@ According to the [React documentation](https://reactjs.org/docs/reconciliation.h In this section we will focus on the first part: differing types. -> In this book we won't be covering keys in depth but you will see why it's very important to follow the guidance from React's documentation that keys be: stable, predictable, and unique. +I> In this book we won't be covering keys in depth but you will see why it's very important to follow the guidance from React's documentation that keys be: stable, predictable, and unique. The approach we will take here is to integrate the heuristics that React uses into our `render` method. Our implementation will be very similar to how React itself does it and we will discuss React's actual implementation later when we talk about Fibers. diff --git a/manuscript/render.markua b/manuscript/render.markua index be3f8a4..b01e83f 100644 --- a/manuscript/render.markua +++ b/manuscript/render.markua @@ -24,7 +24,7 @@ Our DOM element is created first. Then we set the properties, render children el Now that we have an idea of what to build we will work on expanding the pseudocode until we have our own fully functional `render` method using the same general algorithm React uses. In our first pass we will focus on the initial render and ignore reconciliation. -> Reconciliation is basically React's "diffing" algorithm. We will be exploring it after we work out the initial render. +I> Reconciliation is basically React's "diffing" algorithm. We will be exploring it after we work out the initial render. {format: "javascript"} ```