├── .gitignore ├── .travis.yml ├── LICENSE ├── README.md ├── lru.go └── lru_test.go /.gitignore: -------------------------------------------------------------------------------- 1 | # Compiled Object files, Static and Dynamic libs (Shared Objects) 2 | *.o 3 | *.a 4 | *.so 5 | 6 | # Folders 7 | _obj 8 | _test 9 | 10 | # Architecture specific extensions/prefixes 11 | *.[568vq] 12 | [568vq].out 13 | 14 | *.cgo1.go 15 | *.cgo2.c 16 | _cgo_defun.c 17 | _cgo_gotypes.go 18 | _cgo_export.* 19 | 20 | _testmain.go 21 | 22 | *.exe 23 | *.test 24 | *.prof 25 | -------------------------------------------------------------------------------- /.travis.yml: -------------------------------------------------------------------------------- 1 | language: go 2 | go: 3 | - 1.7 4 | - 1.6 5 | - 1.5 6 | 7 | sudo: false 8 | 9 | script: 10 | - go fmt ./... 11 | - go vet ./... 12 | - go test -i -race ./... 13 | - go test 14 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | Apache License 2 | Version 2.0, January 2004 3 | http://www.apache.org/licenses/ 4 | 5 | TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 6 | 7 | 1. Definitions. 8 | 9 | "License" shall mean the terms and conditions for use, reproduction, 10 | and distribution as defined by Sections 1 through 9 of this document. 11 | 12 | "Licensor" shall mean the copyright owner or entity authorized by 13 | the copyright owner that is granting the License. 14 | 15 | "Legal Entity" shall mean the union of the acting entity and all 16 | other entities that control, are controlled by, or are under common 17 | control with that entity. For the purposes of this definition, 18 | "control" means (i) the power, direct or indirect, to cause the 19 | direction or management of such entity, whether by contract or 20 | otherwise, or (ii) ownership of fifty percent (50%) or more of the 21 | outstanding shares, or (iii) beneficial ownership of such entity. 22 | 23 | "You" (or "Your") shall mean an individual or Legal Entity 24 | exercising permissions granted by this License. 25 | 26 | "Source" form shall mean the preferred form for making modifications, 27 | including but not limited to software source code, documentation 28 | source, and configuration files. 29 | 30 | "Object" form shall mean any form resulting from mechanical 31 | transformation or translation of a Source form, including but 32 | not limited to compiled object code, generated documentation, 33 | and conversions to other media types. 34 | 35 | "Work" shall mean the work of authorship, whether in Source or 36 | Object form, made available under the License, as indicated by a 37 | copyright notice that is included in or attached to the work 38 | (an example is provided in the Appendix below). 39 | 40 | "Derivative Works" shall mean any work, whether in Source or Object 41 | form, that is based on (or derived from) the Work and for which the 42 | editorial revisions, annotations, elaborations, or other modifications 43 | represent, as a whole, an original work of authorship. For the purposes 44 | of this License, Derivative Works shall not include works that remain 45 | separable from, or merely link (or bind by name) to the interfaces of, 46 | the Work and Derivative Works thereof. 47 | 48 | "Contribution" shall mean any work of authorship, including 49 | the original version of the Work and any modifications or additions 50 | to that Work or Derivative Works thereof, that is intentionally 51 | submitted to Licensor for inclusion in the Work by the copyright owner 52 | or by an individual or Legal Entity authorized to submit on behalf of 53 | the copyright owner. For the purposes of this definition, "submitted" 54 | means any form of electronic, verbal, or written communication sent 55 | to the Licensor or its representatives, including but not limited to 56 | communication on electronic mailing lists, source code control systems, 57 | and issue tracking systems that are managed by, or on behalf of, the 58 | Licensor for the purpose of discussing and improving the Work, but 59 | excluding communication that is conspicuously marked or otherwise 60 | designated in writing by the copyright owner as "Not a Contribution." 61 | 62 | "Contributor" shall mean Licensor and any individual or Legal Entity 63 | on behalf of whom a Contribution has been received by Licensor and 64 | subsequently incorporated within the Work. 65 | 66 | 2. Grant of Copyright License. Subject to the terms and conditions of 67 | this License, each Contributor hereby grants to You a perpetual, 68 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 69 | copyright license to reproduce, prepare Derivative Works of, 70 | publicly display, publicly perform, sublicense, and distribute the 71 | Work and such Derivative Works in Source or Object form. 72 | 73 | 3. Grant of Patent License. Subject to the terms and conditions of 74 | this License, each Contributor hereby grants to You a perpetual, 75 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 76 | (except as stated in this section) patent license to make, have made, 77 | use, offer to sell, sell, import, and otherwise transfer the Work, 78 | where such license applies only to those patent claims licensable 79 | by such Contributor that are necessarily infringed by their 80 | Contribution(s) alone or by combination of their Contribution(s) 81 | with the Work to which such Contribution(s) was submitted. If You 82 | institute patent litigation against any entity (including a 83 | cross-claim or counterclaim in a lawsuit) alleging that the Work 84 | or a Contribution incorporated within the Work constitutes direct 85 | or contributory patent infringement, then any patent licenses 86 | granted to You under this License for that Work shall terminate 87 | as of the date such litigation is filed. 88 | 89 | 4. Redistribution. You may reproduce and distribute copies of the 90 | Work or Derivative Works thereof in any medium, with or without 91 | modifications, and in Source or Object form, provided that You 92 | meet the following conditions: 93 | 94 | (a) You must give any other recipients of the Work or 95 | Derivative Works a copy of this License; and 96 | 97 | (b) You must cause any modified files to carry prominent notices 98 | stating that You changed the files; and 99 | 100 | (c) You must retain, in the Source form of any Derivative Works 101 | that You distribute, all copyright, patent, trademark, and 102 | attribution notices from the Source form of the Work, 103 | excluding those notices that do not pertain to any part of 104 | the Derivative Works; and 105 | 106 | (d) If the Work includes a "NOTICE" text file as part of its 107 | distribution, then any Derivative Works that You distribute must 108 | include a readable copy of the attribution notices contained 109 | within such NOTICE file, excluding those notices that do not 110 | pertain to any part of the Derivative Works, in at least one 111 | of the following places: within a NOTICE text file distributed 112 | as part of the Derivative Works; within the Source form or 113 | documentation, if provided along with the Derivative Works; or, 114 | within a display generated by the Derivative Works, if and 115 | wherever such third-party notices normally appear. The contents 116 | of the NOTICE file are for informational purposes only and 117 | do not modify the License. You may add Your own attribution 118 | notices within Derivative Works that You distribute, alongside 119 | or as an addendum to the NOTICE text from the Work, provided 120 | that such additional attribution notices cannot be construed 121 | as modifying the License. 122 | 123 | You may add Your own copyright statement to Your modifications and 124 | may provide additional or different license terms and conditions 125 | for use, reproduction, or distribution of Your modifications, or 126 | for any such Derivative Works as a whole, provided Your use, 127 | reproduction, and distribution of the Work otherwise complies with 128 | the conditions stated in this License. 129 | 130 | 5. Submission of Contributions. Unless You explicitly state otherwise, 131 | any Contribution intentionally submitted for inclusion in the Work 132 | by You to the Licensor shall be under the terms and conditions of 133 | this License, without any additional terms or conditions. 134 | Notwithstanding the above, nothing herein shall supersede or modify 135 | the terms of any separate license agreement you may have executed 136 | with Licensor regarding such Contributions. 137 | 138 | 6. Trademarks. This License does not grant permission to use the trade 139 | names, trademarks, service marks, or product names of the Licensor, 140 | except as required for reasonable and customary use in describing the 141 | origin of the Work and reproducing the content of the NOTICE file. 142 | 143 | 7. Disclaimer of Warranty. Unless required by applicable law or 144 | agreed to in writing, Licensor provides the Work (and each 145 | Contributor provides its Contributions) on an "AS IS" BASIS, 146 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 147 | implied, including, without limitation, any warranties or conditions 148 | of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A 149 | PARTICULAR PURPOSE. You are solely responsible for determining the 150 | appropriateness of using or redistributing the Work and assume any 151 | risks associated with Your exercise of permissions under this License. 152 | 153 | 8. Limitation of Liability. In no event and under no legal theory, 154 | whether in tort (including negligence), contract, or otherwise, 155 | unless required by applicable law (such as deliberate and grossly 156 | negligent acts) or agreed to in writing, shall any Contributor be 157 | liable to You for damages, including any direct, indirect, special, 158 | incidental, or consequential damages of any character arising as a 159 | result of this License or out of the use or inability to use the 160 | Work (including but not limited to damages for loss of goodwill, 161 | work stoppage, computer failure or malfunction, or any and all 162 | other commercial damages or losses), even if such Contributor 163 | has been advised of the possibility of such damages. 164 | 165 | 9. Accepting Warranty or Additional Liability. While redistributing 166 | the Work or Derivative Works thereof, You may choose to offer, 167 | and charge a fee for, acceptance of support, warranty, indemnity, 168 | or other liability obligations and/or rights consistent with this 169 | License. However, in accepting such obligations, You may act only 170 | on Your own behalf and on Your sole responsibility, not on behalf 171 | of any other Contributor, and only if You agree to indemnify, 172 | defend, and hold each Contributor harmless for any liability 173 | incurred by, or claims asserted against, such Contributor by reason 174 | of your accepting any such warranty or additional liability. 175 | 176 | END OF TERMS AND CONDITIONS 177 | 178 | APPENDIX: How to apply the Apache License to your work. 179 | 180 | To apply the Apache License to your work, attach the following 181 | boilerplate notice, with the fields enclosed by brackets "{}" 182 | replaced with your own identifying information. (Don't include 183 | the brackets!) The text should be enclosed in the appropriate 184 | comment syntax for the file format. We also recommend that a 185 | file or class name and description of purpose be included on the 186 | same "printed page" as the copyright notice for easier 187 | identification within third-party archives. 188 | 189 | Copyright {yyyy} {name of copyright owner} 190 | 191 | Licensed under the Apache License, Version 2.0 (the "License"); 192 | you may not use this file except in compliance with the License. 193 | You may obtain a copy of the License at 194 | 195 | http://www.apache.org/licenses/LICENSE-2.0 196 | 197 | Unless required by applicable law or agreed to in writing, software 198 | distributed under the License is distributed on an "AS IS" BASIS, 199 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 200 | See the License for the specific language governing permissions and 201 | limitations under the License. 202 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # go-lru [![Go Report Card](https://goreportcard.com/badge/github.com/git-hulk/go-lru)](https://goreportcard.com/report/github.com/git-hulk/go-lru) [![Build Status](https://travis-ci.org/git-hulk/go-lru.svg?branch=master)](https://travis-ci.org/git-hulk/go-lru) 2 | 3 | go-lru is an MIT-licensed Go LRU cache bases on GroupCache, with expire time supported 4 | 5 | ## Example 6 | 7 | Set key with expire time 8 | 9 | ``` 10 | cache := NewCache(100) // max entries in cache is 100 11 | cache.Set("a", 1234, 1) // key "a" would be expired after 1 second 12 | ``` 13 | 14 | Set key without expire time 15 | 16 | ``` 17 | cache := NewCache(100) 18 | cache.Set("a", 1234) // set key "a" without expire time 19 | ``` 20 | 21 | ## API doc 22 | 23 | API documentation is available via [https://godoc.org/github.com/git-hulk/go-lru](https://godoc.org/github.com/git-hulk/go-lru) 24 | -------------------------------------------------------------------------------- /lru.go: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright 2013 Google Inc. 3 | 4 | Licensed under the Apache License, Version 2.0 (the "License"); 5 | you may not use this file except in compliance with the License. 6 | You may obtain a copy of the License at 7 | 8 | http://www.apache.org/licenses/LICENSE-2.0 9 | 10 | Unless required by applicable law or agreed to in writing, software 11 | distributed under the License is distributed on an "AS IS" BASIS, 12 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 13 | See the License for the specific language governing permissions and 14 | limitations under the License. 15 | */ 16 | 17 | // Package lru implements an LRU cache. 18 | package lru 19 | 20 | import ( 21 | "container/list" 22 | "errors" 23 | "sync" 24 | "time" 25 | ) 26 | 27 | // Cache is an LRU cache. It is not safe for concurrent access. 28 | type Cache struct { 29 | // MaxEntries is the maximum number of cache entries before 30 | // an item is evicted. Zero means no limit. 31 | MaxEntries int 32 | 33 | // OnEvicted optionally specifics a callback function to be 34 | // executed when an entry is purged from the cache. 35 | OnEvicted func(key Key, value interface{}) 36 | 37 | ll *list.List 38 | cache map[interface{}]*list.Element 39 | lock sync.RWMutex 40 | } 41 | 42 | // A Key may be any value that is comparable. See http://golang.org/ref/spec#Comparison_operators 43 | type Key interface{} 44 | 45 | type entry struct { 46 | key Key 47 | value interface{} 48 | expire int64 49 | } 50 | 51 | // NewCache creates a new Cache. 52 | // If maxEntries is zero, the cache has no limit and it's assumed 53 | // that eviction is done by the caller. 54 | func NewCache(maxEntries int) *Cache { 55 | c := &Cache{ 56 | MaxEntries: maxEntries, 57 | ll: list.New(), 58 | cache: make(map[interface{}]*list.Element), 59 | } 60 | go c.expiredBackground() 61 | return c 62 | } 63 | 64 | // Check whether entry is expired or not 65 | func (e *entry) isExpired() bool { 66 | if e.expire <= 0 { // entry without expire 67 | return false 68 | } 69 | 70 | now := time.Now().UnixNano() 71 | if e.expire >= now { 72 | return false 73 | } 74 | return true 75 | } 76 | 77 | func (c *Cache) expiredBackground() { 78 | hz := 10 79 | minIterations := 50 80 | defer func() { 81 | if err := recover(); err != nil { 82 | // Do nothing 83 | } 84 | }() 85 | 86 | ticker := time.NewTicker(time.Second / time.Duration(hz)) 87 | defer ticker.Stop() 88 | for { 89 | select { 90 | case <-ticker.C: 91 | // In the worst case we process all the keys in 10 seconds 92 | // In normal conditions (a reasonable number of keys) we process 93 | // all the keys in a shorter time. 94 | c.lock.Lock() 95 | numEntries := c.ll.Len() 96 | iterations := numEntries / (hz * 10) 97 | if iterations < minIterations { 98 | iterations = minIterations 99 | if numEntries < 50 { 100 | iterations = numEntries 101 | } 102 | } 103 | for i := 0; i < iterations && c.ll.Len() > 0; i++ { 104 | ele := c.ll.Back() 105 | if ele.Value.(*entry).isExpired() { 106 | c.removeElement(ele) 107 | } else { 108 | c.ll.MoveToFront(ele) 109 | } 110 | } 111 | c.lock.Unlock() 112 | } 113 | } 114 | } 115 | 116 | // Set a value to the cache. 117 | // Key and value is required, and expire time is option, 118 | // Set("a", 1) or Set("a", 1, 1) is ok. 119 | func (c *Cache) Set(key Key, value interface{}, args ...interface{}) (bool, error) { 120 | var expire int64 121 | var ttl int64 122 | if c.cache == nil { 123 | return false, errors.New("cache is not initialized") 124 | } 125 | 126 | expire = -1 127 | if args != nil && len(args) >= 1 { 128 | ttl = 0 129 | switch t := args[0].(type) { 130 | case int: 131 | ttl = int64(t) 132 | case int8: 133 | ttl = int64(t) 134 | case int16: 135 | ttl = int64(t) 136 | case int32: 137 | ttl = int64(t) 138 | case int64: 139 | ttl = t 140 | default: 141 | return false, errors.New("expire time should be int, int8, int16, int32, int64") 142 | } 143 | if ttl <= 0 { 144 | return false, errors.New("expire time should be > 0") 145 | } 146 | expire = time.Now().UnixNano() + ttl*1e9 147 | } 148 | 149 | c.lock.Lock() 150 | defer c.lock.Unlock() 151 | if ee, ok := c.cache[key]; ok { 152 | c.ll.MoveToFront(ee) 153 | ee.Value.(*entry).value = value 154 | ee.Value.(*entry).expire = expire 155 | return true, nil 156 | } 157 | ele := c.ll.PushFront(&entry{key, value, expire}) 158 | c.cache[key] = ele 159 | if c.MaxEntries != 0 && c.ll.Len() > c.MaxEntries { 160 | c.removeOldest() 161 | } 162 | return true, nil 163 | } 164 | 165 | // Get looks up a key's value from the cache. 166 | func (c *Cache) Get(key Key) (value interface{}, ok bool) { 167 | if c.cache == nil { 168 | return nil, false 169 | } 170 | 171 | c.lock.Lock() 172 | defer c.lock.Unlock() 173 | if ele, hit := c.cache[key]; hit { 174 | if ele.Value.(*entry).isExpired() { 175 | // delete expired elem 176 | c.removeElement(ele) 177 | return nil, false 178 | } 179 | c.ll.MoveToFront(ele) 180 | return ele.Value.(*entry).value, true 181 | } 182 | return nil, false 183 | } 184 | 185 | // Remove removes the provided key from the cache. 186 | func (c *Cache) Remove(key Key) { 187 | if c.cache == nil { 188 | return 189 | } 190 | 191 | c.lock.Lock() 192 | defer c.lock.Unlock() 193 | if ele, hit := c.cache[key]; hit { 194 | c.removeElement(ele) 195 | } 196 | } 197 | 198 | // removeOldest removes the oldest item from the cache. 199 | func (c *Cache) removeOldest() { 200 | if c.cache == nil { 201 | return 202 | } 203 | ele := c.ll.Back() 204 | if ele != nil { 205 | c.removeElement(ele) 206 | } 207 | } 208 | 209 | func (c *Cache) removeElement(e *list.Element) { 210 | c.ll.Remove(e) 211 | kv := e.Value.(*entry) 212 | delete(c.cache, kv.key) 213 | if c.OnEvicted != nil { 214 | c.OnEvicted(kv.key, kv.value) 215 | } 216 | } 217 | 218 | // Len returns the number of items in the cache. 219 | func (c *Cache) Len() int { 220 | if c.cache == nil { 221 | return 0 222 | } 223 | 224 | c.lock.RLock() 225 | defer c.lock.RUnlock() 226 | return c.ll.Len() 227 | } 228 | 229 | // TTL return the ttl for key. 230 | // Return -2 when key is not found, 231 | // return -1 when key without expire time, 232 | // return > 0 when key with expire time. 233 | func (c *Cache) TTL(key Key) int64 { 234 | if c.cache == nil { 235 | return -2 236 | } 237 | 238 | c.lock.RLock() 239 | defer c.lock.RUnlock() 240 | if ele, hit := c.cache[key]; hit { 241 | expire := ele.Value.(*entry).expire 242 | if expire <= 0 { 243 | return -1 244 | } 245 | ttl := expire - time.Now().UnixNano() 246 | if ttl > 0 { 247 | return ttl / 1e9 248 | } 249 | return 0 250 | } 251 | return -2 252 | } 253 | 254 | // Keys return all the keys in cache 255 | func (c *Cache) Keys() []interface{} { 256 | c.lock.RLock() 257 | defer c.lock.RUnlock() 258 | keys := make([]interface{}, 0, c.ll.Len()) 259 | for ele := c.ll.Front(); ele != nil; ele = ele.Next() { 260 | if ele.Value.(*entry).isExpired() { 261 | c.removeElement(ele) 262 | } else { 263 | keys = append(keys, ele.Value.(*entry).key) 264 | } 265 | } 266 | return keys 267 | } 268 | 269 | // FlushAll remove all the keys in cache 270 | func (c *Cache) FlushAll() { 271 | c.lock.Lock() 272 | defer c.lock.Unlock() 273 | c.ll = list.New() 274 | c.cache = make(map[interface{}]*list.Element) 275 | } 276 | -------------------------------------------------------------------------------- /lru_test.go: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright 2013 Google Inc. 3 | 4 | Licensed under the Apache License, Version 2.0 (the "License"); 5 | you may not use this file except in compliance with the License. 6 | You may obtain a copy of the License at 7 | 8 | http://www.apache.org/licenses/LICENSE-2.0 9 | 10 | Unless required by applicable law or agreed to in writing, software 11 | distributed under the License is distributed on an "AS IS" BASIS, 12 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 13 | See the License for the specific language governing permissions and 14 | limitations under the License. 15 | */ 16 | 17 | package lru 18 | 19 | import ( 20 | "fmt" 21 | "testing" 22 | "time" 23 | ) 24 | 25 | type simpleStruct struct { 26 | int 27 | string 28 | } 29 | 30 | type complexStruct struct { 31 | int 32 | simpleStruct 33 | } 34 | 35 | var getTests = []struct { 36 | name string 37 | keyToAdd interface{} 38 | keyToGet interface{} 39 | expectedOk bool 40 | }{ 41 | {"string_hit", "myKey", "myKey", true}, 42 | {"string_miss", "myKey", "nonsense", false}, 43 | {"simple_struct_hit", simpleStruct{1, "two"}, simpleStruct{1, "two"}, true}, 44 | {"simeple_struct_miss", simpleStruct{1, "two"}, simpleStruct{0, "noway"}, false}, 45 | {"complex_struct_hit", complexStruct{1, simpleStruct{2, "three"}}, 46 | complexStruct{1, simpleStruct{2, "three"}}, true}, 47 | } 48 | 49 | func TestGet(t *testing.T) { 50 | for _, tt := range getTests { 51 | lru := NewCache(0) 52 | lru.Set(tt.keyToAdd, 1234) 53 | val, ok := lru.Get(tt.keyToGet) 54 | if ok != tt.expectedOk { 55 | t.Fatalf("%s: cache hit = %v; want %v", tt.name, ok, !ok) 56 | } else if ok && val != 1234 { 57 | t.Fatalf("TestGet failed, %s expected 1234, got %v", tt.name, val) 58 | } 59 | } 60 | } 61 | 62 | func TestExpire(t *testing.T) { 63 | lru := NewCache(100) 64 | expireKey := "keyWithExpire" 65 | expireWithoutKey := "keyWithoutExpire" 66 | lru.Set(expireKey, 1234, 1) 67 | lru.Set(expireWithoutKey, 1234) 68 | val, ok := lru.Get(expireKey) 69 | if !ok || val != 1234 || lru.Len() != 2 { 70 | t.Fatal("TestExpire get val error") 71 | } 72 | time.Sleep(1100 * time.Millisecond) 73 | val, ok = lru.Get(expireKey) 74 | if ok || val == 1234 { 75 | t.Fatal("TestExpire get expire error") 76 | } 77 | val, ok = lru.Get(expireWithoutKey) 78 | if !ok || val != 1234 || lru.Len() != 1 { 79 | t.Fatal("TestExpire get val error") 80 | } 81 | } 82 | 83 | func TestRemove(t *testing.T) { 84 | lru := NewCache(0) 85 | lru.Set("myKey", 1234) 86 | if val, ok := lru.Get("myKey"); !ok { 87 | t.Fatal("TestRemove returned no match") 88 | } else if val != 1234 { 89 | t.Fatalf("TestRemove failed, expected %d, got %v", 1234, val) 90 | } 91 | 92 | lru.Remove("myKey") 93 | if _, ok := lru.Get("myKey"); ok { 94 | t.Fatal("TestRemove returned a removed entry") 95 | } 96 | } 97 | 98 | func TestTTL(t *testing.T) { 99 | expireKey := "expireKey" 100 | expireTime := 2 101 | lru := NewCache(100) 102 | lru.Set(expireKey, 1234, expireTime) 103 | ttl := lru.TTL(expireKey) 104 | fmt.Println(ttl) 105 | if ttl < 1 || ttl > 2 { 106 | t.Fatal("TestTtl got ttl < 0") 107 | } 108 | lru.Set("noExpireKey", 1234) 109 | if lru.TTL("noExpireKey") != -1 { 110 | t.Fatal("TestTtl not expire time key ttl != -1") 111 | } 112 | if lru.TTL("notExistKey") != -2 { 113 | t.Fatal("TestTtl not exist key ttl != -2") 114 | } 115 | } 116 | 117 | func TestKeys(t *testing.T) { 118 | lru := NewCache(100) 119 | lru.Set("a", 1) 120 | lru.Set("b", 1, 1) 121 | keys := lru.Keys() 122 | if len(keys) != 2 { 123 | t.Fatalf("TestKeys failed, expected %d, got %d", 2, len(keys)) 124 | } 125 | time.Sleep(1100 * time.Millisecond) 126 | keys = lru.Keys() 127 | if len(keys) != 1 { 128 | t.Fatalf("TestKeys failed, expected %d, got %d", 1, len(keys)) 129 | } 130 | } 131 | 132 | func TestFlushAll(t *testing.T) { 133 | lru := NewCache(100) 134 | lru.Set("a", 1) 135 | lru.Set("b", 1) 136 | lru.Set("c", 1) 137 | lru.FlushAll() 138 | lru.Set("a", 1) 139 | if lru.Len() != 1 { 140 | t.Fatalf("TestFlushAll failed, expected %d, got %d", 1, lru.Len()) 141 | } 142 | } 143 | --------------------------------------------------------------------------------