@@ -106,8 +106,8 @@ func readBug(repo repository.Repo, ref string) (*Bug, error) {
return nil, err
}
- refSplitted := strings.Split(ref, "/")
- id := refSplitted[len(refSplitted)-1]
+ refSplit := strings.Split(ref, "/")
+ id := refSplit[len(refSplit)-1]
if len(id) != idLength {
return nil, fmt.Errorf("Invalid ref length")
@@ -269,8 +269,8 @@ func refsToIds(refs []string) []string {
ids := make([]string, len(refs))
for i, ref := range refs {
- splitted := strings.Split(ref, "/")
- ids[i] = splitted[len(splitted)-1]
+ split := strings.Split(ref, "/")
+ ids[i] = split[len(split)-1]
}
return ids
@@ -248,13 +248,13 @@ func (repo *GitRepo) ListRefs(refspec string) ([]string, error) {
return nil, err
}
- splitted := strings.Split(stdout, "\n")
+ split := strings.Split(stdout, "\n")
- if len(splitted) == 1 && splitted[0] == "" {
+ if len(split) == 1 && split[0] == "" {
return []string{}, nil
}
- return splitted, nil
+ return split, nil
}
// RefExist will check if a reference exist in Git
@@ -283,10 +283,10 @@ func (repo *GitRepo) ListCommits(ref string) ([]util.Hash, error) {
return nil, err
}
- splitted := strings.Split(stdout, "\n")
+ split := strings.Split(stdout, "\n")
- casted := make([]util.Hash, len(splitted))
- for i, line := range splitted {
+ casted := make([]util.Hash, len(split))
+ for i, line := range split {
casted[i] = util.Hash(line)
}
@@ -91,10 +91,10 @@ func prepareTreeEntries(entries []TreeEntry) bytes.Buffer {
}
func readTreeEntries(s string) ([]TreeEntry, error) {
- splitted := strings.Split(s, "\n")
+ split := strings.Split(s, "\n")
- casted := make([]TreeEntry, len(splitted))
- for i, line := range splitted {
+ casted := make([]TreeEntry, len(split))
+ for i, line := range split {
if line == "" {
continue
}