mirror of
				https://github.com/go-gitea/gitea
				synced 2025-10-31 11:28:24 +00:00 
			
		
		
		
	
		
			
				
	
	
		
			73 lines
		
	
	
		
			1.6 KiB
		
	
	
	
		
			Go
		
	
	
	
		
			Vendored
		
	
	
	
			
		
		
	
	
			73 lines
		
	
	
		
			1.6 KiB
		
	
	
	
		
			Go
		
	
	
	
		
			Vendored
		
	
	
	
| // Copyright 2019 The Xorm Authors. All rights reserved.
 | |
| // Use of this source code is governed by a BSD-style
 | |
| // license that can be found in the LICENSE file.
 | |
| 
 | |
| package schemas
 | |
| 
 | |
| import (
 | |
| 	"fmt"
 | |
| 	"strings"
 | |
| )
 | |
| 
 | |
| // enumerate all index types
 | |
| const (
 | |
| 	IndexType = iota + 1
 | |
| 	UniqueType
 | |
| )
 | |
| 
 | |
| // Index represents a database index
 | |
| type Index struct {
 | |
| 	IsRegular bool
 | |
| 	Name      string
 | |
| 	Type      int
 | |
| 	Cols      []string
 | |
| }
 | |
| 
 | |
| // NewIndex new an index object
 | |
| func NewIndex(name string, indexType int) *Index {
 | |
| 	return &Index{true, name, indexType, make([]string, 0)}
 | |
| }
 | |
| 
 | |
| // XName returns the special index name for the table
 | |
| func (index *Index) XName(tableName string) string {
 | |
| 	if !strings.HasPrefix(index.Name, "UQE_") &&
 | |
| 		!strings.HasPrefix(index.Name, "IDX_") {
 | |
| 		tableParts := strings.Split(strings.Replace(tableName, `"`, "", -1), ".")
 | |
| 		tableName = tableParts[len(tableParts)-1]
 | |
| 		if index.Type == UniqueType {
 | |
| 			return fmt.Sprintf("UQE_%v_%v", tableName, index.Name)
 | |
| 		}
 | |
| 		return fmt.Sprintf("IDX_%v_%v", tableName, index.Name)
 | |
| 	}
 | |
| 	return index.Name
 | |
| }
 | |
| 
 | |
| // AddColumn add columns which will be composite index
 | |
| func (index *Index) AddColumn(cols ...string) {
 | |
| 	index.Cols = append(index.Cols, cols...)
 | |
| }
 | |
| 
 | |
| // Equal return true if the two Index is equal
 | |
| func (index *Index) Equal(dst *Index) bool {
 | |
| 	if index.Type != dst.Type {
 | |
| 		return false
 | |
| 	}
 | |
| 	if len(index.Cols) != len(dst.Cols) {
 | |
| 		return false
 | |
| 	}
 | |
| 
 | |
| 	for i := 0; i < len(index.Cols); i++ {
 | |
| 		var found bool
 | |
| 		for j := 0; j < len(dst.Cols); j++ {
 | |
| 			if index.Cols[i] == dst.Cols[j] {
 | |
| 				found = true
 | |
| 				break
 | |
| 			}
 | |
| 		}
 | |
| 		if !found {
 | |
| 			return false
 | |
| 		}
 | |
| 	}
 | |
| 	return true
 | |
| }
 |