mirror of
https://github.com/gohugoio/hugo.git
synced 2024-11-21 20:46:30 -05:00
hugolib: Correct repeated spelling errors in documentation
This commit is contained in:
parent
a89fb86cdf
commit
962443ade8
1 changed files with 10 additions and 10 deletions
|
@ -109,7 +109,7 @@ func (p Pages) Limit(n int) Pages {
|
||||||
|
|
||||||
// ByWeight sorts the Pages by weight and returns a copy.
|
// ByWeight sorts the Pages by weight and returns a copy.
|
||||||
//
|
//
|
||||||
// Adjacent invocactions on the same receiver will return a cached result.
|
// Adjacent invocations on the same receiver will return a cached result.
|
||||||
//
|
//
|
||||||
// This may safely be executed in parallel.
|
// This may safely be executed in parallel.
|
||||||
func (p Pages) ByWeight() Pages {
|
func (p Pages) ByWeight() Pages {
|
||||||
|
@ -120,7 +120,7 @@ func (p Pages) ByWeight() Pages {
|
||||||
|
|
||||||
// ByTitle sorts the Pages by title and returns a copy.
|
// ByTitle sorts the Pages by title and returns a copy.
|
||||||
//
|
//
|
||||||
// Adjacent invocactions on the same receiver will return a cached result.
|
// Adjacent invocations on the same receiver will return a cached result.
|
||||||
//
|
//
|
||||||
// This may safely be executed in parallel.
|
// This may safely be executed in parallel.
|
||||||
func (p Pages) ByTitle() Pages {
|
func (p Pages) ByTitle() Pages {
|
||||||
|
@ -137,7 +137,7 @@ func (p Pages) ByTitle() Pages {
|
||||||
|
|
||||||
// ByLinkTitle sorts the Pages by link title and returns a copy.
|
// ByLinkTitle sorts the Pages by link title and returns a copy.
|
||||||
//
|
//
|
||||||
// Adjacent invocactions on the same receiver will return a cached result.
|
// Adjacent invocations on the same receiver will return a cached result.
|
||||||
//
|
//
|
||||||
// This may safely be executed in parallel.
|
// This may safely be executed in parallel.
|
||||||
func (p Pages) ByLinkTitle() Pages {
|
func (p Pages) ByLinkTitle() Pages {
|
||||||
|
@ -155,7 +155,7 @@ func (p Pages) ByLinkTitle() Pages {
|
||||||
|
|
||||||
// ByDate sorts the Pages by date and returns a copy.
|
// ByDate sorts the Pages by date and returns a copy.
|
||||||
//
|
//
|
||||||
// Adjacent invocactions on the same receiver will return a cached result.
|
// Adjacent invocations on the same receiver will return a cached result.
|
||||||
//
|
//
|
||||||
// This may safely be executed in parallel.
|
// This may safely be executed in parallel.
|
||||||
func (p Pages) ByDate() Pages {
|
func (p Pages) ByDate() Pages {
|
||||||
|
@ -173,7 +173,7 @@ func (p Pages) ByDate() Pages {
|
||||||
|
|
||||||
// ByPublishDate sorts the Pages by publish date and returns a copy.
|
// ByPublishDate sorts the Pages by publish date and returns a copy.
|
||||||
//
|
//
|
||||||
// Adjacent invocactions on the same receiver will return a cached result.
|
// Adjacent invocations on the same receiver will return a cached result.
|
||||||
//
|
//
|
||||||
// This may safely be executed in parallel.
|
// This may safely be executed in parallel.
|
||||||
func (p Pages) ByPublishDate() Pages {
|
func (p Pages) ByPublishDate() Pages {
|
||||||
|
@ -191,7 +191,7 @@ func (p Pages) ByPublishDate() Pages {
|
||||||
|
|
||||||
// ByExpiryDate sorts the Pages by publish date and returns a copy.
|
// ByExpiryDate sorts the Pages by publish date and returns a copy.
|
||||||
//
|
//
|
||||||
// Adjacent invocactions on the same receiver will return a cached result.
|
// Adjacent invocations on the same receiver will return a cached result.
|
||||||
//
|
//
|
||||||
// This may safely be executed in parallel.
|
// This may safely be executed in parallel.
|
||||||
func (p Pages) ByExpiryDate() Pages {
|
func (p Pages) ByExpiryDate() Pages {
|
||||||
|
@ -209,7 +209,7 @@ func (p Pages) ByExpiryDate() Pages {
|
||||||
|
|
||||||
// ByLastmod sorts the Pages by the last modification date and returns a copy.
|
// ByLastmod sorts the Pages by the last modification date and returns a copy.
|
||||||
//
|
//
|
||||||
// Adjacent invocactions on the same receiver will return a cached result.
|
// Adjacent invocations on the same receiver will return a cached result.
|
||||||
//
|
//
|
||||||
// This may safely be executed in parallel.
|
// This may safely be executed in parallel.
|
||||||
func (p Pages) ByLastmod() Pages {
|
func (p Pages) ByLastmod() Pages {
|
||||||
|
@ -227,7 +227,7 @@ func (p Pages) ByLastmod() Pages {
|
||||||
|
|
||||||
// ByLength sorts the Pages by length and returns a copy.
|
// ByLength sorts the Pages by length and returns a copy.
|
||||||
//
|
//
|
||||||
// Adjacent invocactions on the same receiver will return a cached result.
|
// Adjacent invocations on the same receiver will return a cached result.
|
||||||
//
|
//
|
||||||
// This may safely be executed in parallel.
|
// This may safely be executed in parallel.
|
||||||
func (p Pages) ByLength() Pages {
|
func (p Pages) ByLength() Pages {
|
||||||
|
@ -245,7 +245,7 @@ func (p Pages) ByLength() Pages {
|
||||||
|
|
||||||
// ByLanguage sorts the Pages by the language's Weight.
|
// ByLanguage sorts the Pages by the language's Weight.
|
||||||
//
|
//
|
||||||
// Adjacent invocactions on the same receiver will return a cached result.
|
// Adjacent invocations on the same receiver will return a cached result.
|
||||||
//
|
//
|
||||||
// This may safely be executed in parallel.
|
// This may safely be executed in parallel.
|
||||||
func (p Pages) ByLanguage() Pages {
|
func (p Pages) ByLanguage() Pages {
|
||||||
|
@ -259,7 +259,7 @@ func (p Pages) ByLanguage() Pages {
|
||||||
|
|
||||||
// Reverse reverses the order in Pages and returns a copy.
|
// Reverse reverses the order in Pages and returns a copy.
|
||||||
//
|
//
|
||||||
// Adjacent invocactions on the same receiver will return a cached result.
|
// Adjacent invocations on the same receiver will return a cached result.
|
||||||
//
|
//
|
||||||
// This may safely be executed in parallel.
|
// This may safely be executed in parallel.
|
||||||
func (p Pages) Reverse() Pages {
|
func (p Pages) Reverse() Pages {
|
||||||
|
|
Loading…
Reference in a new issue