OrderedCache is a cache which supports binary searches using Ceil and Floor methods. It is backed by a left-leaning red black tree. See comments in UnorderedCache for more details on cache functionality. OrderedCache requires that keys implement llrb.Comparable. OrderedCache is not safe for concur
| 390 | // |
| 391 | // OrderedCache is not safe for concurrent access. |
| 392 | type OrderedCache struct { |
| 393 | baseCache |
| 394 | llrb llrb.Tree |
| 395 | } |
| 396 | |
| 397 | // NewOrderedCache creates a new Cache backed by a left-leaning red |
| 398 | // black binary tree which supports binary searches via the Ceil() and |
nothing calls this directly
no outgoing calls
no test coverage detected