-
Notifications
You must be signed in to change notification settings - Fork 326
/
Copy pathsubcmd_idx.go
89 lines (82 loc) · 2.18 KB
/
subcmd_idx.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
// Copyright (C) 2017 Google Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package api
// SubCmdIdx is a qualified path from a particular index to a given subcommand.
type SubCmdIdx []uint64
// LessThan returns true if s comes before s2.
func (s SubCmdIdx) LessThan(s2 SubCmdIdx) bool {
for i := range s {
if i > len(s2)-1 {
// This case is a bit weird, but
// {0} > {0, 1}, since {0} represents
// the ALL commands under 0.
return true
}
if s[i] < s2[i] {
return true
}
if s[i] > s2[i] {
return false
}
}
return false
}
// LEQ returns true if s comes before s2.
func (s SubCmdIdx) LEQ(s2 SubCmdIdx) bool {
for i := range s {
if i > len(s2)-1 {
// This case is a bit weird, but
// {0} > {0, 1}, since {0} represents
// the ALL commands under 0.
return true
}
if s[i] < s2[i] {
return true
}
if s[i] > s2[i] {
return false
}
}
return true
}
// Equals returns true if both sets of subcommand indices are the same.
func (s SubCmdIdx) Equals(s2 SubCmdIdx) bool {
if len(s) != len(s2) {
return false
}
for i := range s {
if s[i] != s2[i] {
return false
}
}
return true
}
// Decrement returns the subcommand that preceded this subcommand.
// Decrement will decrement its way UP subcommand chains.
// Eg: {0, 1}.Decrement() == {0, 0}
// {1, 0}.Decrement() == {0}
// {0}.Decrement() == {}
func (s *SubCmdIdx) Decrement() {
for len(*s) > 0 {
if (*s)[len(*s)-1] > 0 {
(*s)[len(*s)-1]--
return
}
*s = (*s)[:len(*s)-1]
}
}
// Contains returns true if s is one of the parent nodes of s2 or equals to s2.
func (s SubCmdIdx) Contains(s2 SubCmdIdx) bool {
return len(s2) >= len(s) && len(s) != 0 && s.Equals(s2[:len(s)])
}