All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.smallmind.nutsnbolts.util.AlphaSpread Maven / Gradle / Ivy

There is a newer version: 6.2.0
Show newest version
/*
 * Copyright (c) 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020 David Berkman
 *
 * This file is part of the SmallMind Code Project.
 *
 * The SmallMind Code Project is free software, you can redistribute
 * it and/or modify it under either, at your discretion...
 *
 * 1) The terms of GNU Affero General Public License as published by the
 * Free Software Foundation, either version 3 of the License, or (at
 * your option) any later version.
 *
 * ...or...
 *
 * 2) The terms of the Apache License, Version 2.0.
 *
 * The SmallMind Code Project is distributed in the hope that it will
 * be useful, but WITHOUT ANY WARRANTY; without even the implied warranty
 * of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
 * General Public License or Apache License for more details.
 *
 * You should have received a copy of the GNU Affero General Public License
 * and the Apache License along with the SmallMind Code Project. If not, see
 *  or .
 *
 * Additional permission under the GNU Affero GPL version 3 section 7
 * ------------------------------------------------------------------
 * If you modify this Program, or any covered work, by linking or
 * combining it with other code, such other code is not for that reason
 * alone subject to any of the requirements of the GNU Affero GPL
 * version 3.
 */
package org.smallmind.nutsnbolts.util;

import java.util.LinkedList;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

public class AlphaSpread {

  private static final Pattern LETTER_PATTERN = Pattern.compile("[a-z]");
  private static final Pattern SPREAD_PATTERN = Pattern.compile("([a-z])\\.\\.([a-z])");

  public static char[] calculate (String letters)
    throws SpreadParserException {

    if ((letters == null) || letters.isEmpty()) {

      return new char[0];
    } else {

      Matcher zoneMatcher;
      LinkedList letterList = new LinkedList<>();
      String[] zones = letters.split(",", 0);
      char[] spreadArray;
      int index = 0;

      for (String zone : zones) {
        if (zone.trim().length() == 0) {
          throw new SpreadParserException("Empty elements are not allowed");
        }

        if ((zoneMatcher = LETTER_PATTERN.matcher(zone.trim())).matches()) {
          letterList.add(zoneMatcher.group().charAt(0));
        } else if ((zoneMatcher = SPREAD_PATTERN.matcher(zone.trim())).matches()) {

          char start = zoneMatcher.group(1).charAt(0);
          char end = zoneMatcher.group(2).charAt(0);

          if (start <= end) {
            for (char letter = start; letter <= end; letter++) {
              letterList.add(letter);
            }
          } else {
            for (char letter = start; letter >= end; letter--) {
              letterList.add(letter);
            }
          }
        } else {
          throw new SpreadParserException("Could not parse elements");
        }
      }

      spreadArray = new char[letterList.size()];
      for (Character letter : letterList) {
        spreadArray[index++] = letter;
      }

      return spreadArray;
    }
  }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy