-
-
Notifications
You must be signed in to change notification settings - Fork 52
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
[fix] replace Id with id in method names
- Loading branch information
1 parent
232c878
commit 1e2b17d
Showing
2 changed files
with
97 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,88 @@ | ||
package plugin | ||
|
||
import ( | ||
"unicode" | ||
"unicode/utf8" | ||
) | ||
|
||
// Split splits the camelcase word and returns a list of words. It also | ||
// supports digits. Both lower camel case and upper camel case are supported. | ||
// For more info please check: http://en.wikipedia.org/wiki/CamelCase | ||
// | ||
// Examples | ||
// | ||
// "" => [""] | ||
// "lowercase" => ["lowercase"] | ||
// "Class" => ["Class"] | ||
// "MyClass" => ["My", "Class"] | ||
// "MyC" => ["My", "C"] | ||
// "HTML" => ["HTML"] | ||
// "PDFLoader" => ["PDF", "Loader"] | ||
// "AString" => ["A", "String"] | ||
// "SimpleXMLParser" => ["Simple", "XML", "Parser"] | ||
// "vimRPCPlugin" => ["vim", "RPC", "Plugin"] | ||
// "GL11Version" => ["GL", "11", "Version"] | ||
// "99Bottles" => ["99", "Bottles"] | ||
// "May5" => ["May", "5"] | ||
// "BFG9000" => ["BFG", "9000"] | ||
// "BöseÜberraschung" => ["Böse", "Überraschung"] | ||
// "Two spaces" => ["Two", " ", "spaces"] | ||
// "BadUTF8\xe2\xe2\xa1" => ["BadUTF8\xe2\xe2\xa1"] | ||
// | ||
// Splitting rules | ||
// | ||
// 1) If string is not valid UTF-8, return it without splitting as | ||
// single item array. | ||
// 2) Assign all unicode characters into one of 4 sets: lower case | ||
// letters, upper case letters, numbers, and all other characters. | ||
// 3) Iterate through characters of string, introducing splits | ||
// between adjacent characters that belong to different sets. | ||
// 4) Iterate through array of split strings, and if a given string | ||
// is upper case: | ||
// if subsequent string is lower case: | ||
// move last character of upper case string to beginning of | ||
// lower case string | ||
func SplitCamelCase(src string) (entries []string) { | ||
// don't split invalid utf8 | ||
if !utf8.ValidString(src) { | ||
return []string{src} | ||
} | ||
entries = []string{} | ||
var runes [][]rune | ||
lastClass := 0 | ||
class := 0 | ||
// split into fields based on class of unicode character | ||
for _, r := range src { | ||
switch true { | ||
case unicode.IsLower(r): | ||
class = 1 | ||
case unicode.IsUpper(r): | ||
class = 2 | ||
case unicode.IsDigit(r): | ||
class = 3 | ||
default: | ||
class = 4 | ||
} | ||
if class == lastClass { | ||
runes[len(runes)-1] = append(runes[len(runes)-1], r) | ||
} else { | ||
runes = append(runes, []rune{r}) | ||
} | ||
lastClass = class | ||
} | ||
// handle upper case -> lower case sequences, e.g. | ||
// "PDFL", "oader" -> "PDF", "Loader" | ||
for i := 0; i < len(runes)-1; i++ { | ||
if unicode.IsUpper(runes[i][0]) && unicode.IsLower(runes[i+1][0]) { | ||
runes[i+1] = append([]rune{runes[i][len(runes[i])-1]}, runes[i+1]...) | ||
runes[i] = runes[i][:len(runes[i])-1] | ||
} | ||
} | ||
// construct []string from results | ||
for _, s := range runes { | ||
if len(s) > 0 { | ||
entries = append(entries, string(s)) | ||
} | ||
} | ||
return | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters