Compare commits

..

2 commits

Author SHA1 Message Date
Bruno BELANYI 39944ed35d posts: fix typos
All checks were successful
ci/woodpecker/push/deploy/2 Pipeline was successful
2024-11-08 16:06:59 +00:00
Bruno BELANYI af4e13d6e8 treewide: fix 'serie' -> 'series' typo 2024-11-08 16:05:24 +00:00
6 changed files with 9 additions and 9 deletions

View file

@ -76,7 +76,7 @@ services:
taxonomies:
category: "categories"
tag: "tags"
serie: "series"
series: "series"
markup:
goldmark:

View file

@ -134,7 +134,7 @@ branch.
#### Fixup, a practical example
A specific kind of squashing which I use frequently is the notion of `fixup`s.
Say you've commited a change (*A*), and later on notice that it is missing
Say you've committed a change (*A*), and later on notice that it is missing
a part of the changeset. You can decide to commit that missing part (*A-bis*)
and annotate it to mean that it is linked to *A*.
@ -184,7 +184,7 @@ After applying the rebase, you find yourself with the complete change inside
This is especially useful when you want to apply suggestion on a merge request
after it was reviewed. You can keep a clean history without those pesky `Apply
suggestion ...` commmits being part of your history.
suggestion ...` commits being part of your history.
### Lost commits and the reflog

View file

@ -261,7 +261,7 @@ this new `SpaceStation` variant at every point you `visit` the `SpaceObject`s.
## The Expression Problem
One issue we have not been able to move past in these exemples is the
One issue we have not been able to move past in these examples is the
[Expression Problem][expression-problem]. In two words, this means that we can't
add a new data type (e.g: `SpaceStation`), or a new operation (e.g: `land_on`)
to our current code without re-compiling it.

View file

@ -133,7 +133,7 @@ and moving the start of the gap further right.
```python
def insert(self, val: str) -> None:
# Ensure we have enouh space to insert the whole string
# Ensure we have enough space to insert the whole string
if len(val) > self.gap_length:
self.grow(max(self.capacity * 2, self.string_length + len(val)))
# Fill the gap with the given string
@ -163,7 +163,7 @@ def delete(self, dist: int = 1) -> None:
### Moving the cursor
Moving the cursor along the buffer will shift letters from one side of the gap
to the other, moving them accross from prefix to suffix and back.
to the other, moving them across from prefix to suffix and back.
I find Python's list slicing not quite as elegant to read as a `memmove`, though
it does make for a very small and efficient implementation.

View file

@ -1,5 +1,5 @@
serie:
other: "serie"
series:
other: "series"
Series:
other: "Series"

View file

@ -1,4 +1,4 @@
serie:
series:
other: "série"
Series: