mirror of
https://github.com/hanzoai/forge.git
synced 2026-10-30 15:00:39 +00:00
zeekayandHanzo Dev
aa87442fdd
Source files keep their SPDX-License-Identifier and Hanzo copyright line; the Gitea, Gogs and LFS Test Server copyrights they used to repeat now live once in NOTICE, alongside LICENSE. The header lint accepts any copyright line above the SPDX line, so it no longer demands an upstream one. Co-authored-by: Hanzo Dev <[email protected]>
140 lines
3.0 KiB
Go
140 lines
3.0 KiB
Go
// Copyright 2026 Hanzo AI, Inc. All rights reserved.
|
|
// SPDX-License-Identifier: MIT
|
|
|
|
package git
|
|
|
|
import (
|
|
"fmt"
|
|
"testing"
|
|
|
|
"github.com/stretchr/testify/assert"
|
|
)
|
|
|
|
func TestBranchRuleMatchPriority(t *testing.T) {
|
|
kases := []struct {
|
|
Rules []string
|
|
BranchName string
|
|
ExpectedMatchIdx int
|
|
}{
|
|
{
|
|
Rules: []string{"release/*", "release/v1.17"},
|
|
BranchName: "release/v1.17",
|
|
ExpectedMatchIdx: 1,
|
|
},
|
|
{
|
|
Rules: []string{"release/v1.17", "release/*"},
|
|
BranchName: "release/v1.17",
|
|
ExpectedMatchIdx: 0,
|
|
},
|
|
{
|
|
Rules: []string{"release/**/v1.17", "release/test/v1.17"},
|
|
BranchName: "release/test/v1.17",
|
|
ExpectedMatchIdx: 1,
|
|
},
|
|
{
|
|
Rules: []string{"release/test/v1.17", "release/**/v1.17"},
|
|
BranchName: "release/test/v1.17",
|
|
ExpectedMatchIdx: 0,
|
|
},
|
|
{
|
|
Rules: []string{"release/**", "release/v1.0.0"},
|
|
BranchName: "release/v1.0.0",
|
|
ExpectedMatchIdx: 1,
|
|
},
|
|
{
|
|
Rules: []string{"release/v1.0.0", "release/**"},
|
|
BranchName: "release/v1.0.0",
|
|
ExpectedMatchIdx: 0,
|
|
},
|
|
{
|
|
Rules: []string{"release/**", "release/v1.0.0"},
|
|
BranchName: "release/v2.0.0",
|
|
ExpectedMatchIdx: 0,
|
|
},
|
|
{
|
|
Rules: []string{"release/*", "release/v1.0.0"},
|
|
BranchName: "release/1/v2.0.0",
|
|
ExpectedMatchIdx: -1,
|
|
},
|
|
}
|
|
|
|
for _, kase := range kases {
|
|
var pbs ProtectedBranchRules
|
|
for _, rule := range kase.Rules {
|
|
pbs = append(pbs, &ProtectedBranch{RuleName: rule})
|
|
}
|
|
pbs.sort()
|
|
matchedPB := pbs.GetFirstMatched(kase.BranchName)
|
|
if matchedPB == nil {
|
|
if kase.ExpectedMatchIdx >= 0 {
|
|
assert.Error(t, fmt.Errorf("no matched rules but expected %s[%d]", kase.Rules[kase.ExpectedMatchIdx], kase.ExpectedMatchIdx))
|
|
}
|
|
} else {
|
|
assert.Equal(t, kase.Rules[kase.ExpectedMatchIdx], matchedPB.RuleName)
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestBranchRuleSortLegacy(t *testing.T) {
|
|
in := []*ProtectedBranch{{
|
|
RuleName: "b",
|
|
CreatedUnix: 1,
|
|
}, {
|
|
RuleName: "b/*",
|
|
CreatedUnix: 3,
|
|
}, {
|
|
RuleName: "a/*",
|
|
CreatedUnix: 2,
|
|
}, {
|
|
RuleName: "c",
|
|
CreatedUnix: 0,
|
|
}, {
|
|
RuleName: "a",
|
|
CreatedUnix: 4,
|
|
}}
|
|
expect := []string{"c", "b", "a", "a/*", "b/*"}
|
|
|
|
pbr := ProtectedBranchRules(in)
|
|
pbr.sort()
|
|
|
|
var got []string
|
|
for i := range pbr {
|
|
got = append(got, pbr[i].RuleName)
|
|
}
|
|
assert.Equal(t, expect, got)
|
|
}
|
|
|
|
func TestBranchRuleSortPriority(t *testing.T) {
|
|
in := []*ProtectedBranch{{
|
|
RuleName: "b",
|
|
CreatedUnix: 1,
|
|
Priority: 4,
|
|
}, {
|
|
RuleName: "b/*",
|
|
CreatedUnix: 3,
|
|
Priority: 2,
|
|
}, {
|
|
RuleName: "a/*",
|
|
CreatedUnix: 2,
|
|
Priority: 1,
|
|
}, {
|
|
RuleName: "c",
|
|
CreatedUnix: 0,
|
|
Priority: 0,
|
|
}, {
|
|
RuleName: "a",
|
|
CreatedUnix: 4,
|
|
Priority: 3,
|
|
}}
|
|
expect := []string{"c", "a/*", "b/*", "a", "b"}
|
|
|
|
pbr := ProtectedBranchRules(in)
|
|
pbr.sort()
|
|
|
|
var got []string
|
|
for i := range pbr {
|
|
got = append(got, pbr[i].RuleName)
|
|
}
|
|
assert.Equal(t, expect, got)
|
|
}
|