anchor.diff:      return digits.reversed;
     }
   
  -  List<String> toDigits() {
  +  List<String> toDigits() { // change to valueToDigits()
       String digitsStringValue = value.toRadixString(base);
       List<String> digits = new List<String>.filled(nDigits, '0');
       if (digitsStringValue.length > nDigits) { // the number in the base is greater than the limit, so return "000" or whatever
  
positive.code:     return digits;
    }
  
    String digitsToString(List<String> digits) {
      //Probably a better way to do this
      StringBuffer resultString = new StringBuffer();
      for (int ctr = 0; ctr < this.nDigits; ctr++) {
  
negative.code: // Obviously wrong if you look at how this counts.
  
  main(List<String> arguments) {
    int minBase = 10;
    int maxBase = 10;
    int minNDigits = 2;
    int maxNDigits = 2;
  
    for (int base = minBase; base <= maxBase; base++) {
      for (int nDigits = minNDigits; nDigits <= maxNDigits; nDigits++) {
        int minValue = 1;
        //int maxValue = ((pow(base, nDigits)) / 2.0).ceil();
        int maxValue = pow(base, nDigits) - 1;
        TedNumber tedNumber = new TedNumber(base, nDigits, minValue);
        for (int value = minValue; value <= maxValue; value++) {
          // TedNumber tedNumber = new TedNumber(base, nDigits, value);
          print("Base $base, digits $nDigits: ${tedNumber.toForward()}:${tedNumber.toReversed()}");
          tedNumber.increment();
        }
      }
    }
  