Mainflux.mainflux/twins/mocks/states.go

102 lines
2.2 KiB
Go

// Copyright (c) Mainflux
// SPDX-License-Identifier: Apache-2.0
package mocks
import (
"context"
"fmt"
"sort"
"strings"
"sync"
"github.com/mainflux/mainflux/twins"
)
var _ twins.StateRepository = (*stateRepositoryMock)(nil)
type stateRepositoryMock struct {
mu sync.Mutex
counter uint64
states map[string]twins.State
}
// NewStateRepository creates in-memory twin repository.
func NewStateRepository() twins.StateRepository {
return &stateRepositoryMock{
states: make(map[string]twins.State),
}
}
// SaveState persists the state
func (srm *stateRepositoryMock) Save(ctx context.Context, st twins.State) error {
srm.mu.Lock()
defer srm.mu.Unlock()
srm.states[key(st.TwinID, string(st.ID))] = st
return nil
}
// CountStates returns the number of states related to twin
func (srm *stateRepositoryMock) Count(ctx context.Context, tw twins.Twin) (int64, error) {
return int64(len(srm.states)), nil
}
func (srm *stateRepositoryMock) RetrieveAll(ctx context.Context, offset uint64, limit uint64, id string) (twins.StatesPage, error) {
srm.mu.Lock()
defer srm.mu.Unlock()
items := make([]twins.State, 0)
if limit <= 0 {
return twins.StatesPage{}, nil
}
// This obscure way to examine map keys is enforced by the key structure in mocks/commons.go
prefix := fmt.Sprintf("%s-", id)
for k, v := range srm.states {
if !strings.HasPrefix(k, prefix) {
continue
}
id := uint64(v.ID)
if id > offset && id < limit {
items = append(items, v)
}
if (uint64)(len(items)) >= limit {
break
}
}
sort.SliceStable(items, func(i, j int) bool {
return items[i].ID < items[j].ID
})
page := twins.StatesPage{
States: items,
PageMetadata: twins.PageMetadata{
Total: srm.counter,
Offset: offset,
Limit: limit,
},
}
return page, nil
}
// RetrieveLast returns the last state related to twin spec by id
func (srm *stateRepositoryMock) RetrieveLast(ctx context.Context, id string) (twins.State, error) {
srm.mu.Lock()
defer srm.mu.Unlock()
items := make([]twins.State, 0)
for _, v := range srm.states {
items = append(items, v)
}
sort.SliceStable(items, func(i, j int) bool {
return items[i].ID < items[j].ID
})
return items[len(items)-1], nil
}