Update charted to 0.4.8 and roll

packages/quiver/lib/src/iterables/range.dart

 // Copyright 2013 Google Inc. All Rights Reserved.
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.
 // You may obtain a copy of the License at
 //
 //     http://www.apache.org/licenses/LICENSE-2.0
 //
 // Unless required by applicable law or agreed to in writing, software
 // distributed under the License is distributed on an "AS IS" BASIS,
 // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
 part of quiver.iterables;
 
-/**
- * Returns an [Iterable] sequence of [num]s.
- *
- * If only one argument is provided, [start_or_stop] is the upper bound for the
- * sequence. If two or more arguments are provided, [stop] is the upper bound.
- *
- * The sequence starts at 0 if one argument is provided, or [start_or_stop] if
- * two or more arguments are provided. The sequence increments by 1, or [step]
- * if provided. [step] can be negative, in which case the sequence counts down
- * from the starting point and [stop] must be less than the starting point so
- * that it becomes the lower bound.
- */
+/// Returns an [Iterable] sequence of [num]s.
+///
+/// If only one argument is provided, [start_or_stop] is the upper bound for
+/// the sequence. If two or more arguments are provided, [stop] is the upper
+/// bound.
+///
+/// The sequence starts at 0 if one argument is provided, or [start_or_stop] if
+/// two or more arguments are provided. The sequence increments by 1, or [step]
+/// if provided. [step] can be negative, in which case the sequence counts down
+/// from the starting point and [stop] must be less than the starting point so
+/// that it becomes the lower bound.
 Iterable<num> range(num start_or_stop, [num stop, num step]) =>
     new _Range(start_or_stop, stop, step);
 
 class _Range extends IterableBase<num> {
   final num start, stop, step;
 
   _Range(num start_or_stop, num _stop, num _step)
       : start = (_stop == null) ? 0 : start_or_stop,
         stop = (_stop == null) ? start_or_stop : _stop,
         step = (_step == null) ? 1 : _step {
@@ skipping 26 matching lines @@
         _inRange = false;
 
   num get current => _inRange ? _value : null;
 
   bool moveNext() {
     if (_hasNext && _inRange) _value += _step;
     _inRange = _hasNext = (_step > 0) ? (_value < _stop) : (_value > _stop);
     return _hasNext;
   }
 }