fix typos (#22715)
This commit is contained in:
parent
f86cd5408b
commit
e6f60d2add
|
@ -224,7 +224,7 @@ describe('CSSPropertyOperations', () => {
|
|||
ReactDOM.render(<Comp />, root);
|
||||
});
|
||||
|
||||
it('should warn about style containing a Infinity value', () => {
|
||||
it('should warn about style containing an Infinity value', () => {
|
||||
class Comp extends React.Component {
|
||||
static displayName = 'Comp';
|
||||
|
||||
|
|
|
@ -884,7 +884,7 @@ function completeWork(
|
|||
// Schedule an effect to clear this container at the start of the next commit.
|
||||
// This handles the case of React rendering into a container with previous children.
|
||||
// It's also safe to do for updates too, because current.child would only be null
|
||||
// if the previous render was null (so the the container would already be empty).
|
||||
// if the previous render was null (so the container would already be empty).
|
||||
workInProgress.flags |= Snapshot;
|
||||
}
|
||||
}
|
||||
|
|
|
@ -884,7 +884,7 @@ function completeWork(
|
|||
// Schedule an effect to clear this container at the start of the next commit.
|
||||
// This handles the case of React rendering into a container with previous children.
|
||||
// It's also safe to do for updates too, because current.child would only be null
|
||||
// if the previous render was null (so the the container would already be empty).
|
||||
// if the previous render was null (so the container would already be empty).
|
||||
workInProgress.flags |= Snapshot;
|
||||
}
|
||||
}
|
||||
|
|
|
@ -50,7 +50,7 @@
|
|||
// new level with a single slot. You can think of this as a fork with only one
|
||||
// prong, or an array of children with length 1.
|
||||
//
|
||||
// It's possible for the the size of the sequence to exceed 32 bits, the max
|
||||
// It's possible for the size of the sequence to exceed 32 bits, the max
|
||||
// size for bitwise operations. When this happens, we make more room by
|
||||
// converting the right part of the id to a string and storing it in an overflow
|
||||
// variable. We use a base 32 string representation, because 32 is the largest
|
||||
|
|
|
@ -50,7 +50,7 @@
|
|||
// new level with a single slot. You can think of this as a fork with only one
|
||||
// prong, or an array of children with length 1.
|
||||
//
|
||||
// It's possible for the the size of the sequence to exceed 32 bits, the max
|
||||
// It's possible for the size of the sequence to exceed 32 bits, the max
|
||||
// size for bitwise operations. When this happens, we make more room by
|
||||
// converting the right part of the id to a string and storing it in an overflow
|
||||
// variable. We use a base 32 string representation, because 32 is the largest
|
||||
|
|
|
@ -1025,7 +1025,7 @@ function finishConcurrentRender(root, exitStatus, lanes) {
|
|||
|
||||
function isRenderConsistentWithExternalStores(finishedWork: Fiber): boolean {
|
||||
// Search the rendered tree for external store reads, and check whether the
|
||||
// stores were mutated in a concurrent event. Intentionally using a iterative
|
||||
// stores were mutated in a concurrent event. Intentionally using an iterative
|
||||
// loop instead of recursion so we can exit early.
|
||||
let node: Fiber = finishedWork;
|
||||
while (true) {
|
||||
|
|
|
@ -1025,7 +1025,7 @@ function finishConcurrentRender(root, exitStatus, lanes) {
|
|||
|
||||
function isRenderConsistentWithExternalStores(finishedWork: Fiber): boolean {
|
||||
// Search the rendered tree for external store reads, and check whether the
|
||||
// stores were mutated in a concurrent event. Intentionally using a iterative
|
||||
// stores were mutated in a concurrent event. Intentionally using an iterative
|
||||
// loop instead of recursion so we can exit early.
|
||||
let node: Fiber = finishedWork;
|
||||
while (true) {
|
||||
|
|
|
@ -50,7 +50,7 @@
|
|||
// new level with a single slot. You can think of this as a fork with only one
|
||||
// prong, or an array of children with length 1.
|
||||
//
|
||||
// It's possible for the the size of the sequence to exceed 32 bits, the max
|
||||
// It's possible for the size of the sequence to exceed 32 bits, the max
|
||||
// size for bitwise operations. When this happens, we make more room by
|
||||
// converting the right part of the id to a string and storing it in an overflow
|
||||
// variable. We use a base 32 string representation, because 32 is the largest
|
||||
|
|
|
@ -21,7 +21,7 @@ A typical release cycle goes like this:
|
|||
1. When a commit is pushed to the React repo, [Circle CI](https://circleci.com/gh/facebook/react/) will build all release bundles and run unit tests against both the source code and the built bundles.
|
||||
2. Each weekday, an automated CI cron job publishes prereleases to the `next` and `experimental` channels, from tip of the main branch.
|
||||
1. You can also [trigger an automated prerelease via the command line](#trigger-an-automated-prerelease), instead of waiting until the next time the cron job runs.
|
||||
2. For advanced cases, you can [**manually prepare and publish to the `next` channel**](#publishing-release) using the [`prepare-release-from-ci`](#prepare-release-from-ci) and [`publish`](#publish) scripts; or to the [**`experimental` channel**](#publishing-an-experimental-release) using the the same scripts (but different build artifacts).
|
||||
2. For advanced cases, you can [**manually prepare and publish to the `next` channel**](#publishing-release) using the [`prepare-release-from-ci`](#prepare-release-from-ci) and [`publish`](#publish) scripts; or to the [**`experimental` channel**](#publishing-an-experimental-release) using the same scripts (but different build artifacts).
|
||||
3. Finally, a "next" release can be [**promoted to stable**](#publishing-a-stable-release)<sup>1</sup> using the [`prepare-release-from-npm`](#prepare-release-from-npm) and [`publish`](#publish) scripts. (This process is always manual.)
|
||||
|
||||
The high level process of creating releases is [documented below](#process). Individual scripts are documented as well:
|
||||
|
|
Loading…
Reference in New Issue