62b57143c8
* Refactor to use structured logging * Properly formatted with gofmt * created interface Cache, but construction of cache is still coupled. * Implementing cache factories to build caches * Simple redis implementation without error handling. Keys and values by default are string * refactor NewLocalCacheLayer to inject cache factory * Removed redis impl to focus on cache abstraction * CacheFactory injected on sqlsupplier and saved in Store struct * remove useless private method * replace concrete declaration of lru cache to cache abstraction * discard spaces * Renamed factory to provider because concrete implementations of factories may hold an state (such as a redis client for example) * refactor to include all caches in the same package cache and subpackages * method close cache. This method will be used for concrete implementations that need to release resources (close a connection, etc) * closing cacheprovider and releasing resources while closing sql store * fixed merge conflict fail * gofmt files * remove unused property from post_store * naming refactor to avoid stutter. Added godocs on interface * Store doesnt know anything about the cache and provider. Cache provider will be built after loading config and injected in localCacheLayer * fixed broken test * cache provider initialized before RunOldAppInitialization which initializes the localcachelayer * move statusCache to server to initialize it with the new cache provider * update terms_service and channel_layer to have new cacheProvider * gofmt * Add Connect method to the cache provider * mock cacheprovider in user_layer_test Co-authored-by: Ben Schumacher <ben.schumacher@mattermost.com> Co-authored-by: mattermod <mattermod@users.noreply.github.com>
125 строки
3.0 KiB
Go
125 строки
3.0 KiB
Go
// Copyright (c) 2015-present Mattermost, Inc. All Rights Reserved.
|
|
// See LICENSE.txt for license information.
|
|
|
|
// This files was copied/modified from https://github.com/hashicorp/golang-lru
|
|
// which was (see below)
|
|
|
|
// This package provides a simple LRU cache. It is based on the
|
|
// LRU implementation in groupcache:
|
|
// https://github.com/golang/groupcache/tree/master/lru
|
|
|
|
package lru
|
|
|
|
import (
|
|
"testing"
|
|
"time"
|
|
|
|
"github.com/stretchr/testify/assert"
|
|
"github.com/stretchr/testify/require"
|
|
)
|
|
|
|
func TestLRU(t *testing.T) {
|
|
l := New(128)
|
|
|
|
for i := 0; i < 256; i++ {
|
|
l.Add(i, i)
|
|
}
|
|
require.Equalf(t, l.Len(), 128, "bad len: %v", l.Len())
|
|
|
|
for i, k := range l.Keys() {
|
|
v, ok := l.Get(k)
|
|
require.True(t, ok, "bad key: %v", k)
|
|
require.Equalf(t, v, k, "bad key: %v", k)
|
|
require.Equalf(t, i+128, v, "bad key: %v", k)
|
|
}
|
|
for i := 0; i < 128; i++ {
|
|
_, ok := l.Get(i)
|
|
require.False(t, ok, "should be evicted")
|
|
}
|
|
for i := 128; i < 256; i++ {
|
|
_, ok := l.Get(i)
|
|
require.True(t, ok, "should not be evicted")
|
|
}
|
|
for i := 128; i < 192; i++ {
|
|
l.Remove(i)
|
|
_, ok := l.Get(i)
|
|
require.False(t, ok, "should be deleted")
|
|
}
|
|
|
|
l.Get(192) // expect 192 to be last key in l.Keys()
|
|
|
|
for i, k := range l.Keys() {
|
|
require.Falsef(t, (i < 63 && k != i+193), "out of order key: %v", k)
|
|
require.Falsef(t, (i == 63 && k != 192), "out of order key: %v", k)
|
|
}
|
|
|
|
l.Purge()
|
|
require.Equalf(t, l.Len(), 0, "bad len: %v", l.Len())
|
|
_, ok := l.Get(200)
|
|
require.False(t, ok, "should contain nothing")
|
|
}
|
|
|
|
func TestLRUExpire(t *testing.T) {
|
|
l := New(128)
|
|
|
|
l.AddWithExpiresInSecs(1, 1, 1)
|
|
l.AddWithExpiresInSecs(2, 2, 1)
|
|
l.AddWithExpiresInSecs(3, 3, 0)
|
|
|
|
time.Sleep(time.Millisecond * 2100)
|
|
|
|
r1, ok := l.Get(1)
|
|
require.False(t, ok, r1)
|
|
|
|
_, ok2 := l.Get(3)
|
|
require.True(t, ok2, "should exist")
|
|
}
|
|
|
|
func TestLRUGetOrAdd(t *testing.T) {
|
|
l := New(128)
|
|
|
|
// First GetOrAdd should save
|
|
value, loaded := l.GetOrAdd(1, 1, 0)
|
|
assert.Equal(t, 1, value)
|
|
assert.False(t, loaded)
|
|
|
|
// Second GetOrAdd should load original value, ignoring new value
|
|
value, loaded = l.GetOrAdd(1, 10, 0)
|
|
assert.Equal(t, 1, value)
|
|
assert.True(t, loaded)
|
|
|
|
// Third GetOrAdd should still load original value
|
|
value, loaded = l.GetOrAdd(1, 1, 0)
|
|
assert.Equal(t, 1, value)
|
|
assert.True(t, loaded)
|
|
|
|
// First GetOrAdd on a new key should save
|
|
value, loaded = l.GetOrAdd(2, 2, 0)
|
|
assert.Equal(t, 2, value)
|
|
assert.False(t, loaded)
|
|
|
|
l.Remove(1)
|
|
|
|
// GetOrAdd after a remove should save
|
|
value, loaded = l.GetOrAdd(1, 10, 0)
|
|
assert.Equal(t, 10, value)
|
|
assert.False(t, loaded)
|
|
|
|
// GetOrAdd after another key was removed should load original value for key
|
|
value, loaded = l.GetOrAdd(2, 2, 0)
|
|
assert.Equal(t, 2, value)
|
|
assert.True(t, loaded)
|
|
|
|
// GetOrAdd should expire
|
|
value, loaded = l.GetOrAdd(3, 3, 500*time.Millisecond)
|
|
assert.Equal(t, 3, value)
|
|
assert.False(t, loaded)
|
|
value, loaded = l.GetOrAdd(3, 4, 500*time.Millisecond)
|
|
assert.Equal(t, 3, value)
|
|
assert.True(t, loaded)
|
|
time.Sleep(1 * time.Second)
|
|
value, loaded = l.GetOrAdd(3, 5, 500*time.Millisecond)
|
|
assert.Equal(t, 5, value)
|
|
assert.False(t, loaded)
|
|
}
|