(cache *BigCache)
| 125 | } |
| 126 | |
| 127 | func newIterator(cache *BigCache) *EntryInfoIterator { |
| 128 | elements, count := cache.shards[0].copyHashedKeys() |
| 129 | |
| 130 | return &EntryInfoIterator{ |
| 131 | cache: cache, |
| 132 | currentShard: 0, |
| 133 | currentIndex: -1, |
| 134 | elements: elements, |
| 135 | elementsCount: count, |
| 136 | } |
| 137 | } |
| 138 | |
| 139 | // Value returns current value from the iterator |
| 140 | func (it *EntryInfoIterator) Value() (EntryInfo, error) { |
no test coverage detected
searching dependent graphs…