RMMemoryCache.m
3.71 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
//
// RMMemoryCache.m
//
// Copyright (c) 2008-2009, Route-Me Contributors
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice, this
// list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
#import "RMMemoryCache.h"
#import "RMTileImage.h"
@implementation RMMemoryCache
-(id)initWithCapacity: (NSUInteger) _capacity
{
if (![super init])
return nil;
RMLog(@"initializing memory cache %@ with capacity %d", self, _capacity);
cache = [[NSMutableDictionary alloc] initWithCapacity:_capacity];
if (_capacity < 1)
_capacity = 1;
capacity = _capacity;
[[NSNotificationCenter defaultCenter] addObserver:self
selector:@selector(imageLoadingCancelled:)
name:RMMapImageLoadingCancelledNotification
object:nil];
return self;
}
/// \bug magic number
-(id)init
{
return [self initWithCapacity:32];
}
-(void) dealloc
{
LogMethod();
[[NSNotificationCenter defaultCenter] removeObserver:self];
[cache release];
[super dealloc];
}
-(void) didReceiveMemoryWarning
{
LogMethod();
[cache removeAllObjects];
}
-(void) removeTile: (RMTile) tile
{
// RMLog(@"tile %d %d %d removed from cache", tile.x, tile.y, tile.zoom);
[cache removeObjectForKey:[RMTileCache tileHash: tile]];
}
-(void) imageLoadingCancelled: (NSNotification*)notification
{
[self removeTile: [[notification object] tile]];
}
-(RMTileImage*) cachedImage:(RMTile)tile
{
NSNumber *key = [RMTileCache tileHash: tile];
RMTileImage *image = [cache objectForKey:key];
return image;
}
/// Remove the least-recently used image from cache, if cache is at or over capacity. Removes only 1 image.
-(void)makeSpaceInCache
{
while ([cache count] >= capacity)
{
// Rather than scanning I would really like to be using a priority queue
// backed by a heap here.
NSEnumerator *enumerator = [cache objectEnumerator];
RMTileImage *image;
NSDate *oldestDate = nil;
RMTileImage *oldestImage = nil;
while ((image = (RMTileImage*)[enumerator nextObject]))
{
if (oldestDate == nil
|| ([oldestDate timeIntervalSinceReferenceDate] > [[image lastUsedTime] timeIntervalSinceReferenceDate]))
{
oldestDate = [image lastUsedTime];
oldestImage = image;
}
}
if(oldestImage) [self removeTile:[oldestImage tile]];
}
}
-(void)addTile: (RMTile)tile WithImage: (RMTileImage*)image
{
if (RMTileIsDummy(tile))
return;
// RMLog(@"cache add %@", key);
[self makeSpaceInCache];
NSNumber *key = [RMTileCache tileHash: tile];
[cache setObject:image forKey:key];
}
-(void) removeAllCachedImages
{
[cache removeAllObjects];
}
@end