 				{
 					value = data[k];
 					countNum++;
-					if (countNum >= numOfBins.value)
+					if (countNum >= _numOfBins)
 						break;
 				}
 			}

			}
			
			_sortedValues = new Array();
			_keyCount = 0;
			_previousSortedValues.length = 0;
			

				_tempNumberClassifier.min.value = _previousSortedValues[minIndex];
				
				var maxIndex:Number;
				if(iBin == _numOfBins -1)
				{
					maxIndex = _previousSortedValues.length -1;
				}
