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

de.telekom.phonenumbernormalizer.numberplans.NumberPlan Maven / Gradle / Ivy

/*
 * Copyright © 2023 Deutsche Telekom AG ([email protected])
 *
 * 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.
 */
package de.telekom.phonenumbernormalizer.numberplans;


import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

import java.util.Map;
import java.util.Collections;
import java.util.Optional;
import java.util.Comparator;


/**
 * This class provides basic logic to check a given number against a simple set of rules to identify if it is short numbers, which does not need normalization.
 * It also needs to provide its country calling code, to specify where the rules apply.
 * 

* PhoneLib already provide a ShortNumbers, but for EU wide 116xxx range only a few countries are configured to support the range. * For Germany only currently assigned numbers are configured which is in contrast to Googles definition of checks, * but nevertheless the corresponding Issues has been rejected. *

* Additionally, we designed the NumberPlanFactory to have a NumberPlan class for each DeviceContextLineType, so we can support short numbers which are valid only in fixed-line or mobile context. *

* @see NumberPlanFactory * @see de.telekom.phonenumbernormalizer.dto.DeviceContextLineType */ public abstract class NumberPlan { private static final Logger LOGGER = LoggerFactory.getLogger(NumberPlan.class); /** * A subclass needs to provide a Map<String, Integer> as tbe rules to identify short numbers * The key (String) is representing a prefix for the number and the value (Integer) is the total length of the short code (including the prefix) *
    *
  • e.g. "110"; 3 - the total length is already the length of the prefix, so its exactly the short number
  • *
  • e.g. "1100"; 5 - the total length is longer than the length of the prefix, so all number from 11000 to 11009 are coverd
  • *
  • e.g. both rules above can be combined, because longer prefixes are evaluated first, so that partical ranges of rules with shorter prefix can be overriden.
  • *
* @return Map of rules for the short codes * * @see NumberPlan#isNumberPlanValid() */ protected abstract Map getShortNumberCodes(); /** * A subclass can provide Country Calling Code of the rules - not used inside this class, but * re-usable when adding the subclass to the factory. * * @return Country Calling Code without leading international Dialing Prefix * * @see NumberPlanFactory */ public static String getCountryCode() { return null; } /** * Checks if a number is matching any a short number rule of the current number plan. * * @param number - number that should be checked against the number plan * @return boolean - if short number was matched */ public boolean isMatchingShortNumber(String number) { // first check if we have rules at all if (this.getShortNumberCodes() == null) { LOGGER.debug("no short number code rules available"); return false; } // check if the number is in the length range of short numbers defined by the rules. int minShortNumberLength = this.getMinShortNumberLength(); int maxShortNumberLength = this.getMaxShortNumberLength(); if (number.length() < minShortNumberLength) { LOGGER.debug("no short number, to short number: {}", number); return false; } if (number.length() > maxShortNumberLength) { LOGGER.debug("no short number, too long number: {}", number); return false; } // check if the number is starting with a prefix defined in the rule int minShortNumberKeyLength = this.getMinShortNumberKeyLength(); int maxShortNumberKeyLength = this.getMaxShortNumberKeyLength(); Integer validShortNumberLength; // starting prefix check with the longest prefix, so overlapping prefixes could be realized // e.g. 1180 is in Germany a starting prefix for a 6 digit short number while 1181 - 1189 is in Germany a starting // prefix for a 5 digits number and could be summed up by 118 and only 1180 is overriding this prefix part. for (int i = maxShortNumberKeyLength; i >= minShortNumberKeyLength; i--) { if (number.length() >= i) { String shortNumber = number.substring(0, i); if (this.getShortNumberCodes().containsKey(shortNumber)) { validShortNumberLength = this.getShortNumberCodes().get(shortNumber); return number.length() == validShortNumberLength; } } } LOGGER.debug("no short number, to code found for number: {}", number); return false; } /** * Returns the length of the shortest configured short Number within the rules. * * @return the length of the shortest short Number within the rules or 0 if no rule exists * * @see NumberPlan#getShortNumberCodes() */ private int getMinShortNumberLength() { if (getShortNumberCodes() != null) { return Collections.min(getShortNumberCodes().values()); } else return 0; } /** * Returns the length of the shortest prefix within the rules. * * @return the length of the shortest prefix within the rules or 0 if no rule exists * * @see NumberPlan#getShortNumberCodes() */ private int getMinShortNumberKeyLength() { if (getShortNumberCodes() != null) { Optional minKey = getShortNumberCodes().keySet().stream() .min(Comparator.comparing(String::length)); if (minKey.isPresent()) { return minKey.get().length(); } } return 0; } /** * Returns the length of the longest configured short Number within the rules. * * @return the length of the longest short Number within the rules or 0 if no rule exists * * @see NumberPlan#getShortNumberCodes() */ private int getMaxShortNumberLength() { if (getShortNumberCodes() != null) { return Collections.max(getShortNumberCodes().values()); } else return 0; } /** * Returns the length of the longest prefix within the rules. * * @return the length of the longest prefix within the rules or 0 if no rule exists * * @see NumberPlan#getShortNumberCodes() */ private int getMaxShortNumberKeyLength() { if (getShortNumberCodes() != null) { Optional maxKey = getShortNumberCodes().keySet().stream() .max(Comparator.comparing(String::length)); if (maxKey.isPresent()) { return maxKey.get().length(); } } return 0; } /** * Checks if the rules are logically without conflict. * Conflicts happen, if the length of a short number (value) is defined lower than the length of its prefix (key). * * @return are the rules free of conflict * * @see NumberPlan#getShortNumberCodes() */ public Boolean isNumberPlanValid() { if (this.getShortNumberCodes() != null) { for ( Map.Entry entry : this.getShortNumberCodes().entrySet()) { if (entry.getKey().length() > entry.getValue()) { LOGGER.warn("The length of the ShortNumberCode '{}' is longer then its ShortnumberCodeLength '{}'", entry.getKey(), entry.getValue()); return false; } } } return true; } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy