Wala shell

Advanced PHP File Manager

Server IP: 127.0.0.1 | PHP Version: 8.3.30 | Domains Hosted: 54

Name	Size	Last Modified	Actions
📁 ..	-	2025-05-25 12:27
📁 .github	-	2025-05-25 12:27
📄 .gitignore # Compiled Object files, Static and Dynamic libs (Shared Objects) .o .a .so # Folders _obj _test # Architecture specific extensions/prefixes .[568vq] [568vq].out .cgo1.go .cgo2.c _cgo_defun.c _cgo_gotypes.go _cgo_export.* _testmain.go .exe .test	259 B	2025-05-25 12:27
📄 .golangci.yml # Copyright (c) HashiCorp, Inc. # SPDX-License-Identifier: MPL-2.0 linters: fast: false disable-all: true enable: - revive - megacheck - govet - unconvert - gas - gocyclo - dupl - misspell - unparam - unused - typecheck - ineffassign # - stylecheck - exportloopref - gocritic - nakedret - gosimple - prealloc # golangci-lint configuration file linters-settings: revive: ignore-generated-header: true severity: warning rules: - name: package-comments severity: warning disabled: true - name: exported severity: warning disabled: false arguments: ["checkPrivateReceivers", "disableStutteringCheck"] issues: exclude-use-default: false exclude-rules: - path: _test\.go linters: - dupl	850 B	2025-05-25 12:27
📄 2q.go // Copyright (c) HashiCorp, Inc. // SPDX-License-Identifier: MPL-2.0 package lru import ( "errors" "sync" "github.com/hashicorp/golang-lru/v2/simplelru" ) const ( // Default2QRecentRatio is the ratio of the 2Q cache dedicated // to recently added entries that have only been accessed once. Default2QRecentRatio = 0.25 // Default2QGhostEntries is the default ratio of ghost // entries kept to track entries recently evicted Default2QGhostEntries = 0.50 ) // TwoQueueCache is a thread-safe fixed size 2Q cache. // 2Q is an enhancement over the standard LRU cache // in that it tracks both frequently and recently used // entries separately. This avoids a burst in access to new // entries from evicting frequently used entries. It adds some // additional tracking overhead to the standard LRU cache, and is // computationally about 2x the cost, and adds some metadata over // head. The ARCCache is similar, but does not require setting any // parameters. type TwoQueueCache[K comparable, V any] struct { size int recentSize int recentRatio float64 ghostRatio float64 recent simplelru.LRUCache[K, V] frequent simplelru.LRUCache[K, V] recentEvict simplelru.LRUCache[K, struct{}] lock sync.RWMutex } // New2Q creates a new TwoQueueCache using the default // values for the parameters. func New2Q[K comparable, V any](size int) (TwoQueueCache[K, V], error) { return New2QParams[K, V](size, Default2QRecentRatio, Default2QGhostEntries) } // New2QParams creates a new TwoQueueCache using the provided // parameter values. func New2QParams[K comparable, V any](size int, recentRatio, ghostRatio float64) (TwoQueueCache[K, V], error) { if size <= 0 { return nil, errors.New("invalid size") } if recentRatio < 0.0 \|\| recentRatio > 1.0 { return nil, errors.New("invalid recent ratio") } if ghostRatio < 0.0 \|\| ghostRatio > 1.0 { return nil, errors.New("invalid ghost ratio") } // Determine the sub-sizes recentSize := int(float64(size) * recentRatio) evictSize := int(float64(size) * ghostRatio) // Allocate the LRUs recent, err := simplelru.NewLRU[K, V](size, nil) if err != nil { return nil, err } frequent, err := simplelru.NewLRU[K, V](size, nil) if err != nil { return nil, err } recentEvict, err := simplelru.NewLRU[K, struct{}](evictSize, nil) if err != nil { return nil, err } // Initialize the cache c := &TwoQueueCache[K, V]{ size: size, recentSize: recentSize, recentRatio: recentRatio, ghostRatio: ghostRatio, recent: recent, frequent: frequent, recentEvict: recentEvict, } return c, nil } // Get looks up a key's value from the cache. func (c TwoQueueCache[K, V]) Get(key K) (value V, ok bool) { c.lock.Lock() defer c.lock.Unlock() // Check if this is a frequent value if val, ok := c.frequent.Get(key); ok { return val, ok } // If the value is contained in recent, then we // promote it to frequent if val, ok := c.recent.Peek(key); ok { c.recent.Remove(key) c.frequent.Add(key, val) return val, ok } // No hit return } // Add adds a value to the cache. func (c TwoQueueCache[K, V]) Add(key K, value V) { c.lock.Lock() defer c.lock.Unlock() // Check if the value is frequently used already, // and just update the value if c.frequent.Contains(key) { c.frequent.Add(key, value) return } // Check if the value is recently used, and promote // the value into the frequent list if c.recent.Contains(key) { c.recent.Remove(key) c.frequent.Add(key, value) return } // If the value was recently evicted, add it to the // frequently used list if c.recentEvict.Contains(key) { c.ensureSpace(true) c.recentEvict.Remove(key) c.frequent.Add(key, value) return } // Add to the recently seen list c.ensureSpace(false) c.recent.Add(key, value) } // ensureSpace is used to ensure we have space in the cache func (c TwoQueueCache[K, V]) ensureSpace(recentEvict bool) { // If we have space, nothing to do recentLen := c.recent.Len() freqLen := c.frequent.Len() if recentLen+freqLen < c.size { return } // If the recent buffer is larger than // the target, evict from there if recentLen > 0 && (recentLen > c.recentSize \|\| (recentLen == c.recentSize && !recentEvict)) { k, _, _ := c.recent.RemoveOldest() c.recentEvict.Add(k, struct{}{}) return } // Remove from the frequent list otherwise c.frequent.RemoveOldest() } // Len returns the number of items in the cache. func (c TwoQueueCache[K, V]) Len() int { c.lock.RLock() defer c.lock.RUnlock() return c.recent.Len() + c.frequent.Len() } // Resize changes the cache size. func (c TwoQueueCache[K, V]) Resize(size int) (evicted int) { c.lock.Lock() defer c.lock.Unlock() // Recalculate the sub-sizes recentSize := int(float64(size) c.recentRatio) evictSize := int(float64(size) * c.ghostRatio) c.size = size c.recentSize = recentSize // ensureSpace diff := c.recent.Len() + c.frequent.Len() - size if diff < 0 { diff = 0 } for i := 0; i < diff; i++ { c.ensureSpace(true) } // Reallocate the LRUs c.recent.Resize(size) c.frequent.Resize(size) c.recentEvict.Resize(evictSize) return diff } // Keys returns a slice of the keys in the cache. // The frequently used keys are first in the returned slice. func (c TwoQueueCache[K, V]) Keys() []K { c.lock.RLock() defer c.lock.RUnlock() k1 := c.frequent.Keys() k2 := c.recent.Keys() return append(k1, k2...) } // Values returns a slice of the values in the cache. // The frequently used values are first in the returned slice. func (c TwoQueueCache[K, V]) Values() []V { c.lock.RLock() defer c.lock.RUnlock() v1 := c.frequent.Values() v2 := c.recent.Values() return append(v1, v2...) } // Remove removes the provided key from the cache. func (c TwoQueueCache[K, V]) Remove(key K) { c.lock.Lock() defer c.lock.Unlock() if c.frequent.Remove(key) { return } if c.recent.Remove(key) { return } if c.recentEvict.Remove(key) { return } } // Purge is used to completely clear the cache. func (c TwoQueueCache[K, V]) Purge() { c.lock.Lock() defer c.lock.Unlock() c.recent.Purge() c.frequent.Purge() c.recentEvict.Purge() } // Contains is used to check if the cache contains a key // without updating recency or frequency. func (c TwoQueueCache[K, V]) Contains(key K) bool { c.lock.RLock() defer c.lock.RUnlock() return c.frequent.Contains(key) \|\| c.recent.Contains(key) } // Peek is used to inspect the cache value of a key // without updating recency or frequency. func (c TwoQueueCache[K, V]) Peek(key K) (value V, ok bool) { c.lock.RLock() defer c.lock.RUnlock() if val, ok := c.frequent.Peek(key); ok { return val, ok } return c.recent.Peek(key) }	6.56 KB	2025-05-25 12:27
📄 2q_test.go // Copyright (c) HashiCorp, Inc. // SPDX-License-Identifier: MPL-2.0 package lru import ( "testing" ) func Benchmark2Q_Rand(b testing.B) { l, err := New2Q[int64, int64](8192) if err != nil { b.Fatalf("err: %v", err) } trace := make([]int64, b.N2) for i := 0; i < b.N2; i++ { trace[i] = getRand(b) % 32768 } b.ResetTimer() var hit, miss int for i := 0; i < 2b.N; i++ { if i%2 == 0 { l.Add(trace[i], trace[i]) } else { if _, ok := l.Get(trace[i]); ok { hit++ } else { miss++ } } } b.Logf("hit: %d miss: %d ratio: %f", hit, miss, float64(hit)/float64(hit+miss)) } func Benchmark2Q_Freq(b testing.B) { l, err := New2Q[int64, int64](8192) if err != nil { b.Fatalf("err: %v", err) } trace := make([]int64, b.N2) for i := 0; i < b.N2; i++ { if i%2 == 0 { trace[i] = getRand(b) % 16384 } else { trace[i] = getRand(b) % 32768 } } b.ResetTimer() for i := 0; i < b.N; i++ { l.Add(trace[i], trace[i]) } var hit, miss int for i := 0; i < b.N; i++ { if _, ok := l.Get(trace[i]); ok { hit++ } else { miss++ } } b.Logf("hit: %d miss: %d ratio: %f", hit, miss, float64(hit)/float64(hit+miss)) } func Test2Q_RandomOps(t testing.T) { size := 128 l, err := New2Q[int64, int64](128) if err != nil { t.Fatalf("err: %v", err) } n := 200000 for i := 0; i < n; i++ { key := getRand(t) % 512 r := getRand(t) switch r % 3 { case 0: l.Add(key, key) case 1: l.Get(key) case 2: l.Remove(key) } if l.recent.Len()+l.frequent.Len() > size { t.Fatalf("bad: recent: %d freq: %d", l.recent.Len(), l.frequent.Len()) } } } func Test2Q_Get_RecentToFrequent(t testing.T) { l, err := New2Q[int, int](128) if err != nil { t.Fatalf("err: %v", err) } // Touch all the entries, should be in t1 for i := 0; i < 128; i++ { l.Add(i, i) } if n := l.recent.Len(); n != 128 { t.Fatalf("bad: %d", n) } if n := l.frequent.Len(); n != 0 { t.Fatalf("bad: %d", n) } // Get should upgrade to t2 for i := 0; i < 128; i++ { if _, ok := l.Get(i); !ok { t.Fatalf("missing: %d", i) } } if n := l.recent.Len(); n != 0 { t.Fatalf("bad: %d", n) } if n := l.frequent.Len(); n != 128 { t.Fatalf("bad: %d", n) } // Get be from t2 for i := 0; i < 128; i++ { if _, ok := l.Get(i); !ok { t.Fatalf("missing: %d", i) } } if n := l.recent.Len(); n != 0 { t.Fatalf("bad: %d", n) } if n := l.frequent.Len(); n != 128 { t.Fatalf("bad: %d", n) } } func Test2Q_Add_RecentToFrequent(t testing.T) { l, err := New2Q[int, int](128) if err != nil { t.Fatalf("err: %v", err) } // Add initially to recent l.Add(1, 1) if n := l.recent.Len(); n != 1 { t.Fatalf("bad: %d", n) } if n := l.frequent.Len(); n != 0 { t.Fatalf("bad: %d", n) } // Add should upgrade to frequent l.Add(1, 1) if n := l.recent.Len(); n != 0 { t.Fatalf("bad: %d", n) } if n := l.frequent.Len(); n != 1 { t.Fatalf("bad: %d", n) } // Add should remain in frequent l.Add(1, 1) if n := l.recent.Len(); n != 0 { t.Fatalf("bad: %d", n) } if n := l.frequent.Len(); n != 1 { t.Fatalf("bad: %d", n) } } func Test2Q_Add_RecentEvict(t testing.T) { l, err := New2Q[int, int](4) if err != nil { t.Fatalf("err: %v", err) } // Add 1,2,3,4,5 -> Evict 1 l.Add(1, 1) l.Add(2, 2) l.Add(3, 3) l.Add(4, 4) l.Add(5, 5) if n := l.recent.Len(); n != 4 { t.Fatalf("bad: %d", n) } if n := l.recentEvict.Len(); n != 1 { t.Fatalf("bad: %d", n) } if n := l.frequent.Len(); n != 0 { t.Fatalf("bad: %d", n) } // Pull in the recently evicted l.Add(1, 1) if n := l.recent.Len(); n != 3 { t.Fatalf("bad: %d", n) } if n := l.recentEvict.Len(); n != 1 { t.Fatalf("bad: %d", n) } if n := l.frequent.Len(); n != 1 { t.Fatalf("bad: %d", n) } // Add 6, should cause another recent evict l.Add(6, 6) if n := l.recent.Len(); n != 3 { t.Fatalf("bad: %d", n) } if n := l.recentEvict.Len(); n != 2 { t.Fatalf("bad: %d", n) } if n := l.frequent.Len(); n != 1 { t.Fatalf("bad: %d", n) } } func Test2Q_Resize(t testing.T) { l, err := New2Q[int, int](100) if err != nil { t.Fatalf("err: %v", err) } // Touch all the entries, should be in t1 for i := 0; i < 100; i++ { l.Add(i, i) } evicted := l.Resize(50) if evicted != 50 { t.Fatalf("bad: %d", evicted) } if n := l.recent.Len(); n != 50 { t.Fatalf("bad: %d", n) } if n := l.frequent.Len(); n != 0 { t.Fatalf("bad: %d", n) } l, err = New2Q[int, int](100) if err != nil { t.Fatalf("err: %v", err) } for i := 0; i < 100; i++ { l.Add(i, i) } for i := 0; i < 50; i++ { l.Add(i, i) } evicted = l.Resize(50) if evicted != 50 { t.Fatalf("bad: %d", evicted) } if n := l.recent.Len(); n != 12 { t.Fatalf("bad: %d", n) } if n := l.frequent.Len(); n != 38 { t.Fatalf("bad: %d", n) } l, err = New2Q[int, int](100) if err != nil { t.Fatalf("err: %v", err) } for i := 0; i < 100; i++ { l.Add(i, i) l.Add(i, i) } evicted = l.Resize(50) if evicted != 50 { t.Fatalf("bad: %d", evicted) } if n := l.recent.Len(); n != 0 { t.Fatalf("bad: %d", n) } if n := l.frequent.Len(); n != 50 { t.Fatalf("bad: %d", n) } } func Test2Q(t testing.T) { l, err := New2Q[int, int](128) if err != nil { t.Fatalf("err: %v", err) } for i := 0; i < 256; i++ { l.Add(i, i) } if l.Len() != 128 { t.Fatalf("bad len: %v", l.Len()) } for i, k := range l.Keys() { if v, ok := l.Get(k); !ok \|\| v != k \|\| v != i+128 { t.Fatalf("bad key: %v", k) } } for i, v := range l.Values() { if v != i+128 { t.Fatalf("bad key: %v", v) } } for i := 0; i < 128; i++ { if _, ok := l.Get(i); ok { t.Fatalf("should be evicted") } } for i := 128; i < 256; i++ { if _, ok := l.Get(i); !ok { t.Fatalf("should not be evicted") } } for i := 128; i < 192; i++ { l.Remove(i) if _, ok := l.Get(i); ok { t.Fatalf("should be deleted") } } l.Purge() if l.Len() != 0 { t.Fatalf("bad len: %v", l.Len()) } if _, ok := l.Get(200); ok { t.Fatalf("should contain nothing") } } // Test that Contains doesn't update recent-ness func Test2Q_Contains(t testing.T) { l, err := New2Q[int, int](2) if err != nil { t.Fatalf("err: %v", err) } l.Add(1, 1) l.Add(2, 2) if !l.Contains(1) { t.Errorf("1 should be contained") } l.Add(3, 3) if l.Contains(1) { t.Errorf("Contains should not have updated recent-ness of 1") } } // Test that Peek doesn't update recent-ness func Test2Q_Peek(t *testing.T) { l, err := New2Q[int, int](2) if err != nil { t.Fatalf("err: %v", err) } l.Add(1, 1) l.Add(2, 2) if v, ok := l.Peek(1); !ok \|\| v != 1 { t.Errorf("1 should be set to 1: %v, %v", v, ok) } l.Add(3, 3) if l.Contains(1) { t.Errorf("should not have updated recent-ness of 1") } }	6.61 KB	2025-05-25 12:27
📄 LICENSE Copyright (c) 2014 HashiCorp, Inc. Mozilla Public License, version 2.0 1. Definitions 1.1. "Contributor" means each individual or legal entity that creates, contributes to the creation of, or owns Covered Software. 1.2. "Contributor Version" means the combination of the Contributions of others (if any) used by a Contributor and that particular Contributor's Contribution. 1.3. "Contribution" means Covered Software of a particular Contributor. 1.4. "Covered Software" means Source Code Form to which the initial Contributor has attached the notice in Exhibit A, the Executable Form of such Source Code Form, and Modifications of such Source Code Form, in each case including portions thereof. 1.5. "Incompatible With Secondary Licenses" means a. that the initial Contributor has attached the notice described in Exhibit B to the Covered Software; or b. that the Covered Software was made available under the terms of version 1.1 or earlier of the License, but not also under the terms of a Secondary License. 1.6. "Executable Form" means any form of the work other than Source Code Form. 1.7. "Larger Work" means a work that combines Covered Software with other material, in a separate file or files, that is not Covered Software. 1.8. "License" means this document. 1.9. "Licensable" means having the right to grant, to the maximum extent possible, whether at the time of the initial grant or subsequently, any and all of the rights conveyed by this License. 1.10. "Modifications" means any of the following: a. any file in Source Code Form that results from an addition to, deletion from, or modification of the contents of Covered Software; or b. any new file in Source Code Form that contains any Covered Software. 1.11. "Patent Claims" of a Contributor means any patent claim(s), including without limitation, method, process, and apparatus claims, in any patent Licensable by such Contributor that would be infringed, but for the grant of the License, by the making, using, selling, offering for sale, having made, import, or transfer of either its Contributions or its Contributor Version. 1.12. "Secondary License" means either the GNU General Public License, Version 2.0, the GNU Lesser General Public License, Version 2.1, the GNU Affero General Public License, Version 3.0, or any later versions of those licenses. 1.13. "Source Code Form" means the form of the work preferred for making modifications. 1.14. "You" (or "Your") means an individual or a legal entity exercising rights under this License. For legal entities, "You" includes any entity that controls, is controlled by, or is under common control with You. For purposes of this definition, "control" means (a) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (b) ownership of more than fifty percent (50%) of the outstanding shares or beneficial ownership of such entity. 2. License Grants and Conditions 2.1. Grants Each Contributor hereby grants You a world-wide, royalty-free, non-exclusive license: a. under intellectual property rights (other than patent or trademark) Licensable by such Contributor to use, reproduce, make available, modify, display, perform, distribute, and otherwise exploit its Contributions, either on an unmodified basis, with Modifications, or as part of a Larger Work; and b. under Patent Claims of such Contributor to make, use, sell, offer for sale, have made, import, and otherwise transfer either its Contributions or its Contributor Version. 2.2. Effective Date The licenses granted in Section 2.1 with respect to any Contribution become effective for each Contribution on the date the Contributor first distributes such Contribution. 2.3. Limitations on Grant Scope The licenses granted in this Section 2 are the only rights granted under this License. No additional rights or licenses will be implied from the distribution or licensing of Covered Software under this License. Notwithstanding Section 2.1(b) above, no patent license is granted by a Contributor: a. for any code that a Contributor has removed from Covered Software; or b. for infringements caused by: (i) Your and any other third party's modifications of Covered Software, or (ii) the combination of its Contributions with other software (except as part of its Contributor Version); or c. under Patent Claims infringed by Covered Software in the absence of its Contributions. This License does not grant any rights in the trademarks, service marks, or logos of any Contributor (except as may be necessary to comply with the notice requirements in Section 3.4). 2.4. Subsequent Licenses No Contributor makes additional grants as a result of Your choice to distribute the Covered Software under a subsequent version of this License (see Section 10.2) or under the terms of a Secondary License (if permitted under the terms of Section 3.3). 2.5. Representation Each Contributor represents that the Contributor believes its Contributions are its original creation(s) or it has sufficient rights to grant the rights to its Contributions conveyed by this License. 2.6. Fair Use This License is not intended to limit any rights You have under applicable copyright doctrines of fair use, fair dealing, or other equivalents. 2.7. Conditions Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted in Section 2.1. 3. Responsibilities 3.1. Distribution of Source Form All distribution of Covered Software in Source Code Form, including any Modifications that You create or to which You contribute, must be under the terms of this License. You must inform recipients that the Source Code Form of the Covered Software is governed by the terms of this License, and how they can obtain a copy of this License. You may not attempt to alter or restrict the recipients' rights in the Source Code Form. 3.2. Distribution of Executable Form If You distribute Covered Software in Executable Form then: a. such Covered Software must also be made available in Source Code Form, as described in Section 3.1, and You must inform recipients of the Executable Form how they can obtain a copy of such Source Code Form by reasonable means in a timely manner, at a charge no more than the cost of distribution to the recipient; and b. You may distribute such Executable Form under the terms of this License, or sublicense it under different terms, provided that the license for the Executable Form does not attempt to limit or alter the recipients' rights in the Source Code Form under this License. 3.3. Distribution of a Larger Work You may create and distribute a Larger Work under terms of Your choice, provided that You also comply with the requirements of this License for the Covered Software. If the Larger Work is a combination of Covered Software with a work governed by one or more Secondary Licenses, and the Covered Software is not Incompatible With Secondary Licenses, this License permits You to additionally distribute such Covered Software under the terms of such Secondary License(s), so that the recipient of the Larger Work may, at their option, further distribute the Covered Software under the terms of either this License or such Secondary License(s). 3.4. Notices You may not remove or alter the substance of any license notices (including copyright notices, patent notices, disclaimers of warranty, or limitations of liability) contained within the Source Code Form of the Covered Software, except that You may alter any license notices to the extent required to remedy known factual inaccuracies. 3.5. Application of Additional Terms You may choose to offer, and to charge a fee for, warranty, support, indemnity or liability obligations to one or more recipients of Covered Software. However, You may do so only on Your own behalf, and not on behalf of any Contributor. You must make it absolutely clear that any such warranty, support, indemnity, or liability obligation is offered by You alone, and You hereby agree to indemnify every Contributor for any liability incurred by such Contributor as a result of warranty, support, indemnity or liability terms You offer. You may include additional disclaimers of warranty and limitations of liability specific to any jurisdiction. 4. Inability to Comply Due to Statute or Regulation If it is impossible for You to comply with any of the terms of this License with respect to some or all of the Covered Software due to statute, judicial order, or regulation then You must: (a) comply with the terms of this License to the maximum extent possible; and (b) describe the limitations and the code they affect. Such description must be placed in a text file included with all distributions of the Covered Software under this License. Except to the extent prohibited by statute or regulation, such description must be sufficiently detailed for a recipient of ordinary skill to be able to understand it. 5. Termination 5.1. The rights granted under this License will terminate automatically if You fail to comply with any of its terms. However, if You become compliant, then the rights granted under this License from a particular Contributor are reinstated (a) provisionally, unless and until such Contributor explicitly and finally terminates Your grants, and (b) on an ongoing basis, if such Contributor fails to notify You of the non-compliance by some reasonable means prior to 60 days after You have come back into compliance. Moreover, Your grants from a particular Contributor are reinstated on an ongoing basis if such Contributor notifies You of the non-compliance by some reasonable means, this is the first time You have received notice of non-compliance with this License from such Contributor, and You become compliant prior to 30 days after Your receipt of the notice. 5.2. If You initiate litigation against any entity by asserting a patent infringement claim (excluding declaratory judgment actions, counter-claims, and cross-claims) alleging that a Contributor Version directly or indirectly infringes any patent, then the rights granted to You by any and all Contributors for the Covered Software under Section 2.1 of this License shall terminate. 5.3. In the event of termination under Sections 5.1 or 5.2 above, all end user license agreements (excluding distributors and resellers) which have been validly granted by You or Your distributors under this License prior to termination shall survive termination. 6. Disclaimer of Warranty Covered Software is provided under this License on an "as is" basis, without warranty of any kind, either expressed, implied, or statutory, including, without limitation, warranties that the Covered Software is free of defects, merchantable, fit for a particular purpose or non-infringing. The entire risk as to the quality and performance of the Covered Software is with You. Should any Covered Software prove defective in any respect, You (not any Contributor) assume the cost of any necessary servicing, repair, or correction. This disclaimer of warranty constitutes an essential part of this License. No use of any Covered Software is authorized under this License except under this disclaimer. 7. Limitation of Liability Under no circumstances and under no legal theory, whether tort (including negligence), contract, or otherwise, shall any Contributor, or anyone who distributes Covered Software as permitted above, be liable to You for any direct, indirect, special, incidental, or consequential damages of any character including, without limitation, damages for lost profits, loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses, even if such party shall have been informed of the possibility of such damages. This limitation of liability shall not apply to liability for death or personal injury resulting from such party's negligence to the extent applicable law prohibits such limitation. Some jurisdictions do not allow the exclusion or limitation of incidental or consequential damages, so this exclusion and limitation may not apply to You. 8. Litigation Any litigation relating to this License may be brought only in the courts of a jurisdiction where the defendant maintains its principal place of business and such litigation shall be governed by laws of that jurisdiction, without reference to its conflict-of-law provisions. Nothing in this Section shall prevent a party's ability to bring cross-claims or counter-claims. 9. Miscellaneous This License represents the complete agreement concerning the subject matter hereof. If any provision of this License is held to be unenforceable, such provision shall be reformed only to the extent necessary to make it enforceable. Any law or regulation which provides that the language of a contract shall be construed against the drafter shall not be used to construe this License against a Contributor. 10. Versions of the License 10.1. New Versions Mozilla Foundation is the license steward. Except as provided in Section 10.3, no one other than the license steward has the right to modify or publish new versions of this License. Each version will be given a distinguishing version number. 10.2. Effect of New Versions You may distribute the Covered Software under the terms of the version of the License under which You originally received the Covered Software, or under the terms of any subsequent version published by the license steward. 10.3. Modified Versions If you create software not governed by this License, and you want to create a new license for such software, you may create and use a modified version of this License if you rename the license and remove any references to the name of the license steward (except to note that such modified license differs from this License). 10.4. Distributing Source Code Form that is Incompatible With Secondary Licenses If You choose to distribute Source Code Form that is Incompatible With Secondary Licenses under the terms of this version of the License, the notice described in Exhibit B of this License must be attached. Exhibit A - Source Code Form License Notice This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not distributed with this file, You can obtain one at http://mozilla.org/MPL/2.0/. If it is not possible or desirable to put the notice in a particular file, then You may include the notice in a location (such as a LICENSE file in a relevant directory) where a recipient would be likely to look for such a notice. You may add additional accurate notices of copyright ownership. Exhibit B - "Incompatible With Secondary Licenses" Notice This Source Code Form is "Incompatible With Secondary Licenses", as defined by the Mozilla Public License, v. 2.0.	15.58 KB	2025-05-25 12:27
📄 README.md golang-lru ========== This provides the `lru` package which implements a fixed-size thread safe LRU cache. It is based on the cache in Groupcache. Documentation ============= Full docs are available on [Go Packages](https://pkg.go.dev/github.com/hashicorp/golang-lru/v2) LRU cache example ================= ```go package main import ( "fmt" "github.com/hashicorp/golang-lru/v2" ) func main() { l, _ := lru.New[int, any](128) for i := 0; i < 256; i++ { l.Add(i, nil) } if l.Len() != 128 { panic(fmt.Sprintf("bad len: %v", l.Len())) } } ``` Expirable LRU cache example =========================== ```go package main import ( "fmt" "time" "github.com/hashicorp/golang-lru/v2/expirable" ) func main() { // make cache with 10ms TTL and 5 max keys cache := expirable.NewLRU[string, string](5, nil, time.Millisecond10) // set value under key1. cache.Add("key1", "val1") // get value under key1 r, ok := cache.Get("key1") // check for OK value if ok { fmt.Printf("value before expiration is found: %v, value: %q\n", ok, r) } // wait for cache to expire time.Sleep(time.Millisecond 12) // get value under key1 after key expiration r, ok = cache.Get("key1") fmt.Printf("value after expiration is found: %v, value: %q\n", ok, r) // set value under key2, would evict old entry because it is already expired. cache.Add("key2", "val2") fmt.Printf("Cache len: %d\n", cache.Len()) // Output: // value before expiration is found: true, value: "val1" // value after expiration is found: false, value: "" // Cache len: 1 } ```	1.53 KB	2025-05-25 12:27
📄 doc.go // Copyright (c) HashiCorp, Inc. // SPDX-License-Identifier: MPL-2.0 // Package lru provides three different LRU caches of varying sophistication. // // Cache is a simple LRU cache. It is based on the LRU implementation in // groupcache: https://github.com/golang/groupcache/tree/master/lru // // TwoQueueCache tracks frequently used and recently used entries separately. // This avoids a burst of accesses from taking out frequently used entries, at // the cost of about 2x computational overhead and some extra bookkeeping. // // ARCCache is an adaptive replacement cache. It tracks recent evictions as well // as recent usage in both the frequent and recent caches. Its computational // overhead is comparable to TwoQueueCache, but the memory overhead is linear // with the size of the cache. // // ARC has been patented by IBM, so do not use it if that is problematic for // your program. For this reason, it is in a separate go module contained within // this repository. // // All caches in this package take locks while operating, and are therefore // thread-safe for consumers. package lru	1.07 KB	2025-05-25 12:27
📁 expirable	-	2025-05-25 12:27
📄 go.mod module github.com/hashicorp/golang-lru/v2 go 1.18	51 B	2025-05-25 12:27
📁 internal	-	2025-05-25 12:27
📄 lru.go // Copyright (c) HashiCorp, Inc. // SPDX-License-Identifier: MPL-2.0 package lru import ( "sync" "github.com/hashicorp/golang-lru/v2/simplelru" ) const ( // DefaultEvictedBufferSize defines the default buffer size to store evicted key/val DefaultEvictedBufferSize = 16 ) // Cache is a thread-safe fixed size LRU cache. type Cache[K comparable, V any] struct { lru simplelru.LRU[K, V] evictedKeys []K evictedVals []V onEvictedCB func(k K, v V) lock sync.RWMutex } // New creates an LRU of the given size. func New[K comparable, V any](size int) (Cache[K, V], error) { return NewWithEvict[K, V](size, nil) } // NewWithEvict constructs a fixed size cache with the given eviction // callback. func NewWithEvict[K comparable, V any](size int, onEvicted func(key K, value V)) (c Cache[K, V], err error) { // create a cache with default settings c = &Cache[K, V]{ onEvictedCB: onEvicted, } if onEvicted != nil { c.initEvictBuffers() onEvicted = c.onEvicted } c.lru, err = simplelru.NewLRU(size, onEvicted) return } func (c Cache[K, V]) initEvictBuffers() { c.evictedKeys = make([]K, 0, DefaultEvictedBufferSize) c.evictedVals = make([]V, 0, DefaultEvictedBufferSize) } // onEvicted save evicted key/val and sent in externally registered callback // outside of critical section func (c Cache[K, V]) onEvicted(k K, v V) { c.evictedKeys = append(c.evictedKeys, k) c.evictedVals = append(c.evictedVals, v) } // Purge is used to completely clear the cache. func (c Cache[K, V]) Purge() { var ks []K var vs []V c.lock.Lock() c.lru.Purge() if c.onEvictedCB != nil && len(c.evictedKeys) > 0 { ks, vs = c.evictedKeys, c.evictedVals c.initEvictBuffers() } c.lock.Unlock() // invoke callback outside of critical section if c.onEvictedCB != nil { for i := 0; i < len(ks); i++ { c.onEvictedCB(ks[i], vs[i]) } } } // Add adds a value to the cache. Returns true if an eviction occurred. func (c Cache[K, V]) Add(key K, value V) (evicted bool) { var k K var v V c.lock.Lock() evicted = c.lru.Add(key, value) if c.onEvictedCB != nil && evicted { k, v = c.evictedKeys[0], c.evictedVals[0] c.evictedKeys, c.evictedVals = c.evictedKeys[:0], c.evictedVals[:0] } c.lock.Unlock() if c.onEvictedCB != nil && evicted { c.onEvictedCB(k, v) } return } // Get looks up a key's value from the cache. func (c Cache[K, V]) Get(key K) (value V, ok bool) { c.lock.Lock() value, ok = c.lru.Get(key) c.lock.Unlock() return value, ok } // Contains checks if a key is in the cache, without updating the // recent-ness or deleting it for being stale. func (c Cache[K, V]) Contains(key K) bool { c.lock.RLock() containKey := c.lru.Contains(key) c.lock.RUnlock() return containKey } // Peek returns the key value (or undefined if not found) without updating // the "recently used"-ness of the key. func (c Cache[K, V]) Peek(key K) (value V, ok bool) { c.lock.RLock() value, ok = c.lru.Peek(key) c.lock.RUnlock() return value, ok } // ContainsOrAdd checks if a key is in the cache without updating the // recent-ness or deleting it for being stale, and if not, adds the value. // Returns whether found and whether an eviction occurred. func (c Cache[K, V]) ContainsOrAdd(key K, value V) (ok, evicted bool) { var k K var v V c.lock.Lock() if c.lru.Contains(key) { c.lock.Unlock() return true, false } evicted = c.lru.Add(key, value) if c.onEvictedCB != nil && evicted { k, v = c.evictedKeys[0], c.evictedVals[0] c.evictedKeys, c.evictedVals = c.evictedKeys[:0], c.evictedVals[:0] } c.lock.Unlock() if c.onEvictedCB != nil && evicted { c.onEvictedCB(k, v) } return false, evicted } // PeekOrAdd checks if a key is in the cache without updating the // recent-ness or deleting it for being stale, and if not, adds the value. // Returns whether found and whether an eviction occurred. func (c Cache[K, V]) PeekOrAdd(key K, value V) (previous V, ok, evicted bool) { var k K var v V c.lock.Lock() previous, ok = c.lru.Peek(key) if ok { c.lock.Unlock() return previous, true, false } evicted = c.lru.Add(key, value) if c.onEvictedCB != nil && evicted { k, v = c.evictedKeys[0], c.evictedVals[0] c.evictedKeys, c.evictedVals = c.evictedKeys[:0], c.evictedVals[:0] } c.lock.Unlock() if c.onEvictedCB != nil && evicted { c.onEvictedCB(k, v) } return } // Remove removes the provided key from the cache. func (c Cache[K, V]) Remove(key K) (present bool) { var k K var v V c.lock.Lock() present = c.lru.Remove(key) if c.onEvictedCB != nil && present { k, v = c.evictedKeys[0], c.evictedVals[0] c.evictedKeys, c.evictedVals = c.evictedKeys[:0], c.evictedVals[:0] } c.lock.Unlock() if c.onEvictedCB != nil && present { c.onEvictedCB(k, v) } return } // Resize changes the cache size. func (c Cache[K, V]) Resize(size int) (evicted int) { var ks []K var vs []V c.lock.Lock() evicted = c.lru.Resize(size) if c.onEvictedCB != nil && evicted > 0 { ks, vs = c.evictedKeys, c.evictedVals c.initEvictBuffers() } c.lock.Unlock() if c.onEvictedCB != nil && evicted > 0 { for i := 0; i < len(ks); i++ { c.onEvictedCB(ks[i], vs[i]) } } return evicted } // RemoveOldest removes the oldest item from the cache. func (c Cache[K, V]) RemoveOldest() (key K, value V, ok bool) { var k K var v V c.lock.Lock() key, value, ok = c.lru.RemoveOldest() if c.onEvictedCB != nil && ok { k, v = c.evictedKeys[0], c.evictedVals[0] c.evictedKeys, c.evictedVals = c.evictedKeys[:0], c.evictedVals[:0] } c.lock.Unlock() if c.onEvictedCB != nil && ok { c.onEvictedCB(k, v) } return } // GetOldest returns the oldest entry func (c Cache[K, V]) GetOldest() (key K, value V, ok bool) { c.lock.RLock() key, value, ok = c.lru.GetOldest() c.lock.RUnlock() return } // Keys returns a slice of the keys in the cache, from oldest to newest. func (c Cache[K, V]) Keys() []K { c.lock.RLock() keys := c.lru.Keys() c.lock.RUnlock() return keys } // Values returns a slice of the values in the cache, from oldest to newest. func (c Cache[K, V]) Values() []V { c.lock.RLock() values := c.lru.Values() c.lock.RUnlock() return values } // Len returns the number of items in the cache. func (c *Cache[K, V]) Len() int { c.lock.RLock() length := c.lru.Len() c.lock.RUnlock() return length }	6.18 KB	2025-05-25 12:27
📄 lru_test.go // Copyright (c) HashiCorp, Inc. // SPDX-License-Identifier: MPL-2.0 package lru import ( "reflect" "testing" ) func BenchmarkLRU_Rand(b testing.B) { l, err := New[int64, int64](8192) if err != nil { b.Fatalf("err: %v", err) } trace := make([]int64, b.N2) for i := 0; i < b.N2; i++ { trace[i] = getRand(b) % 32768 } b.ResetTimer() var hit, miss int for i := 0; i < 2b.N; i++ { if i%2 == 0 { l.Add(trace[i], trace[i]) } else { if _, ok := l.Get(trace[i]); ok { hit++ } else { miss++ } } } b.Logf("hit: %d miss: %d ratio: %f", hit, miss, float64(hit)/float64(hit+miss)) } func BenchmarkLRU_Freq(b testing.B) { l, err := New[int64, int64](8192) if err != nil { b.Fatalf("err: %v", err) } trace := make([]int64, b.N2) for i := 0; i < b.N2; i++ { if i%2 == 0 { trace[i] = getRand(b) % 16384 } else { trace[i] = getRand(b) % 32768 } } b.ResetTimer() for i := 0; i < b.N; i++ { l.Add(trace[i], trace[i]) } var hit, miss int for i := 0; i < b.N; i++ { if _, ok := l.Get(trace[i]); ok { hit++ } else { miss++ } } b.Logf("hit: %d miss: %d ratio: %f", hit, miss, float64(hit)/float64(hit+miss)) } func TestLRU(t testing.T) { evictCounter := 0 onEvicted := func(k int, v int) { if k != v { t.Fatalf("Evict values not equal (%v!=%v)", k, v) } evictCounter++ } l, err := NewWithEvict(128, onEvicted) if err != nil { t.Fatalf("err: %v", err) } for i := 0; i < 256; i++ { l.Add(i, i) } if l.Len() != 128 { t.Fatalf("bad len: %v", l.Len()) } if evictCounter != 128 { t.Fatalf("bad evict count: %v", evictCounter) } for i, k := range l.Keys() { if v, ok := l.Get(k); !ok \|\| v != k \|\| v != i+128 { t.Fatalf("bad key: %v", k) } } for i, v := range l.Values() { if v != i+128 { t.Fatalf("bad value: %v", v) } } for i := 0; i < 128; i++ { if _, ok := l.Get(i); ok { t.Fatalf("should be evicted") } } for i := 128; i < 256; i++ { if _, ok := l.Get(i); !ok { t.Fatalf("should not be evicted") } } for i := 128; i < 192; i++ { l.Remove(i) if _, ok := l.Get(i); ok { t.Fatalf("should be deleted") } } l.Get(192) // expect 192 to be last key in l.Keys() for i, k := range l.Keys() { if (i < 63 && k != i+193) \|\| (i == 63 && k != 192) { t.Fatalf("out of order key: %v", k) } } l.Purge() if l.Len() != 0 { t.Fatalf("bad len: %v", l.Len()) } if _, ok := l.Get(200); ok { t.Fatalf("should contain nothing") } } // test that Add returns true/false if an eviction occurred func TestLRUAdd(t testing.T) { evictCounter := 0 onEvicted := func(k int, v int) { evictCounter++ } l, err := NewWithEvict(1, onEvicted) if err != nil { t.Fatalf("err: %v", err) } if l.Add(1, 1) == true \|\| evictCounter != 0 { t.Errorf("should not have an eviction") } if l.Add(2, 2) == false \|\| evictCounter != 1 { t.Errorf("should have an eviction") } } // test that Contains doesn't update recent-ness func TestLRUContains(t testing.T) { l, err := New[int, int](2) if err != nil { t.Fatalf("err: %v", err) } l.Add(1, 1) l.Add(2, 2) if !l.Contains(1) { t.Errorf("1 should be contained") } l.Add(3, 3) if l.Contains(1) { t.Errorf("Contains should not have updated recent-ness of 1") } } // test that ContainsOrAdd doesn't update recent-ness func TestLRUContainsOrAdd(t testing.T) { l, err := New[int, int](2) if err != nil { t.Fatalf("err: %v", err) } l.Add(1, 1) l.Add(2, 2) contains, evict := l.ContainsOrAdd(1, 1) if !contains { t.Errorf("1 should be contained") } if evict { t.Errorf("nothing should be evicted here") } l.Add(3, 3) contains, evict = l.ContainsOrAdd(1, 1) if contains { t.Errorf("1 should not have been contained") } if !evict { t.Errorf("an eviction should have occurred") } if !l.Contains(1) { t.Errorf("now 1 should be contained") } } // test that PeekOrAdd doesn't update recent-ness func TestLRUPeekOrAdd(t testing.T) { l, err := New[int, int](2) if err != nil { t.Fatalf("err: %v", err) } l.Add(1, 1) l.Add(2, 2) previous, contains, evict := l.PeekOrAdd(1, 1) if !contains { t.Errorf("1 should be contained") } if evict { t.Errorf("nothing should be evicted here") } if previous != 1 { t.Errorf("previous is not equal to 1") } l.Add(3, 3) contains, evict = l.ContainsOrAdd(1, 1) if contains { t.Errorf("1 should not have been contained") } if !evict { t.Errorf("an eviction should have occurred") } if !l.Contains(1) { t.Errorf("now 1 should be contained") } } // test that Peek doesn't update recent-ness func TestLRUPeek(t testing.T) { l, err := New[int, int](2) if err != nil { t.Fatalf("err: %v", err) } l.Add(1, 1) l.Add(2, 2) if v, ok := l.Peek(1); !ok \|\| v != 1 { t.Errorf("1 should be set to 1: %v, %v", v, ok) } l.Add(3, 3) if l.Contains(1) { t.Errorf("should not have updated recent-ness of 1") } } // test that Resize can upsize and downsize func TestLRUResize(t testing.T) { onEvictCounter := 0 onEvicted := func(k int, v int) { onEvictCounter++ } l, err := NewWithEvict(2, onEvicted) if err != nil { t.Fatalf("err: %v", err) } // Downsize l.Add(1, 1) l.Add(2, 2) evicted := l.Resize(1) if evicted != 1 { t.Errorf("1 element should have been evicted: %v", evicted) } if onEvictCounter != 1 { t.Errorf("onEvicted should have been called 1 time: %v", onEvictCounter) } l.Add(3, 3) if l.Contains(1) { t.Errorf("Element 1 should have been evicted") } // Upsize evicted = l.Resize(2) if evicted != 0 { t.Errorf("0 elements should have been evicted: %v", evicted) } l.Add(4, 4) if !l.Contains(3) \|\| !l.Contains(4) { t.Errorf("Cache should have contained 2 elements") } } func (c Cache[K, V]) wantKeys(t testing.T, want []K) { t.Helper() got := c.Keys() if !reflect.DeepEqual(got, want) { t.Errorf("wrong keys got: %v, want: %v ", got, want) } } func TestCache_EvictionSameKey(t testing.T) { t.Run("Add", func(t testing.T) { var evictedKeys []int cache, _ := NewWithEvict( 2, func(key int, _ struct{}) { evictedKeys = append(evictedKeys, key) }) if evicted := cache.Add(1, struct{}{}); evicted { t.Error("First 1: got unexpected eviction") } cache.wantKeys(t, []int{1}) if evicted := cache.Add(2, struct{}{}); evicted { t.Error("2: got unexpected eviction") } cache.wantKeys(t, []int{1, 2}) if evicted := cache.Add(1, struct{}{}); evicted { t.Error("Second 1: got unexpected eviction") } cache.wantKeys(t, []int{2, 1}) if evicted := cache.Add(3, struct{}{}); !evicted { t.Error("3: did not get expected eviction") } cache.wantKeys(t, []int{1, 3}) want := []int{2} if !reflect.DeepEqual(evictedKeys, want) { t.Errorf("evictedKeys got: %v want: %v", evictedKeys, want) } }) t.Run("ContainsOrAdd", func(t testing.T) { var evictedKeys []int cache, _ := NewWithEvict( 2, func(key int, _ struct{}) { evictedKeys = append(evictedKeys, key) }) contained, evicted := cache.ContainsOrAdd(1, struct{}{}) if contained { t.Error("First 1: got unexpected contained") } if evicted { t.Error("First 1: got unexpected eviction") } cache.wantKeys(t, []int{1}) contained, evicted = cache.ContainsOrAdd(2, struct{}{}) if contained { t.Error("2: got unexpected contained") } if evicted { t.Error("2: got unexpected eviction") } cache.wantKeys(t, []int{1, 2}) contained, evicted = cache.ContainsOrAdd(1, struct{}{}) if !contained { t.Error("Second 1: did not get expected contained") } if evicted { t.Error("Second 1: got unexpected eviction") } cache.wantKeys(t, []int{1, 2}) contained, evicted = cache.ContainsOrAdd(3, struct{}{}) if contained { t.Error("3: got unexpected contained") } if !evicted { t.Error("3: did not get expected eviction") } cache.wantKeys(t, []int{2, 3}) want := []int{1} if !reflect.DeepEqual(evictedKeys, want) { t.Errorf("evictedKeys got: %v want: %v", evictedKeys, want) } }) t.Run("PeekOrAdd", func(t testing.T) { var evictedKeys []int cache, _ := NewWithEvict( 2, func(key int, _ struct{}) { evictedKeys = append(evictedKeys, key) }) _, contained, evicted := cache.PeekOrAdd(1, struct{}{}) if contained { t.Error("First 1: got unexpected contained") } if evicted { t.Error("First 1: got unexpected eviction") } cache.wantKeys(t, []int{1}) _, contained, evicted = cache.PeekOrAdd(2, struct{}{}) if contained { t.Error("2: got unexpected contained") } if evicted { t.Error("2: got unexpected eviction") } cache.wantKeys(t, []int{1, 2}) _, contained, evicted = cache.PeekOrAdd(1, struct{}{}) if !contained { t.Error("Second 1: did not get expected contained") } if evicted { t.Error("Second 1: got unexpected eviction") } cache.wantKeys(t, []int{1, 2}) _, contained, evicted = cache.PeekOrAdd(3, struct{}{}) if contained { t.Error("3: got unexpected contained") } if !evicted { t.Error("3: did not get expected eviction") } cache.wantKeys(t, []int{2, 3}) want := []int{1} if !reflect.DeepEqual(evictedKeys, want) { t.Errorf("evictedKeys got: %v want: %v", evictedKeys, want) } }) }	9.02 KB	2025-05-25 12:27
📁 simplelru	-	2025-05-25 12:27
📄 testing_test.go // Copyright (c) HashiCorp, Inc. // SPDX-License-Identifier: MPL-2.0 package lru import ( "crypto/rand" "math" "math/big" "testing" ) func getRand(tb testing.TB) int64 { out, err := rand.Int(rand.Reader, big.NewInt(math.MaxInt64)) if err != nil { tb.Fatal(err) } return out.Int64() }	297 B	2025-05-25 12:27

Terminal