branch: elpa/treepy
commit a0702bc5b27958b60e4da36f65e63aff86e0a734
Author: Jonas Bernoulli <[email protected]>
Commit: Jonas Bernoulli <[email protected]>
Fix metastasized typo
---
README.md | 6 +++---
treepy.el | 8 ++++----
2 files changed, 7 insertions(+), 7 deletions(-)
diff --git a/README.md b/README.md
index 6ac3804944..75c5b9c55f 100644
--- a/README.md
+++ b/README.md
@@ -137,11 +137,11 @@ For a manual installation, just place `treepy.el` in your
`load-path` and
- `treepy-lefts` loc
- Returns a list of the left sibilings of this LOC.
+ Returns a list of the left siblings of this LOC.
- `treepy-rights` loc
- Returns a list of the right sibilings of this LOC.
+ Returns a list of the right siblings of this LOC.
#### Navigation
@@ -316,7 +316,7 @@ need to bother with if you just wanna use the library.
- `<path alist>` is an alist containing the same keys and values as
`clojure.zip`'s path map. Only difference is that *treepy* uses lists instead
- of vectors to handle the `left` sibilings and `pnodes` parent nodes.
+ of vectors to handle the `left` siblings and `pnodes` parent nodes.
## Prior Art
diff --git a/treepy.el b/treepy.el
index 295bb4d120..e949aac97b 100644
--- a/treepy.el
+++ b/treepy.el
@@ -270,7 +270,7 @@ Reflect any alterations to the tree."
(defun treepy-right (loc)
"Return the loc of the right sibling of the node at this LOC.
-nil if there's no more right sibilings."
+nil if there's no more right siblings."
(treepy--with-loc loc (node context l r)
(let ((r (if (listp r)
r
@@ -302,7 +302,7 @@ If LOC is already the rightmost sibling, return self."
(defun treepy-left (loc)
"Return the loc of the left sibling of the node at this LOC.
-nil if no more left sibilings."
+nil if no more left siblings."
(treepy--with-loc loc (node context l r)
(when (and context l)
(seq-let [cl &rest lnext] l
@@ -337,7 +337,7 @@ If LOC is already the leftmost sibling, return self."
(defun treepy-insert-left (loc item)
"Insert as the left sibling of this LOC'S node the ITEM.
-Return same loc with sibilings updated."
+Return same loc with siblings updated."
(treepy--with-loc loc (node context l)
(if (not context)
(error "Insert at top")
@@ -350,7 +350,7 @@ Return same loc with sibilings updated."
(defun treepy-insert-right (loc item)
"Insert as the right sibling of this LOC's node the ITEM.
-Return same loc with sibilings updated."
+Return same loc with siblings updated."
(treepy--with-loc loc (node context r)
(if (not context)
(error "Insert at top")
