forked from networkservicemesh/fanout
-
Notifications
You must be signed in to change notification settings - Fork 0
/
domain.go
119 lines (108 loc) · 2.56 KB
/
domain.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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
// Copyright (c) 2020 Doc.ai and/or its affiliates.
//
// SPDX-License-Identifier: Apache-2.0
//
// 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 fanout
import (
"strings"
)
// Domain represents DNS domain name
type Domain interface {
Get(string) Domain
AddString(string)
Add(string, Domain)
Contains(string) bool
IsFinal() bool
Finish()
}
type domain struct {
children map[string]Domain
end bool
}
// Finish marks current domain as last in the chain
func (l *domain) Finish() {
l.end = true
}
// Add adds domain by name
func (l *domain) Add(n string, d Domain) {
l.children[n] = d
}
// IsFinal returns true if this domain is last in the chain
func (l *domain) IsFinal() bool {
return l.end
}
// Contains parses string and check is domains contains
func (l *domain) Contains(s string) bool {
end := len(s)
var curr Domain = l
for start := strings.LastIndex(s, "."); start != -1; start = strings.LastIndex(s[:start], ".") {
var k string
if start == end-1 {
k = "."
} else {
k = s[start+1 : end]
}
end = start
curr = curr.Get(k)
if curr == nil {
return false
}
if curr.IsFinal() {
return true
}
}
curr = curr.Get(s[:end])
if curr == nil {
return false
}
return curr.IsFinal()
}
// AddString parses string and adds child domains
func (l *domain) AddString(s string) {
end := len(s)
var curr = Domain(l)
for start := strings.LastIndex(s, "."); start != -1; start = strings.LastIndex(s[:start], ".") {
var k string
if start == end-1 {
k = "."
} else {
k = s[start+1 : end]
}
end = start
if v := curr.Get(k); v != nil {
if v.IsFinal() {
return
}
curr = v
} else {
next := &domain{children: map[string]Domain{}}
curr.Add(k, next)
curr = next
}
}
if s != "." {
next := &domain{children: map[string]Domain{}, end: true}
curr.Add(s[:end], next)
} else {
curr.Finish()
}
}
// Get returns child domain by name
func (l *domain) Get(s string) Domain {
return l.children[s]
}
// NewDomain creates new domain instance
func NewDomain() Domain {
return &domain{children: map[string]Domain{}}
}