mirror of
https://github.com/tailscale/tailscale.git
synced 2025-08-11 13:18:53 +00:00
types/views: add SliceView.All iterator (#13536)
And convert a all relevant usages. Updates #12912 Signed-off-by: Joe Tsai <joetsai@digital-static.net>
This commit is contained in:
@@ -93,8 +93,7 @@ func (b *LocalBackend) driveSetShareLocked(share *drive.Share) (views.SliceView[
|
||||
|
||||
addedShare := false
|
||||
var shares []*drive.Share
|
||||
for i := range existingShares.Len() {
|
||||
existing := existingShares.At(i)
|
||||
for _, existing := range existingShares.All() {
|
||||
if existing.Name() != share.Name {
|
||||
if !addedShare && existing.Name() > share.Name {
|
||||
// Add share in order
|
||||
@@ -152,8 +151,7 @@ func (b *LocalBackend) driveRenameShareLocked(oldName, newName string) (views.Sl
|
||||
|
||||
found := false
|
||||
var shares []*drive.Share
|
||||
for i := range existingShares.Len() {
|
||||
existing := existingShares.At(i)
|
||||
for _, existing := range existingShares.All() {
|
||||
if existing.Name() == newName {
|
||||
return existingShares, os.ErrExist
|
||||
}
|
||||
@@ -213,8 +211,7 @@ func (b *LocalBackend) driveRemoveShareLocked(name string) (views.SliceView[*dri
|
||||
|
||||
found := false
|
||||
var shares []*drive.Share
|
||||
for i := range existingShares.Len() {
|
||||
existing := existingShares.At(i)
|
||||
for _, existing := range existingShares.All() {
|
||||
if existing.Name() != name {
|
||||
shares = append(shares, existing.AsStruct())
|
||||
} else {
|
||||
|
@@ -511,8 +511,8 @@ func NewLocalBackend(logf logger.Logf, logID logid.PublicID, sys *tsd.System, lo
|
||||
currentShares := b.pm.prefs.DriveShares()
|
||||
if currentShares.Len() > 0 {
|
||||
var shares []*drive.Share
|
||||
for i := range currentShares.Len() {
|
||||
shares = append(shares, currentShares.At(i).AsStruct())
|
||||
for _, share := range currentShares.All() {
|
||||
shares = append(shares, share.AsStruct())
|
||||
}
|
||||
fs.SetShares(shares)
|
||||
}
|
||||
@@ -6184,8 +6184,8 @@ func wireguardExitNodeDNSResolvers(nm *netmap.NetworkMap, peers map[tailcfg.Node
|
||||
resolvers := p.ExitNodeDNSResolvers()
|
||||
if !resolvers.IsNil() && resolvers.Len() > 0 {
|
||||
copies := make([]*dnstype.Resolver, resolvers.Len())
|
||||
for i := range resolvers.Len() {
|
||||
copies[i] = resolvers.At(i).AsStruct()
|
||||
for i, r := range resolvers.All() {
|
||||
copies[i] = r.AsStruct()
|
||||
}
|
||||
return copies, true
|
||||
}
|
||||
|
Reference in New Issue
Block a user