refactor: modernize Go syntax with range over integers

api/models/graph.go

@@ -5,7 +5,7 @@
 func (g Graph) GetTree(current string) Graph {
 	graph := Graph{}
 	queue := []string{current}
-	for i := 0; i < len(queue); i++ {
+	for i := range len(queue) {
 		k := queue[i]
 		for _, v := range g[k] {
 			queue = append(queue, v)

dependency_graph.go

@@ -215,7 +215,7 @@ func (g *DependencyGraphBuilder) sort(key []string, key2Model func(string) iDepe
 			queue = append(queue, k)
 		}
 	}
-	for i := 0; i < len(queue); i++ {
+	for i := range len(queue) {
 		node := queue[i]
 		for _, v := range graph[node] {
 			inDegree[v]--

dictionary_adapter.go

@@ -51,7 +51,7 @@ func GetDependencyTree(adapter IAdapter, current string) (models.Graph, error) {
 	visit := map[string]bool{current: true}
 	graph := models.Graph{current: nil}
 	queue := []string{current}
-	for i := 0; i < len(queue); i++ {
+	for i := range len(queue) {
 		node, err := adapter.GetSourceByKey(queue[i])
 		if err != nil {
 			return nil, err

dictionary_column.go

@@ -111,7 +111,7 @@ func isSameColumnTables(t1, t2 []string) error {
 	sort.Strings(t1)
 	sort.Strings(t2)
 	// TODO linq
-	for i := 0; i < len(t1); i++ {
+	for i := range len(t1) {
 		if t1[i] != t2[i] {
 			return fmt.Errorf("table is not same t1=%v, t2=%v", t1, t2)
 		}

dictionary_splitter.go

@@ -290,7 +290,7 @@ func (n *NormalClauseSplitter) buildDimensionJoin() []*types.Join {
 		}
 		ds1, dl1, ds2, dl2 := v.Get1().DataSource, v.Get1().Dimension, v.Get2().DataSource, v.Get2().Dimension
 		var on []*types.JoinOn
-		for i := 0; i < len(dl1); i++ {
+		for i := range len(dl1) {
 			k1 := fmt.Sprintf("%v.%v", ds1, dl1[i])
 			k2 := fmt.Sprintf("%v.%v", ds2, dl2[i])
 			d1, _ := dGraph.GetDimension(k1)