Compare prefix against dashboards' slugs instead of their names

src/config/config.go

@@ -2,10 +2,10 @@ package config
 
 import (
 	"io/ioutil"
-	"strings"
 
 	"gopkg.in/yaml.v2"
 
+	"github.com/gosimple/slug"
 	"github.com/sirupsen/logrus"
 )
 
@@ -65,6 +65,8 @@ func Load(filename string) (cfg *Config, err error) {
 
 	cfg = new(Config)
 	err = yaml.Unmarshal(rawCfg, cfg)
-	cfg.Grafana.IgnorePrefix = strings.ToLower(cfg.Grafana.IgnorePrefix)
+	// Since we always compare the prefix against a slug, we need to make sure
+	// the prefix is a slug itself.
+	cfg.Grafana.IgnorePrefix = slug.Make(cfg.Grafana.IgnorePrefix)
 	return
 }

src/grafana/helpers/helpers.go

@@ -0,0 +1,22 @@
+package helpers
+
+import (
+	"encoding/json"
+
+	"github.com/gosimple/slug"
+)
+
+// GetDashboardSlug reads the JSON description of a dashboard and computes a
+// slug from the dashboard's title.
+// Returns an error if there was an issue parsing the dashboard JSON description.
+func GetDashboardSlug(dbJSONDescription []byte) (dbSlug string, err error) {
+	// Parse the file's content to find the dashboard's title
+	var dashboardTitle struct {
+		Title string `json:"title"`
+	}
+
+	err = json.Unmarshal(dbJSONDescription, &dashboardTitle)
+	// Compute the slug
+	dbSlug = slug.Make(dashboardTitle.Title)
+	return
+}

src/puller/puller.go

@@ -66,8 +66,7 @@ func PullGrafanaAndCommit(client *grafana.Client, cfg *config.Config) error {
 		}
 
 		if len(cfg.Grafana.IgnorePrefix) > 0 {
-			lowerCasedName := strings.ToLower(dashboard.Name)
-			if strings.HasPrefix(lowerCasedName, cfg.Grafana.IgnorePrefix) {
+			if strings.HasPrefix(dashboard.Slug, cfg.Grafana.IgnorePrefix) {
 				logrus.WithFields(logrus.Fields{
 					"uri":    uri,
 					"name":   dashboard.Name,

src/pusher/webhook.go

@@ -1,12 +1,12 @@
 package main
 
 import (
-	"encoding/json"
 	"io/ioutil"
 	"strings"
 
 	"config"
 	"git"
+	"grafana/helpers"
 	puller "puller"
 
 	"github.com/sirupsen/logrus"
@@ -183,18 +183,14 @@ func isIgnored(filename string) (bool, error) {
 		return false, err
 	}
 
-	// Parse the file's content to find the dashboard's name
-	var dashboardName struct {
-		Name string `json:"title"`
-	}
-	if err = json.Unmarshal(fileContent, &dashboardName); err != nil {
+	// Parse the file's content to extract its slug
+	slug, err := helpers.GetDashboardSlug(fileContent)
+	if err != nil {
 		return false, err
 	}
 
-	// Compare the lower case dashboar name to the prefix (which has already
-	// been lower cased when loading the configuration file)
-	lowerCaseName := strings.ToLower(dashboardName.Name)
-	if strings.HasPrefix(lowerCaseName, cfg.Grafana.IgnorePrefix) {
+	// Compare the slug against the prefix
+	if strings.HasPrefix(slug, cfg.Grafana.IgnorePrefix) {
 		return true, nil
 	}
 

vendor/manifest

@@ -8,6 +8,12 @@
 			"branch": "master"
 		},
 		{
+			"importpath": "github.com/gosimple/slug",
+			"repository": "https://github.com/gosimple/slug",
+			"revision": "e9f42fa127660e552d0ad2b589868d403a9be7c6",
+			"branch": "master"
+		},
+		{
 			"importpath": "github.com/jbenet/go-context/io",
 			"repository": "https://github.com/jbenet/go-context",
 			"revision": "d14ea06fba99483203c19d92cfcd13ebe73135f4",
@@ -27,6 +33,12 @@
 			"branch": "master"
 		},
 		{
+			"importpath": "github.com/rainycape/unidecode",
+			"repository": "https://github.com/rainycape/unidecode",
+			"revision": "cb7f23ec59bec0d61b19c56cd88cee3d0cc1870c",
+			"branch": "master"
+		},
+		{
 			"importpath": "github.com/sergi/go-diff/diffmatchpatch",
 			"repository": "https://github.com/sergi/go-diff",
 			"revision": "1744e2970ca51c86172c8190fadad617561ed6e7",

vendor/src/github.com/gosimple/slug/LICENSE

@@ -0,0 +1,373 @@
+Mozilla Public License Version 2.0
+==================================
+
+1. Definitions
+--------------
+
+1.1. "Contributor"
+    means each individual or legal entity that creates, contributes to
+    the creation of, or owns Covered Software.
+
+1.2. "Contributor Version"
+    means the combination of the Contributions of others (if any) used
+    by a Contributor and that particular Contributor's Contribution.
+
+1.3. "Contribution"
+    means Covered Software of a particular Contributor.
+
+1.4. "Covered Software"
+    means Source Code Form to which the initial Contributor has attached
+    the notice in Exhibit A, the Executable Form of such Source Code
+    Form, and Modifications of such Source Code Form, in each case
+    including portions thereof.
+
+1.5. "Incompatible With Secondary Licenses"
+    means
+
+    (a) that the initial Contributor has attached the notice described
+        in Exhibit B to the Covered Software; or
+
+    (b) that the Covered Software was made available under the terms of
+        version 1.1 or earlier of the License, but not also under the
+        terms of a Secondary License.
+
+1.6. "Executable Form"
+    means any form of the work other than Source Code Form.
+
+1.7. "Larger Work"
+    means a work that combines Covered Software with other material, in
+    a separate file or files, that is not Covered Software.
+
+1.8. "License"
+    means this document.
+
+1.9. "Licensable"
+    means having the right to grant, to the maximum extent possible,
+    whether at the time of the initial grant or subsequently, any and
+    all of the rights conveyed by this License.
+
+1.10. "Modifications"
+    means any of the following:
+
+    (a) any file in Source Code Form that results from an addition to,
+        deletion from, or modification of the contents of Covered
+        Software; or
+
+    (b) any new file in Source Code Form that contains any Covered
+        Software.
+
+1.11. "Patent Claims" of a Contributor
+    means any patent claim(s), including without limitation, method,
+    process, and apparatus claims, in any patent Licensable by such
+    Contributor that would be infringed, but for the grant of the
+    License, by the making, using, selling, offering for sale, having
+    made, import, or transfer of either its Contributions or its
+    Contributor Version.
+
+1.12. "Secondary License"
+    means either the GNU General Public License, Version 2.0, the GNU
+    Lesser General Public License, Version 2.1, the GNU Affero General
+    Public License, Version 3.0, or any later versions of those
+    licenses.
+
+1.13. "Source Code Form"
+    means the form of the work preferred for making modifications.
+
+1.14. "You" (or "Your")
+    means an individual or a legal entity exercising rights under this
+    License. For legal entities, "You" includes any entity that
+    controls, is controlled by, or is under common control with You. For
+    purposes of this definition, "control" means (a) the power, direct
+    or indirect, to cause the direction or management of such entity,
+    whether by contract or otherwise, or (b) ownership of more than
+    fifty percent (50%) of the outstanding shares or beneficial
+    ownership of such entity.
+
+2. License Grants and Conditions
+--------------------------------
+
+2.1. Grants
+
+Each Contributor hereby grants You a world-wide, royalty-free,
+non-exclusive license:
+
+(a) under intellectual property rights (other than patent or trademark)
+    Licensable by such Contributor to use, reproduce, make available,
+    modify, display, perform, distribute, and otherwise exploit its
+    Contributions, either on an unmodified basis, with Modifications, or
+    as part of a Larger Work; and
+
+(b) under Patent Claims of such Contributor to make, use, sell, offer
+    for sale, have made, import, and otherwise transfer either its
+    Contributions or its Contributor Version.
+
+2.2. Effective Date
+
+The licenses granted in Section 2.1 with respect to any Contribution
+become effective for each Contribution on the date the Contributor first
+distributes such Contribution.
+
+2.3. Limitations on Grant Scope
+
+The licenses granted in this Section 2 are the only rights granted under
+this License. No additional rights or licenses will be implied from the
+distribution or licensing of Covered Software under this License.
+Notwithstanding Section 2.1(b) above, no patent license is granted by a
+Contributor:
+
+(a) for any code that a Contributor has removed from Covered Software;
+    or
+
+(b) for infringements caused by: (i) Your and any other third party's
+    modifications of Covered Software, or (ii) the combination of its
+    Contributions with other software (except as part of its Contributor
+    Version); or
+
+(c) under Patent Claims infringed by Covered Software in the absence of
+    its Contributions.
+
+This License does not grant any rights in the trademarks, service marks,
+or logos of any Contributor (except as may be necessary to comply with
+the notice requirements in Section 3.4).
+
+2.4. Subsequent Licenses
+
+No Contributor makes additional grants as a result of Your choice to
+distribute the Covered Software under a subsequent version of this
+License (see Section 10.2) or under the terms of a Secondary License (if
+permitted under the terms of Section 3.3).
+
+2.5. Representation
+
+Each Contributor represents that the Contributor believes its
+Contributions are its original creation(s) or it has sufficient rights
+to grant the rights to its Contributions conveyed by this License.
+
+2.6. Fair Use
+
+This License is not intended to limit any rights You have under
+applicable copyright doctrines of fair use, fair dealing, or other
+equivalents.
+
+2.7. Conditions
+
+Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted
+in Section 2.1.
+
+3. Responsibilities
+-------------------
+
+3.1. Distribution of Source Form
+
+All distribution of Covered Software in Source Code Form, including any
+Modifications that You create or to which You contribute, must be under
+the terms of this License. You must inform recipients that the Source
+Code Form of the Covered Software is governed by the terms of this
+License, and how they can obtain a copy of this License. You may not
+attempt to alter or restrict the recipients' rights in the Source Code
+Form.
+
+3.2. Distribution of Executable Form
+
+If You distribute Covered Software in Executable Form then:
+
+(a) such Covered Software must also be made available in Source Code
+    Form, as described in Section 3.1, and You must inform recipients of
+    the Executable Form how they can obtain a copy of such Source Code
+    Form by reasonable means in a timely manner, at a charge no more
+    than the cost of distribution to the recipient; and
+
+(b) You may distribute such Executable Form under the terms of this
+    License, or sublicense it under different terms, provided that the
+    license for the Executable Form does not attempt to limit or alter
+    the recipients' rights in the Source Code Form under this License.
+
+3.3. Distribution of a Larger Work
+
+You may create and distribute a Larger Work under terms of Your choice,
+provided that You also comply with the requirements of this License for
+the Covered Software. If the Larger Work is a combination of Covered
+Software with a work governed by one or more Secondary Licenses, and the
+Covered Software is not Incompatible With Secondary Licenses, this
+License permits You to additionally distribute such Covered Software
+under the terms of such Secondary License(s), so that the recipient of
+the Larger Work may, at their option, further distribute the Covered
+Software under the terms of either this License or such Secondary
+License(s).
+
+3.4. Notices
+
+You may not remove or alter the substance of any license notices
+(including copyright notices, patent notices, disclaimers of warranty,
+or limitations of liability) contained within the Source Code Form of
+the Covered Software, except that You may alter any license notices to
+the extent required to remedy known factual inaccuracies.
+
+3.5. Application of Additional Terms
+
+You may choose to offer, and to charge a fee for, warranty, support,
+indemnity or liability obligations to one or more recipients of Covered
+Software. However, You may do so only on Your own behalf, and not on
+behalf of any Contributor. You must make it absolutely clear that any
+such warranty, support, indemnity, or liability obligation is offered by
+You alone, and You hereby agree to indemnify every Contributor for any
+liability incurred by such Contributor as a result of warranty, support,
+indemnity or liability terms You offer. You may include additional
+disclaimers of warranty and limitations of liability specific to any
+jurisdiction.
+
+4. Inability to Comply Due to Statute or Regulation
+---------------------------------------------------
+
+If it is impossible for You to comply with any of the terms of this
+License with respect to some or all of the Covered Software due to
+statute, judicial order, or regulation then You must: (a) comply with
+the terms of this License to the maximum extent possible; and (b)
+describe the limitations and the code they affect. Such description must
+be placed in a text file included with all distributions of the Covered
+Software under this License. Except to the extent prohibited by statute
+or regulation, such description must be sufficiently detailed for a
+recipient of ordinary skill to be able to understand it.
+
+5. Termination
+--------------
+
+5.1. The rights granted under this License will terminate automatically
+if You fail to comply with any of its terms. However, if You become
+compliant, then the rights granted under this License from a particular
+Contributor are reinstated (a) provisionally, unless and until such
+Contributor explicitly and finally terminates Your grants, and (b) on an
+ongoing basis, if such Contributor fails to notify You of the
+non-compliance by some reasonable means prior to 60 days after You have
+come back into compliance. Moreover, Your grants from a particular
+Contributor are reinstated on an ongoing basis if such Contributor
+notifies You of the non-compliance by some reasonable means, this is the
+first time You have received notice of non-compliance with this License
+from such Contributor, and You become compliant prior to 30 days after
+Your receipt of the notice.
+
+5.2. If You initiate litigation against any entity by asserting a patent
+infringement claim (excluding declaratory judgment actions,
+counter-claims, and cross-claims) alleging that a Contributor Version
+directly or indirectly infringes any patent, then the rights granted to
+You by any and all Contributors for the Covered Software under Section
+2.1 of this License shall terminate.
+
+5.3. In the event of termination under Sections 5.1 or 5.2 above, all
+end user license agreements (excluding distributors and resellers) which
+have been validly granted by You or Your distributors under this License
+prior to termination shall survive termination.
+
+************************************************************************
+*                                                                      *
+*  6. Disclaimer of Warranty                                           *
+*  -------------------------                                           *
+*                                                                      *
+*  Covered Software is provided under this License on an "as is"       *
+*  basis, without warranty of any kind, either expressed, implied, or  *
+*  statutory, including, without limitation, warranties that the       *
+*  Covered Software is free of defects, merchantable, fit for a        *
+*  particular purpose or non-infringing. The entire risk as to the     *
+*  quality and performance of the Covered Software is with You.        *
+*  Should any Covered Software prove defective in any respect, You     *
+*  (not any Contributor) assume the cost of any necessary servicing,   *
+*  repair, or correction. This disclaimer of warranty constitutes an   *
+*  essential part of this License. No use of any Covered Software is   *
+*  authorized under this License except under this disclaimer.         *
+*                                                                      *
+************************************************************************
+
+************************************************************************
+*                                                                      *
+*  7. Limitation of Liability                                          *
+*  --------------------------                                          *
+*                                                                      *
+*  Under no circumstances and under no legal theory, whether tort      *
+*  (including negligence), contract, or otherwise, shall any           *
+*  Contributor, or anyone who distributes Covered Software as          *
+*  permitted above, be liable to You for any direct, indirect,         *
+*  special, incidental, or consequential damages of any character      *
+*  including, without limitation, damages for lost profits, loss of    *
+*  goodwill, work stoppage, computer failure or malfunction, or any    *
+*  and all other commercial damages or losses, even if such party      *
+*  shall have been informed of the possibility of such damages. This   *
+*  limitation of liability shall not apply to liability for death or   *
+*  personal injury resulting from such party's negligence to the       *
+*  extent applicable law prohibits such limitation. Some               *
+*  jurisdictions do not allow the exclusion or limitation of           *
+*  incidental or consequential damages, so this exclusion and          *
+*  limitation may not apply to You.                                    *
+*                                                                      *
+************************************************************************
+
+8. Litigation
+-------------
+
+Any litigation relating to this License may be brought only in the
+courts of a jurisdiction where the defendant maintains its principal
+place of business and such litigation shall be governed by laws of that
+jurisdiction, without reference to its conflict-of-law provisions.
+Nothing in this Section shall prevent a party's ability to bring
+cross-claims or counter-claims.
+
+9. Miscellaneous
+----------------
+
+This License represents the complete agreement concerning the subject
+matter hereof. If any provision of this License is held to be
+unenforceable, such provision shall be reformed only to the extent
+necessary to make it enforceable. Any law or regulation which provides
+that the language of a contract shall be construed against the drafter
+shall not be used to construe this License against a Contributor.
+
+10. Versions of the License
+---------------------------
+
+10.1. New Versions
+
+Mozilla Foundation is the license steward. Except as provided in Section
+10.3, no one other than the license steward has the right to modify or
+publish new versions of this License. Each version will be given a
+distinguishing version number.
+
+10.2. Effect of New Versions
+
+You may distribute the Covered Software under the terms of the version
+of the License under which You originally received the Covered Software,
+or under the terms of any subsequent version published by the license
+steward.
+
+10.3. Modified Versions
+
+If you create software not governed by this License, and you want to
+create a new license for such software, you may create and use a
+modified version of this License if you rename the license and remove
+any references to the name of the license steward (except to note that
+such modified license differs from this License).
+
+10.4. Distributing Source Code Form that is Incompatible With Secondary
+Licenses
+
+If You choose to distribute Source Code Form that is Incompatible With
+Secondary Licenses under the terms of this version of the License, the
+notice described in Exhibit B of this License must be attached.
+
+Exhibit A - Source Code Form License Notice
+-------------------------------------------
+
+  This Source Code Form is subject to the terms of the Mozilla Public
+  License, v. 2.0. If a copy of the MPL was not distributed with this
+  file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+If it is not possible or desirable to put the notice in a particular
+file, then You may include the notice in a location (such as a LICENSE
+file in a relevant directory) where a recipient would be likely to look
+for such a notice.
+
+You may add additional accurate notices of copyright ownership.
+
+Exhibit B - "Incompatible With Secondary Licenses" Notice
+---------------------------------------------------------
+
+  This Source Code Form is "Incompatible With Secondary Licenses", as
+  defined by the Mozilla Public License, v. 2.0.

vendor/src/github.com/gosimple/slug/README.md

@@ -0,0 +1,54 @@
+slug
+====
+
+Package `slug` generate slug from unicode string, URL-friendly slugify with
+multiple languages support.
+
+[![GoDoc](https://godoc.org/github.com/gosimple/slug?status.png)](https://godoc.org/github.com/gosimple/slug)
+[![Build Status](https://drone.io/github.com/gosimple/slug/status.png)](https://drone.io/github.com/gosimple/slug/latest)
+
+[Documentation online](http://godoc.org/github.com/gosimple/slug)
+
+## Example
+
+	package main
+
+	import(
+		"github.com/gosimple/slug"
+	    "fmt"
+	)
+
+	func main () {
+		text := slug.Make("Hellö Wörld хелло ворлд")
+		fmt.Println(text) // Will print: "hello-world-khello-vorld"
+
+		someText := slug.Make("影師")
+		fmt.Println(someText) // Will print: "ying-shi"
+
+		enText := slug.MakeLang("This & that", "en")
+		fmt.Println(enText) // Will print: "this-and-that"
+
+		deText := slug.MakeLang("Diese & Dass", "de")
+		fmt.Println(deText) // Will print: "diese-und-dass"
+
+		slug.CustomSub = map[string]string{
+			"water": "sand",
+		}
+		textSub := slug.Make("water is hot")
+		fmt.Println(textSub) // Will print: "sand-is-hot"
+	}
+
+### Requests or bugs?
+<https://github.com/gosimple/slug/issues>
+
+## Installation
+
+	go get -u github.com/gosimple/slug
+
+## License
+
+The source files are distributed under the
+[Mozilla Public License, version 2.0](http://mozilla.org/MPL/2.0/),
+unless otherwise noted.
+Please read the [FAQ](http://www.mozilla.org/MPL/2.0/FAQ.html)
+if you have further questions regarding the license.

vendor/src/github.com/gosimple/slug/doc.go

@@ -0,0 +1,43 @@
+// Copyright 2013 by Dobrosław Żybort. All rights reserved.
+// This Source Code Form is subject to the terms of the Mozilla Public
+// License, v. 2.0. If a copy of the MPL was not distributed with this
+// file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+/*
+Package slug generate slug from unicode string, URL-friendly slugify with
+multiple languages support.
+
+Example:
+
+	package main
+
+	import(
+		"github.com/gosimple/slug"
+		"fmt"
+	)
+
+	func main () {
+		text := slug.Make("Hellö Wörld хелло ворлд")
+		fmt.Println(text) // Will print hello-world-khello-vorld
+
+		someText := slug.Make("影師")
+		fmt.Println(someText) // Will print: ying-shi
+
+		enText := slug.MakeLang("This & that", "en")
+		fmt.Println(enText) // Will print 'this-and-that'
+
+		deText := slug.MakeLang("Diese & Dass", "de")
+		fmt.Println(deText) // Will print 'diese-und-dass'
+
+		slug.CustomSub = map[string]string{
+			"water": "sand",
+		}
+		textSub := slug.Make("water is hot")
+		fmt.Println(textSub) // Will print 'sand-is-hot'
+	}
+
+Requests or bugs?
+
+https://github.com/gosimple/slug/issues
+*/
+package slug

vendor/src/github.com/gosimple/slug/languages_substitution.go

@@ -0,0 +1,57 @@
+// Copyright 2013 by Dobrosław Żybort. All rights reserved.
+// This Source Code Form is subject to the terms of the Mozilla Public
+// License, v. 2.0. If a copy of the MPL was not distributed with this
+// file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+package slug
+
+func init() {
+	// Merge language subs with the default one
+	for _, sub := range []*map[rune]string{&deSub, &enSub, &plSub, &esSub} {
+		for key, value := range defaultSub {
+			(*sub)[key] = value
+		}
+	}
+}
+
+var defaultSub = map[rune]string{
+	'"':  "",
+	'\'': "",
+	'’':  "",
+	'‒':  "-", // figure dash
+	'–':  "-", // en dash
+	'—':  "-", // em dash
+	'―':  "-", // horizontal bar
+}
+
+var deSub = map[rune]string{
+	'&': "und",
+	'@': "an",
+}
+
+var enSub = map[rune]string{
+	'&': "and",
+	'@': "at",
+}
+
+var plSub = map[rune]string{
+	'&': "i",
+	'@': "na",
+}
+
+var esSub = map[rune]string{
+	'&': "y",
+	'@': "en",
+}
+
+var grSub = map[rune]string{
+	'&': "kai",
+	'η': "i",
+	'ή': "i",
+	'Η': "i",
+	'ι': "i",
+	'ί': "i",
+	'Ι': "i",
+	'χ': "x",
+	'Χ': "x",
+}

vendor/src/github.com/gosimple/slug/slug.go

@@ -0,0 +1,157 @@
+// Copyright 2013 by Dobrosław Żybort. All rights reserved.
+// This Source Code Form is subject to the terms of the Mozilla Public
+// License, v. 2.0. If a copy of the MPL was not distributed with this
+// file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+package slug
+
+import (
+	"bytes"
+	"regexp"
+	"sort"
+	"strings"
+
+	"github.com/rainycape/unidecode"
+)
+
+var (
+	// CustomSub stores custom substitution map
+	CustomSub map[string]string
+	// CustomRuneSub stores custom rune substitution map
+	CustomRuneSub map[rune]string
+
+	// MaxLength stores maximum slug length.
+	// It's smart so it will cat slug after full word.
+	// By default slugs aren't shortened.
+	// If MaxLength is smaller than length of the first word, then returned
+	// slug will contain only substring from the first word truncated
+	// after MaxLength.
+	MaxLength int
+
+	regexpNonAuthorizedChars = regexp.MustCompile("[^a-z0-9-_]")
+	regexpMultipleDashes     = regexp.MustCompile("-+")
+)
+
+//=============================================================================
+
+// Make returns slug generated from provided string. Will use "en" as language
+// substitution.
+func Make(s string) (slug string) {
+	return MakeLang(s, "en")
+}
+
+// MakeLang returns slug generated from provided string and will use provided
+// language for chars substitution.
+func MakeLang(s string, lang string) (slug string) {
+	slug = strings.TrimSpace(s)
+
+	// Custom substitutions
+	// Always substitute runes first
+	slug = SubstituteRune(slug, CustomRuneSub)
+	slug = Substitute(slug, CustomSub)
+
+	// Process string with selected substitution language
+	switch lang {
+	case "de":
+		slug = SubstituteRune(slug, deSub)
+	case "en":
+		slug = SubstituteRune(slug, enSub)
+	case "pl":
+		slug = SubstituteRune(slug, plSub)
+	case "es":
+		slug = SubstituteRune(slug, esSub)
+	case "gr":
+		slug = SubstituteRune(slug, grSub)
+	default: // fallback to "en" if lang not found
+		slug = SubstituteRune(slug, enSub)
+	}
+
+	// Process all non ASCII symbols
+	slug = unidecode.Unidecode(slug)
+
+	slug = strings.ToLower(slug)
+
+	// Process all remaining symbols
+	slug = regexpNonAuthorizedChars.ReplaceAllString(slug, "-")
+	slug = regexpMultipleDashes.ReplaceAllString(slug, "-")
+	slug = strings.Trim(slug, "-")
+
+	if MaxLength > 0 {
+		slug = smartTruncate(slug)
+	}
+
+	return slug
+}
+
+// Substitute returns string with superseded all substrings from
+// provided substitution map. Substitution map will be applied in alphabetic
+// order. Many passes, on one substitution another one could apply.
+func Substitute(s string, sub map[string]string) (buf string) {
+	buf = s
+	var keys []string
+	for k := range sub {
+		keys = append(keys, k)
+	}
+	sort.Strings(keys)
+
+	for _, key := range keys {
+		buf = strings.Replace(buf, key, sub[key], -1)
+	}
+	return
+}
+
+// SubstituteRune substitutes string chars with provided rune
+// substitution map. One pass.
+func SubstituteRune(s string, sub map[rune]string) string {
+	var buf bytes.Buffer
+	for _, c := range s {
+		if d, ok := sub[c]; ok {
+			buf.WriteString(d)
+		} else {
+			buf.WriteRune(c)
+		}
+	}
+	return buf.String()
+}
+
+func smartTruncate(text string) string {
+	if len(text) < MaxLength {
+		return text
+	}
+
+	var truncated string
+	words := strings.SplitAfter(text, "-")
+	// If MaxLength is smaller than length of the first word return word
+	// truncated after MaxLength.
+	if len(words[0]) > MaxLength {
+		return words[0][:MaxLength]
+	}
+	for _, word := range words {
+		if len(truncated)+len(word)-1 <= MaxLength {
+			truncated = truncated + word
+		} else {
+			break
+		}
+	}
+	return strings.Trim(truncated, "-")
+}
+
+// IsSlug returns True if provided text does not contain white characters,
+// punctuation, all letters are lower case and only from ASCII range.
+// It could contain `-` and `_` but not at the beginning or end of the text.
+// It should be in range of the MaxLength var if specified.
+// All output from slug.Make(text) should pass this test.
+func IsSlug(text string) bool {
+	if text == "" ||
+		(MaxLength > 0 && len(text) > MaxLength) ||
+		text[0] == '-' || text[0] == '_' ||
+		text[len(text)-1] == '-' || text[len(text)-1] == '_' {
+		return false
+	}
+	for _, c := range text {
+		if (c < 'a' || c > 'z') && c != '-' && c != '_' && (c < '0' || c > '9') {
+			return false
+		}
+	}
+	return true
+}

vendor/src/github.com/gosimple/slug/slug_test.go

@@ -0,0 +1,421 @@
+// Copyright 2013 by Dobrosław Żybort. All rights reserved.
+// This Source Code Form is subject to the terms of the Mozilla Public
+// License, v. 2.0. If a copy of the MPL was not distributed with this
+// file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+package slug
+
+import (
+	"testing"
+)
+
+//=============================================================================
+
+func TestSlugMake(t *testing.T) {
+	var testCases = []struct {
+		in   string
+		want string
+	}{
+		{"DOBROSLAWZYBORT", "dobroslawzybort"},
+		{"Dobroslaw Zybort", "dobroslaw-zybort"},
+		{"  Dobroslaw     Zybort  ?", "dobroslaw-zybort"},
+		{"Dobrosław Żybort", "dobroslaw-zybort"},
+		{"Ala ma 6 kotów.", "ala-ma-6-kotow"},
+
+		{"áÁàÀãÃâÂäÄąĄą̊Ą̊", "aaaaaaaaaaaaaa"},
+		{"ćĆĉĈçÇ", "cccccc"},
+		{"éÉèÈẽẼêÊëËęĘ", "eeeeeeeeeeee"},
+		{"íÍìÌĩĨîÎïÏįĮ", "iiiiiiiiiiii"},
+		{"łŁ", "ll"},
+		{"ńŃ", "nn"},
+		{"óÓòÒõÕôÔöÖǫǪǭǬø", "ooooooooooooooo"},
+		{"śŚ", "ss"},
+		{"úÚùÙũŨûÛüÜųŲ", "uuuuuuuuuuuu"},
+		{"y̨Y̨", "yy"},
+		{"źŹżŹ", "zzzz"},
+		{"·/,:;`˜'\"", ""},
+		{"2000–2013", "2000-2013"},
+		{"style—not", "style-not"},
+		{"test_slug", "test_slug"},
+		{"Æ", "ae"},
+		{"Ich heiße", "ich-heisse"},
+
+		{"This & that", "this-and-that"},
+		{"fácil €", "facil-eu"},
+		{"smile ☺", "smile"},
+		{"Hellö Wörld хелло ворлд", "hello-world-khello-vorld"},
+		{"\"C'est déjà l’été.\"", "cest-deja-lete"},
+		{"jaja---lol-méméméoo--a", "jaja-lol-mememeoo-a"},
+		{"影師", "ying-shi"},
+	}
+
+	for index, st := range testCases {
+		got := Make(st.in)
+		if got != st.want {
+			t.Errorf(
+				"%d. Make(%#v) = %#v; want %#v",
+				index, st.in, got, st.want)
+		}
+	}
+}
+
+func TestSlugMakeLang(t *testing.T) {
+	var testCases = []struct {
+		lang string
+		in   string
+		want string
+	}{
+		{"en", "This & that", "this-and-that"},
+		{"de", "This & that", "this-und-that"},
+		{"pl", "This & that", "this-i-that"},
+		{"es", "This & that", "this-y-that"},
+		{"gr", "This & that", "this-kai-that"},
+		{"test", "This & that", "this-and-that"}, // unknown lang, fallback to "en"
+	}
+
+	for index, smlt := range testCases {
+		got := MakeLang(smlt.in, smlt.lang)
+		if got != smlt.want {
+			t.Errorf(
+				"%d. MakeLang(%#v, %#v) = %#v; want %#v",
+				index, smlt.in, smlt.lang, got, smlt.want)
+		}
+	}
+}
+
+func TestSlugMakeUserSubstituteLang(t *testing.T) {
+	var testCases = []struct {
+		cSub map[string]string
+		lang string
+		in   string
+		want string
+	}{
+		{map[string]string{"'": " "}, "en", "That's great", "that-s-great"},
+		{map[string]string{"&": "or"}, "en", "This & that", "this-or-that"},                   // by default "&" => "and"
+		{map[string]string{"&": "or"}, "de", "This & that", "this-or-that"},                   // by default "&" => "und"
+		{map[string]string{"&": "or", "@": "the"}, "de", "@ This & that", "the-this-or-that"}, // by default "&" => "und", "@" => "an"
+	}
+
+	for index, smust := range testCases {
+		CustomSub = smust.cSub
+		got := MakeLang(smust.in, smust.lang)
+		if got != smust.want {
+			t.Errorf(
+				"%d. %#v; MakeLang(%#v, %#v) = %#v; want %#v",
+				index, smust.cSub, smust.in, smust.lang,
+				got, smust.want)
+
+		}
+	}
+}
+
+func TestSlugMakeSubstituteOrderLang(t *testing.T) {
+	// Always substitute runes first
+	var testCases = []struct {
+		rSub map[rune]string
+		sSub map[string]string
+		in   string
+		want string
+	}{
+		{map[rune]string{'o': "left"}, map[string]string{"o": "right"}, "o o", "left-left"},
+		{map[rune]string{'o': "left", 'a': "r"}, map[string]string{"o": "right"}, "o a o", "left-r-left"},
+		{map[rune]string{'o': "left"}, map[string]string{"o": "right", "a": "r"}, "a o a o", "r-left-r-left"},
+		{map[rune]string{'&': "down"}, map[string]string{"&": "up"}, "&", "down"},
+	}
+
+	for index, smsot := range testCases {
+		CustomRuneSub = smsot.rSub
+		CustomSub = smsot.sSub
+		got := Make(smsot.in)
+		if got != smsot.want {
+			t.Errorf(
+				"%d. %#v; %#v; Make(%#v) = %#v; want %#v",
+				index, smsot.rSub, smsot.sSub, smsot.in,
+				got, smsot.want)
+
+		}
+	}
+}
+
+func TestSubstituteLang(t *testing.T) {
+	var testCases = []struct {
+		cSub map[string]string
+		in   string
+		want string
+	}{
+		{map[string]string{"o": "no"}, "o o o", "no no no"},
+		{map[string]string{"o": "no", "a": "or"}, "o a o", "no nor no"},
+		{map[string]string{"a": "or", "o": "no"}, "o a o", "no nor no"},
+		{map[string]string{"'": " "}, "That's great", "That s great"},
+	}
+
+	for index, sst := range testCases {
+		got := Substitute(sst.in, sst.cSub)
+		if got != sst.want {
+			t.Errorf(
+				"%d. Substitute(%#v, %#v) = %#v; want %#v",
+				index, sst.in, sst.cSub, got, sst.want)
+		}
+	}
+}
+
+func TestSubstituteRuneLang(t *testing.T) {
+	var testCases = []struct {
+		cSub map[rune]string
+		in   string
+		want string
+	}{
+		{map[rune]string{'o': "no"}, "o o o", "no no no"},
+		{map[rune]string{'o': "no", 'a': "or"}, "o a o", "no or no"},
+		{map[rune]string{'a': "or", 'o': "no"}, "o a o", "no or no"},
+		{map[rune]string{'\'': " "}, "That's great", "That s great"},
+	}
+
+	for index, ssrt := range testCases {
+		got := SubstituteRune(ssrt.in, ssrt.cSub)
+		if got != ssrt.want {
+			t.Errorf(
+				"%d. SubstituteRune(%#v, %#v) = %#v; want %#v",
+				index, ssrt.in, ssrt.cSub, got, ssrt.want)
+		}
+	}
+}
+
+func TestSlugMakeSmartTruncate(t *testing.T) {
+	var testCases = []struct {
+		in        string
+		maxLength int
+		want      string
+	}{
+		{"DOBROSLAWZYBORT", 100, "dobroslawzybort"},
+		{"Dobroslaw Zybort", 100, "dobroslaw-zybort"},
+		{"Dobroslaw Zybort", 12, "dobroslaw"},
+		{"  Dobroslaw     Zybort  ?", 12, "dobroslaw"},
+		{"Ala ma 6 kotów.", 10, "ala-ma-6"},
+		{"Dobrosław Żybort", 5, "dobro"},
+	}
+
+	for index, smstt := range testCases {
+		MaxLength = smstt.maxLength
+		got := Make(smstt.in)
+		if got != smstt.want {
+			t.Errorf(
+				"%d. MaxLength = %v; Make(%#v) = %#v; want %#v",
+				index, smstt.maxLength, smstt.in, got, smstt.want)
+		}
+	}
+}
+
+func TestIsSlug(t *testing.T) {
+	MaxLength = 0
+	type args struct {
+		text string
+	}
+	tests := []struct {
+		name string
+		args args
+		want bool
+	}{
+		{"some", args{"some"}, true},
+		{"with -", args{"some-more"}, true},
+		{"with _", args{"some_more"}, true},
+		{"with numbers", args{"number-2"}, true},
+		{"empty string", args{""}, false},
+		{"upper case", args{"Some-more"}, false},
+		{"space", args{"some more"}, false},
+		{"starts with '-'", args{"-some"}, false},
+		{"ends with '-'", args{"some-"}, false},
+		{"starts with '_'", args{"_some"}, false},
+		{"ends with '_'", args{"some_"}, false},
+		{"outside ASCII", args{"Dobrosław Żybort"}, false},
+		{"outside ASCII –", args{"2000–2013"}, false},
+		{"smile ☺", args{"smile ☺"}, false},
+	}
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			if got := IsSlug(tt.args.text); got != tt.want {
+				t.Errorf("IsSlug() = %v, want %v", got, tt.want)
+			}
+		})
+	}
+
+	t.Run("MaxLength", func(t *testing.T) {
+		MaxLength = 4
+		if got := IsSlug("012345"); got != false {
+			t.Errorf("IsSlug() = %v, want %v", got, false)
+		}
+		MaxLength = 0
+	})
+}
+
+func BenchmarkMakeShortAscii(b *testing.B) {
+	b.ReportAllocs()
+	for n := 0; n < b.N; n++ {
+		Make("Hello world")
+	}
+}
+func BenchmarkMakeShort(b *testing.B) {
+	b.ReportAllocs()
+	for n := 0; n < b.N; n++ {
+		Make("хелло ворлд")
+	}
+}
+
+func BenchmarkMakeShortSymbols(b *testing.B) {
+	b.ReportAllocs()
+	for n := 0; n < b.N; n++ {
+		Make("·/,:;`˜'\" &€￡￥")
+	}
+}
+
+func BenchmarkMakeMediumAscii(b *testing.B) {
+	b.ReportAllocs()
+	for n := 0; n < b.N; n++ {
+		Make("ABCDE FGHIJ KLMNO PQRST UWXYZ ABCDE FGHIJ KLMNO PQRST UWXYZ ABCDE")
+	}
+}
+
+func BenchmarkMakeMedium(b *testing.B) {
+	b.ReportAllocs()
+	for n := 0; n < b.N; n++ {
+		Make("ｦｧｨｩｪ ｫｬｭｮｯ ｰｱｲｳｴ ｵｶｷｸｹ ｺｻｼｽｾ ｿﾀﾁﾂﾃ ﾄﾅﾆﾇﾈ ﾉﾊﾋﾌﾍ ﾎﾏﾐﾑﾒ ﾓﾔﾕﾖﾗ ﾘﾙﾚﾛﾜ")
+	}
+}
+
+func BenchmarkMakeLongAscii(b *testing.B) {
+	longStr := "Lorem ipsum dolor sit amet, consectetur adipiscing elit. Morbi " +
+		"pulvinar sodales ultrices. Nulla facilisi. Sed at vestibulum erat. Ut " +
+		"sit amet urna posuere, sagittis eros ac, varius nisi. Morbi ullamcorper " +
+		"odio at nunc pulvinar mattis. Vestibulum rutrum, ante eu dictum mattis, " +
+		"elit risus finibus nunc, consectetur facilisis eros leo ut sapien. Sed " +
+		"pulvinar volutpat mi. Cras semper mi ac eros accumsan, at feugiat massa " +
+		"elementum. Morbi eget dolor sit amet purus condimentum egestas non ut " +
+		"sapien. Duis feugiat magna vitae nisi lobortis, quis finibus sem " +
+		"sollicitudin. Pellentesque eleifend blandit ipsum, ut porta arcu " +
+		"ultricies et. Fusce vel ipsum porta, placerat diam ac, consectetur " +
+		"magna. Nulla in porta sem. Suspendisse commodo, felis in molestie " +
+		"ultricies, arcu ipsum aliquet turpis, elementum dapibus ipsum lorem a " +
+		"nisl. Etiam varius imperdiet placerat. Aliquam euismod lacus arcu, " +
+		"ultrices hendrerit est pellentesque vel. Aliquam sit amet laoreet leo. " +
+		"Integer eros libero, mollis sed posuere."
+
+	b.ReportAllocs()
+	b.ResetTimer()
+	for n := 0; n < b.N; n++ {
+		Make(longStr)
+	}
+}
+
+func BenchmarkSubstituteRuneShort(b *testing.B) {
+	shortStr := "Hello/Hi world"
+	subs := map[rune]string{'o': "no", '/': "slash"}
+
+	b.ReportAllocs()
+	b.ResetTimer()
+	for n := 0; n < b.N; n++ {
+		SubstituteRune(shortStr, subs)
+	}
+}
+
+func BenchmarkSubstituteRuneLong(b *testing.B) {
+	longStr := "Lorem ipsum dolor sit amet, consectetur adipiscing elit. Morbi " +
+		"pulvinar sodales ultrices. Nulla facilisi. Sed at vestibulum erat. Ut " +
+		"sit amet urna posuere, sagittis eros ac, varius nisi. Morbi ullamcorper " +
+		"odio at nunc pulvinar mattis. Vestibulum rutrum, ante eu dictum mattis, " +
+		"elit risus finibus nunc, consectetur facilisis eros leo ut sapien. Sed " +
+		"pulvinar volutpat mi. Cras semper mi ac eros accumsan, at feugiat massa " +
+		"elementum. Morbi eget dolor sit amet purus condimentum egestas non ut " +
+		"sapien. Duis feugiat magna vitae nisi lobortis, quis finibus sem " +
+		"sollicitudin. Pellentesque eleifend blandit ipsum, ut porta arcu " +
+		"ultricies et. Fusce vel ipsum porta, placerat diam ac, consectetur " +
+		"magna. Nulla in porta sem. Suspendisse commodo, felis in molestie " +
+		"ultricies, arcu ipsum aliquet turpis, elementum dapibus ipsum lorem a " +
+		"nisl. Etiam varius imperdiet placerat. Aliquam euismod lacus arcu, " +
+		"ultrices hendrerit est pellentesque vel. Aliquam sit amet laoreet leo. " +
+		"Integer eros libero, mollis sed posuere."
+	subs := map[rune]string{
+		'o': "no",
+		'/': "slash",
+		'i': "done",
+		'E': "es",
+		'a': "ASD",
+		'1': "one",
+		'l': "onetwo",
+	}
+
+	b.ReportAllocs()
+	b.ResetTimer()
+	for n := 0; n < b.N; n++ {
+		SubstituteRune(longStr, subs)
+	}
+}
+
+func BenchmarkSmartTruncateShort(b *testing.B) {
+	shortStr := "Hello-world"
+	MaxLength = 8
+
+	b.ReportAllocs()
+	b.ResetTimer()
+	for n := 0; n < b.N; n++ {
+		smartTruncate(shortStr)
+	}
+}
+
+func BenchmarkSmartTruncateLong(b *testing.B) {
+	longStr := "Lorem-ipsum-dolor-sit-amet,-consectetur-adipiscing-elit.-Morbi-" +
+		"pulvinar-sodales-ultrices.-Nulla-facilisi.-Sed-at-vestibulum-erat.-Ut-" +
+		"sit-amet-urna-posuere,-sagittis-eros-ac,-varius-nisi.-Morbi-ullamcorper-" +
+		"odio-at-nunc-pulvinar-mattis.-Vestibulum-rutrum,-ante-eu-dictum-mattis,-" +
+		"elit-risus-finibus-nunc,-consectetur-facilisis-eros-leo-ut-sapien.-Sed-" +
+		"pulvinar-volutpat-mi.-Cras-semper-mi-ac-eros-accumsan,-at-feugiat-massa-" +
+		"elementum.-Morbi-eget-dolor-sit-amet-purus-condimentum-egestas-non-ut-" +
+		"sapien.-Duis-feugiat-magna-vitae-nisi-lobortis,-quis-finibus-sem-" +
+		"sollicitudin.-Pellentesque-eleifend-blandit-ipsum,-ut-porta-arcu-" +
+		"ultricies-et.-Fusce-vel-ipsum-porta,-placerat-diam-ac,-consectetur-" +
+		"magna.-Nulla-in-porta-sem.-Suspendisse-commodo,-felis-in-molestie-" +
+		"ultricies,-arcu-ipsum-aliquet-turpis,-elementum-dapibus-ipsum-lorem-a-" +
+		"nisl.-Etiam-varius-imperdiet-placerat.-Aliquam-euismod-lacus-arcu,-" +
+		"ultrices-hendrerit-est-pellentesque-vel.-Aliquam-sit-amet-laoreet-leo.-" +
+		"Integer-eros-libero,-mollis-sed-posuere."
+	MaxLength = 256
+
+	b.ReportAllocs()
+	b.ResetTimer()
+	for n := 0; n < b.N; n++ {
+		smartTruncate(longStr)
+	}
+}
+
+func BenchmarkIsSlugShort(b *testing.B) {
+	shortStr := "hello-world"
+
+	b.ReportAllocs()
+	b.ResetTimer()
+	for n := 0; n < b.N; n++ {
+		IsSlug(shortStr)
+	}
+}
+
+func BenchmarkIsSlugLong(b *testing.B) {
+	longStr := "lorem-ipsum-dolor-sit-amet-consectetur-adipiscing-elit-morbi-" +
+		"pulvinar-sodales-ultrices-nulla-facilisi-sed-at-vestibulum-erat-ut-" +
+		"sit-amet-urna-posuere-sagittis-eros-ac-varius-nisi-morbi-ullamcorper-" +
+		"odio-at-nunc-pulvinar-mattis-vestibulum-rutrum-ante-eu-dictum-mattis,-" +
+		"elit-risus-finibus-nunc-consectetur-facilisis-eros-leo-ut-sapien-sed-" +
+		"pulvinar-volutpat-mi-cras-semper-mi-ac-eros-accumsan-at-feugiat-massa-" +
+		"elementum-morbi-eget-dolor-sit-amet-purus-condimentum-egestas-non-ut-" +
+		"sapien-duis-feugiat-magna-vitae-nisi-lobortis-quis-finibus-sem-" +
+		"sollicitudin-pellentesque-eleifend-blandit-ipsum-ut-porta-arcu-" +
+		"ultricies-et-fusce-vel-ipsum-porta-placerat-diam-ac-consectetur-" +
+		"magna-nulla-in-porta-sem-suspendisse-commodo-felis-in-molestie-" +
+		"ultricies-arcu-ipsum-aliquet-turpis-elementum-dapibus-ipsum-lorem-a-" +
+		"nisl-etiam-varius-imperdiet-placerat-aliquam-euismod-lacus-arcu-" +
+		"ultrices-hendrerit-est-pellentesque-vel-aliquam-sit-amet-laoreet-leo-" +
+		"integer-eros-libero-mollis-sed-posuere"
+
+	b.ReportAllocs()
+	b.ResetTimer()
+	for n := 0; n < b.N; n++ {
+		IsSlug(longStr)
+	}
+}

vendor/src/github.com/rainycape/unidecode/LICENSE

@@ -0,0 +1,203 @@
+Copyright 2014 Rainy Cape S.L. <hello@rainycape.com>
+
+Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "{}"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright {yyyy} {name of copyright owner}
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

vendor/src/github.com/rainycape/unidecode/README.md

@@ -0,0 +1,6 @@
+unidecode
+=========
+
+Unicode transliterator in Golang - Replaces non-ASCII characters with their ASCII approximations.
+
+[![GoDoc](https://godoc.org/github.com/rainycape/unidecode?status.svg)](https://godoc.org/github.com/rainycape/unidecode)

vendor/src/github.com/rainycape/unidecode/decode.go

@@ -0,0 +1,41 @@
+package unidecode
+
+import (
+	"compress/zlib"
+	"encoding/binary"
+	"io"
+	"strings"
+)
+
+var (
+	transliterations [65536][]rune
+	transCount       = rune(len(transliterations))
+	getUint16        = binary.LittleEndian.Uint16
+)
+
+func decodeTransliterations() {
+	r, err := zlib.NewReader(strings.NewReader(tableData))
+	if err != nil {
+		panic(err)
+	}
+	defer r.Close()
+	tmp1 := make([]byte, 2)
+	tmp2 := tmp1[:1]
+	for {
+		if _, err := io.ReadAtLeast(r, tmp1, 2); err != nil {
+			if err == io.EOF {
+				break
+			}
+			panic(err)
+		}
+		chr := getUint16(tmp1)
+		if _, err := io.ReadAtLeast(r, tmp2, 1); err != nil {
+			panic(err)
+		}
+		b := make([]byte, int(tmp2[0]))
+		if _, err := io.ReadFull(r, b); err != nil {
+			panic(err)
+		}
+		transliterations[int(chr)] = []rune(string(b))
+	}
+}

vendor/src/github.com/rainycape/unidecode/make_table.go

@@ -0,0 +1,71 @@
+// +build none
+
+package main
+
+import (
+	"bytes"
+	"compress/zlib"
+	"encoding/binary"
+	"fmt"
+	"go/format"
+	"io/ioutil"
+	"strconv"
+	"strings"
+)
+
+func main() {
+	data, err := ioutil.ReadFile("table.txt")
+	if err != nil {
+		panic(err)
+	}
+	var buf bytes.Buffer
+	for _, line := range strings.Split(string(data), "\n") {
+		if strings.HasPrefix(line, "/*") || line == "" {
+			continue
+		}
+		sep := strings.IndexByte(line, ':')
+		if sep == -1 {
+			panic(line)
+		}
+		val, err := strconv.ParseInt(line[:sep], 0, 32)
+		if err != nil {
+			panic(err)
+		}
+		s, err := strconv.Unquote(line[sep+2:])
+		if err != nil {
+			panic(err)
+		}
+		if s == "" {
+			continue
+		}
+		if err := binary.Write(&buf, binary.LittleEndian, uint16(val)); err != nil {
+			panic(err)
+		}
+		if err := binary.Write(&buf, binary.LittleEndian, uint8(len(s))); err != nil {
+			panic(err)
+		}
+		buf.WriteString(s)
+	}
+	var cbuf bytes.Buffer
+	w, err := zlib.NewWriterLevel(&cbuf, zlib.BestCompression)
+	if err != nil {
+		panic(err)
+	}
+	if _, err := w.Write(buf.Bytes()); err != nil {
+		panic(err)
+	}
+	if err := w.Close(); err != nil {
+		panic(err)
+	}
+	buf.Reset()
+	buf.WriteString("package unidecode\n")
+	buf.WriteString("// AUTOGENERATED - DO NOT EDIT!\n\n")
+	fmt.Fprintf(&buf, "var tableData = %q;\n", cbuf.String())
+	dst, err := format.Source(buf.Bytes())
+	if err != nil {
+		panic(err)
+	}
+	if err := ioutil.WriteFile("table.go", dst, 0644); err != nil {
+		panic(err)
+	}
+}

vendor/src/github.com/rainycape/unidecode/unidecode.go

@@ -0,0 +1,58 @@
+// Package unidecode implements a unicode transliterator
+// which replaces non-ASCII characters with their ASCII
+// approximations.
+package unidecode
+
+//go:generate go run make_table.go
+
+import (
+	"sync"
+	"unicode"
+)
+
+const pooledCapacity = 64
+
+var (
+	slicePool    sync.Pool
+	decodingOnce sync.Once
+)
+
+// Unidecode implements a unicode transliterator, which
+// replaces non-ASCII characters with their ASCII
+// counterparts.
+// Given an unicode encoded string, returns
+// another string with non-ASCII characters replaced
+// with their closest ASCII counterparts.
+// e.g. Unicode("áéíóú") => "aeiou"
+func Unidecode(s string) string {
+	decodingOnce.Do(decodeTransliterations)
+	l := len(s)
+	var r []rune
+	if l > pooledCapacity {
+		r = make([]rune, 0, len(s))
+	} else {
+		if x := slicePool.Get(); x != nil {
+			r = x.([]rune)[:0]
+		} else {
+			r = make([]rune, 0, pooledCapacity)
+		}
+	}
+	for _, c := range s {
+		if c <= unicode.MaxASCII {
+			r = append(r, c)
+			continue
+		}
+		if c > unicode.MaxRune || c > transCount {
+			/* Ignore reserved chars */
+			continue
+		}
+		if d := transliterations[c]; d != nil {
+			r = append(r, d...)
+		}
+	}
+	res := string(r)
+	if l <= pooledCapacity {
+		slicePool.Put(r)
+	}
+	return res
+}

vendor/src/github.com/rainycape/unidecode/unidecode_test.go

@@ -0,0 +1,57 @@
+package unidecode
+
+import (
+	"testing"
+)
+
+func testTransliteration(original string, decoded string, t *testing.T) {
+	if r := Unidecode(original); r != decoded {
+		t.Errorf("Expected '%s', got '%s'\n", decoded, r)
+	}
+}
+
+func TestASCII(t *testing.T) {
+	s := "ABCDEF"
+	testTransliteration(s, s, t)
+}
+
+func TestKnosos(t *testing.T) {
+	o := "Κνωσός"
+	d := "Knosos"
+	testTransliteration(o, d, t)
+}
+
+func TestBeiJing(t *testing.T) {
+	o := "\u5317\u4EB0"
+	d := "Bei Jing "
+	testTransliteration(o, d, t)
+}
+
+func TestEmoji(t *testing.T) {
+	o := "Hey Luna t belle 😵😂"
+	d := "Hey Luna t belle "
+	testTransliteration(o, d, t)
+}
+
+func BenchmarkUnidecode(b *testing.B) {
+	cases := []string{
+		"ABCDEF",
+		"Κνωσός",
+		"\u5317\u4EB0",
+	}
+	for ii := 0; ii < b.N; ii++ {
+		for _, v := range cases {
+			_ = Unidecode(v)
+		}
+	}
+}
+
+func BenchmarkDecodeTable(b *testing.B) {
+	for ii := 0; ii < b.N; ii++ {
+		decodeTransliterations()
+	}
+}
+
+func init() {
+	decodeTransliterations()
+}