Unverified Commit 2ecfdb8b authored by Roman A's avatar Roman A Committed by GitHub

Fix a couple typos (#80080)

parent c8bcde6b
...@@ -153,7 +153,7 @@ module.exports = { ...@@ -153,7 +153,7 @@ module.exports = {
## Advanced Custom Fields PRO (optional, but recommended) ## Advanced Custom Fields PRO (optional, but recommended)
I will recommend building your page content by using the [Flexible Content](https://www.advancedcustomfields.com/resources/flexible-content/) data type in ACF Pro. I will recommend building your page content by using the [Flexible Content](https://www.advancedcustomfields.com/resources/flexible-content/) data type in ACF Pro.
This will make you able to create a "Block Builder" editor experience, but still having everything automatically type generated, and recieving the data in a structured way. This will make you able to create a "Block Builder" editor experience, but still having everything automatically type generated, and receiving the data in a structured way.
The default "Gutenberg" editor returns a lot of HTML, which makes you loose a lot of the advantages of using GraphQL with type generation. The default "Gutenberg" editor returns a lot of HTML, which makes you loose a lot of the advantages of using GraphQL with type generation.
## Redirection setup ## Redirection setup
......
...@@ -16,7 +16,7 @@ type FontOptions = { ...@@ -16,7 +16,7 @@ type FontOptions = {
subsets: string[] subsets: string[]
} }
/** /**
* Validate the data recieved from next-swc next-transform-font on next/font/google calls * Validate the data received from next-swc next-transform-font on next/font/google calls
*/ */
export function validateGoogleFontFunctionCall( export function validateGoogleFontFunctionCall(
functionName: string, functionName: string,
......
...@@ -3,7 +3,7 @@ import type { Declaration } from 'postcss' ...@@ -3,7 +3,7 @@ import type { Declaration } from 'postcss'
import postcss from 'postcss' import postcss from 'postcss'
/** /**
* The next/font postcss plugin recieves the @font-face declarations returned from the next/font loaders. * The next/font postcss plugin receives the @font-face declarations returned from the next/font loaders.
* *
* It hashes the font-family name to make it unguessable, it shouldn't be globally accessible. * It hashes the font-family name to make it unguessable, it shouldn't be globally accessible.
* If it were global, we wouldn't be able to tell which pages are using which fonts when generating preload tags. * If it were global, we wouldn't be able to tell which pages are using which fonts when generating preload tags.
......
...@@ -198,7 +198,7 @@ describe('app dir - basepath', () => { ...@@ -198,7 +198,7 @@ describe('app dir - basepath', () => {
expect(firstResponse.status()).toEqual(303) expect(firstResponse.status()).toEqual(303)
// Since this is an external request to a resource outside of NextJS // Since this is an external request to a resource outside of NextJS
// we expect to see a seperate request resolving the external URL. // we expect to see a separate request resolving the external URL.
expect(secondResponse.status()).toEqual(200) expect(secondResponse.status()).toEqual(200)
}) })
}) })
...@@ -5,7 +5,7 @@ graph for your turbo tasks project. ...@@ -5,7 +5,7 @@ graph for your turbo tasks project.
## How it works ## How it works
- find all occurences of #[turbo_tasks::function] across all the packages you - find all occurrences of #[turbo_tasks::function] across all the packages you
want to query want to query
- for each of the tasks we find, query rust analyzer to see which tasks call - for each of the tasks we find, query rust analyzer to see which tasks call
them them
......
...@@ -123,7 +123,7 @@ where ...@@ -123,7 +123,7 @@ where
.find_or_find_insert_slot(h1, eq1, hash_entry) .find_or_find_insert_slot(h1, eq1, hash_entry)
.unwrap_or_else(|slot| unsafe { .unwrap_or_else(|slot| unsafe {
// SAFETY: This slot was previously returned by `find_or_find_insert_slot`, and no // SAFETY: This slot was previously returned by `find_or_find_insert_slot`, and no
// mutation of the table has occured since that call. // mutation of the table has occurred since that call.
guard.insert_in_slot(h1, slot, (key1.clone(), SharedValue::new(insert_with()))) guard.insert_in_slot(h1, slot, (key1.clone(), SharedValue::new(insert_with())))
}); });
......
...@@ -491,7 +491,7 @@ impl<'a> Parser<'a> { ...@@ -491,7 +491,7 @@ impl<'a> Parser<'a> {
}; };
// we don't need to check because we already checked 'have_tokens' above. // we don't need to check because we already checked 'have_tokens' above.
match self.pop_token_unchecked() { match self.pop_token_unchecked() {
// This is for `/**/**` which is kind of silly, just skip the second occurence // This is for `/**/**` which is kind of silly, just skip the second occurrence
Token::RecursivePrefix => { Token::RecursivePrefix => {
self.push_token(Token::RecursivePrefix); self.push_token(Token::RecursivePrefix);
} }
......
...@@ -231,7 +231,7 @@ enum MapEntry { ...@@ -231,7 +231,7 @@ enum MapEntry {
#[derive(Default)] #[derive(Default)]
pub struct InvalidationReasonSet { pub struct InvalidationReasonSet {
next_unique_tag: usize, next_unique_tag: usize,
// We track typed and untyped entries in the same map to keep the occurence order of entries. // We track typed and untyped entries in the same map to keep the occurrence order of entries.
map: FxIndexMap<MapKey, MapEntry>, map: FxIndexMap<MapKey, MapEntry>,
} }
......
...@@ -607,7 +607,7 @@ pub async fn compute_module_batches( ...@@ -607,7 +607,7 @@ pub async fn compute_module_batches(
extracted_shared_items += selected_items; extracted_shared_items += selected_items;
// Check if a batch is completely selected. In that case we can replace all other // Check if a batch is completely selected. In that case we can replace all other
// occurences with a reference to that batch // occurrences with a reference to that batch
let exact_match = batches_with_item_index let exact_match = batches_with_item_index
.iter() .iter()
.find(|&&(batch_idx, item_idx)| { .find(|&&(batch_idx, item_idx)| {
...@@ -615,7 +615,7 @@ pub async fn compute_module_batches( ...@@ -615,7 +615,7 @@ pub async fn compute_module_batches(
&& pre_batches.batches[batch_idx].items.len() == selected_items && pre_batches.batches[batch_idx].items.len() == selected_items
}); });
if let Some(&(exact_match, _)) = exact_match { if let Some(&(exact_match, _)) = exact_match {
// Replace all other occurences with a reference to the exact match // Replace all other occurrences with a reference to the exact match
for &(batch_index, item_start) in batches_with_item_index.iter() { for &(batch_index, item_start) in batches_with_item_index.iter() {
if batch_index != exact_match { if batch_index != exact_match {
pre_batches.batches[batch_index].items.splice( pre_batches.batches[batch_index].items.splice(
...@@ -633,7 +633,7 @@ pub async fn compute_module_batches( ...@@ -633,7 +633,7 @@ pub async fn compute_module_batches(
} }
} }
} else { } else {
// Create a new batch of the shared part and replace all occurences with a // Create a new batch of the shared part and replace all occurrences with a
// reference to that batch // reference to that batch
let first_batch_index = batches_with_item_index[0].0; let first_batch_index = batches_with_item_index[0].0;
let first_batch_item_index = batches_with_item_index[0].1; let first_batch_item_index = batches_with_item_index[0].1;
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment