vendor: add github.com/die-net/lrucache

vendor/github.com/die-net/lrucache/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "{}"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright {yyyy} {name of copyright owner}
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

vendor/github.com/die-net/lrucache/README.md

@@ -0,0 +1,19 @@
+LruCache [![Build Status](https://travis-ci.org/die-net/lrucache.svg?branch=master)](https://travis-ci.org/die-net/lrucache) [![Coverage Status](https://coveralls.io/repos/github/die-net/lrucache/badge.svg?branch=master)](https://coveralls.io/github/die-net/lrucache?branch=master)
+========
+
+LruCache is a thread-safe, in-memory [httpcache.Cache](https://github.com/gregjones/httpcache) implementation that evicts the least recently used entries when a byte size limit or optional max age would be exceeded.
+
+Using the included [TwoTier](https://github.com/die-net/lrucache/tree/master/twotier) wrapper, it could also be used as a small and fast cache for popular objects, falling back to a larger and slower cache (such as [s3cache](https://github.com/sourcegraph/s3cache)) for less popular ones.
+
+Also see the godoc API documentation for [LruCache](https://godoc.org/github.com/die-net/lrucache) or [TwoTier](https://godoc.org/github.com/die-net/lrucache/twotier).
+
+Included are a test suite with close to 100% test coverage and a parallel benchmark suite that shows individual Set, Get, and Delete operations take under 400ns to complete.
+
+License
+-------
+
+Copyright 2016 Aaron Hopkins and contributors
+
+Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at: http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.

vendor/github.com/die-net/lrucache/lrucache.go

@@ -0,0 +1,146 @@
+// Package lrucache provides a byte-size-limited implementation of
+// httpcache.Cache that stores data in memory.
+package lrucache
+
+import (
+	"container/list"
+	"sync"
+	"time"
+)
+
+// LruCache is a thread-safe, in-memory httpcache.Cache that evicts the
+// least recently used entries from memory when either MaxSize (in bytes)
+// limit would be exceeded or (if set) the entries are older than MaxAge (in
+// seconds).  Use the New constructor to create one.
+type LruCache struct {
+	MaxSize int64
+	MaxAge  int64
+
+	mu    sync.Mutex
+	cache map[string]*list.Element
+	lru   *list.List // Front is least-recent
+	size  int64
+}
+
+// New creates an LruCache that will restrict itself to maxSize bytes of
+// memory.  If maxAge > 0, entries will also be expired after maxAge
+// seconds.
+func New(maxSize int64, maxAge int64) *LruCache {
+	c := &LruCache{
+		MaxSize: maxSize,
+		MaxAge:  maxAge,
+		lru:     list.New(),
+		cache:   make(map[string]*list.Element),
+	}
+
+	return c
+}
+
+// Get returns the []byte representation of a cached response and a bool
+// set to true if the key was found.
+func (c *LruCache) Get(key string) ([]byte, bool) {
+	c.mu.Lock()
+
+	le, ok := c.cache[key]
+	if !ok {
+		c.mu.Unlock() // Avoiding defer overhead
+		return nil, false
+	}
+
+	if c.MaxAge > 0 && le.Value.(*entry).expires <= time.Now().Unix() {
+		c.deleteElement(le)
+		c.maybeDeleteOldest()
+
+		c.mu.Unlock() // Avoiding defer overhead
+		return nil, false
+	}
+
+	c.lru.MoveToBack(le)
+	value := le.Value.(*entry).value
+
+	c.mu.Unlock() // Avoiding defer overhead
+	return value, true
+}
+
+// Set stores the []byte representation of a response for a given key.
+func (c *LruCache) Set(key string, value []byte) {
+	c.mu.Lock()
+
+	expires := int64(0)
+	if c.MaxAge > 0 {
+		expires = time.Now().Unix() + c.MaxAge
+	}
+
+	if le, ok := c.cache[key]; ok {
+		c.lru.MoveToBack(le)
+		e := le.Value.(*entry)
+		c.size += int64(len(value)) - int64(len(e.value))
+		e.value = value
+		e.expires = expires
+	} else {
+		e := &entry{key: key, value: value, expires: expires}
+		c.cache[key] = c.lru.PushBack(e)
+		c.size += e.size()
+	}
+
+	c.maybeDeleteOldest()
+
+	c.mu.Unlock()
+}
+
+// Delete removes the value associated with a key.
+func (c *LruCache) Delete(key string) {
+	c.mu.Lock()
+
+	if le, ok := c.cache[key]; ok {
+		c.deleteElement(le)
+	}
+
+	c.mu.Unlock()
+}
+
+// Size returns the estimated current memory usage of LruCache.
+func (c *LruCache) Size() int64 {
+	c.mu.Lock()
+	size := c.size
+	c.mu.Unlock()
+
+	return size
+}
+
+func (c *LruCache) maybeDeleteOldest() {
+	for c.size > c.MaxSize {
+		le := c.lru.Front()
+		if le == nil {
+			panic("LruCache: non-zero size but empty lru")
+		}
+		c.deleteElement(le)
+	}
+
+	if c.MaxAge > 0 {
+		now := time.Now().Unix()
+		for le := c.lru.Front(); le != nil && le.Value.(*entry).expires <= now; le = c.lru.Front() {
+			c.deleteElement(le)
+		}
+	}
+}
+
+func (c *LruCache) deleteElement(le *list.Element) {
+	c.lru.Remove(le)
+	e := le.Value.(*entry)
+	delete(c.cache, e.key)
+	c.size -= e.size()
+}
+
+// Rough estimate of map + entry object + string + byte slice overheads in bytes.
+const entryOverhead = 168
+
+type entry struct {
+	key     string
+	value   []byte
+	expires int64
+}
+
+func (e *entry) size() int64 {
+	return entryOverhead + int64(len(e.key)) + int64(len(e.value))
+}

vendor/github.com/die-net/lrucache/twotier/README.md

@@ -0,0 +1,21 @@
+TwoTier [![Build Status](https://travis-ci.org/die-net/lrucache.svg?branch=master)](https://travis-ci.org/die-net/lrucache)
+========
+
+TwoTier is an [httpcache.Cache](https://github.com/gregjones/httpcache) implementation that wraps two other httpcache.Cache instances,
+allowing you to use both a small and fast cache (such as an in-memory [LruCache](https://github.com/die-net/lrucache) or [memcache](https://github.com/gregjones/httpcache/tree/master/memcache)) for popular objects and
+fall back to a larger and slower cache (such as [s3cache](https://github.com/sourcegraph/s3cache)) for less popular ones.
+
+While TwoTier passes Set and Delete operations to both tiers, it can't make strong guarantees that the contents of both caches will always remain in sync. If you are caching URLs that don't change often or don't mind that you sometimes get different versions of the same URL's contents, this is probably fine. When using LruCache as the first-tier cache, you can limit how long it can disagree with the second-tier cache by setting its MaxAge parameter to the maximum time you are comfortable with them disagreeing.
+
+See the godoc API documentation for [TwoTier](https://godoc.org/github.com/die-net/lrucache/twotier) or [LruCache](https://godoc.org/github.com/die-net/lrucache).
+
+There is a test-suite included that has close to 100% test coverage on TwoTier's relatively simple functionality.
+
+License
+-------
+
+Copyright 2016 Aaron Hopkins and contributors
+
+Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at: http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.

vendor/github.com/die-net/lrucache/twotier/twotier.go

@@ -0,0 +1,57 @@
+// Package twotier provides a wrapper for two httpcache.Cache instances,
+// allowing you to use both a small and fast cache for popular objects and
+// fall back to a larger and slower cache for less popular ones.
+package twotier
+
+import (
+	"github.com/gregjones/httpcache"
+)
+
+// TwoTier creates a two-tiered cache out of two httpcache.Cache instances.
+// Reads are favored from first, and writes affect both first and second.
+type TwoTier struct {
+	first  httpcache.Cache
+	second httpcache.Cache
+}
+
+// New creates a TwoTier. Both first and second must be non-nil.
+func New(first httpcache.Cache, second httpcache.Cache) *TwoTier {
+	if first == nil || second == nil || first == second {
+		return nil
+	}
+	return &TwoTier{first: first, second: second}
+}
+
+// Get returns the []byte representation of a cached response and a bool set
+// to true if the key was found.  It tries the first tier cache, and if
+// that's not successful, copies the result from the second tier into the
+// first tier.
+func (c *TwoTier) Get(key string) ([]byte, bool) {
+	if value, ok := c.first.Get(key); ok {
+		return value, true
+	}
+
+	value, ok := c.second.Get(key)
+	if !ok {
+		return nil, false
+	}
+
+	c.first.Set(key, value)
+
+	return value, true
+}
+
+// Set stores the []byte representation of a response for a given key into
+// the second tier cache, and deletes the cache entry from the first tier
+// cache.
+func (c *TwoTier) Set(key string, value []byte) {
+	c.second.Set(key, value)
+	c.first.Delete(key)
+}
+
+// Delete removes the value associated with a key from both the first and
+// second tier caches.
+func (c *TwoTier) Delete(key string) {
+	c.second.Delete(key)
+	c.first.Delete(key)
+}

vendor/vendor.json

@@ -230,6 +230,18 @@
 			"revision": "a539ee1a749a2b895533f979515ac7e6e0f5b650",
 			"revisionTime": "2017-06-08T00:51:49Z"
 		},
+		{
+			"checksumSHA1": "ixCQL3bWowRQGeWOS0eg2JWTy4Q=",
+			"path": "github.com/die-net/lrucache",
+			"revision": "36174c11a4bb5b86413af31527b6a1469426ed06",
+			"revisionTime": "2017-05-25T23:02:08Z"
+		},
+		{
+			"checksumSHA1": "bLKUgAPC8sntHXaqNmt5h9ZwNkI=",
+			"path": "github.com/die-net/lrucache/twotier",
+			"revision": "36174c11a4bb5b86413af31527b6a1469426ed06",
+			"revisionTime": "2017-05-25T23:02:08Z"
+		},
 		{
 			"checksumSHA1": "YIXBtGk4CTbbCPmIkYzEGva4ZAA=",
 			"path": "github.com/diegomarangoni/gcscache",