-
Notifications
You must be signed in to change notification settings - Fork 450
/
cache.go
72 lines (62 loc) · 2.15 KB
/
cache.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
// Copyright (c) 2018 Uber Technologies, Inc.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
package transform
import (
"sync"
"github.com/m3db/m3/src/query/block"
"github.com/m3db/m3/src/query/parser"
"github.com/pkg/errors"
)
// BlockCache is used to cache blocks
type BlockCache struct {
blocks map[parser.NodeID]block.Block
mu sync.Mutex
}
// NewBlockCache creates a new BlockCache
func NewBlockCache() *BlockCache {
return &BlockCache{
blocks: make(map[parser.NodeID]block.Block),
}
}
// Add the block to the cache, errors out if block already exists
func (c *BlockCache) Add(key parser.NodeID, b block.Block) error {
c.mu.Lock()
defer c.mu.Unlock()
_, ok := c.blocks[key]
if ok {
return errors.New("block already exists")
}
c.blocks[key] = b
return nil
}
// Remove the block from the cache
func (c *BlockCache) Remove(key parser.NodeID) {
c.mu.Lock()
defer c.mu.Unlock()
delete(c.blocks, key)
}
// Get the block from the cache
// TODO: Evaluate only a single process getting a block at a time
func (c *BlockCache) Get(key parser.NodeID) (block.Block, bool) {
c.mu.Lock()
defer c.mu.Unlock()
b, ok := c.blocks[key]
return b, ok
}