 			var xDistance:Number;
 			var yDistance:Number;
 			var distanceSq:Number;
-			var recordBounds:IBounds2D;
 			var xQueryCenter:Number = queryBounds.getXCenter();
 			var yQueryCenter:Number = queryBounds.getYCenter();
 			var foundQueryCenterOverlap:Boolean = false; // true when we found a key that overlaps the center of the given bounds

				var object:Object = selectedObjects[i];
				var overlapsQueryCenter:Boolean = false;
				
				// if the plotter wasn't an IPlotterWithGeometries or if the user wants the old probing
				for each (recordBounds in objectToBounds[object])
				{
					// find the distance squared from the query point to the center of the shape
					xDistance = recordBounds.getXCenter() - xQueryCenter;
					yDistance = recordBounds.getYCenter() - yQueryCenter;
					distanceSq = xDistance * xDistance + yDistance * yDistance;
					
					overlapsQueryCenter = recordBounds.contains(xQueryCenter, yQueryCenter);
					
					// Consider all keys until we have found one that overlaps the query center.
					// After that, only consider keys that overlap query center.
					if (!foundQueryCenterOverlap || overlapsQueryCenter)
					{
						// if this is the first record that overlaps the query center, reset the list of keys
						if (!foundQueryCenterOverlap && overlapsQueryCenter)
						{
							resultCount = 0;
							closestDistanceSq = Infinity;
							foundQueryCenterOverlap = true;
						}
						// if this distance is closer than any previous distance, clear all previous keys
						if (distanceSq < closestDistanceSq)
						{
							// clear previous result and update closest distance
							resultCount = 0;
							closestDistanceSq = distanceSq;
						}
						// add keys to the result if they are the closest so far
						if (distanceSq == closestDistanceSq && (resultCount == 0 || result[resultCount - 1] != object))
							result[resultCount++] = object;
					}
				}
			}
			
			result.length = resultCount;
			return result;
		}
	}
}

		 */		
		public function clear():void
		{
			objectToCoords = new Dictionary(true);
			_kdTree.clear();
		}
		
