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 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227
|
//
// Copyright 2020-2022 Sean C Foley
//
// 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 ipaddr
// Iterator iterates collections, such as subnets and sequential address ranges.
type Iterator[T any] interface {
// HasNext returns true if there is another item to iterate, false otherwise.
HasNext() bool
// Next returns the next item, or the zero value for T if there is none left.
Next() T
}
// IteratorWithRemove is an iterator that provides a removal operation.
type IteratorWithRemove[T any] interface {
Iterator[T]
// Remove removes the last iterated item from the underlying data structure or collection, and returns that element.
// If there is no such element, it returns the zero value for T.
Remove() T
}
//
type singleIterator[T any] struct {
empty bool
original T
}
func (it *singleIterator[T]) HasNext() bool {
return !it.empty
}
func (it *singleIterator[T]) Next() (res T) {
if it.HasNext() {
res = it.original
it.empty = true
}
return
}
//
type multiAddrIterator struct {
Iterator[*AddressSection]
zone Zone
}
func (it multiAddrIterator) Next() (res *Address) {
if it.HasNext() {
sect := it.Iterator.Next()
res = createAddress(sect, it.zone)
}
return
}
func nilAddrIterator() Iterator[*Address] {
return &singleIterator[*Address]{}
}
func nilIterator[T any]() Iterator[T] {
return &singleIterator[T]{}
}
func addrIterator(
single bool,
original *Address,
prefixLen PrefixLen,
valsAreMultiple bool,
iterator Iterator[[]*AddressDivision]) Iterator[*Address] {
if single {
return &singleIterator[*Address]{original: original}
}
return multiAddrIterator{
Iterator: &multiSectionIterator{
original: original.section,
iterator: iterator,
valsAreMultiple: valsAreMultiple,
prefixLen: prefixLen,
},
zone: original.zone,
}
}
func prefixAddrIterator(
single bool,
original *Address,
prefixLen PrefixLen,
iterator Iterator[[]*AddressDivision]) Iterator[*Address] {
if single {
return &singleIterator[*Address]{original: original}
}
var zone Zone
if original != nil {
zone = original.zone
}
return multiAddrIterator{
Iterator: &prefixSectionIterator{
original: original.section,
iterator: iterator,
prefixLen: prefixLen,
},
zone: zone,
}
}
// this one is used by the sequential ranges
func rangeAddrIterator(
single bool,
original *Address,
prefixLen PrefixLen,
valsAreMultiple bool,
iterator Iterator[[]*AddressDivision]) Iterator[*Address] {
return addrIterator(single, original, prefixLen, valsAreMultiple, iterator)
}
type ipAddrIterator struct {
Iterator[*Address]
}
func (iter ipAddrIterator) Next() *IPAddress {
return iter.Iterator.Next().ToIP()
}
//
type sliceIterator[T any] struct {
elements []T
}
func (iter *sliceIterator[T]) HasNext() bool {
return len(iter.elements) > 0
}
func (iter *sliceIterator[T]) Next() (res T) {
if iter.HasNext() {
res = iter.elements[0]
iter.elements = iter.elements[1:]
}
return
}
//
type ipv4AddressIterator struct {
Iterator[*Address]
}
func (iter ipv4AddressIterator) Next() *IPv4Address {
return iter.Iterator.Next().ToIPv4()
}
//
type ipv6AddressIterator struct {
Iterator[*Address]
}
func (iter ipv6AddressIterator) Next() *IPv6Address {
return iter.Iterator.Next().ToIPv6()
}
//
type macAddressIterator struct {
Iterator[*Address]
}
func (iter macAddressIterator) Next() *MACAddress {
return iter.Iterator.Next().ToMAC()
}
//
type addressSeriesIterator struct {
Iterator[*Address]
}
func (iter addressSeriesIterator) Next() ExtendedSegmentSeries {
if !iter.HasNext() {
return nil
}
return wrapAddress(iter.Iterator.Next())
}
//
type ipaddressSeriesIterator struct {
Iterator[*IPAddress]
}
func (iter ipaddressSeriesIterator) Next() ExtendedIPSegmentSeries {
if !iter.HasNext() {
return nil
}
return iter.Iterator.Next().Wrap()
}
//
type sectionSeriesIterator struct {
Iterator[*AddressSection]
}
func (iter sectionSeriesIterator) Next() ExtendedSegmentSeries {
if !iter.HasNext() {
return nil
}
return wrapSection(iter.Iterator.Next())
}
//
type ipSectionSeriesIterator struct {
Iterator[*IPAddressSection]
}
func (iter ipSectionSeriesIterator) Next() ExtendedIPSegmentSeries {
if !iter.HasNext() {
return nil
}
return wrapIPSection(iter.Iterator.Next())
}
|