1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117
|
/* ----------------------------------------------------------------------------
* This file was automatically generated by SWIG (http://www.swig.org).
* Version 2.0.4
*
* Do not make changes to this file unless you know what you are doing--modify
* the SWIG interface file instead.
* ----------------------------------------------------------------------------- */
package org.sbml.libsbml;
/**
* Wrapper class for global methods and constants defined by libSBML.
* <p>
* <em style='color: #555'>
* This class of objects is defined by libSBML only and has no direct
* equivalent in terms of SBML components. This class is not prescribed by
* the SBML specifications, although it is used to implement features
* defined in SBML.
* </em>
* <p>
* In the C++ and C versions of libSBML, there exists a small number of
* methods that are global in scope; in addition, libSBML uses a number
* of enum's to define such things as error codes in a way that can be
* used by both C++ and C. This poses a problem in languages such as
* Java, where there is no concept of global method or global constant.
* SWIG wraps these global identifiers in the class whose documentation
* you see before you.
*/
public class libsbml implements libsbmlConstants {
/**
* Downcast a package extension object to its specific package class.
*
* This method is used in the implementation of libSBML extensions to
* support SBML Level 3 packages. It allows an object to be
* downcast to the actual {@link SBMLExtension} object it is.
*
* @param cPtr the the pointer to the object
* @param owner if <code>true</code>, it indicates the caller will "own"
* the memory associated with the object and will be responsible for
* freeing it.
*
* @return the {@link SBMLExtension} for the package
*
* @internal
*/
public static SBMLExtension DowncastExtension(long cPtr, boolean owner)
{
if (cPtr == 0) return null;
SBMLExtension ext = new SBMLExtension(cPtr, false);
String pkgName = ext.getName();
return new SBMLExtension(cPtr,owner);
}
/**
* SBMLExtension derived classes must override this method
* @internal
*/
public static SBasePlugin DowncastSBasePlugin(long cPtr, boolean owner)
{
if (cPtr == 0) return null;
SBasePlugin sbp = new SBasePlugin(cPtr,false);
String pkgName = sbp.getPackageName();
SBMLExtension sbmlext = SBMLExtensionRegistry.getInstance().getExtension(pkgName);
if (sbmlext != null)
{
return sbmlext.DowncastSBasePlugin(cPtr,owner);
}
return new SBasePlugin(cPtr,owner);
}
/**
* @internal
*/
public static SBMLNamespaces DowncastSBMLNamespaces(long cPtr, boolean owner)
{
if (cPtr == 0) return null;
SBMLNamespaces sbn = new SBMLNamespaces(cPtr, false);
if (sbn != null)
{
XMLNamespaces ns = sbn.getNamespaces();
}
return new SBMLNamespaces(cPtr, owner);
}
/**
* Internal method.
*
* @internal
*/
public static SBase DowncastSBase(long cPtr, boolean owner)
{
if (cPtr == 0) return null;
SBase sb = new SBase(cPtr,false);
String pkgName = sb.getPackageName();
if (pkgName.equals("core"))
{
switch( sb.getTypeCode() )
{
case libsbmlConstants.SBML_COMPARTMENT:
return new Compartment(cPtr, owner);
case libsbmlConstants.SBML_COMPARTMENT_TYPE:
return new CompartmentType(cPtr, owner);
case libsbmlConstants.SBML_CONSTRAINT:
return new Constraint(cPtr, owner);
case libsbmlConstants.SBML_DOCUMENT:
return new SBMLDocument(cPtr, owner);
case libsbmlConstants.SBML_DELAY:
return new Delay(cPtr, owner);
case libsbmlConstants.SBML_EVENT:
return new Event(cPtr, owner);
case libsbmlConstants.SBML_EVENT_ASSIGNMENT:
return new EventAssignment(cPtr, owner);
case libsbmlConstants.SBML_FUNCTION_DEFINITION:
return new FunctionDefinition(cPtr, owner);
case libsbmlConstants.SBML_INITIAL_ASSIGNMENT:
return new InitialAssignment(cPtr, owner);
case libsbmlConstants.SBML_KINETIC_LAW:
return new KineticLaw(cPtr, owner);
case libsbmlConstants.SBML_LIST_OF:
String name = sb.getElementName();
if(name.equals("listOf")){
return new ListOf(cPtr, owner);
}
else if(name.equals("listOfCompartments")){
return new ListOfCompartments(cPtr, owner);
}
else if(name.equals("listOfCompartmentTypes")){
return new ListOfCompartmentTypes(cPtr, owner);
}
else if(name.equals("listOfConstraints")){
return new ListOfConstraints(cPtr, owner);
}
else if(name.equals("listOfEvents")){
return new ListOfEvents(cPtr, owner);
}
else if(name.equals("listOfEventAssignments")){
return new ListOfEventAssignments(cPtr, owner);
}
else if(name.equals("listOfFunctionDefinitions")){
return new ListOfFunctionDefinitions(cPtr, owner);
}
else if(name.equals("listOfInitialAssignments")){
return new ListOfInitialAssignments(cPtr, owner);
}
else if(name.equals("listOfParameters")){
return new ListOfParameters(cPtr, owner);
}
else if(name.equals("listOfLocalParameters")){
return new ListOfLocalParameters(cPtr, owner);
}
else if(name.equals("listOfReactions")){
return new ListOfReactions(cPtr, owner);
}
else if(name.equals("listOfRules")){
return new ListOfRules(cPtr, owner);
}
else if(name.equals("listOfSpecies")){
return new ListOfSpecies(cPtr, owner);
}
else if(name.equals("listOfUnknowns")){
return new ListOfSpeciesReferences(cPtr, owner);
}
else if(name.equals("listOfReactants")){
return new ListOfSpeciesReferences(cPtr, owner);
}
else if(name.equals("listOfProducts")){
return new ListOfSpeciesReferences(cPtr, owner);
}
else if(name.equals("listOfModifiers")){
return new ListOfSpeciesReferences(cPtr, owner);
}
else if(name.equals("listOfSpeciesTypes")){
return new ListOfSpeciesTypes(cPtr, owner);
}
else if(name.equals("listOfUnits")){
return new ListOfUnits(cPtr, owner);
}
else if(name.equals("listOfUnitDefinitions")){
return new ListOfUnitDefinitions(cPtr, owner);
}
return new ListOf(cPtr, owner);
case libsbmlConstants.SBML_MODEL:
return new Model(cPtr, owner);
case libsbmlConstants.SBML_PARAMETER:
return new Parameter(cPtr, owner);
case libsbmlConstants.SBML_PRIORITY:
return new Priority(cPtr, owner);
case libsbmlConstants.SBML_LOCAL_PARAMETER:
return new LocalParameter(cPtr, owner);
case libsbmlConstants.SBML_REACTION:
return new Reaction(cPtr, owner);
case libsbmlConstants.SBML_SPECIES:
return new Species(cPtr, owner);
case libsbmlConstants.SBML_SPECIES_REFERENCE:
return new SpeciesReference(cPtr, owner);
case libsbmlConstants.SBML_MODIFIER_SPECIES_REFERENCE:
return new ModifierSpeciesReference(cPtr, owner);
case libsbmlConstants.SBML_SPECIES_TYPE:
return new SpeciesType(cPtr, owner);
case libsbmlConstants.SBML_TRIGGER:
return new Trigger(cPtr, owner);
case libsbmlConstants.SBML_UNIT_DEFINITION:
return new UnitDefinition(cPtr, owner);
case libsbmlConstants.SBML_UNIT:
return new Unit(cPtr, owner);
case libsbmlConstants.SBML_ALGEBRAIC_RULE:
return new AlgebraicRule(cPtr, owner);
case libsbmlConstants.SBML_ASSIGNMENT_RULE:
return new AssignmentRule(cPtr, owner);
case libsbmlConstants.SBML_RATE_RULE:
return new RateRule(cPtr, owner);
case libsbmlConstants.SBML_STOICHIOMETRY_MATH:
return new StoichiometryMath(cPtr, owner);
default:
return new SBase(cPtr, owner);
}
}
else
{
SBMLExtension sbmlext = SBMLExtensionRegistry.getInstance().getExtension(pkgName);
if (sbmlext != null)
{
return sbmlext.DowncastSBase(cPtr,owner);
}
}
return new SBase(cPtr, owner);
}
public static ASTBase DowncastASTBase(long cPtr, boolean owner)
{
if (cPtr == 0) return null;
ASTBase ab = new ASTBase(cPtr,false);
switch( ab.getTypeCode() )
{
default:
case libsbmlConstants.AST_TYPECODE_BASE:
return new ASTBase(cPtr, owner);
/*
case libsbmlConstants.AST_TYPECODE_CN_BASE:
return new ASTCnBase(cPtr, owner);
case libsbmlConstants.AST_TYPECODE_FUNCTION_BASE:
return new ASTFunctionBase(cPtr, owner);
case libsbmlConstants.AST_TYPECODE_NUMBER:
return new ASTNumber(cPtr, owner);
case libsbmlConstants.AST_TYPECODE_CN_INTEGER:
return new ASTCnIntegerNode(cPtr, owner);
case libsbmlConstants.AST_TYPECODE_CN_EXPONENTIAL:
return new ASTCnExponentialNode(cPtr, owner);
case libsbmlConstants.AST_TYPECODE_CN_RATIONAL:
return new ASTCnRationalNode(cPtr, owner);
case libsbmlConstants.AST_TYPECODE_CN_REAL:
return new ASTCnRealNode(cPtr, owner);
case libsbmlConstants.AST_TYPECODE_CSYMBOL:
return new ASTCSymbol(cPtr, owner);
case libsbmlConstants.AST_TYPECODE_CSYMBOL_AVOGADRO:
return new ASTCSymbolAvogadroNode(cPtr, owner);
case libsbmlConstants.AST_TYPECODE_CSYMBOL_DELAY:
return new ASTCSymbolDelayNode(cPtr, owner);
case libsbmlConstants.AST_TYPECODE_CSYMBOL_TIME:
return new ASTCSymbolTimeNode(cPtr, owner);
case libsbmlConstants.AST_TYPECODE_FUNCTION:
return new ASTFunction(cPtr, owner);
case libsbmlConstants.AST_TYPECODE_FUNCTION_UNARY:
return new ASTUnaryFunctionNode(cPtr, owner);
case libsbmlConstants.AST_TYPECODE_FUNCTION_BINARY:
return new ASTBinaryFunctionNode(cPtr, owner);
case libsbmlConstants.AST_TYPECODE_FUNCTION_NARY:
return new ASTNaryFunctionNode(cPtr, owner);
case libsbmlConstants.AST_TYPECODE_FUNCTION_PIECEWISE:
return new ASTPiecewiseFunctionNode(cPtr, owner);
case libsbmlConstants.AST_TYPECODE_FUNCTION_LAMBDA:
return new ASTLambdaFunctionNode(cPtr, owner);
case libsbmlConstants.AST_TYPECODE_FUNCTION_CI:
return new ASTCiFunctionNode(cPtr, owner);
case libsbmlConstants.AST_TYPECODE_FUNCTION_SEMANTIC:
return new ASTSemanticsNode(cPtr, owner);
case libsbmlConstants.AST_TYPECODE_FUNCTION_QUALIFIER:
return new ASTQualifierNode(cPtr, owner);*/
case libsbmlConstants.AST_TYPECODE_ASTNODE:
return new ASTNode(cPtr, owner);
}
//return new ASTBase(cPtr, owner);
}
static String getAbsolutePath(String filename)
{
java.io.File file = new java.io.File(filename);
return file.getAbsolutePath();
}
/**
* Stream handle for low-level C++ standard output stream.
* <p>
* A few libSBML methods accept an argument for indicating where to send
* text string output. An example is the {@link
* SBMLDocument#printErrors} method. However, the methods use C++ style
* streams and not Java stream objects. The OStream object class in the
* libSBML Java interface provides a wrapper for the underlying C++
* streams. The present object (cout) is a static final variable that
* can be used directly from your code. An example use might be
* something like this:
* <p>
* <div class="fragment"><pre class="fragment">
* SBMLDocument document = libsbml.readSBML("somefile.xml");
* if (document.getNumErrors() > 0)
* {
* document.printErrors(libsbml.cout);
* println("Please correct the above problems first.");
* System.exit(1);
* }</div>
*
* @see #cerr
* @see #clog
*/
public final static OStream cout;
/**
* Stream handle for low-level C++ standard error stream.
* <p>
* A few libSBML methods accept an argument for indicating where to send
* text string output. An example is the {@link
* SBMLDocument#printErrors} method. However, the methods use C++ style
* streams and not Java stream objects. The OStream object class in the
* libSBML Java interface provides a wrapper for the underlying C++
* streams. The present object (cerr) is a static final variable that
* can be used directly from your code. An example use might be
* something like this:
* <p>
* <div class="fragment"><pre class="fragment">
* SBMLDocument document = libsbml.readSBML("somefile.xml");
* if (document.getNumErrors() > 0)
* {
* document.printErrors(libsbml.cerr);
* println("Please correct the above problems first.");
* System.exit(1);
* }</div>
* <p>
* By default, most operating systems have have their standard error and
* logging output streams directed to the console/terminal, and this is
* where text messages will be shown. This can usually be redirected
* elsewhere, although how to do this depends on the specific environment
* where the program is running.
*
* @see #cout
* @see #clog
*/
public final static OStream cerr;
/**
* Stream handle for low-level C++ standard logging stream.
* <p>
* A few libSBML methods accept an argument for indicating where to send
* text string output. An example is the {@link
* SBMLDocument#printErrors} method. However, the methods use C++ style
* streams and not Java stream objects. The OStream object class in the
* libSBML Java interface provides a wrapper for the underlying C++
* streams. The present object (clog) is a static final variable that
* can be used directly from your code. An example use might be
* something like this:
* <p>
* <div class="fragment"><pre class="fragment">
* SBMLDocument document = libsbml.readSBML("somefile.xml");
* if (document.getNumErrors() > 0)
* {
* document.printErrors(libsbml.clog);
* println("Please correct the above problems first.");
* System.exit(1);
* }</div>
* <p>
* By default, most operating systems have have their standard error and
* logging output streams directed to the console/terminal, and this is
* where text messages will be shown. This can usually be redirected
* elsewhere, although how to do this depends on the specific environment
* where the program is running.
*
* @see #cout
* @see #cerr
*/
public final static OStream clog;
static {
cout = new OStream(OStream.COUT);
cerr = new OStream(OStream.CERR);
clog = new OStream(OStream.CLOG);
}
/**
* This private constructor does nothing and never invoked.
* The purpose of this constuctor is to hide a default constructor of this
* class in javadoc documentation.
*/
private libsbml() {}
/**
* Returns the version number of this copy of libSBML as an integer.
<p>
* @return the libSBML version as an integer; version 1.2.3 becomes 10203.
*/ public
static int getLibSBMLVersion() {
return libsbmlJNI.getLibSBMLVersion();
}
/**
* Returns the version number of this copy of libSBML as a string.
<p>
* @return the libSBML version as a string; version 1.2.3 becomes
* '1.2.3'.
<p>
* @see #getLibSBMLVersionString()
*/ public
static String getLibSBMLDottedVersion() {
return libsbmlJNI.getLibSBMLDottedVersion();
}
/**
* Returns the version number of this copy of libSBML as a string without
* periods.
<p>
* @return the libSBML version as a string: version 1.2.3 becomes '10203'.
<p>
* @see #getLibSBMLDottedVersion()
*/ public
static String getLibSBMLVersionString() {
return libsbmlJNI.getLibSBMLVersionString();
}
/**
* Returns an indication whether libSBML has been compiled with
* against a specific library.
<p>
* @param option the library to test against, this can be one of
* 'expat', 'libxml', 'xerces-c', 'bzip2', 'zip'
<p>
* @return 0 in case the libSBML has not been compiled against
* that library and non-zero otherwise (for libraries
* that define an integer version number that number will
* be returned).
<p>
* @see #getLibSBMLDependencyVersionOf(String option)
*/ public
static int isLibSBMLCompiledWith(String option) {
return libsbmlJNI.isLibSBMLCompiledWith(option);
}
/**
* Returns the version string for the dependency library used.
<p>
* @param option the library for which the version
* should be retrieved, this can be one of
* 'expat', 'libxml', 'xerces-c', 'bzip2', 'zip'
<p>
* @return null in case libSBML has not been compiled against
* that library and a version string otherwise.
<p>
* @see #isLibSBMLCompiledWith(String option)
*/ public
static String getLibSBMLDependencyVersionOf(String option) {
return libsbmlJNI.getLibSBMLDependencyVersionOf(option);
}
/**
* This method takes an SBML operation return value and returns a string representing
* the code.
<p>
* @param returnValue the operation return value to convert to a string
<p>
* @return a human readable name for the given
* operation return value .
<p>
* @note The caller does not own the returned string and is therefore not
* allowed to modify it.
*/ public
static String OperationReturnValue_toString(int returnValue) {
return libsbmlJNI.OperationReturnValue_toString(returnValue);
}
/**
* Reads an SBML document from the given file <code>filename</code>.
<p>
* If <code>filename</code> does not exist, or it is not an SBML file, an error will
* be logged in the error log of the {@link SBMLDocument} object returned by this
* method. Calling programs can inspect this error log to determine
* the nature of the problem. Please refer to the definition of
* SBMLDocument_t for more information about the error reporting mechanism.
<p>
* <code>
* SBMLReader_t *sr;
* SBMLDocument_t *d;
<p>
* sr = SBMLReader_create();
<p>
* d = SBMLReader_readSBML(reader, filename);
<p>
* if (SBMLDocument_getNumErrors(d) > 0)
* {
* if (XMLError_getId(SBMLDocument_getError(d, 0))
* == SBML_READ_ERROR_FILE_NOT_FOUND)
* if (XMLError_getId(SBMLDocument_getError(d, 0))
* == SBML_READ_ERROR_NOT_SBML)
* }
* </code>
<p>
* If the filename ends with @em .gz, the file will be read as a <em>gzip</em> file.
* Similary, if the filename ends with @em .zip or @em .bz2, the file will be
* read as a <em>zip</em> or <em>bzip2</em> file, respectively. Otherwise, the fill will be
* read as an uncompressed file.
* If the filename ends with @em .zip, only the first file in the archive will
* be read if the zip archive contains two or more files.
<p>
* To read a gzip/zip file, underlying libSBML needs to be linked with zlib
* at compile time. Also, underlying libSBML needs to be linked with bzip2
* to read a bzip2 file. File unreadable error will be logged if a compressed
* file name is given and underlying libSBML is not linked with the corresponding
* required library.
* SBMLReader_hasZlib() and SBMLReader_hasBzip2() can be used to check
* whether libSBML is linked with each library.
<p>
* @return a pointer to the {@link SBMLDocument} read.
*/ public
static SBMLDocument readSBML(String filename) {
long cPtr = libsbmlJNI.readSBML(libsbml.getAbsolutePath(filename));
return (cPtr == 0) ? null : new SBMLDocument(cPtr, true);
}
/**
* Reads an SBML document from the given file <code>filename</code>.
<p>
* If <code>filename</code> does not exist, or it is not an SBML file, an error will
* be logged in the error log of the {@link SBMLDocument} object returned by this
* method. Calling programs can inspect this error log to determine
* the nature of the problem. Please refer to the definition of
* SBMLDocument_t for more information about the error reporting mechanism.
<p>
<p>
* <code>
* SBMLReader_t *sr;
* SBMLDocument_t *d;
<p>
* sr = SBMLReader_create();
<p>
* d = SBMLReader_readSBML(reader, filename);
<p>
* if (SBMLDocument_getNumErrors(d) > 0)
* {
* if (XMLError_getId(SBMLDocument_getError(d, 0))
* == SBML_READ_ERROR_FILE_NOT_FOUND)
* if (XMLError_getId(SBMLDocument_getError(d, 0))
* == SBML_READ_ERROR_NOT_SBML)
* }
* </code>
<p>
* If the filename ends with @em .gz, the file will be read as a <em>gzip</em> file.
* Similary, if the filename ends with @em .zip or @em .bz2, the file will be
* read as a <em>zip</em> or <em>bzip2</em> file, respectively. Otherwise, the fill will be
* read as an uncompressed file.
* If the filename ends with @em .zip, only the first file in the archive will
* be read if the zip archive contains two or more files.
<p>
* To read a gzip/zip file, underlying libSBML needs to be linked with zlib
* at compile time. Also, underlying libSBML needs to be linked with bzip2
* to read a bzip2 file. File unreadable error will be logged if a compressed
* file name is given and underlying libSBML is not linked with the corresponding
* required library.
* SBMLReader_hasZlib() and SBMLReader_hasBzip2() can be used to check
* whether libSBML is linked with each library.
<p>
* @return a pointer to the {@link SBMLDocument} read.
*/ public
static SBMLDocument readSBMLFromFile(String filename) {
long cPtr = libsbmlJNI.readSBMLFromFile(libsbml.getAbsolutePath(filename));
return (cPtr == 0) ? null : new SBMLDocument(cPtr, true);
}
/**
* Reads an SBML document from the given XML string <code>xml</code>.
<p>
* If the string does not begin with XML declaration,
*<div class='fragment'><pre class='fragment'>
<?xml version='1.0' encoding='UTF-8'?>
</pre></div>
<p>
* an XML declaration string will be prepended.
<p>
* This method will report an error if the given string <code>xml</code> is not SBML.
* The error will be logged in the error log of the SBMLDocument_t structure
* returned by this method. Calling programs can inspect this error log to
* determine the nature of the problem. Please refer to the definition of
* {@link SBMLDocument} for more information about the error reporting mechanism.
<p>
* @return a pointer to the SBMLDocument_t read.
<p>
* @note When using this method to read an {@link SBMLDocument} that uses
* the SBML L3 Hierarchical {@link Model} Composition package (comp) the
* document location cannot be set automatically. Thus, if the model
* contains references to ExternalModelDefinitions, it will be necessary
* to manually set the document URI location (setLocationURI) in order
* to facilitate resolving these models.
*/ public
static SBMLDocument readSBMLFromString(String xml) {
long cPtr = libsbmlJNI.readSBMLFromString(xml);
return (cPtr == 0) ? null : new SBMLDocument(cPtr, true);
}
/**
* Writes the given SBML document <code>d</code> to the file named by <code>filename</code>.
* This convenience function is functionally equivalent to:
<p>
* SBMLWriter_writeSBML(SBMLWriter_create(), d, filename);
<p>
* If the given filename ends with the suffix <code>".gz"</code>
(for example, <code>"myfile.xml.gz"</code>), libSBML assumes the
caller wants the file to be written compressed in <em>gzip</em> format.
Similarly, if the given filename ends with <code>".zip"</code> or
<code>".bz2"</code>, libSBML assumes the caller wants the file to
be compressed in <em>zip</em> or <em>bzip2</em> format (respectively).
Files whose names lack these suffixes will be written uncompressed.
<em>Special considerations for the zip format</em>: If the given filename
ends with <code>".zip"</code>, the file placed in the zip archive
will have the suffix <code>".xml"</code> or
<code>".sbml"</code>. For example, the file in the zip archive
will be named <code>"test.xml"</code> if the given filename is
<code>"test.xml.zip"</code> or <code>"test.zip"</code>.
Similarly, the filename in the archive will be
<code>"test.sbml"</code> if the given filename is
<code>"test.sbml.zip"</code>.
<p>
* @param d the {@link SBMLDocument} object to be written out in XML format
<p>
* @param filename a string giving the path to a file where the XML
* content is to be written.
<p>
* @return <code>1</code> on success and <code>0</code> (zero) if <code>filename</code> could not be
* written. Some possible reasons for failure include (a) being unable to
* open the file, and (b) using a filename that indicates a compressed SBML
* file (i.e., a filename ending in <code>".zip"</code> or
* similar) when the compression functionality has not been enabled in
* the underlying copy of libSBML.
<p>
* @see SBMLWriter#hasZlib()
* @see SBMLWriter#hasBzip2()
*/ public
static int writeSBML(SBMLDocument d, String filename) {
return libsbmlJNI.writeSBML(SBMLDocument.getCPtr(d), d, libsbml.getAbsolutePath(filename));
}
/**
* Writes the given SBML document <code>d</code> to an in-memory string and returns a
* pointer to it. The string is owned by the caller and should be freed
* (with free()) when no longer needed. This convenience function is
* functionally equivalent to:
<p>
* SBMLWriter_writeSBMLToString(SBMLWriter_create(), d);
<p>
* but does not require the caller to create an {@link SBMLWriter} object first.
<p>
* @param d an {@link SBMLDocument} object to be written out in XML format
<p>
* @return the string on success and <code>null</code> if one of the underlying parser
* components fail.
*/ public
static String writeSBMLToString(SBMLDocument d) {
return libsbmlJNI.writeSBMLToString(SBMLDocument.getCPtr(d), d);
}
/**
* Writes the given SBML document <code>d</code> to the file <code>filename</code>.
* This convenience function is functionally equivalent to:
<p>
* SBMLWriter_writeSBMLToFile(SBMLWriter_create(), d, filename);
<p>
* but that does not require the caller to create an {@link SBMLWriter} object first.
<p>
* If the given filename ends with the suffix <code>".gz"</code>
(for example, <code>"myfile.xml.gz"</code>), libSBML assumes the
caller wants the file to be written compressed in <em>gzip</em> format.
Similarly, if the given filename ends with <code>".zip"</code> or
<code>".bz2"</code>, libSBML assumes the caller wants the file to
be compressed in <em>zip</em> or <em>bzip2</em> format (respectively).
Files whose names lack these suffixes will be written uncompressed.
<em>Special considerations for the zip format</em>: If the given filename
ends with <code>".zip"</code>, the file placed in the zip archive
will have the suffix <code>".xml"</code> or
<code>".sbml"</code>. For example, the file in the zip archive
will be named <code>"test.xml"</code> if the given filename is
<code>"test.xml.zip"</code> or <code>"test.zip"</code>.
Similarly, the filename in the archive will be
<code>"test.sbml"</code> if the given filename is
<code>"test.sbml.zip"</code>.
<p>
* @param d an {@link SBMLDocument} object to be written out in XML format
<p>
* @param filename a string giving the path to a file where the XML
* content is to be written.
<p>
* @return <code>1</code> on success and <code>0</code> (zero) if <code>filename</code> could not be
* written. Some possible reasons for failure include (a) being unable to
* open the file, and (b) using a filename that indicates a compressed SBML
* file (i.e., a filename ending in <code>".zip"</code> or
* similar) when the compression functionality has not been enabled in
* the underlying copy of libSBML.
<p>
<p>
<p>
* @see SBMLWriter#hasZlib()
* @see SBMLWriter#hasBzip2()
*/ public
static int writeSBMLToFile(SBMLDocument d, String filename) {
return libsbmlJNI.writeSBMLToFile(SBMLDocument.getCPtr(d), d, libsbml.getAbsolutePath(filename));
}
/**
* This method takes an SBML type code and returns a string representing
* the code.
<p>
* LibSBML attaches an identifying code to every
* kind of SBML object. These are known as <em>SBML type codes</em>. In
* other languages, the set of type codes is stored in an enumeration; in
* the Java language interface for libSBML, the type codes are defined as
* static integer constants in the interface class {@link
* libsbmlConstants}. The names of the type codes all begin with the
* characters <code>SBML_.</code>
<p>
* @return a human readable name for the given
* SBML type code.
<p>
* @note The caller does not own the returned string and is therefore not
* allowed to modify it.
*/ public
static String SBMLTypeCode_toString(int tc, String pkgName) {
return libsbmlJNI.SBMLTypeCode_toString(tc, pkgName);
}
/**
* Tests for logical equality between two given <code>UNIT_KIND_</code>
* code values.
<p>
* This function behaves exactly like C's <code>==</code> operator, except
* for the following two cases:
* <ul>
* <li>{@link libsbmlConstants#UNIT_KIND_LITER UNIT_KIND_LITER} <code>==</code> {@link libsbmlConstants#UNIT_KIND_LITRE UNIT_KIND_LITRE}
* <li>{@link libsbmlConstants#UNIT_KIND_METER UNIT_KIND_METER} <code>==</code> {@link libsbmlConstants#UNIT_KIND_METRE UNIT_KIND_METRE}
* </ul>
<p>
* In the two cases above, C equality comparison would yield <code>false</code>
* (because each of the above is a distinct enumeration value), but
* this function returns <code>true.</code>
<p>
* @param uk1 a <code>UNIT_KIND_</code> value
* @param uk2 a second <code>UNIT_KIND_</code> value to compare to <code>uk1</code>
<p>
* @return nonzero (for <code>true</code>) if <code>uk1</code> is logically equivalent to
* <code>uk2</code>, zero (for <code>false</code>) otherwise.
<p>
* @note For more information about the libSBML unit codes, please refer to
* the class documentation for {@link Unit}.
*/ public
static int UnitKind_equals(int uk1, int uk2) {
return libsbmlJNI.UnitKind_equals(uk1, uk2);
}
/**
* Converts a text string naming a kind of unit to its corresponding
* libSBML <code>UNIT_KIND_</code> constant/enumeration value.
<p>
* @param name a string, the name of a predefined base unit in SBML
<p>
* @return a value the set of <code>UNIT_KIND_</code> codes
* defined in class {@link libsbmlConstants}, corresponding to the string
* <code>name</code> (determined in a case-insensitive manner).
<p>
* @note For more information about the libSBML unit codes, please refer to
* the class documentation for {@link Unit}.
*/ public
static int UnitKind_forName(String name) {
return libsbmlJNI.UnitKind_forName(name);
}
/**
* Converts a unit code to a text string equivalent.
<p>
* @param uk a value from the set of <code>UNIT_KIND_</code> codes
* defined in the class {@link libsbmlConstants}
<p>
<p>
* @return the name corresponding to the given unit code.
<p>
* @note For more information about the libSBML unit codes, please refer to
* the class documentation for {@link Unit}.
<p>
* @warning The string returned is a static data value. The caller does not
* own the returned string and is therefore not allowed to modify it.
*/ public
static String UnitKind_toString(int uk) {
return libsbmlJNI.UnitKind_toString(uk);
}
/**
* Predicate for testing whether a given string corresponds to a
* predefined libSBML unit code.
<p>
* @param str a text string naming a base unit defined by SBML
* @param level the Level of SBML
* @param version the Version within the Level of SBML
<p>
* @return nonzero (for <code>true</code>) if string is the name of a valid
* <code>UNIT_KIND_</code> value, zero (for <code>false</code>) otherwise.
<p>
* @note For more information about the libSBML unit codes, please refer to
* the class documentation for {@link Unit}.
*/ public
static int UnitKind_isValidUnitKindString(String str, long level, long version) {
return libsbmlJNI.UnitKind_isValidUnitKindString(str, level, version);
}
public static boolean representsNumber(int type) {
return libsbmlJNI.representsNumber(type);
}
public static boolean representsFunction(int type, ASTBasePlugin plugin) {
return libsbmlJNI.representsFunction__SWIG_0(type, ASTBasePlugin.getCPtr(plugin), plugin);
}
public static boolean representsFunction(int type) {
return libsbmlJNI.representsFunction__SWIG_1(type);
}
public static boolean representsUnaryFunction(int type, ASTBasePlugin plugin) {
return libsbmlJNI.representsUnaryFunction__SWIG_0(type, ASTBasePlugin.getCPtr(plugin), plugin);
}
public static boolean representsUnaryFunction(int type) {
return libsbmlJNI.representsUnaryFunction__SWIG_1(type);
}
public static boolean representsBinaryFunction(int type, ASTBasePlugin plugin) {
return libsbmlJNI.representsBinaryFunction__SWIG_0(type, ASTBasePlugin.getCPtr(plugin), plugin);
}
public static boolean representsBinaryFunction(int type) {
return libsbmlJNI.representsBinaryFunction__SWIG_1(type);
}
public static boolean representsNaryFunction(int type, ASTBasePlugin plugin) {
return libsbmlJNI.representsNaryFunction__SWIG_0(type, ASTBasePlugin.getCPtr(plugin), plugin);
}
public static boolean representsNaryFunction(int type) {
return libsbmlJNI.representsNaryFunction__SWIG_1(type);
}
public static boolean representsQualifier(int type, ASTBasePlugin plugin) {
return libsbmlJNI.representsQualifier__SWIG_0(type, ASTBasePlugin.getCPtr(plugin), plugin);
}
public static boolean representsQualifier(int type) {
return libsbmlJNI.representsQualifier__SWIG_1(type);
}
public static boolean representsFunctionRequiringAtLeastTwoArguments(int type) {
return libsbmlJNI.representsFunctionRequiringAtLeastTwoArguments(type);
}
public static int getCoreTypeFromName(String name) {
return libsbmlJNI.getCoreTypeFromName(name);
}
public static String getNameFromCoreType(int type) {
return libsbmlJNI.getNameFromCoreType(type);
}
public static boolean isCoreTopLevelMathMLFunctionNodeTag(String name) {
return libsbmlJNI.isCoreTopLevelMathMLFunctionNodeTag(name);
}
public static boolean isCoreTopLevelMathMLNumberNodeTag(String name) {
return libsbmlJNI.isCoreTopLevelMathMLNumberNodeTag(name);
}
/**
* Reads the MathML from the given XML string, constructs a corresponding
* abstract syntax tree, and returns a pointer to the root of the tree.
<p>
* @param xml a string containing a full MathML expression
<p>
* @return the root of an AST corresponding to the given mathematical
* expression, otherwise <code>null</code> is returned if the given string is <code>null</code>
* or invalid.
*/ public
static ASTNode readMathMLFromString(String xml) {
long cPtr = libsbmlJNI.readMathMLFromString(xml);
return (cPtr == 0) ? null : new ASTNode(cPtr, true);
}
/**
* Reads the MathML from the given XML string, constructs a corresponding
* abstract syntax tree, and returns a pointer to the root of the tree.
<p>
* @param xml a string containing a full MathML expression
* @param xmlns a XMLNamespaces_t object containing namespaces that
* are considered active during the read e.g. an L3 package namespace
<p>
* @return the root of an AST corresponding to the given mathematical
* expression, otherwise <code>null</code> is returned if the given string is <code>null</code>
* or invalid.
*/ public
static ASTNode readMathMLFromStringWithNamespaces(String xml, XMLNamespaces xmlns) {
long cPtr = libsbmlJNI.readMathMLFromStringWithNamespaces(xml, XMLNamespaces.getCPtr(xmlns), xmlns);
return (cPtr == 0) ? null : new ASTNode(cPtr, false);
}
/**
* Writes the given ASTNode_t (and its children) to a string as MathML, and
* returns the string.
<p>
* @param node the root of an AST to write out to the stream.
<p>
* @return a string containing the written-out MathML representation
* of the given AST.
<p>
* @note The string is owned by the caller and should be freed (with
* free()) when no longer needed. <code>null</code> is returned if the given
* argument is <code>null.</code>
*/ public
static String writeMathMLToString(ASTNode node) {
return libsbmlJNI.writeMathMLToString(ASTNode.getCPtr(node), node);
}
/**
* Parses the given SBML formula and returns a representation of it as an
* Abstract Syntax Tree (AST).
<p>
* <p>
* The text-string form of mathematical formulas produced by
* <code><a href='libsbml.html#formulaToString(org.sbml.libsbml.ASTNode)'>libsbml.formulaToString(ASTNode tree)</a></code>
* and read by <code><a href='libsbml.html#parseFormula(java.lang.String)'>libsbml.parseFormula(String formula)</a></code>
* use a simple C-inspired infix notation taken from SBML Level 1. A
* formula in this text-string form therefore can be handed to a program
* that understands SBML Level 1 mathematical expressions, or used as
* part of a formula translation system. The syntax is described in detail
* in the documentation for {@link ASTNode}.
<p>
* Note that this facility is provided as a convenience by libSBML—the
* MathML standard does not actually define a 'string-form' equivalent to
* MathML expression trees, so the choice of formula syntax is somewhat
* arbitrary. The approach taken by libSBML is to use the syntax defined by
* SBML Level 1 (which in fact used a text-string representation of
* formulas and not MathML). This formula syntax is based mostly on C
* programming syntax, and may contain operators, function calls, symbols,
* and white space characters. The following table provides the precedence
* rules for the different entities that may appear in formula strings.
<p>
* <table border="0" class="centered text-table width80 normal-font alt-row-colors" style="padding-bottom: 0.5em">
<tr style="background: lightgray; font-size: 14px;">
<th align="left">Token</th>
<th align="left">Operation</th>
<th align="left">Class</th>
<th>Precedence</th>
<th align="left">Associates</th>
</tr>
<tr><td><em>name</em></td><td>symbol reference</td><td>operand</td><td align="center">6</td><td>n/a</td></tr>
<tr><td><code>(</code><em>expression</em><code>)</code></td><td>expression grouping</td><td>operand</td><td align="center">6</td><td>n/a</td></tr>
<tr><td><code>f(</code><em>...</em><code>)</code></td><td>function call</td><td>prefix</td><td align="center">6</td><td>left</td></tr>
<tr><td><code>-</code></td><td>negation</td><td>unary</td><td align="center">5</td><td>right</td></tr>
<tr><td><code>^</code></td><td>power</td><td>binary</td><td align="center">4</td><td>left</td></tr>
<tr><td><code>*</code></td><td>multiplication</td><td>binary</td><td align="center">3</td><td>left</td></tr>
<tr><td><code>/</code></td><td>divison</td><td>binary</td><td align="center">3</td><td>left</td></tr>
<tr><td><code>+</code></td><td>addition</td><td>binary</td><td align="center">2</td><td>left</td></tr>
<tr><td><code>-</code></td><td>subtraction</td><td>binary</td><td align="center">2</td><td>left</td></tr>
<tr><td><code>,</code></td><td>argument delimiter</td><td>binary</td><td align="center">1</td><td>left</td></tr>
<caption class="top-caption">A table of the expression operators and their precedence in the
text-string format for mathematical expressions used by SBML_parseFormula().
</caption>
</table>
<p>
* In the table above, <em>operand</em> implies the construct is an operand,
* <em>prefix</em> implies the operation is applied to the following arguments,
* <em>unary</em> implies there is one argument, and <em>binary</em> implies there are
* two arguments. The values in the <b>Precedence</b> column show how the
* order of different types of operation are determined. For example, the
* expression <code>a * b + c</code> is evaluated as <code>(a * b) +
* c</code> because the @c * operator has higher precedence. The
* <b>Associates</b> column shows how the order of similar precedence
* operations is determined; for example, <code>a - b + c</code> is
* evaluated as <code>(a - b) + c</code> because the <code>+</code> and <code>-</code>
* operators are left-associative.
<p>
* The function call syntax consists of a function name, followed by optional
* white space, followed by an opening parenthesis token, followed by a
* sequence of zero or more arguments separated by commas (with each comma
* optionally preceded and/or followed by zero or more white space
* characters, followed by a closing parenthesis token. The function name
* must be chosen from one of the pre-defined functions in SBML or a
* user-defined function in the model. The following table lists the names
* of certain common mathematical functions; this table corresponds to
* Table 6 in the <a target='_blank' href='http://sbml.org/Documents/Specifications#SBML_Level_1_Version_2'>SBML Level 1 Version 2 specification</a>:
<p>
* <table border="0" class="centered text-table width80 normal-font alt-row-colors">
<tr>
<th align="left" width="60">Name</th>
<th align="left" width="35">Args</th>
<th align="left">Formula or meaning</th>
<th align="left" width="110">Argument Constraints</th>
<th align="left" width="100">Result constraints</th>
</tr>
<tr><td><code>abs</code></td><td><em>x</em></td><td>absolute value of <em>x</em></td><td></td><td></td></tr>
<tr><td><code>acos</code></td><td><em>x</em></td><td>arc cosine of <em>x</em> in radians</td><td>-1.0 ≤ <em>x</em> ≤ 1.0</td><td>0 ≤ <em>acos(x)</em> ≤ π</td></tr>
<tr><td><code>asin</code></td><td><em>x</em></td><td>arc sine of <em>x</em> in radians</td><td>-1.0 ≤ <em>x</em> ≤ 1.0</td><td>0 ≤ <em>asin(x)</em> ≤ π</td></tr>
<tr><td><code>atan</code></td><td><em>x</em></td><td>arc tangent of <em>x</em> in radians</td><td></td><td>0 ≤ <em>atan(x)</em> ≤ π</td></tr>
<tr><td><code>ceil</code></td><td><em>x</em></td><td>smallest number not less than <em>x</em> whose value is an exact integer</td><td></td><td></td></tr>
<tr><td><code>cos</code></td><td><em>x</em></td><td>cosine of <em>x</em></td><td></td><td></td></tr>
<tr><td><code>exp</code></td><td><em>x</em></td><td><em>e</em><sup><em> x</em></sup>, where <em>e</em> is the base of the natural logarithm</td><td></td><td></td></tr>
<tr><td><code>floor</code></td><td><em>x</em></td><td>the largest number not greater than <em>x</em> whose value is an exact integer</td><td></td><td></td></tr>
<tr><td><code>log</code></td><td><em>x</em></td><td>natural logarithm of <em>x</em></td><td><em>x</em> > 0</td><td></td></tr>
<tr><td><code>log10</code></td><td><em>x</em></td><td>base 10 logarithm of <em>x</em></td><td><em>x</em> > 0</td><td></td></tr>
<tr><td><code>pow</code></td><td><em>x, y</em></td><td><em>x</em><sup><em> y</em></sup></td><td></td><td></td></tr>
<tr><td><code>sqr</code></td><td><em>x</em></td><td><em>x</em><sup><em>2</em></sup></td><td></td><td></td></tr>
<tr><td><code>sqrt</code></td><td><em>x</em></td><td>√<em>x</em></td><td><em>x</em> > 0</td><td><em>sqrt(x)</em> ≥ 0</td></tr>
<tr><td><code>sin</code></td><td><em>x</em></td><td>sine of <em>x</em></td><td></td><td></td></tr>
<tr><td><code>tan</code></td><td><em>x</em></td><td>tangent of <em>x</em></td><td>x ≠ n*π/2, for odd integer <em>n</em></td><td></td></tr>
<caption class="bottom-caption">The names of mathematical functions defined in the SBML
Level 1 Version 2 text-string formula syntax.</caption>
</table>
<p>
* @warning <span class='warning'>There are differences between the symbols
* used to represent the common mathematical functions and the corresponding
* MathML token names. This is a potential source of incompatibilities.
* Note in particular that in this text-string syntax, <code>log(x)</code>
* represents the natural logarithm, whereas in MathML, the natural logarithm
* is <code><ln/></code>. Application writers are urged to be careful
* when translating between text forms and MathML forms, especially if they
* provide a direct text-string input facility to users of their software
* systems.</span>
<p>
* <p>
* @warning <span class='warning'>We urge developers to keep in mind that
* the text-string formula syntax is specific to SBML Level 1's C-like
* mathematical formula syntax. In particular, it is <em>not a
* general-purpose mathematical expression syntax</em>. LibSBML provides
* methods for parsing and transforming text-string math formulas back and
* forth from AST structures, but it is important to keep the system's
* limitations in mind.</span>
<p>
* @param formula the text-string formula expression to be parsed
<p>
* @return the root node of the AST corresponding to the <code>formula</code>, or
* <code>null</code> if an error occurred in parsing the formula
<p>
<p>
<p>
<p>
* @see <code><a href='libsbml.html#formulaToString(org.sbml.libsbml.ASTNode tree)'>libsbml.formulaToString(ASTNode tree)</a></code>
* @see <code><a href='libsbml.html#parseL3FormulaWithSettings(java.lang.String, org.sbml.libsbml.L3ParserSettings)'>libsbml.parseL3FormulaWithSettings(String formula, L3ParserSettings settings)</a></code>
* @see <code><a href='libsbml.html#parseL3Formula(java.lang.String)'>libsbml.parseL3Formula(String formula)</a></code>
* @see <code><a href='libsbml.html#parseL3FormulaWithModel(java.lang.String, org.sbml.libsbml.Model)'>parseL3FormulaWithModel(String formula, Model model)</a></code>
* @see <code><a href='libsbml.html#getLastParseL3Error()'>getLastParseL3Error()</a></code>
* @see <code><a href='libsbml.html#getDefaultL3ParserSettings()'>getDefaultL3ParserSettings()</a></code>
*/ public
static ASTNode parseFormula(String formula) {
long cPtr = libsbmlJNI.parseFormula(formula);
return (cPtr == 0) ? null : new ASTNode(cPtr, true);
}
/**
* Converts an AST to a string representation of a formula using a syntax
* basically derived from SBML Level 1.
<p>
* <p>
* The text-string form of mathematical formulas produced by
* <code><a href='libsbml.html#formulaToString(org.sbml.libsbml.ASTNode)'>libsbml.formulaToString(ASTNode tree)</a></code>
* and read by <code><a href='libsbml.html#parseFormula(java.lang.String)'>libsbml.parseFormula(String formula)</a></code>
* use a simple C-inspired infix notation taken from SBML Level 1. A
* formula in this text-string form therefore can be handed to a program
* that understands SBML Level 1 mathematical expressions, or used as
* part of a formula translation system. The syntax is described in detail
* in the documentation for {@link ASTNode}.
<p>
* Note that this facility is provided as a convenience by libSBML—the
* MathML standard does not actually define a 'string-form' equivalent to
* MathML expression trees, so the choice of formula syntax is somewhat
* arbitrary. The approach taken by libSBML is to use the syntax defined by
* SBML Level 1 (which in fact used a text-string representation of
* formulas and not MathML). This formula syntax is based mostly on C
* programming syntax, and may contain operators, function calls, symbols,
* and white space characters. The following table provides the precedence
* rules for the different entities that may appear in formula strings.
<p>
* <table border="0" class="centered text-table width80 normal-font alt-row-colors" style="padding-bottom: 0.5em">
<tr style="background: lightgray; font-size: 14px;">
<th align="left">Token</th>
<th align="left">Operation</th>
<th align="left">Class</th>
<th>Precedence</th>
<th align="left">Associates</th>
</tr>
<tr><td><em>name</em></td><td>symbol reference</td><td>operand</td><td align="center">6</td><td>n/a</td></tr>
<tr><td><code>(</code><em>expression</em><code>)</code></td><td>expression grouping</td><td>operand</td><td align="center">6</td><td>n/a</td></tr>
<tr><td><code>f(</code><em>...</em><code>)</code></td><td>function call</td><td>prefix</td><td align="center">6</td><td>left</td></tr>
<tr><td><code>-</code></td><td>negation</td><td>unary</td><td align="center">5</td><td>right</td></tr>
<tr><td><code>^</code></td><td>power</td><td>binary</td><td align="center">4</td><td>left</td></tr>
<tr><td><code>*</code></td><td>multiplication</td><td>binary</td><td align="center">3</td><td>left</td></tr>
<tr><td><code>/</code></td><td>divison</td><td>binary</td><td align="center">3</td><td>left</td></tr>
<tr><td><code>+</code></td><td>addition</td><td>binary</td><td align="center">2</td><td>left</td></tr>
<tr><td><code>-</code></td><td>subtraction</td><td>binary</td><td align="center">2</td><td>left</td></tr>
<tr><td><code>,</code></td><td>argument delimiter</td><td>binary</td><td align="center">1</td><td>left</td></tr>
<caption class="top-caption">A table of the expression operators and their precedence in the
text-string format for mathematical expressions used by SBML_parseFormula().
</caption>
</table>
<p>
* In the table above, <em>operand</em> implies the construct is an operand,
* <em>prefix</em> implies the operation is applied to the following arguments,
* <em>unary</em> implies there is one argument, and <em>binary</em> implies there are
* two arguments. The values in the <b>Precedence</b> column show how the
* order of different types of operation are determined. For example, the
* expression <code>a * b + c</code> is evaluated as <code>(a * b) +
* c</code> because the @c * operator has higher precedence. The
* <b>Associates</b> column shows how the order of similar precedence
* operations is determined; for example, <code>a - b + c</code> is
* evaluated as <code>(a - b) + c</code> because the <code>+</code> and <code>-</code>
* operators are left-associative.
<p>
* The function call syntax consists of a function name, followed by optional
* white space, followed by an opening parenthesis token, followed by a
* sequence of zero or more arguments separated by commas (with each comma
* optionally preceded and/or followed by zero or more white space
* characters, followed by a closing parenthesis token. The function name
* must be chosen from one of the pre-defined functions in SBML or a
* user-defined function in the model. The following table lists the names
* of certain common mathematical functions; this table corresponds to
* Table 6 in the <a target='_blank' href='http://sbml.org/Documents/Specifications#SBML_Level_1_Version_2'>SBML Level 1 Version 2 specification</a>:
<p>
* <table border="0" class="centered text-table width80 normal-font alt-row-colors">
<tr>
<th align="left" width="60">Name</th>
<th align="left" width="35">Args</th>
<th align="left">Formula or meaning</th>
<th align="left" width="110">Argument Constraints</th>
<th align="left" width="100">Result constraints</th>
</tr>
<tr><td><code>abs</code></td><td><em>x</em></td><td>absolute value of <em>x</em></td><td></td><td></td></tr>
<tr><td><code>acos</code></td><td><em>x</em></td><td>arc cosine of <em>x</em> in radians</td><td>-1.0 ≤ <em>x</em> ≤ 1.0</td><td>0 ≤ <em>acos(x)</em> ≤ π</td></tr>
<tr><td><code>asin</code></td><td><em>x</em></td><td>arc sine of <em>x</em> in radians</td><td>-1.0 ≤ <em>x</em> ≤ 1.0</td><td>0 ≤ <em>asin(x)</em> ≤ π</td></tr>
<tr><td><code>atan</code></td><td><em>x</em></td><td>arc tangent of <em>x</em> in radians</td><td></td><td>0 ≤ <em>atan(x)</em> ≤ π</td></tr>
<tr><td><code>ceil</code></td><td><em>x</em></td><td>smallest number not less than <em>x</em> whose value is an exact integer</td><td></td><td></td></tr>
<tr><td><code>cos</code></td><td><em>x</em></td><td>cosine of <em>x</em></td><td></td><td></td></tr>
<tr><td><code>exp</code></td><td><em>x</em></td><td><em>e</em><sup><em> x</em></sup>, where <em>e</em> is the base of the natural logarithm</td><td></td><td></td></tr>
<tr><td><code>floor</code></td><td><em>x</em></td><td>the largest number not greater than <em>x</em> whose value is an exact integer</td><td></td><td></td></tr>
<tr><td><code>log</code></td><td><em>x</em></td><td>natural logarithm of <em>x</em></td><td><em>x</em> > 0</td><td></td></tr>
<tr><td><code>log10</code></td><td><em>x</em></td><td>base 10 logarithm of <em>x</em></td><td><em>x</em> > 0</td><td></td></tr>
<tr><td><code>pow</code></td><td><em>x, y</em></td><td><em>x</em><sup><em> y</em></sup></td><td></td><td></td></tr>
<tr><td><code>sqr</code></td><td><em>x</em></td><td><em>x</em><sup><em>2</em></sup></td><td></td><td></td></tr>
<tr><td><code>sqrt</code></td><td><em>x</em></td><td>√<em>x</em></td><td><em>x</em> > 0</td><td><em>sqrt(x)</em> ≥ 0</td></tr>
<tr><td><code>sin</code></td><td><em>x</em></td><td>sine of <em>x</em></td><td></td><td></td></tr>
<tr><td><code>tan</code></td><td><em>x</em></td><td>tangent of <em>x</em></td><td>x ≠ n*π/2, for odd integer <em>n</em></td><td></td></tr>
<caption class="bottom-caption">The names of mathematical functions defined in the SBML
Level 1 Version 2 text-string formula syntax.</caption>
</table>
<p>
* @warning <span class='warning'>There are differences between the symbols
* used to represent the common mathematical functions and the corresponding
* MathML token names. This is a potential source of incompatibilities.
* Note in particular that in this text-string syntax, <code>log(x)</code>
* represents the natural logarithm, whereas in MathML, the natural logarithm
* is <code><ln/></code>. Application writers are urged to be careful
* when translating between text forms and MathML forms, especially if they
* provide a direct text-string input facility to users of their software
* systems.</span>
<p>
* <p>
* @warning <span class='warning'>We urge developers to keep in mind that
* the text-string formula syntax is specific to SBML Level 1's C-like
* mathematical formula syntax. In particular, it is <em>not a
* general-purpose mathematical expression syntax</em>. LibSBML provides
* methods for parsing and transforming text-string math formulas back and
* forth from AST structures, but it is important to keep the system's
* limitations in mind.</span>
<p>
* @param tree the AST to be converted.
<p>
* @return the formula from the given AST as an SBML Level 1 text-string
* mathematical formula. The caller owns the returned string and is
* responsible for freeing it when it is no longer needed.
<p>
<p>
<p>
<p>
* @see <code><a href='libsbml.html#formulaToString(org.sbml.libsbml.ASTNode tree)'>libsbml.formulaToString(ASTNode tree)</a></code>
* @see <code><a href='libsbml.html#parseL3FormulaWithSettings(java.lang.String, org.sbml.libsbml.L3ParserSettings)'>libsbml.parseL3FormulaWithSettings(String formula, L3ParserSettings settings)</a></code>
* @see <code><a href='libsbml.html#parseL3Formula(java.lang.String)'>libsbml.parseL3Formula(String formula)</a></code>
* @see <code><a href='libsbml.html#parseL3FormulaWithModel(java.lang.String, org.sbml.libsbml.Model)'>parseL3FormulaWithModel(String formula, Model model)</a></code>
* @see <code><a href='libsbml.html#getLastParseL3Error()'>getLastParseL3Error()</a></code>
* @see <code><a href='libsbml.html#getDefaultL3ParserSettings()'>getDefaultL3ParserSettings()</a></code>
*/ public
static String formulaToString(ASTNode tree) {
return libsbmlJNI.formulaToString(ASTNode.getCPtr(tree), tree);
}
/**
* Parses the given mathematical formula and returns a representation of it
* as an Abstract Syntax Tree (AST).
<p>
* <p>
* The text-string form of mathematical formulas read by the functions
* <code><a
* href='libsbml.html#formulaToL3String(org.sbml.libsbml.ASTNode)'>libsbml.formulaToL3String(ASTNode
* tree)</a></code> and <code><a
* href='libsbml.html#parseFormula(java.lang.String)'>libsbml.parseFormula(String
* formula)</a></code> are expanded versions of the formats produced
* and read by <code><a
* href='libsbml.html#formulaToString(org.sbml.libsbml.ASTNode)'>libsbml.formulaToString(ASTNode
* tree)</a></code> and * <code><a
* href='libsbml.html#parseFormula(java.lang.String)'>libsbml.parseFormula(String
* formula)</a></code>, respectively. The latter two libSBML
* functions were originally developed to support conversion between SBML
* Levels 1 and 2, and were focused on the syntax of mathematical
* formulas used in SBML Level 1. With time, and the use of MathML in
* SBML Levels 2 and 3, it became clear that supporting
* Level 2 and 3's expanded mathematical syntax would be useful for
* software developers.
* To maintain backwards compatibility, the original
* <code><a href='libsbml.html#formulaToString(org.sbml.libsbml.ASTNode)'>libsbml.formulaToString(ASTNode tree)</a></code>
* and
* <code><a href='libsbml.html#parseFormula(java.lang.String)'>libsbml.parseFormula(String formula)</a></code>
* have been left untouched, and instead, the new functionality is
* provided in the form of
* <cod
e><a href='libsbml.html#parseL3Formula(java.lang.String)'>libsbml.parseL3Formula(String formula)</a></code>
* and <code><a
* href='libsbml.html#formulaToL3String(org.sbml.libsbml.ASTNode)'>libsbml.formulaToL3String(ASTNode
* tree)</a></code>.
<p>
* The following are the differences in the formula syntax supported by the
* 'L3' versions of the formula parsers and formatters, compared to what is
* supported by * <code><a
* href='libsbml.html#parseFormula(java.lang.String)'>libsbml.parseFormula(String
* formula)</a></code> and <code><a
* href='libsbml.html#formulaToL3String(org.sbml.libsbml.ASTNode)'>libsbml.formulaToL3String(ASTNode
* tree)</a></code>:
<p>
* <ul>
* <li> Units may be asociated with bare numbers, using the following syntax:
* <div style='margin: 10px auto 10px 25px; display: block'>
* <span class='code' style='background-color: #d0d0ee'>number</span>
* <span class='code' style='background-color: #edd'>unit</span>
* </div>
* The <span class='code' style='background-color: #d0d0ee'>number</span>
* may be in any form (an integer, real, or rational
* number), and the
* <span class='code' style='background-color: #edd'>unit</span>
* must conform to the syntax of an SBML identifier (technically, the
* type defined as <code>SId</code> in the SBML specifications). The whitespace between
* <span class='code' style='background-color: #d0d0ee'>number</span>
* and <span class='code' style='background-color: #edd'>unit</span>
* is optional.
<p>
* <li> The Boolean function symbols <code>&&</code>, <code>||</code>, <code>!</code>, and <code>!=</code> may be
* used.
<p>
* <li> The <em>modulo</em> operation is allowed as the symbol <code>@%</code> and will
* produce a piecewise function in the MathML.
<p>
* <li> All inverse trigonometric functions may be defined in the infix either
* using <code>arc</code> as a prefix or simply <code>a</code>; in other words, both <code>arccsc</code>
* and <code>acsc</code> are interpreted as the operator <em>arccosecant</em> defined in
* MathML. (Many functions in the SBML Level 1 infix-notation parser
* implemented by * <code><a
* href='libsbml.html#parseFormula(java.lang.String)'>libsbml.parseFormula(String
* formula)</a></code> are defined this way as well, but not all.)
<p>
* <li> The following expression is parsed as a rational number instead of
* as a numerical division:
* <pre style='display: block; margin-left: 25px'>
* (<span class='code' style='background-color: #d0d0ee'>integer</span>/<span class='code' style='background-color: #d0d0ee'>integer</span>)</pre>
* No spaces are allowed in this construct; in other words,
* "<code>(3 / 4)</code>" will be parsed into the MathML
* <code><divide></code> construct rather than a rational number. The
* general number syntax allows you to assign units to a rational number, e.g.,
* "<code>(3/4) ml</code>". (If the string is a division, units
* are not interpreted in this way.)
<p>
* <li> Various settings may be altered by using an {@link L3ParserSettings} object in
* conjunction with the functions <code><a
* href='libsbml.html#parseL3FormulaWithSettings(java.lang.String,
* org.sbml.libsbml.L3ParserSettings)'>libsbml.parseL3FormulaWithSettings(String
* formula, {@link L3ParserSettings} settings)</a></code> and <code><a
* href='libsbml.html#formulaToL3String(org.sbml.libsbml.ASTNode)'>libsbml.formulaToL3String(ASTNode
* tree)</a></code>, including the following:
* <ul>
* <li> The function <code>log</code> with a single argument ("<code>log(x)</code>")
* can be parsed as <code>log10(x)</code>, <code>ln(x)</code>, or treated
* as an error, as desired.
* <li> Unary minus signs can be collapsed or preserved; that is,
* sequential pairs of unary minuses (e.g., "<code>- -3</code>")
* can be removed from the input entirely and single unary minuses can be
* incorporated into the number node, or all minuses can be preserved in
* the AST node structure.
* <li> Parsing of units embedded in the input string can be turned on and
* off.
* <li> The string <code>avogadro</code> can be parsed as a MathML <em>csymbol</em> or
* as an identifier.
* <li> A {@link Model} object may optionally be provided to the parser using the
* variant function call
* <code><a
* href='libsbml.html#parseL3FormulaWithModel(java.lang.String,
* org.sbml.libsbml.Model)'>libsbml.parseL3FormulaWithModel(String formula,
* {@link Model} model)</a></code> or stored in a {@link L3ParserSettings} object
* passed to the variant function <code><a
* href='libsbml.html#parseL3FormulaWithSettings(java.lang.String,
* org.sbml.libsbml.L3ParserSettings)'>libsbml.parseL3FormulaWithSettings(String
* formula, {@link L3ParserSettings} settings)</a></code>.
* When a {@link Model} object is provided, identifiers (values of type <code>SId</code>) from
* that model are used in preference to pre-defined MathML definitions. More
* precisely, the {@link Model} entities whose identifiers will shadow identical
* symbols in the mathematical formula are: {@link Species}, {@link Compartment}, {@link Parameter},
* {@link Reaction}, and {@link SpeciesReference}. For instance, if the parser is given a
* {@link Model} containing a {@link Species} with the identifier
* "<code>pi</code>", and the formula to be parsed is
* "<code>3*pi</code>", the MathML produced will contain the
* construct <code><ci> pi </ci></code> instead of the construct
* <code><pi/></code>. <li> Similarly, when a {@link Model} object is
* provided, <code>SId</code> values of user-defined functions present in the model
* will be used preferentially over pre-defined MathML functions. For
* example, if the passed-in {@link Model} contains a {@link FunctionDefinition} with the
* identifier "<code>sin</code>", that function will be used
* instead of the predefined MathML function <code><sin/></code>.
* </ul>
* These configuration settings cannot be changed using the basic parser and
* formatter functions, but can be changed on a per-call basis by using the
* alternative functions <code><a
* href='libsbml.html#parseL3FormulaWithSettings(java.lang.String,
* org.sbml.libsbml.L3ParserSettings)'>libsbml.parseL3FormulaWithSettings(String
* formula, {@link L3ParserSettings} settings)</a></code> and <code><a
* href='libsbml.html#formulaToL3StringWithSettings(const ASTNode_t tree,
* org.sbml.libsbml.L3ParserSettings)'>libsbml.parseL3FormulaWithSettings(ASTNode tree
* {@link L3ParserSettings} settings)</a></code>.
*
* </ul> <p>
* The parser function <code><a
* href='libsbml.html#parseL3FormulaWithSettings(java.lang.String,
* org.sbml.libsbml.L3ParserSettings)'>libsbml.parseL3FormulaWithSettings(String
* formula, {@link L3ParserSettings} settings)</a></code>
* returns the root node of the AST corresponding to the
* formula given as the argument. If the formula contains a syntax error,
* the function will return <code>null</code> instead. When <code>null</code> is returned, an
* error is set; information about the error can be retrieved using
* <code><a href='libsbml.html#getLastParseL3Error()'>libsbml.getLastParseL3Error()</a></code>.
<p>
* Note that this facility and the SBML Level 1-based <code><a
* href='libsbml.html#parseFormula(java.lang.String)'>libsbml.parseFormula(String
* formula)</a></code> are provided as a convenience by
* libSBML—the MathML standard does not actually define a 'string-form'
* equivalent to MathML expressions, so the choice of formula syntax is
* arbitrary. The approach taken by libSBML is to start with the syntax
* defined by SBML Level 1 (which in fact used a text-string
* representation of formulas, and not MathML), and expand it to include the
* above functionality. This formula syntax is based mostly on C programming
* syntax, and may contain operators, function calls, symbols, and white
* space characters. The following table provides the precedence rules for
* the different entities that may appear in formula strings.
<p>
* <table border="0" class="centered text-table width80 normal-font alt-row-colors" style="padding-bottom: 0.5em">
<tr style="background: lightgray; font-size: 14px;">
<th align="left">Token</th>
<th align="left">Operation</th>
<th align="left">Class</th>
<th>Precedence</th>
<th align="left">Associates</th>
</tr>
<tr><td><em>name</em></td><td>symbol reference</td><td>operand</td><td align="center">8</td><td>n/a</td></tr>
<tr><td><code>(</code><em>expression</em><code>)</code></td><td>expression grouping</td><td>operand</td><td align="center">8</td><td>n/a</td></tr>
<tr><td><code>f(</code><em>...</em><code>)</code></td><td>function call</td><td>prefix</td><td align="center">8</td><td>left</td></tr>
<tr><td><code>^</code></td><td>power</td><td>binary</td><td align="center">7</td><td>left</td></tr>
<tr><td><code>-, !</code></td><td>negation and boolean 'not'</td><td>unary</td><td align="center">6</td><td>right</td></tr>
<tr><td><code>*, /, %</code></td><td>multiplication, division, and modulo</td><td>binary</td><td align="center">5</td><td>left</td></tr>
<tr><td><code>+, -</code></td><td>addition and subtraction</td><td>binary</td><td align="center">4</td><td>left</td></tr>
<tr><td><code>==, <, >, <=, >=, !=</code></td><td>boolean equality, inequality, and comparison</td><td>binary</td><td align="center">3</td><td>left</td></tr>
<tr><td><code>&&, ||</code></td><td>boolean 'and' and 'or'</td><td>binary</td><td align="center">2</td><td>left</td></tr>
<tr><td><code>,</code></td><td>argument delimiter</td><td>binary</td><td align="center">1</td><td>left</td></tr>
<caption class="top-caption">A table of the expression operators and their precedence in the
text-string format for mathematical expressions used by SBML_parseL3Formula().
</caption>
</table>
<p>
* In the table above, <em>operand</em> implies the construct is an operand,
* <em>prefix</em> implies the operation is applied to the following arguments,
* <em>unary</em> implies there is one argument, and <em>binary</em> implies there are
* two arguments. The values in the <b>Precedence</b> column show how the
* order of different types of operation are determined. For example, the
* expression <code>a + b * c</code> is evaluated as <code>a + (b * c)</code>
* because the @c * operator has higher precedence. The
* <b>Associates</b> column shows how the order of similar precedence
* operations is determined; for example, <code>a && b || c</code> is
* evaluated as <code>(a && b) || c</code> because the <code>&&</code> and <code>||</code>
* operators are left-associative and have the same precedence.
<p>
* The function call syntax consists of a function name, followed by optional
* white space, followed by an opening parenthesis token, followed by a
* sequence of zero or more arguments separated by commas (with each comma
* optionally preceded and/or followed by zero or more white space
* characters), followed by a closing parenthesis token. The function name
* must be chosen from one of the pre-defined functions in SBML or a
* user-defined function in the model. The following table lists the names
* of certain common mathematical functions; this table corresponds to
* Table 6 in the <a target='_blank'
* href='http://sbml.org/Documents/Specifications#SBML_Level_1_Version_2'>SBML
* Level 1 Version 2 specification</a> with additions based on the
* functions added in SBML Level 2 and Level 3:
<p>
* <table border="0" class="centered text-table width80 normal-font alt-row-colors">
<tr>
<th align="left" width="100">Name</th>
<th align="left" width="100">Argument(s)</th>
<th align="left">Formula or meaning</th>
<th align="left" width="110">Argument Constraints</th>
<th align="left" width="100">Result constraints</th>
</tr>
<tr><td><code>abs</code></td>
<td><em>x</em></td>
<td>Absolute value of <em>x</em>.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>acos</code>, <code>arccos</code></td>
<td><em>x</em></td>
<td>Arccosine of <em>x</em> in radians.</td>
<td>-1.0 ≤ <em>x</em> ≤ 1.0</td>
<td>0 ≤ <em>acos(x)</em> ≤ π</td>
</tr>
<tr><td><code>acosh</code>, <code>arccosh</code></td>
<td><em>x</em></td>
<td>Hyperbolic arccosine of <em>x</em> in radians.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>acot</code>, <code>arccot</code></td>
<td><em>x</em></td>
<td>Arccotangent of <em>x</em> in radians.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>acoth</code>, <code>arccoth</code></td>
<td><em>x</em></td>
<td>Hyperbolic arccotangent of <em>x</em> in radians.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>acsc</code>, <code>arccsc</code></td>
<td><em>x</em></td>
<td>Arccosecant of <em>x</em> in radians.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>acsch</code>, <code>arccsch</code></td>
<td><em>x</em></td>
<td>Hyperbolic arccosecant of <em>x</em> in radians.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>asec</code>, <code>arcsec</code></td>
<td><em>x</em></td>
<td>Arcsecant of <em>x</em> in radians.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>asech</code>, <code>arcsech</code></td>
<td><em>x</em></td>
<td>Hyperbolic arcsecant of <em>x</em> in radians.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>asin</code>, <code>arcsin</code></td>
<td><em>x</em></td><td>Arcsine of <em>x</em> in radians.</td>
<td>-1.0 ≤ <em>x</em> ≤ 1.0</td>
<td>0 ≤ <em>asin(x)</em> ≤ π</td>
</tr>
<tr><td><code>atan</code>, <code>arctan</code></td>
<td><em>x</em></td>
<td>Arctangent of <em>x</em> in radians.</td>
<td></td>
<td>0 ≤ <em>atan(x)</em> ≤ π</td>
</tr>
<tr><td><code>atanh</code>, <code>arctanh</code></td>
<td><em>x</em></td>
<td>Hyperbolic arctangent of <em>x</em> in radians.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>ceil</code>, <code>ceiling</code></td>
<td><em>x</em></td>
<td>Smallest number not less than <em>x</em> whose value is an exact integer.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>cos</code></td>
<td><em>x</em></td>
<td>Cosine of <em>x</em></td>
<td></td>
<td></td>
</tr>
<tr><td><code>cosh</code></td>
<td><em>x</em></td>
<td>Hyperbolic cosine of <em>x</em>.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>cot</code></td>
<td><em>x</em></td>
<td>Cotangent of <em>x</em>.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>coth</code></td>
<td><em>x</em></td>
<td>Hyperbolic cotangent of <em>x</em>.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>csc</code></td>
<td><em>x</em></td>
<td>Cosecant of <em>x</em>.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>csch</code></td>
<td><em>x</em></td>
<td>Hyperbolic cosecant of <em>x</em>.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>delay</code></td>
<td><em>x, y</em></td>
<td>The value of <em>x</em> at <em>y</em> time units in the past.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>factorial</code></td>
<td><em>n</em></td>
<td>The factorial of <em>n</em>. Factorials are defined by n! = n*(n-1)* ... * 1.</td>
<td><em>n</em> must be an integer.</td>
<td></td>
</tr>
<tr><td><code>exp</code></td>
<td><em>x</em></td>
<td><em>e</em><sup><em> x</em></sup>, where <em>e</em> is the base of the natural logarithm.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>floor</code></td>
<td><em>x</em></td>
<td>The largest number not greater than <em>x</em> whose value is an exact integer.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>ln</code></td>
<td><em>x</em></td>
<td>Natural logarithm of <em>x</em>.</td>
<td><em>x</em> > 0</td>
<td></td>
</tr>
<tr><td><code>log</code></td>
<td><em>x</em></td>
<td>By default, the base 10 logarithm of <em>x</em>, but can be set to be the natural logarithm of <em>x</em>, or to be an illegal construct.</td>
<td><em>x</em> > 0</td>
<td></td>
</tr>
<tr><td><code>log</code></td>
<td><em>x, y</em></td>
<td>The base <em>x</em> logarithm of <em>y</em>.</td>
<td><em>y</em> > 0</td>
<td></td>
</tr>
<tr><td><code>log10</code></td>
<td><em>x</em></td>
<td>Base 10 logarithm of <em>x</em>.</td>
<td><em>x</em> > 0</td>
<td></td>
</tr>
<tr><td><code>piecewise</code></td>
<td><em>x1, y1, [x2, y2,] [...] [z]</em></td>
<td>A piecewise function: if (<em>y1</em>), <em>x1</em>. Otherwise, if (<em>y2</em>), <em>x2</em>, etc. Otherwise, z. </td>
<td><em>y1, y2, y3 [etc]</em> must be boolean</td>
<td></td>
</tr>
<tr><td><code>pow</code>, <code>power</code> </td>
<td><em>x, y</em></td>
<td><em>x</em><sup><em> y</em></sup>.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>root</code></td>
<td><em>b, x</em></td>
<td>The root base <em>b</em> of <em>x</em>.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>sec</code></td>
<td><em>x</em></td>
<td>Secant of <em>x</em>.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>sech</code></td>
<td><em>x</em></td>
<td>Hyperbolic secant of <em>x</em>.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>sqr</code></td>
<td><em>x</em></td>
<td><em>x</em><sup><em>2</em></sup>.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>sqrt</code></td>
<td><em>x</em></td>
<td>√<em>x</em>.</td>
<td><em>x</em> > 0</td>
<td><em>sqrt(x)</em> ≥ 0</td>
</tr>
<tr><td><code>sin</code></td>
<td><em>x</em></td>
<td>Sine of <em>x</em>.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>sinh</code></td>
<td><em>x</em></td>
<td>Hyperbolic sine of <em>x</em>.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>tan</code></td>
<td><em>x</em></td>
<td>Tangent of <em>x</em>.</td>
<td>x ≠ n*π/2, for odd integer <em>n</em></td>
<td></td>
</tr>
<tr><td><code>tanh</code></td>
<td><em>x</em></td>
<td>Hyperbolic tangent of <em>x</em>.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>and</code></td>
<td><em>x, y, z...</em></td>
<td>Boolean and(<em>x, y, z...</em>): returns true if all of its arguments are true. Note that 'and' is an n-ary function, taking 0 or more arguments, and that and() returns 'true'.</td>
<td>All arguments must be boolean</td>
<td></td>
</tr>
<tr><td><code>not</code></td>
<td><em>x</em></td>
<td>Boolean not(<em>x</em>)</td>
<td><em>x</em> must be boolean</td>
<td></td>
</tr>
<tr><td><code>or</code></td>
<td><em>x, y, z...</em></td>
<td>Boolean or(<em>x, y, z...</em>): returns true if at least one of its arguments is true. Note that 'or' is an n-ary function, taking 0 or more arguments, and that or() returns 'false'.</td>
<td>All arguments must be boolean</td>
<td></td>
</tr>
<tr><td><code>xor</code></td>
<td><em>x, y, z...</em></td>
<td>Boolean xor(<em>x, y, z...</em>): returns true if an odd number of its arguments is true. Note that 'xor' is an n-ary function, taking 0 or more arguments, and that xor() returns 'false'.</td>
<td>All arguments must be boolean</td>
<td></td>
</tr>
<tr><td><code>eq</code></td>
<td><em>x, y, z...</em></td>
<td>Boolean eq(<em>x, y, z...</em>): returns true if all arguments are equal. Note that 'eq' is an n-ary function, but must take 2 or more arguments.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>geq</code></td>
<td><em>x, y, z...</em></td>
<td>Boolean geq(<em>x, y, z...</em>): returns true if each argument is greater than or equal to the argument following it. Note that 'geq' is an n-ary function, but must take 2 or more arguments.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>gt</code></td>
<td><em>x, y, z...</em></td>
<td>Boolean gt(<em>x, y, z...</em>): returns true if each argument is greater than the argument following it. Note that 'gt' is an n-ary function, but must take 2 or more arguments.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>leq</code></td>
<td><em>x, y, z...</em></td>
<td>Boolean leq(<em>x, y, z...</em>): returns true if each argument is less than or equal to the argument following it. Note that 'leq' is an n-ary function, but must take 2 or more arguments.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>lt</code></td>
<td><em>x, y, z...</em></td>
<td>Boolean lt(<em>x, y, z...</em>): returns true if each argument is less than the argument following it. Note that 'lt' is an n-ary function, but must take 2 or more arguments.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>neq</code></td>
<td><em>x, y</em></td>
<td>Boolean <em>x</em> != <em>y</em>: returns true unless x and y are equal.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>plus</code></td>
<td><em>x, y, z...</em></td>
<td><em>x</em> + <em>y</em> + <em>z</em> + <em>...</em>: The sum of the arguments of the function. Note that 'plus' is an n-ary function taking 0 or more arguments, and that 'plus()' returns 0.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>times</code></td>
<td><em>x, y, z...</em></td>
<td><em>x</em> * <em>y</em> * <em>z</em> * <em>...</em>: The product of the arguments of the function. Note that 'times' is an n-ary function taking 0 or more arguments, and that 'times()' returns 1.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>minus</code></td>
<td><em>x, y</em></td>
<td><em>x</em> - <em>y</em>.</td>
<td></td>
<td></td>
</tr>
<tr><td><code>divide</code></td>
<td><em>x, y</em></td>
<td><em>x</em> / <em>y</em>.</td>
<td></td>
<td></td>
</tr>
<caption class="top-caption">The names of mathematical functions defined
in the text-string formula syntax understood by SBML_parseL3Formula() and
related functions.</caption>
</table>
<p>
* Note that the manner in which the 'L3' versions of the formula parser and
* formatter interpret the function "<code>log</code>" can be
* changed. To do so, callers should use the function <code><a
* href='libsbml.html#parseL3FormulaWithSettings(java.lang.String,
* org.sbml.libsbml.L3ParserSettings)'>libsbml.parseL3FormulaWithSettings(String
* formula, {@link L3ParserSettings} settings)</a></code>
* and pass it an appropriate {@link L3ParserSettings} object. By default,
* unlike the SBML Level 1 parser implemented by <code><a
* href='libsbml.html#parseFormula(java.lang.String)'>libsbml.parseFormula(String
* formula)</a></code>, the string "<code>log</code>" is
* interpreted as the base 10 logarithm, and <em>not</em> as the natural
* logarithm. However, you can change the interpretation to be base-10 log,
* natural log, or as an error; since the name 'log' by itself is ambiguous,
* you require that the parser uses <code>log10</code> or <code>ln</code> instead, which are more
* clear. Please refer to <code><a
* href='libsbml.html#parseL3FormulaWithSettings(java.lang.String,
* org.sbml.libsbml.L3ParserSettings)'>libsbml.parseL3FormulaWithSettings(String
* formula, {@link L3ParserSettings} settings)</a></code>.
<p>
* In addition, the following symbols will be translated to their MathML
* equivalents, if no symbol with the same <code>SId</code> identifier string exists
* in the {@link Model} object provided:
<p>
* <table border="0" class="centered text-table width80 normal-font alt-row-colors">
<tr>
<th align="left" width="60">Name</th>
<th align="left" width="200">Meaning</th>
<th align="left">MathML</th>
</tr>
<tr><td><code>true</code></td>
<td>The boolean value <code>true</code></td>
<td><code><true/></code></td>
</tr>
<tr><td><code>false</code></td>
<td>The boolean value <code>false</code></td>
<td><code><false/></code></td>
</tr>
<tr><td><code>pi</code></td>
<td>The mathematical constant pi</td>
<td><code><pi/></code></td>
</tr>
<tr><td><code>avogadro</code></td>
<td>The numerical value of Avogadro's constant, as defined in the SBML specification</td>
<td><code><csymbol encoding="text" definitionURL="http://www.sbml.org/sbml/symbols/avogadro"> avogadro </csymbol/></code></td>
</tr>
<tr><td><code>time</code></td>
<td>Simulation time as defined in SBML</td>
<td><code><csymbol encoding="text" definitionURL="http://www.sbml.org/sbml/symbols/time"> time </csymbol/></code></td>
</tr>
<tr><td><code>inf</code> or <code>infinity</code></td>
<td>The mathematical constant "infinity"</td>
<td><code><infinity/></code></td>
</tr>
<tr><td><code>nan</code> or <code>notanumber</code></td>
<td>The mathematical concept "not a number"</td>
<td><code><notanumber/></code></td>
</tr>
<caption class="top-caption">The names of mathematical symbols defined
in the text-string formula syntax understood by
SBML_parseL3Formula() and related functions.
</caption>
</table>
<p>
* Note that whether the string "<code>avogadro</code>" is parsed
* as an AST node of type {@link libsbmlConstants#AST_NAME_AVOGADRO
* AST_NAME_AVOGADRO} or {@link libsbmlConstants#AST_NAME AST_NAME}
* is configurable; use the alternate version of this function, called <code><a
* href='libsbml.html#parseL3FormulaWithSettings(java.lang.String,
* org.sbml.libsbml.L3ParserSettings)'>libsbml.parseL3FormulaWithSettings(String
* formula, {@link L3ParserSettings} settings)</a></code>. This
* functionality is provided because SBML Level 2 models may not use
* {@link libsbmlConstants#AST_NAME_AVOGADRO AST_NAME_AVOGADRO} AST nodes.
<p>
* @param formula the text-string formula expression to be parsed
<p>
* @return the root node of an AST representing the mathematical formula,
* or <code>null</code> if an error occurred while parsing the formula. When <code>null</code>
* is returned, an error is recorded internally; information about the
* error can be retrieved using
* <code><a href='libsbml.html#getLastParseL3Error()'>libsbml.getLastParseL3Error()</a></code>.
<p>
<p>
<p>
<p>
* @see <code><a href='libsbml.html#formulaToString(org.sbml.libsbml.ASTNode tree)'>libsbml.formulaToString(ASTNode tree)</a></code>
* @see <code><a href='libsbml.html#parseL3FormulaWithSettings(java.lang.String, org.sbml.libsbml.L3ParserSettings)'>libsbml.parseL3FormulaWithSettings(String formula, L3ParserSettings settings)</a></code>
* @see <code><a href='libsbml.html#parseL3Formula(java.lang.String)'>libsbml.parseL3Formula(String formula)</a></code>
* @see <code><a href='libsbml.html#parseL3FormulaWithModel(java.lang.String, org.sbml.libsbml.Model)'>parseL3FormulaWithModel(String formula, Model model)</a></code>
* @see <code><a href='libsbml.html#getLastParseL3Error()'>getLastParseL3Error()</a></code>
* @see <code><a href='libsbml.html#getDefaultL3ParserSettings()'>getDefaultL3ParserSettings()</a></code>
*/ public
static ASTNode parseL3Formula(String formula) {
long cPtr = libsbmlJNI.parseL3Formula(formula);
return (cPtr == 0) ? null : new ASTNode(cPtr, true);
}
/**
* Parses the given mathematical formula using specific a specific {@link Model} to
* resolve symbols, and returns an Abstract Syntax Tree (AST)
* representation of the result.
<p>
* This is identical to
* <code><a href='libsbml.html#parseL3Formula(java.lang.String)'>libsbml.parseL3Formula(String formula)</a></code>,
* except that this function uses the given model in the argument <code>model</code>
* to check against identifiers that appear in the <code>formula</code>.
<p>
* For more details about the parser, please see the definition of
* the function <code><a href='libsbml.html#parseL3Formula(java.lang.String)'>libsbml.parseL3Formula(String formula)</a></code>.
<p>
* @param formula the mathematical formula expression to be parsed
<p>
* @param model the {@link Model} object to use for checking identifiers
<p>
* @return the root node of an AST representing the mathematical formula,
* or <code>null</code> if an error occurred while parsing the formula. When <code>null</code>
* is returned, an error is recorded internally; information about the
* error can be retrieved using
* <code><a href='libsbml.html#getLastParseL3Error()'>libsbml.getLastParseL3Error()</a></code>.
<p>
<p>
<p>
<p>
* @see <code><a href='libsbml.html#formulaToString(org.sbml.libsbml.ASTNode tree)'>libsbml.formulaToString(ASTNode tree)</a></code>
* @see <code><a href='libsbml.html#parseL3FormulaWithSettings(java.lang.String, org.sbml.libsbml.L3ParserSettings)'>libsbml.parseL3FormulaWithSettings(String formula, L3ParserSettings settings)</a></code>
* @see <code><a href='libsbml.html#parseL3Formula(java.lang.String)'>libsbml.parseL3Formula(String formula)</a></code>
* @see <code><a href='libsbml.html#getLastParseL3Error()'>getLastParseL3Error()</a></code>
* @see <code><a href='libsbml.html#getDefaultL3ParserSettings()'>getDefaultL3ParserSettings()</a></code>
*/ public
static ASTNode parseL3FormulaWithModel(String formula, Model model) {
long cPtr = libsbmlJNI.parseL3FormulaWithModel(formula, Model.getCPtr(model), model);
return (cPtr == 0) ? null : new ASTNode(cPtr, true);
}
/**
* Parses the given mathematical formula using specific parser settings and
* returns an Abstract Syntax Tree (AST) representation of the result.
<p>
* This is identical to
<code><a href='libsbml.html#parseL3Formula(java.lang.String)'>libsbml.parseL3Formula(String formula)</a></code>,
* except that this function uses the parser settings given in the argument
* <code>settings</code>. The settings override the default parsing behavior.
<p>
* The parameter <code>settings</code> allows callers to change the following parsing
* behaviors:
<p>
* <ul>
* <li> Use a specific {@link Model} object against which identifiers to compare
* identifiers. This causes the parser to search the {@link Model} for identifiers
* that the parser encounters in the formula. If a given symbol in the
* formula matches the identifier of a {@link Species}, {@link Compartment}, {@link Parameter},
* {@link Reaction}, {@link SpeciesReference} or {@link FunctionDefinition} in the {@link Model}, then the
* symbol is assumed to refer to that model entity instead of any possible
* mathematical terms with the same symbol. For example, if the parser is
* given a {@link Model} containing a {@link Species} with the identifier
* "<code>pi</code>", and the formula to be parsed is
* "<code>3*pi</code>", the MathML produced will contain the
* construct <code><ci> pi </ci></code> instead of the
* construct <code><pi/></code>.
* <li> Whether to parse "<code>log(x)</code>" with a single
* argument as the base 10
* logarithm of x, the natural logarithm of x, or treat the case as an
* error.
* <li> Whether to parse "<code>number id</code>" by interpreting
* <code>id</code> as the identifier of a unit of measurement associated with the
* number, or whether to treat the case as an error.
* <li> Whether to parse "<code>avogadro</code>" as an {@link ASTNode} of
* type {@link libsbmlConstants#AST_NAME_AVOGADRO AST_NAME_AVOGADRO} or
* as type {@link libsbmlConstants#AST_NAME AST_NAME}.
* <li> Whether to always create explicit ASTNodes of type {@link
* libsbmlConstants#AST_MINUS AST_MINUS} for all unary minuses, or
* collapse and remove minuses where possible.
*
* </ul> <p>
* For more details about the parser, please see the definition of
* {@link L3ParserSettings} and
* <code><a href='libsbml.html#parseL3Formula(java.lang.String)'>libsbml.parseL3Formula(String formula)</a></code>.
<p>
* @param formula the mathematical formula expression to be parsed
<p>
* @param settings the settings to be used for this parser invocation
<p>
* @return the root node of an AST representing the mathematical formula,
* or <code>null</code> if an error occurred while parsing the formula. When <code>null</code>
* is returned, an error is recorded internally; information about the
* error can be retrieved using
* <code><a href='libsbml.html#getLastParseL3Error()'>libsbml.getLastParseL3Error()</a></code>.
<p>
<p>
<p>
<p>
* @see <code><a href='libsbml.html#formulaToString(org.sbml.libsbml.ASTNode tree)'>libsbml.formulaToString(ASTNode tree)</a></code>
* @see <code><a href='libsbml.html#parseL3Formula(java.lang.String)'>libsbml.parseL3Formula(String formula)</a></code>
* @see <code><a href='libsbml.html#parseL3FormulaWithModel(java.lang.String, org.sbml.libsbml.Model)'>parseL3FormulaWithModel(String formula, Model model)</a></code>
* @see <code><a href='libsbml.html#getLastParseL3Error()'>getLastParseL3Error()</a></code>
* @see <code><a href='libsbml.html#getDefaultL3ParserSettings()'>getDefaultL3ParserSettings()</a></code>
*/ public
static ASTNode parseL3FormulaWithSettings(String formula, L3ParserSettings settings) {
long cPtr = libsbmlJNI.parseL3FormulaWithSettings(formula, L3ParserSettings.getCPtr(settings), settings);
return (cPtr == 0) ? null : new ASTNode(cPtr, true);
}
/**
* Returns a copy of the default parser settings used by <code><a href='libsbml.html#parseL3Formula(java.lang.String)'>libsbml.parseL3Formula(String formula)</a></code>.
<p>
* The settings structure allows callers to change the following parsing
* behaviors:
<p>
* <ul>
* <li> Use a specific {@link Model} object against which identifiers to compare
* identifiers. This causes the parser to search the {@link Model} for identifiers
* that the parser encounters in the formula. If a given symbol in the
* formula matches the identifier of a {@link Species}, {@link Compartment}, {@link Parameter},
* {@link Reaction}, {@link SpeciesReference} or {@link FunctionDefinition} in the {@link Model}, then the
* symbol is assumed to refer to that model entity instead of any possible
* mathematical terms with the same symbol. For example, if the parser is
* given a {@link Model} containing a {@link Species} with the identifier
* "<code>pi</code>", and the formula to be parsed is
* "<code>3*pi</code>", the MathML produced will contain the
* construct <code><ci> pi </ci></code> instead of the
* construct <code><pi/></code>.
* <li> Whether to parse "<code>log(x)</code>" with a single
* argument as the base 10
* logarithm of x, the natural logarithm of x, or treat the case as an
* error.
* <li> Whether to parse "<code>number id</code>" by interpreting
* <code>id</code> as the identifier of a unit of measurement associated with the
* number, or whether to treat the case as an error.
* <li> Whether to parse "<code>avogadro</code>" as an {@link ASTNode} of
* type {@link libsbmlConstants#AST_NAME_AVOGADRO AST_NAME_AVOGADRO} or
* as type {@link libsbmlConstants#AST_NAME AST_NAME}.
* <li> Whether to always create explicit ASTNodes of type {@link
* libsbmlConstants#AST_MINUS AST_MINUS} for all unary minuses, or
* collapse and remove minuses where possible.
*
* </ul> <p>
* For more details about the parser, please see the definition of
* {@link L3ParserSettings} and
* <code><a href='libsbml.html#parseL3Formula(java.lang.String)'>libsbml.parseL3Formula(String formula)</a></code>.
<p>
<p>
<p>
<p>
* @see <code><a href='libsbml.html#formulaToString(org.sbml.libsbml.ASTNode tree)'>libsbml.formulaToString(ASTNode tree)</a></code>
* @see <code><a href='libsbml.html#parseL3FormulaWithSettings(java.lang.String, org.sbml.libsbml.L3ParserSettings)'>libsbml.parseL3FormulaWithSettings(String formula, L3ParserSettings settings)</a></code>
* @see <code><a href='libsbml.html#parseL3Formula(java.lang.String)'>libsbml.parseL3Formula(String formula)</a></code>
* @see <code><a href='libsbml.html#parseL3FormulaWithModel(java.lang.String, org.sbml.libsbml.Model)'>parseL3FormulaWithModel(String formula, Model model)</a></code>
* @see <code><a href='libsbml.html#getLastParseL3Error()'>getLastParseL3Error()</a></code>
*/ public
static L3ParserSettings getDefaultL3ParserSettings() {
long cPtr = libsbmlJNI.getDefaultL3ParserSettings();
return (cPtr == 0) ? null : new L3ParserSettings(cPtr, true);
}
/**
* Returns the last error reported by the parser.
<p>
* If <code><a href='libsbml.html#parseL3Formula(java.lang.String)'>libsbml.parseL3Formula(String formula)</a></code>,
* <code><a href='libsbml.html#parseL3FormulaWithSettings(java.lang.String, org.sbml.libsbml.L3ParserSettings)'>libsbml.parseL3FormulaWithSettings(String formula, {@link L3ParserSettings} settings)</a></code>, or
* <code><a href='libsbml.html#parseL3FormulaWithModel(java.lang.String, org.sbml.libsbml.Model)'>libsbml.parseL3FormulaWithModel(String formula, {@link Model} model)</a></code> return <code>null</code>, an error is set internally which is accessible
* via this function.
<p>
* @return a string describing the error that occurred. This will contain
* the string the parser was trying to parse, which character it had parsed
* when it encountered the error, and a description of the error.
<p>
<p>
<p>
<p>
* @see <code><a href='libsbml.html#formulaToString(org.sbml.libsbml.ASTNode tree)'>libsbml.formulaToString(ASTNode tree)</a></code>
* @see <code><a href='libsbml.html#parseL3FormulaWithSettings(java.lang.String, org.sbml.libsbml.L3ParserSettings)'>libsbml.parseL3FormulaWithSettings(String formula, L3ParserSettings settings)</a></code>
* @see <code><a href='libsbml.html#parseL3Formula(java.lang.String)'>libsbml.parseL3Formula(String formula)</a></code>
* @see <code><a href='libsbml.html#parseL3FormulaWithModel(java.lang.String, org.sbml.libsbml.Model)'>parseL3FormulaWithModel(String formula, Model model)</a></code>
* @see <code><a href='libsbml.html#getDefaultL3ParserSettings()'>getDefaultL3ParserSettings()</a></code>
*/ public
static String getLastParseL3Error() {
return libsbmlJNI.getLastParseL3Error();
}
}
|