org.mariuszgromada.math.mxparser.parsertokens.Function2Arg Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of MathParser.org-mXparser Show documentation
Show all versions of MathParser.org-mXparser Show documentation
mXparser is a super easy, rich, fast and highly flexible math expression parser library (parser and evaluator of mathematical expressions / formulas provided as plain text / string). Software delivers easy to use API for JAVA, Android and C# .NET/MONO (Common Language Specification compliant: F#, Visual Basic, C++/CLI). *** If you find the software useful donation or purchase is something you might consider: https://mathparser.org/donate/ *** Online store: https://payhip.com/INFIMA *** Scalar Scientific Calculator, Charts and Scripts, Scalar Lite: https://play.google.com/store/apps/details?id=org.mathparser.scalar.lite *** Scalar Pro: https://play.google.com/store/apps/details?id=org.mathparser.scalar.pro *** ScalarMath.org: https://scalarmath.org/ *** MathSpace.pl: https://mathspace.pl/ ***
/*
* @(#)Function2Arg.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.parsertokens;
import org.mariuszgromada.math.mxparser.mXparser;
/**
* Binary functions (2 arguments) - mXparser tokens definition.
*
* @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 5.2.0
*/
public final class Function2Arg {
/*
* BinaryFunction - token type id.
*/
public static final int TYPE_ID = 5;
public static String TYPE_DESC = ParserSymbol.NA;
/*
* BinaryFunction - tokens id.
*/
public static final int LOG_ID = 1;
public static final int MOD_ID = 2;
public static final int BINOM_COEFF_ID = 3;
public static final int BERNOULLI_NUMBER_ID = 4;
public static final int STIRLING1_NUMBER_ID = 5;
public static final int STIRLING2_NUMBER_ID = 6;
public static final int WORPITZKY_NUMBER_ID = 7;
public static final int EULER_NUMBER_ID = 8;
public static final int KRONECKER_DELTA_ID = 9;
public static final int EULER_POLYNOMIAL_ID = 10;
public static final int HARMONIC_NUMBER_ID = 11;
public static final int RND_UNIFORM_CONT_ID = 12;
public static final int RND_UNIFORM_DISCR_ID = 13;
public static final int ROUND_ID = 14;
public static final int RND_NORMAL_ID = 15;
public static final int NDIG_ID = 16;
public static final int DIGIT10_ID = 17;
public static final int FACTVAL_ID = 18;
public static final int FACTEXP_ID = 19;
public static final int ROOT_ID = 20;
public static final int INC_GAMMA_LOWER_ID = 21;
public static final int INC_GAMMA_UPPER_ID = 22;
public static final int REG_GAMMA_LOWER_ID = 23;
public static final int REG_GAMMA_UPPER_ID = 24;
public static final int PERMUTATIONS_ID = 25;
public static final int BETA_ID = 26;
public static final int LOG_BETA_ID = 27;
public static final int PDF_STUDENT_T_ID = 28;
public static final int CDF_STUDENT_T_ID = 29;
public static final int QNT_STUDENT_T_ID = 30;
public static final int PDF_CHI2_ID = 31;
public static final int CDF_CHI2_ID = 32;
public static final int QNT_CHI2_ID = 33;
public static final int RND_F_SNEDECOR_ID = 34;
/*
* BinaryFunction - tokens key words.
*/
public static final String LOG_STR = "log";
public static final String MOD_STR = "mod";
public static final String BINOM_COEFF_STR = "C";
public static final String BINOM_COEFF_NCK_STR = "nCk";
public static final String BERNOULLI_NUMBER_STR = "Bern";
public static final String STIRLING1_NUMBER_STR = "Stirl1";
public static final String STIRLING2_NUMBER_STR = "Stirl2";
public static final String WORPITZKY_NUMBER_STR = "Worp";
public static final String EULER_NUMBER_STR = "Euler";
public static final String KRONECKER_DELTA_STR = "KDelta";
public static final String EULER_POLYNOMIAL_STR = "EulerPol";
public static final String HARMONIC_NUMBER_STR = "Harm";
public static final String RND_UNIFORM_CONT_STR = "rUni";
public static final String RND_UNIFORM_DISCR_STR = "rUnid";
public static final String ROUND_STR = "round";
public static final String RND_NORMAL_STR = "rNor";
public static final String NDIG_STR = "ndig";
public static final String DIGIT10_STR = "dig10";
public static final String FACTVAL_STR = "factval";
public static final String FACTEXP_STR = "factexp";
public static final String ROOT_STR = "root";
public static final String INC_GAMMA_LOWER_STR = "GammaL";
public static final String INC_GAMMA_UPPER_STR = "GammaU";
public static final String REG_GAMMA_LOWER_STR = "GammaRegL";
public static final String REG_GAMMA_UPPER_STR = "GammaRegU";
public static final String REG_GAMMA_LOWER_P_STR = "GammaP";
public static final String REG_GAMMA_UPPER_Q_STR = "GammaQ";
public static final String PERMUTATIONS_STR = "nPk";
public static final String BETA_STR = "Beta";
public static final String LOG_BETA_STR = "logBeta";
public static final String PDF_STUDENT_T_STR = "pStud";
public static final String CDF_STUDENT_T_STR = "cStud";
public static final String QNT_STUDENT_T_STR = "qStud";
public static final String PDF_CHI2_STR = "pChi2";
public static final String CDF_CHI2_STR = "cChi2";
public static final String QNT_CHI2_STR = "qChi2";
public static final String RND_F_SNEDECOR_STR = "rFSned";
/*
* BinaryFunction - syntax.
*/
public static final String LOG_SYN = SyntaxStringBuilder.binaryFunction(LOG_STR, SyntaxStringBuilder.a, SyntaxStringBuilder.b);
public static final String MOD_SYN = SyntaxStringBuilder.binaryFunction(MOD_STR, SyntaxStringBuilder.a, SyntaxStringBuilder.b);
public static final String BINOM_COEFF_SYN = SyntaxStringBuilder.binaryFunction(BINOM_COEFF_STR, SyntaxStringBuilder.n, SyntaxStringBuilder.k);
public static final String BERNOULLI_NUMBER_SYN = SyntaxStringBuilder.binaryFunction(BERNOULLI_NUMBER_STR, SyntaxStringBuilder.m, SyntaxStringBuilder.n);
public static final String STIRLING1_NUMBER_SYN = SyntaxStringBuilder.binaryFunction(STIRLING1_NUMBER_STR, SyntaxStringBuilder.n, SyntaxStringBuilder.k);
public static final String STIRLING2_NUMBER_SYN = SyntaxStringBuilder.binaryFunction(STIRLING2_NUMBER_STR, SyntaxStringBuilder.n, SyntaxStringBuilder.k);
public static final String WORPITZKY_NUMBER_SYN = SyntaxStringBuilder.binaryFunction(WORPITZKY_NUMBER_STR, SyntaxStringBuilder.n, SyntaxStringBuilder.k);
public static final String EULER_NUMBER_SYN = SyntaxStringBuilder.binaryFunction(EULER_NUMBER_STR, SyntaxStringBuilder.n, SyntaxStringBuilder.k);
public static final String KRONECKER_DELTA_SYN = SyntaxStringBuilder.binaryFunction(KRONECKER_DELTA_STR, SyntaxStringBuilder.i, SyntaxStringBuilder.j);
public static final String EULER_POLYNOMIAL_SYN = SyntaxStringBuilder.binaryFunction(EULER_POLYNOMIAL_STR, SyntaxStringBuilder.m, SyntaxStringBuilder.x);
public static final String HARMONIC_NUMBER_SYN = SyntaxStringBuilder.binaryFunction(HARMONIC_NUMBER_STR, SyntaxStringBuilder.x, SyntaxStringBuilder.n);
public static final String RND_UNIFORM_CONT_SYN = SyntaxStringBuilder.binaryFunction(RND_UNIFORM_CONT_STR, SyntaxStringBuilder.a, SyntaxStringBuilder.b);
public static final String RND_UNIFORM_DISCR_SYN = SyntaxStringBuilder.binaryFunction(RND_UNIFORM_DISCR_STR, SyntaxStringBuilder.a, SyntaxStringBuilder.b);
public static final String ROUND_SYN = SyntaxStringBuilder.binaryFunction(ROUND_STR, SyntaxStringBuilder.x, SyntaxStringBuilder.n);
public static final String RND_NORMAL_SYN = SyntaxStringBuilder.binaryFunction(RND_NORMAL_STR, SyntaxStringBuilder.mean, SyntaxStringBuilder.stdv);
public static final String NDIG_SYN = SyntaxStringBuilder.binaryFunction(NDIG_STR, SyntaxStringBuilder.number, SyntaxStringBuilder.basestr);
public static final String DIGIT10_SYN = SyntaxStringBuilder.binaryFunction(DIGIT10_STR, SyntaxStringBuilder.num, SyntaxStringBuilder.pos);
public static final String FACTVAL_SYN = SyntaxStringBuilder.binaryFunction(FACTVAL_STR, SyntaxStringBuilder.number, SyntaxStringBuilder.factorid);
public static final String FACTEXP_SYN = SyntaxStringBuilder.binaryFunction(FACTEXP_STR, SyntaxStringBuilder.number, SyntaxStringBuilder.factorid);
public static final String ROOT_SYN = SyntaxStringBuilder.binaryFunction(ROOT_STR, SyntaxStringBuilder.rootorder, SyntaxStringBuilder.number);
public static final String INC_GAMMA_LOWER_SYN = SyntaxStringBuilder.binaryFunction(INC_GAMMA_LOWER_STR, SyntaxStringBuilder.s, SyntaxStringBuilder.x);
public static final String INC_GAMMA_UPPER_SYN = SyntaxStringBuilder.binaryFunction(INC_GAMMA_UPPER_STR, SyntaxStringBuilder.s, SyntaxStringBuilder.x);
public static final String REG_GAMMA_LOWER_SYN = SyntaxStringBuilder.binaryFunction(REG_GAMMA_LOWER_STR, SyntaxStringBuilder.s, SyntaxStringBuilder.x);
public static final String REG_GAMMA_UPPER_SYN = SyntaxStringBuilder.binaryFunction(REG_GAMMA_UPPER_STR, SyntaxStringBuilder.s, SyntaxStringBuilder.x);
public static final String REG_GAMMA_LOWER_P_SYN = SyntaxStringBuilder.binaryFunction(REG_GAMMA_LOWER_P_STR, SyntaxStringBuilder.s, SyntaxStringBuilder.x);
public static final String REG_GAMMA_UPPER_Q_SYN = SyntaxStringBuilder.binaryFunction(REG_GAMMA_UPPER_Q_STR, SyntaxStringBuilder.s, SyntaxStringBuilder.x);
public static final String BINOM_COEFF_NCK_SYN = SyntaxStringBuilder.binaryFunction(BINOM_COEFF_NCK_STR, SyntaxStringBuilder.n, SyntaxStringBuilder.k);
public static final String PERMUTATIONS_SYN = SyntaxStringBuilder.binaryFunction(PERMUTATIONS_STR, SyntaxStringBuilder.n, SyntaxStringBuilder.k);
public static final String BETA_SYN = SyntaxStringBuilder.binaryFunction(BETA_STR, SyntaxStringBuilder.x, SyntaxStringBuilder.y);
public static final String LOG_BETA_SYN = SyntaxStringBuilder.binaryFunction(LOG_BETA_STR, SyntaxStringBuilder.x, SyntaxStringBuilder.y);
public static final String PDF_STUDENT_T_SYN = SyntaxStringBuilder.binaryFunction(PDF_STUDENT_T_STR, SyntaxStringBuilder.x, SyntaxStringBuilder.v);
public static final String CDF_STUDENT_T_SYN = SyntaxStringBuilder.binaryFunction(CDF_STUDENT_T_STR, SyntaxStringBuilder.x, SyntaxStringBuilder.v);
public static final String QNT_STUDENT_T_SYN = SyntaxStringBuilder.binaryFunction(QNT_STUDENT_T_STR, SyntaxStringBuilder.p, SyntaxStringBuilder.v);
public static final String PDF_CHI2_SYN = SyntaxStringBuilder.binaryFunction(PDF_CHI2_STR, SyntaxStringBuilder.x, SyntaxStringBuilder.k);
public static final String CDF_CHI2_SYN = SyntaxStringBuilder.binaryFunction(CDF_CHI2_STR, SyntaxStringBuilder.x, SyntaxStringBuilder.k);
public static final String QNT_CHI2_SYN = SyntaxStringBuilder.binaryFunction(QNT_CHI2_STR, SyntaxStringBuilder.p, SyntaxStringBuilder.k);
public static final String RND_F_SNEDECOR_SYN = SyntaxStringBuilder.binaryFunction(RND_F_SNEDECOR_STR, SyntaxStringBuilder.d1, SyntaxStringBuilder.d2);
/*
* BinaryFunction - tokens description.
*/
public static String LOG_DESC = ParserSymbol.NA;
public static String MOD_DESC = ParserSymbol.NA;
public static String BINOM_COEFF_DESC = ParserSymbol.NA;
public static String BERNOULLI_NUMBER_DESC = ParserSymbol.NA;
public static String STIRLING1_NUMBER_DESC = ParserSymbol.NA;
public static String STIRLING2_NUMBER_DESC = ParserSymbol.NA;
public static String WORPITZKY_NUMBER_DESC = ParserSymbol.NA;
public static String EULER_NUMBER_DESC = ParserSymbol.NA;
public static String KRONECKER_DELTA_DESC = ParserSymbol.NA;
public static String EULER_POLYNOMIAL_DESC = ParserSymbol.NA;
public static String HARMONIC_NUMBER_DESC = ParserSymbol.NA;
public static String RND_UNIFORM_CONT_DESC = ParserSymbol.NA;
public static String RND_UNIFORM_DISCR_DESC = ParserSymbol.NA;
public static String ROUND_DESC = ParserSymbol.NA;
public static String RND_NORMAL_DESC = ParserSymbol.NA;
public static String NDIG_DESC = ParserSymbol.NA;
public static String DIGIT10_DESC = ParserSymbol.NA;
public static String FACTVAL_DESC = ParserSymbol.NA;
public static String FACTEXP_DESC = ParserSymbol.NA;
public static String ROOT_DESC = ParserSymbol.NA;
public static String INC_GAMMA_LOWER_DESC = ParserSymbol.NA;
public static String INC_GAMMA_UPPER_DESC = ParserSymbol.NA;
public static String REG_GAMMA_LOWER_DESC = ParserSymbol.NA;
public static String REG_GAMMA_UPPER_DESC = ParserSymbol.NA;
public static String PERMUTATIONS_DESC = ParserSymbol.NA;
public static String BETA_DESC = ParserSymbol.NA;
public static String LOG_BETA_DESC = ParserSymbol.NA;
public static String PDF_STUDENT_T_DESC = ParserSymbol.NA;
public static String CDF_STUDENT_T_DESC = ParserSymbol.NA;
public static String QNT_STUDENT_T_DESC = ParserSymbol.NA;
public static String PDF_CHI2_DESC = ParserSymbol.NA;
public static String CDF_CHI2_DESC = ParserSymbol.NA;
public static String QNT_CHI2_DESC = ParserSymbol.NA;
public static String RND_F_SNEDECOR_DESC = ParserSymbol.NA;
/*
* BinaryFunction - since.
*/
public static final String LOG_SINCE = mXparser.NAMEv10;
public static final String MOD_SINCE = mXparser.NAMEv10;
public static final String BINOM_COEFF_SINCE = mXparser.NAMEv10;
public static final String BINOM_COEFF_NCK_SINCE = mXparser.NAMEv42;
public static final String BERNOULLI_NUMBER_SINCE = mXparser.NAMEv10;
public static final String STIRLING1_NUMBER_SINCE = mXparser.NAMEv10;
public static final String STIRLING2_NUMBER_SINCE = mXparser.NAMEv10;
public static final String WORPITZKY_NUMBER_SINCE = mXparser.NAMEv10;
public static final String EULER_NUMBER_SINCE = mXparser.NAMEv10;
public static final String KRONECKER_DELTA_SINCE = mXparser.NAMEv10;
public static final String EULER_POLYNOMIAL_SINCE = mXparser.NAMEv10;
public static final String HARMONIC_NUMBER_SINCE = mXparser.NAMEv10;
public static final String RND_UNIFORM_CONT_SINCE = mXparser.NAMEv30;
public static final String RND_UNIFORM_DISCR_SINCE = mXparser.NAMEv30;
public static final String ROUND_SINCE = mXparser.NAMEv30;
public static final String RND_NORMAL_SINCE = mXparser.NAMEv30;
public static final String NDIG_SINCE = mXparser.NAMEv41;
public static final String DIGIT10_SINCE = mXparser.NAMEv41;
public static final String FACTVAL_SINCE = mXparser.NAMEv41;
public static final String FACTEXP_SINCE = mXparser.NAMEv41;
public static final String ROOT_SINCE = mXparser.NAMEv41;
public static final String INC_GAMMA_LOWER_SINCE = mXparser.NAMEv42;
public static final String INC_GAMMA_UPPER_SINCE = mXparser.NAMEv42;
public static final String REG_GAMMA_LOWER_SINCE = mXparser.NAMEv42;
public static final String REG_GAMMA_UPPER_SINCE = mXparser.NAMEv42;
public static final String PERMUTATIONS_SINCE = mXparser.NAMEv42;
public static final String BETA_SINCE = mXparser.NAMEv42;
public static final String LOG_BETA_SINCE = mXparser.NAMEv42;
public static final String PDF_STUDENT_T_SINCE = mXparser.NAMEv50;
public static final String CDF_STUDENT_T_SINCE = mXparser.NAMEv50;
public static final String QNT_STUDENT_T_SINCE = mXparser.NAMEv50;
public static final String PDF_CHI2_SINCE = mXparser.NAMEv50;
public static final String CDF_CHI2_SINCE = mXparser.NAMEv50;
public static final String QNT_CHI2_SINCE = mXparser.NAMEv50;
public static final String RND_F_SNEDECOR_SINCE = mXparser.NAMEv51;
}