Changes made as asked

Author: darkyen

lib/ImageCache.js

@@ -77,6 +77,7 @@ assign(Img.prototype, EventEmitter.prototype, {
 });
 
 var kInstancePoolLength = 300;
+
 var _instancePool = {
  length: 0,
  // Keep all the nodes in memory.
@@ -115,18 +116,17 @@ var _instancePool = {
  },
 
  _reduceLeastUsed: function (least, currentHash) {
-  var current = this.elements[currentHash];
+ var current = _instancePool.elements[currentHash];
 
-  if( least.freq > current.freq ){
-  return current;
-  }
+ if( least.freq > current.freq ){
+ return current;
+ }
 
-  return least;
+ return least;
  },
 
  popLeastUsed: function () {
- // there is a much faster way using self
- var reducer = this._reduceLeastUsed.bind(this);
+ var reducer = _instancePool._reduceLeastUsed;
  var minUsed = Object.keys(this.elements).reduce(reducer, { freq: Infinity });
 
  if( minUsed.hash ){
@@ -149,7 +149,7 @@ var ImageCache = {
  get: function (src) {
  var image = _instancePool.get(src);
  if (!image) {
- // Simple FIFO queue
+ // Awesome LRU
  image = new Img(src);
  if (_instancePool.length >= kInstancePoolLength) {
  _instancePool.popLeastUsed().destructor();
@@ -161,4 +161,4 @@ var ImageCache = {
 
 };
 
-module.exports = ImageCache;
+module.exports = ImageCache;