Skip to content

Commit

Permalink
Fix misspells in comments
Browse files Browse the repository at this point in the history
  • Loading branch information
alconaut committed Nov 14, 2016
1 parent 638e0c7 commit 0f7315d
Show file tree
Hide file tree
Showing 3 changed files with 5 additions and 5 deletions.
2 changes: 1 addition & 1 deletion controllers/requests/requests.go
Original file line number Diff line number Diff line change
Expand Up @@ -39,7 +39,7 @@ func (c *Requests) Before() http.Handler {
err = c.Request.ParseForm()
}

// Make sure the parsing was successfull.
// Make sure the parsing was successful.
// Otherwise, return a "bad request" error.
if err != nil {
return http.HandlerFunc(func(w http.ResponseWriter, r *http.Request) {
Expand Down
2 changes: 1 addition & 1 deletion controllers/templates/templates.go
Original file line number Diff line number Diff line change
Expand Up @@ -81,7 +81,7 @@ func (c *Templates) RenderTemplate(templatePath string) http.Handler {

// Render is an equivalent of the following:
// RenderTemplate(CurrentController + "/" + CurrentAction + ".html")
// The default path pattern may be overriden by adding the following
// The default path pattern may be overridden by adding the following
// line to your configuration file:
// [templates]
// default.pattern = %s/%s.tpl
Expand Down
6 changes: 3 additions & 3 deletions routers/denco/denco.go
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
// Package denco is a wrapper around naoina/denco router.
// It uses request.Form to store params instead of a separate Params
// argument. So, it requires a bit more memory and it is little slower.
// However, the downsides are an acceptable trade off for compatability
// However, the downsides are an acceptable trade off for compatibility
// with the standard library.
//
// A sample of its usage is below:
Expand Down Expand Up @@ -55,8 +55,8 @@ type Route struct {

// Dict is a dictionary structure that is used by routing package instead of map
// for small sets of data.
// On average efficency of getting an element from map is O(c + 1).
// At the same time efficency of iterating over a slice is O(n).
// On average efficiency of getting an element from map is O(c + 1).
// At the same time efficiency of iterating over a slice is O(n).
// And when n is small, O(n) < O(c + 1). That's why we are using slice and simple loop
// rather than a map.
type Dict struct {
Expand Down

0 comments on commit 0f7315d

Please sign in to comment.