• Home
• org.mariuszgromada.math
• MathParser.org-mXparser
• 6.0.0
• source code
• StringUtils.java

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

org.mariuszgromada.math.mxparser.StringUtils Maven / Gradle / Ivy

/*
 * @(#)StringUtils.java        6.0.0    2024-05-19
 *
 * MathParser.org-mXparser DUAL LICENSE AGREEMENT as of date 2024-05-19
 * The most up-to-date license is available at the below link:
 * - https://mathparser.org/mxparser-license
 *
 * AUTHOR: Copyright 2010 - 2024 Mariusz Gromada - All rights reserved
 * PUBLISHER: INFIMA - https://payhip.com/infima
 *
 * SOFTWARE means source code and/or binary form and/or documentation.
 * PRODUCT: MathParser.org-mXparser SOFTWARE
 * LICENSE: DUAL LICENSE AGREEMENT
 *
 * BY INSTALLING, COPYING, OR OTHERWISE USING THE PRODUCT, YOU AGREE TO BE
 * BOUND BY ALL OF THE TERMS AND CONDITIONS OF THE DUAL LICENSE AGREEMENT.
 *
 * The AUTHOR & PUBLISHER provide the PRODUCT under the DUAL LICENSE AGREEMENT
 * model designed to meet the needs of both non-commercial use and commercial
 * use.
 *
 * NON-COMMERCIAL USE means any use or activity where a fee is not charged
 * and the purpose is not the sale of a good or service, and the use or
 * activity is not intended to produce a profit. Examples of NON-COMMERCIAL USE
 * include:
 *
 * 1. Non-commercial open-source software.
 * 2. Non-commercial mobile applications.
 * 3. Non-commercial desktop software.
 * 4. Non-commercial web applications/solutions.
 * 5. Non-commercial use in research, scholarly and educational context.
 *
 * The above list is non-exhaustive and illustrative only.
 *
 * COMMERCIAL USE means any use or activity where a fee is charged or the
 * purpose is the sale of a good or service, or the use or activity is
 * intended to produce a profit. COMMERCIAL USE examples:
 *
 * 1. OEMs (Original Equipment Manufacturers).
 * 2. ISVs (Independent Software Vendors).
 * 3. VARs (Value Added Resellers).
 * 4. Other distributors that combine and distribute commercially licensed
 *    software.
 *
 * The above list is non-exhaustive and illustrative only.
 *
 * IN CASE YOU WANT TO USE THE PRODUCT COMMERCIALLY, YOU MUST PURCHASE THE
 * APPROPRIATE LICENSE FROM "INFIMA" ONLINE STORE, STORE ADDRESS:
 *
 * 1. https://mathparser.org/order-commercial-license
 * 2. https://payhip.com/infima
 *
 * NON-COMMERCIAL LICENSE
 *
 * Redistribution and use of the PRODUCT in source and/or binary forms,
 * with or without modification, are permitted provided that the following
 * conditions are met:
 *
 * 1. Redistributions of source code must retain the unmodified content of
 *    the entire MathParser.org-mXparser DUAL LICENSE AGREEMENT, including
 *    the definition of NON-COMMERCIAL USE, the definition of COMMERCIAL USE,
 *    the NON-COMMERCIAL LICENSE conditions, the COMMERCIAL LICENSE conditions,
 *    and the following DISCLAIMER.
 * 2. Redistributions in binary form must reproduce the entire content of
 *    MathParser.org-mXparser DUAL LICENSE AGREEMENT in the documentation
 *    and/or other materials provided with the distribution, including the
 *    definition of NON-COMMERCIAL USE, the definition of COMMERCIAL USE, the
 *    NON-COMMERCIAL LICENSE conditions, the COMMERCIAL LICENSE conditions,
 *    and the following DISCLAIMER.
 * 3. Any form of redistribution requires confirmation and signature of
 *    the NON-COMMERCIAL USE by successfully calling the method:
 *       License.iConfirmNonCommercialUse(...)
 *    The method call is used only internally for logging purposes, and
 *    there is no connection with other external services, and no data is
 *    sent or collected. The lack of a method call (or its successful call)
 *    does not affect the operation of the PRODUCT in any way. Please see
 *    the API documentation.
 *
 * COMMERCIAL LICENSE
 *
 *  1. Before purchasing a commercial license, the AUTHOR & PUBLISHER allow
 *     you to download, install, and use up to three copies of the PRODUCT to
 *     perform integration tests, confirm the quality of the PRODUCT, and
 *     its suitability. The testing period should be limited to fourteen
 *     days. Tests should be performed under the test environments conditions
 *     and not for profit generation.
 *  2. Provided that you purchased a license from "INFIMA" online store
 *     (store address: https://mathparser.org/order-commercial-license or
 *     https://payhip.com/infima), and you comply with all terms and
 *     conditions below, and you have acknowledged and understood the
 *     following DISCLAIMER, the AUTHOR & PUBLISHER grant you a nonexclusive
 *     license with the following rights:
 *  3. The license is granted only to you, the person or entity that made
 *     the purchase, identified and confirmed by the data provided during
 *     the purchase.
 *  4. If you purchased a license in the "ONE-TIME PURCHASE" model, the
 *     license is granted only for the PRODUCT version specified in the
 *     purchase. The upgrade policy gives you additional rights, described
 *     in the dedicated section below.
 *  5. If you purchased a license in the "SUBSCRIPTION" model, you may
 *     install and use any version of the PRODUCT during the subscription
 *     validity period.
 *  6. If you purchased a "SINGLE LICENSE" you may install and use the
 *     PRODUCT on/from one workstation that is located/accessible at/from
 *     any of your premises.
 *  7. Additional copies of the PRODUCT may be installed and used on/from
 *     more than one workstation, limited to the number of workstations
 *     purchased per order.
 *  8. If you purchased a "SITE LICENSE", the PRODUCT may be installed
 *     and used on/from all workstations located/accessible at/from any
 *     of your premises.
 *  9. You may incorporate the unmodified PRODUCT into your own products
 *     and software.
 * 10. If you purchased a license with the "SOURCE CODE" option, you may
 *     modify the PRODUCT's source code and incorporate the modified source
 *     code into your own products and/or software.
 * 11. Provided that the license validity period has not expired, you may
 *     distribute your product and/or software with the incorporated
 *     PRODUCT royalty-free.
 * 12. You may make copies of the PRODUCT for backup and archival purposes.
 * 13. Any form of redistribution requires confirmation and signature of
 *     the COMMERCIAL USE by successfully calling the method:
 *        License.iConfirmCommercialUse(...)
 *     The method call is used only internally for logging purposes, and
 *     there is no connection with other external services, and no data is
 *     sent or collected. The lack of a method call (or its successful call)
 *     does not affect the operation of the PRODUCT in any way. Please see
 *     the API documentation.
 * 14. The AUTHOR & PUBLISHER reserve all rights not expressly granted to
 *     you in this agreement.
 *
 * ADDITIONAL CLARIFICATION ON WORKSTATION
 *
 * A workstation is a device, a remote device, or a virtual device, used by
 * you, your employees, or other entities to whom you have commissioned
 * tasks. For example, the number of workstations may refer to the number
 * of software developers, engineers, architects, scientists, and other
 * professionals who use the PRODUCT on your behalf. The number of
 * workstations is not the number of copies of your end-product that you
 * distribute to your end-users.
 *
 * By purchasing the COMMERCIAL LICENSE, you only pay for the number of
 * workstations, while the number of copies/users of your final product
 * (delivered to your end-users) is not limited.
 *
 * Below are some examples to help you select the right license size:
 *
 * Example 1: Single Workstation License
 * Only one developer works on the development of your application. You do
 * not use separate environments for testing, meaning you design, create,
 * test, and compile your final application on one environment. In this
 * case, you need a license for a single workstation.
 *
 * Example 2: Up to 5 Workstations License
 * Two developers are working on the development of your application.
 * Additionally, one tester conducts tests in a separate environment.
 * You use three workstations in total, so you need a license for up to
 * five workstations.
 *
 * Example 3: Up to 20 Workstations License
 * Ten developers are working on the development of your application.
 * Additionally, five testers conduct tests in separate environments.
 * You use fifteen workstations in total, so you need a license for
 * up to twenty workstations.
 *
 * Example 4: Site License
 * Several dozen developers and testers work on the development of your
 * application using multiple environments. You have a large,
 * multi-disciplinary team involved in creating your solution. As your team
 * is growing and you want to avoid licensing limitations, the best choice
 * would be a site license.
 *
 * UPGRADE POLICY
 *
 * The PRODUCT is versioned according to the following convention:
 *
 *    [MAJOR].[MINOR].[PATCH]
 *
 * 1. COMMERCIAL LICENSE holders can install and use the updated version
 *    for bug fixes free of charge, i.e. if you have purchased a license
 *    for the [MAJOR].[MINOR] version (e.g., 5.0), you can freely install
 *    all releases specified in the [PATCH] version (e.g., 5.0.2).
 *    The license terms remain unchanged after the update.
 * 2. COMMERCIAL LICENSE holders for the [MAJOR].[MINOR] version (e.g., 5.0)
 *    can install and use the updated version [MAJOR].[MINOR + 1] free of
 *    charge, i.e., plus one release in the [MINOR] range (e.g., 5.1). The
 *    license terms remain unchanged after the update.
 * 3. COMMERCIAL LICENSE holders who wish to upgrade their version, but are
 *    not eligible for the free upgrade, can claim a discount when
 *    purchasing the upgrade. For this purpose, please contact us via e-mail.
 *
 * DISCLAIMER
 *
 * THIS PRODUCT IS PROVIDED BY THE AUTHOR & PUBLISHER "AS IS" AND ANY EXPRESS
 * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL AUTHOR OR PUBLISHER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS PRODUCT, EVEN IF ADVISED OF
 * THE POSSIBILITY OF SUCH DAMAGE.
 *
 * THE VIEWS AND CONCLUSIONS CONTAINED IN THE PRODUCT AND DOCUMENTATION ARE
 * THOSE OF THE AUTHORS AND SHOULD NOT BE INTERPRETED AS REPRESENTING
 * OFFICIAL POLICIES, EITHER EXPRESSED OR IMPLIED, OF THE AUTHOR OR PUBLISHER.
 *
 * CONTACT
 *
 * - e-mail: [email protected]
 * - website: https://mathparser.org
 * - source code: https://github.com/mariuszgromada/MathParser.org-mXparser
 * - online store: https://mathparser.org/order-commercial-license
 * - online store: https://payhip.com/infima
 */
package org.mariuszgromada.math.mxparser;

import java.util.Arrays;
import java.util.regex.Pattern;

/**
 * A class containing all string utils.
 *
 * @author         Mariusz Gromada

 *                 MathParser.org - mXparser project page

 *                 mXparser on GitHub

 *                 INFIMA place to purchase a commercial MathParser.org-mXparser software license

 *                 [email protected]

 *                 ScalarMath.org - a powerful math engine and math scripting language

 *                 Scalar Lite

 *                 Scalar Pro

 *                 MathSpace.pl

 *
 * @version        6.0.0
 */
public final class StringUtils {
    /**
     * Function used to introduce some compatibility
     * between JAVA and C# while regexp matching.
     *
     * @param str         String
     * @param pattern     Pattern (regexp)
     *
     * @return            True if pattern matches entirely, False otherwise
     */
    public static boolean regexMatch(String str, String pattern){
        return Pattern.matches(pattern, str);
    }

    static String surroundBrackets(String str) {
        return StringInvariant.LEFT_BRACKET + str + StringInvariant.RIGHT_BRACKET;
    }
    static String surroundBracketsAddSpace(String str) {
        return surroundBrackets(str) + StringInvariant.SPACE;
    }
    static String surroundSquareBrackets(String str) {
        return StringInvariant.LEFT_SQUARE_BRACKET + str + StringInvariant.RIGHT_SQUARE_BRACKET;
    }
    static String surroundSquareBracketsAddSpace(String str) {
        return surroundSquareBrackets(str) + StringInvariant.SPACE;
    }
    static String surroundApostrophe(String str) {
        return StringInvariant.APOSTROPHE + str + StringInvariant.APOSTROPHE;
    }
    static String surroundApostropheAddSpace(String str) {
        return surroundApostrophe(str) + StringInvariant.SPACE;
    }
    static String surroundQuote(String str) {
        return StringInvariant.QUOTE + str + StringInvariant.QUOTE;
    }
    static String surroundQuoteAddSpace(String str) {
        return surroundQuote(str) + StringInvariant.SPACE;
    }
    static String trimNotNull(String str) {
        if (str != null) return str.trim();
        else return StringInvariant.EMPTY;
    }
    static String stringConcatenateMaxLength(String str1, String str2, int maxLength) {
        if (str1.length() + str2.length() > maxLength)
            if (str1.contains(StringModel.STRING_RESOURCES.MAXIMUM_ERROR_MESSAGE_LENGTH_EXCEEDED))
                return str1;
            else
                return str1 + StringModel.STRING_RESOURCES.MAXIMUM_ERROR_MESSAGE_LENGTH_EXCEEDED + StringInvariant.NEW_LINE;
        else
            return str1 + str2;
    }
    static boolean isUnicodeName(char c) {
        switch (c) {
            case 'α':
            case 'β':
            case 'γ':
            case 'δ':
            case 'ε':
            case 'ζ':
            case 'η':
            case 'θ':
            case 'ι':
            case 'κ':
            case 'λ':
            case 'μ':
            case 'ν':
            case 'ξ':
            case 'ο':
            case 'π':
            case 'ρ':
            case 'ς':
            case 'σ':
            case 'τ':
            case 'υ':
            case 'φ':
            case 'χ':
            case 'ψ':
            case 'ω':
            case 'Α':
            case 'Β':
            case 'Γ':
            case 'Δ':
            case 'Ε':
            case 'Ζ':
            case 'Η':
            case 'Θ':
            case 'Ι':
            case 'Κ':
            case 'Λ':
            case 'Μ':
            case 'Ν':
            case 'Ξ':
            case 'Ο':
            case 'Π':
            case 'Ρ':
            case 'Σ':
            case 'Τ':
            case 'Υ':
            case 'Φ':
            case 'Χ':
            case 'Ψ':
            case 'Ω':
            case '∑':
            case '∏':
            case 'ℿ':
            case '∆':
            case '∇':
            case '∫':
            case 'ℼ':
            case 'ℇ':
            case 'ⅇ':
            case 'ℯ':
            case '∂':
                return true;
        }
        return false;
    }
    private static boolean isUnicodeOperator(char c) {
        switch (c) {
            case '∜':
            case '∛':
            case '√':
            case '⊻':
            case '⊽':
            case '⊼':
            case '⇔':
            case '⇍':
            case '⇏':
            case '⇐':
            case '⇒':
            case '¬':
            case '∧':
            case '∨':
            case '⋝':
            case '≥':
            case '⋜':
            case '≤':
            case '≠':
            case '÷':
            case '∙':
            case '⨉':
            case '×':
                return true;
        }
        return false;
    }
    static boolean isNotSpecialChar(char c) {
        switch (c) {
            case '+':
            case '-':
            case '*':
            case '/':
            case '^':
            case ',':
            case ';':
            case '(':
            case ')':
            case '|':
            case '&':
            case '=':
            case '>':
            case '<':
            case '~':
            case '\\':
            case '#':
            case '@':
            case ']':
            case '[':
            case ':':
                return false;
        }
        return !isUnicodeOperator(c);
    }
    static boolean is0To9Digit(char c) {
        switch (c) {
            case '0':
            case '1':
            case '2':
            case '3':
            case '4':
            case '5':
            case '6':
            case '7':
            case '8':
            case '9':
                return true;
        }
        return false;
    }
    static boolean canBeSeparatingChar(char c) {
        switch (c) {
            case ' ':
            case ',':
            case ';':
            case '|':
            case '&':
            case '+':
            case '-':
            case '*':
            case '\\':
            case '/':
            case '(':
            case ')':
            case '=':
            case '>':
            case '<':
            case '~':
            case '^':
            case '#':
            case '%':
            case '@':
            case '!':
            case '[':
            case ']':
            case ':':
                return true;
        }
        return isUnicodeOperator(c);
    }
    static boolean isBlankChar(char c) {
        switch (c) {
            case ' ':
            case '\n':
            case '\r':
            case '\t':
            case '\f':
                return true;
        }
        return false;
    }
    static boolean charIsLeftParenthesis(String str, int pos) {
        int len = str.length();
        if (pos >= len) return false;
        return str.charAt(pos) == '(';
    }
    static String repeatString(String str, int times) {
        StringBuilder result = new StringBuilder();
        for (int i = 0; i < times; i++)
            result.append(str);
        return result.toString();
    }
    /*
     * Text adjusting.
     */
    static String getLeftSpaces(String maxStr, String str) {
        return repeatString(StringInvariant.SPACE, maxStr.length() - str.length()) + str;
    }
    /*
     * Text adjusting.
     */
    static String getRightSpaces(String maxStr, String str) {
        return str + repeatString(StringInvariant.SPACE, maxStr.length() - str.length());
    }
    static void consolePrintln() {
        System.out.println();
    }
    static void consolePrintln(Object o) {
        System.out.println(o);
    }
    static void errorPrintln() {
        System.err.println();
    }
    static void errorPrintln(Object o) {
        System.err.println(o);
    }
    static String cleanForHtml(String text) {
        return text.replace("&", "&").replace("<", "<").replace(">", ">");
    }
    static String cleanForMarkdown(String text) {
        return text.replace("\\", "\\\\").replace("|", "\\|");
    }
    static String cleanForJson(String text) {
        return text.replace("\\", "\\\\");
    }
    static void stringBuilderPartsAppend(StringBuilder stringBuilder, String... partsToAppend) {
        for (String part : partsToAppend) {
            stringBuilder.append(part);
        }
    }
    static void stringBuilderLinesAppend(StringBuilder stringBuilder, String... linesToAppend) {
        for (String line : linesToAppend) {
            stringBuilder.append(line);
            stringBuilder.append(StringInvariant.NEW_LINE);
        }
    }
    static void stringBuilderPartsAppendDelimited(
            String partTagLeft
            ,String partTagRight
            ,String delimiter
            ,boolean clearForHtml
            ,boolean clearForMarkdown
            ,boolean clearForJson
            ,StringBuilder stringBuilder
            ,String... partsToAppend
    ) {
        int n = 0;
        for (String part : partsToAppend) {
            n++;
            if (n > 1) stringBuilder.append(delimiter);
            stringBuilder.append(partTagLeft);

            String partFinal = part;
            if (clearForHtml)
                partFinal = cleanForHtml(partFinal);
            if (clearForMarkdown)
                partFinal = cleanForMarkdown(partFinal);

            if (clearForJson)
                partFinal = cleanForJson(partFinal);

            stringBuilder.append(partFinal);

            stringBuilder.append(partTagRight);
        }
    }
    static void stringBuilderPartsAppendDelimited(String partQuote, String delimiter, StringBuilder stringBuilder, String... partsToAppend) {
        stringBuilderPartsAppendDelimited(partQuote, partQuote, delimiter, false, false, false, stringBuilder, partsToAppend);
    }
    static void stringBuilderPartsAppendDelimitedRow(
            String partTagLeft
            ,String partTagRight
            ,String delimiter
            ,String rowBeforeTag
            ,String rowAfterTag
            ,boolean clearForHtml
            ,boolean clearForMarkdown
            ,boolean clearForJson
            ,StringBuilder stringBuilder
            ,String... partsToAppend
    ) {
        boolean tagBefore = rowBeforeTag == null || rowBeforeTag.length() > 0;
        boolean tagAfter = rowAfterTag == null || rowAfterTag.length() > 0;

        if (tagBefore) stringBuilder.append(rowBeforeTag);
        stringBuilderPartsAppendDelimited(partTagLeft, partTagRight, delimiter, clearForHtml, clearForMarkdown, clearForJson, stringBuilder, partsToAppend);
        if (tagAfter) stringBuilder.append(rowAfterTag);
    }
    static void stringBuilderPartsAppendDelimitedRow(
            String partQuote
            ,String delimiter
            ,boolean newLineBefore
            ,boolean clearForHtml
            ,boolean clearForMarkdown
            ,boolean clearForJson
            ,StringBuilder stringBuilder
            ,String... partsToAppend
    ) {
        if (newLineBefore)
            stringBuilderPartsAppendDelimitedRow(partQuote, partQuote, delimiter, StringInvariant.NEW_LINE, "", clearForHtml, clearForMarkdown, clearForJson, stringBuilder, partsToAppend);
        else
            stringBuilderPartsAppendDelimitedRow(partQuote, partQuote, delimiter, "", "", clearForHtml, clearForMarkdown, clearForJson, stringBuilder, partsToAppend);
    }
    static void stringBuilderPartsAppendDelimitedRow(
            String partQuote
            ,String delimiter
            ,boolean newLineBefore
            ,StringBuilder stringBuilder
            ,String... partsToAppend
    ) {
        stringBuilderPartsAppendDelimitedRow(partQuote, delimiter, newLineBefore, false, false, false, stringBuilder, partsToAppend);
    }

    private static final String HTML_TD_START_TAG = "";
    private static final String HTML_TD_END_TAG = "";
    private static final String HTML_TH_START_TAG = "";
    private static final String HTML_TH_END_TAG = "";
    private static final String HTML_TR_START_TAG = "";
    private static final String HTML_TR_END_TAG = "" + StringInvariant.NEW_LINE;

    static void stringBuilderPartsAppendHtmlTableRow(StringBuilder stringBuilder, String... partsToAppend) {
        stringBuilderPartsAppendDelimitedRow(
                HTML_TD_START_TAG
                ,HTML_TD_END_TAG
                ,StringInvariant.EMPTY
                , HTML_TR_START_TAG
                ,HTML_TR_END_TAG
                ,true
                ,false
                ,false
                ,stringBuilder
                ,partsToAppend
        );
    }

    static void stringBuilderPartsAppendHtmlTableHead(StringBuilder stringBuilder, String... partsToAppend) {
        stringBuilderPartsAppendDelimitedRow(
                HTML_TH_START_TAG
                ,HTML_TH_END_TAG
                ,StringInvariant.EMPTY
                ,HTML_TR_START_TAG
                ,HTML_TR_END_TAG
                ,true
                ,false
                ,false
                ,stringBuilder
                ,partsToAppend);
    }
    private static final String MARKDOWN_DELIMITER = "|";
    private static final String MARKDOWN_ROW_BEFORE_TAG = "|";
    private static final String MARKDOWN_ROW_AFTER_TAG = "|" + StringInvariant.NEW_LINE;
    private static final String MARKDOWN_HEADER_TAG = "---";
    static void stringBuilderPartsAppendMarkdownTableRow(StringBuilder stringBuilder, String... partsToAppend) {
        stringBuilderPartsAppendDelimitedRow(
                StringInvariant.EMPTY
                ,StringInvariant.EMPTY
                ,MARKDOWN_DELIMITER
                ,MARKDOWN_ROW_BEFORE_TAG
                ,MARKDOWN_ROW_AFTER_TAG
                ,false
                ,true
                ,false
                ,stringBuilder
                ,partsToAppend
        );
    }

    static void stringBuilderPartsAppendMarkdownTableHead(boolean addHeader, StringBuilder stringBuilder, String... partsToAppend) {
        if (!addHeader) {
            String[] mdTableEmptyHeader = new String[partsToAppend.length];
            Arrays.fill(mdTableEmptyHeader, "   ");
            stringBuilderPartsAppendDelimitedRow(
                    StringInvariant.EMPTY
                    ,StringInvariant.EMPTY
                    ,MARKDOWN_DELIMITER
                    ,MARKDOWN_ROW_BEFORE_TAG
                    ,MARKDOWN_ROW_AFTER_TAG
                    ,false
                    ,false
                    ,false
                    ,stringBuilder
                    ,mdTableEmptyHeader
            );
        } else
            stringBuilderPartsAppendDelimitedRow(
                    StringInvariant.EMPTY
                    ,StringInvariant.EMPTY
                    ,MARKDOWN_DELIMITER
                    ,MARKDOWN_ROW_BEFORE_TAG
                    ,MARKDOWN_ROW_AFTER_TAG
                    ,false
                    ,true
                    ,false
                    ,stringBuilder
                    ,partsToAppend
            );

        String[] mdTableStructure = new String[partsToAppend.length];
        Arrays.fill(mdTableStructure, MARKDOWN_HEADER_TAG);
        stringBuilderPartsAppendDelimitedRow(
                StringInvariant.EMPTY
                ,StringInvariant.EMPTY
                ,MARKDOWN_DELIMITER
                ,MARKDOWN_ROW_BEFORE_TAG
                ,MARKDOWN_ROW_AFTER_TAG
                ,false
                ,false
                ,false
                ,stringBuilder
                ,mdTableStructure
        );
    }

    static final String JSON_ROW_INDENTATION_TAG = "  ";
    private static final String JSON_PART_INDENTATION_TAG = JSON_ROW_INDENTATION_TAG + JSON_ROW_INDENTATION_TAG;
    private static final String JSON_ROW_BEFORE_TAG = StringInvariant.NEW_LINE
            + JSON_ROW_INDENTATION_TAG
            + StringInvariant.LEFT_CURLY_BRACKET
            + StringInvariant.NEW_LINE
            ;
    private static final String JSON_ROW_AFTER_TAG = StringInvariant.NEW_LINE
                    + JSON_ROW_INDENTATION_TAG
                    + StringInvariant.RIGHT_CURLY_BRACKET
            ;
    private static final String JSON_PART_DELIMITER = StringInvariant.COMMA + StringInvariant.NEW_LINE;
    static void stringBuilderPartsAppendJsonRow(StringBuilder stringBuilder, String... partsToAppend) {
        stringBuilderPartsAppendDelimitedRow(
                JSON_PART_INDENTATION_TAG
                ,StringInvariant.EMPTY
                ,JSON_PART_DELIMITER
                ,JSON_ROW_BEFORE_TAG
                ,JSON_ROW_AFTER_TAG
                ,false
                ,false
                ,true
                ,stringBuilder
                ,partsToAppend
        );
    }
    static String cleanNewLineAtTheEnd(String str) {
        int length = str.length();

        if (length == 0)
            return str;

        if (str.endsWith(StringInvariant.NEW_LINE))
            return str.substring(0, length - StringInvariant.NEW_LINE.length());

        return str;
    }
    /**
     * Converts integer number to hex string (plain text)
     *
     * @param number   Integer number
     * @return         Hex string (i.e. FF23)
     */
    public static String numberToHexString(int number) {
        return Integer.toHexString(number);
    }
    /**
     * Converts long number to hex string (plain text)
     *
     * @param number   Long number
     * @return         Hex string (i.e. FF23)
     */
    public static String numberToHexString(long number) {
        return Long.toHexString(number);
    }
    /**
     * Converts (long)double number to hex string (plain text)
     *
     * @param number   Double number
     * @return         Hex string (i.e. FF23)
     */
    public static String numberToHexString(double number) {
        return numberToHexString((long)number);
    }
    /**
     * Converts hex string into ASCII string, where each letter is
     * represented by two hex digits (byte) from the hex string.
     *
     * @param hexString   Hex string (i.e. 48656C6C6F)
     * @return         ASCII string (i.e. '48656C6C6F' = 'Hello')
     */
    public static String hexString2AsciiString(String hexString) {
        String hexByteStr;
        int hexByteInt;
        String asciiString = StringInvariant.EMPTY;
        for (int i = 0; i < hexString.length(); i+=2) {
            hexByteStr = hexString.substring(i, i+2);
            hexByteInt = Integer.parseInt(hexByteStr, 16);
            asciiString = asciiString + (char)hexByteInt;
        }
        return asciiString;
    }
    /**
     * Converts number into ASCII string, where each letter is
     * represented by two hex digits (byte) from the hex representation
     * of the original number
     *
     * @param number   Integer number (i.e. 310939249775 = '48656C6C6F')
     * @return         ASCII string (i.e. '48656C6C6F' = 'Hello')
     */
    public static String numberToAsciiString(int number) {
        return hexString2AsciiString( numberToHexString(number) );
    }
    /**
     * Converts number into ASCII string, where each letter is
     * represented by two hex digits (byte) from the hex representation
     * of the original number
     *
     * @param number   Long number (i.e. 310939249775 = '48656C6C6F')
     * @return         ASCII string (i.e. '48656C6C6F' = 'Hello')
     */
    public static String numberToAsciiString(long number) {
        return hexString2AsciiString( numberToHexString(number) );
    }
    /**
     * Converts (long)double number into ASCII string, where each letter is
     * represented by two hex digits (byte) from the hex representation
     * of the original number cast to long type.
     *
     * @param number   Double number (i.e. 310939249775 = '48656C6C6F')
     * @return         ASCII string (i.e. '48656C6C6F' = 'Hello')
     */
    public static String numberToAsciiString(double number) {
        return hexString2AsciiString( numberToHexString(number) );
    }
    public static int countOccurrences(String str, String toFind) {
        if (str == null || toFind == null) return -1;
        int strLen = str.length();
        int toFindLen = toFind.length();
        if (strLen == 0 || toFindLen == 0 || toFindLen > strLen) return 0;
        return (strLen - str.replace(toFind, StringInvariant.EMPTY).length()) / toFindLen;
    }
    public static int countLines(String text) {
        if (text == null) return -1;
        if (text.length() == 0) return 0;
        return countOccurrences(text, StringInvariant.NEW_LINE) + 1;
    }
}