From 32e28372ba0b39bce87e204a824231fcef88f1e9 Mon Sep 17 00:00:00 2001 From: GitLab Date: Thu, 12 Sep 2024 18:55:32 +0000 Subject: [PATCH] Deploy to GitHub Pages --- ConfigurationOptions.txt | 146 + api/allclasses-index.html | 949 ++ api/allclasses.html | 179 + api/allpackages-index.html | 245 + api/constant-values.html | 241 + api/deprecated-list.html | 192 + api/element-list | 14 + api/help-doc.html | 273 + api/index-all.html | 5167 +++++++ api/index.html | 250 + api/jquery-ui.overrides.css | 35 + api/jquery/external/jquery/jquery.js | 10872 +++++++++++++++ api/jquery/jquery-3.6.1.min.js | 2 + api/jquery/jquery-ui.min.css | 6 + api/jquery/jquery-ui.min.js | 6 + api/jquery/jszip-utils/dist/jszip-utils-ie.js | 56 + .../jszip-utils/dist/jszip-utils-ie.min.js | 10 + api/jquery/jszip-utils/dist/jszip-utils.js | 118 + .../jszip-utils/dist/jszip-utils.min.js | 10 + api/jquery/jszip/dist/jszip.js | 11370 ++++++++++++++++ api/jquery/jszip/dist/jszip.min.js | 13 + api/legal/ASSEMBLY_EXCEPTION | 27 + api/legal/jquery.md | 72 + api/legal/jqueryUI.md | 49 + api/legal/jszip.md | 653 + api/legal/pako.md | 45 + api/member-search-index.js | 1 + api/member-search-index.zip | Bin 0 -> 17640 bytes .../SolverContextFactory.Solvers.html | 485 + .../java_smt/SolverContextFactory.html | 543 + .../sosy_lab/java_smt/api/ArrayFormula.html | 224 + .../java_smt/api/ArrayFormulaManager.html | 460 + ...BasicProverEnvironment.AllSatCallback.html | 288 + .../java_smt/api/BasicProverEnvironment.html | 726 + .../java_smt/api/BitvectorFormula.html | 219 + .../java_smt/api/BitvectorFormulaManager.html | 1162 ++ .../sosy_lab/java_smt/api/BooleanFormula.html | 219 + .../java_smt/api/BooleanFormulaManager.html | 769 ++ .../java_smt/api/EnumerationFormula.html | 219 + .../api/EnumerationFormulaManager.html | 352 + api/org/sosy_lab/java_smt/api/Evaluator.html | 483 + .../java_smt/api/FloatingPointFormula.html | 219 + .../api/FloatingPointFormulaManager.html | 1173 ++ .../java_smt/api/FloatingPointNumber.html | 570 + .../api/FloatingPointRoundingMode.html | 417 + .../api/FloatingPointRoundingModeFormula.html | 220 + api/org/sosy_lab/java_smt/api/Formula.html | 313 + .../sosy_lab/java_smt/api/FormulaManager.html | 966 ++ .../api/FormulaType.ArrayFormulaType.html | 423 + .../api/FormulaType.BitvectorType.html | 410 + .../FormulaType.EnumerationFormulaType.html | 437 + .../api/FormulaType.FloatingPointType.html | 441 + .../java_smt/api/FormulaType.NumeralType.html | 360 + .../sosy_lab/java_smt/api/FormulaType.html | 726 + .../java_smt/api/FunctionDeclaration.html | 315 + .../java_smt/api/FunctionDeclarationKind.html | 2093 +++ .../java_smt/api/IntegerFormulaManager.html | 355 + .../api/InterpolatingProverEnvironment.html | 500 + .../java_smt/api/Model.ValueAssignment.html | 506 + api/org/sosy_lab/java_smt/api/Model.html | 398 + .../api/NumeralFormula.IntegerFormula.html | 239 + .../api/NumeralFormula.RationalFormula.html | 239 + .../sosy_lab/java_smt/api/NumeralFormula.html | 251 + .../java_smt/api/NumeralFormulaManager.html | 622 + ...timizationProverEnvironment.OptStatus.html | 404 + .../api/OptimizationProverEnvironment.html | 459 + .../java_smt/api/PropagatorBackend.html | 404 + .../java_smt/api/ProverEnvironment.html | 264 + .../QuantifiedFormulaManager.Quantifier.html | 381 + .../api/QuantifiedFormulaManager.html | 410 + .../java_smt/api/RationalFormulaManager.html | 272 + .../sosy_lab/java_smt/api/RegexFormula.html | 219 + .../java_smt/api/SLFormulaManager.html | 329 + .../api/SolverContext.ProverOptions.html | 441 + .../sosy_lab/java_smt/api/SolverContext.html | 460 + .../java_smt/api/SolverException.html | 308 + .../sosy_lab/java_smt/api/StringFormula.html | 219 + .../java_smt/api/StringFormulaManager.html | 953 ++ api/org/sosy_lab/java_smt/api/Tactic.html | 430 + api/org/sosy_lab/java_smt/api/UFManager.html | 378 + .../sosy_lab/java_smt/api/UserPropagator.html | 421 + .../java_smt/api/package-summary.html | 500 + .../sosy_lab/java_smt/api/package-tree.html | 267 + .../BooleanFormulaTransformationVisitor.html | 606 + .../api/visitors/BooleanFormulaVisitor.html | 506 + .../DefaultBooleanFormulaVisitor.html | 614 + .../api/visitors/DefaultFormulaVisitor.html | 479 + .../api/visitors/ExpectedFormulaVisitor.html | 335 + .../FormulaTransformationVisitor.html | 462 + .../java_smt/api/visitors/FormulaVisitor.html | 385 + .../TraversalProcess.TraversalType.html | 407 + .../api/visitors/TraversalProcess.html | 421 + .../api/visitors/package-summary.html | 241 + .../java_smt/api/visitors/package-tree.html | 191 + .../AbstractArrayFormulaManager.html | 672 + .../AbstractBitvectorFormulaManager.html | 1970 +++ .../AbstractBooleanFormulaManager.html | 1212 ++ ...actEnumerationFormulaManager.EnumType.html | 330 + .../AbstractEnumerationFormulaManager.html | 617 + .../java_smt/basicimpl/AbstractEvaluator.html | 664 + .../AbstractFloatingPointFormulaManager.html | 2218 +++ .../basicimpl/AbstractFormulaManager.html | 1369 ++ .../java_smt/basicimpl/AbstractModel.html | 398 + ...ralFormulaManager.NonLinearArithmetic.html | 394 + .../AbstractNumeralFormulaManager.html | 1402 ++ .../java_smt/basicimpl/AbstractProver.html | 732 + .../basicimpl/AbstractProverWithAllSat.html | 455 + .../AbstractQuantifiedFormulaManager.html | 509 + .../basicimpl/AbstractSLFormulaManager.html | 572 + .../basicimpl/AbstractSolverContext.html | 538 + .../AbstractStringFormulaManager.html | 1721 +++ .../java_smt/basicimpl/AbstractUFManager.html | 550 + .../basicimpl/AbstractUserPropagator.html | 515 + .../java_smt/basicimpl/CachingModel.html | 645 + .../java_smt/basicimpl/FormulaCreator.html | 1121 ++ .../basicimpl/FunctionDeclarationImpl.html | 365 + .../java_smt/basicimpl/ShutdownHook.html | 337 + .../java_smt/basicimpl/package-summary.html | 290 + .../java_smt/basicimpl/package-tree.html | 203 + .../basicimpl/tactics/NNFVisitor.html | 449 + .../basicimpl/tactics/package-summary.html | 170 + .../basicimpl/tactics/package-tree.html | 166 + .../BasicProverWithAssumptionsWrapper.html | 770 ++ ...rpolatingProverWithAssumptionsWrapper.html | 546 + .../ProverWithAssumptionsWrapper.html | 332 + .../package-summary.html | 182 + .../withAssumptionsWrapper/package-tree.html | 167 + .../DebuggingArrayFormulaManager.html | 524 + .../DebuggingBitvectorFormulaManager.html | 1305 ++ .../DebuggingBooleanFormulaManager.html | 894 ++ .../DebuggingEnumerationFormulaManager.html | 414 + .../DebuggingFloatingPointFormulaManager.html | 1406 ++ .../debugging/DebuggingFormulaManager.html | 1105 ++ .../DebuggingIntegerFormulaManager.html | 422 + ...buggingInterpolatingProverEnvironment.html | 794 ++ .../delegate/debugging/DebuggingModel.html | 616 + .../DebuggingNumeralFormulaManager.html | 765 ++ ...ebuggingOptimizationProverEnvironment.html | 791 ++ .../debugging/DebuggingProverEnvironment.html | 648 + .../DebuggingQuantifiedFormulaManager.html | 382 + .../DebuggingRationalFormulaManager.html | 300 + .../debugging/DebuggingSLFormulaManager.html | 402 + .../debugging/DebuggingSolverContext.html | 538 + .../debugging/DebuggingSolverInformation.html | 324 + .../DebuggingStringFormulaManager.html | 1081 ++ .../debugging/DebuggingUFManager.html | 458 + .../delegate/debugging/package-summary.html | 242 + .../delegate/debugging/package-tree.html | 183 + .../logging/LoggingSolverContext.html | 532 + .../delegate/logging/package-summary.html | 177 + .../delegate/logging/package-tree.html | 162 + .../delegate/statistics/SolverStatistics.html | 643 + .../StatisticsEnumerationFormulaManager.html | 372 + .../statistics/StatisticsSolverContext.html | 546 + .../statistics/TimerPool.TimerWrapper.html | 284 + .../delegate/statistics/TimerPool.html | 398 + .../delegate/statistics/package-summary.html | 193 + .../delegate/statistics/package-tree.html | 166 + ...SynchronizedEnumerationFormulaManager.html | 372 + .../SynchronizedSolverContext.html | 540 + .../delegate/synchronize/package-summary.html | 184 + .../delegate/synchronize/package-tree.html | 163 + .../java_smt/example/AllSatExample.html | 317 + .../example/Binoxxo.BinoxxoSolver.html | 285 + .../Binoxxo.BooleanBasedBinoxxoSolver.html | 285 + .../Binoxxo.IntegerBasedBinoxxoSolver.html | 283 + .../sosy_lab/java_smt/example/Binoxxo.html | 351 + .../java_smt/example/FormulaClassifier.html | 351 + .../sosy_lab/java_smt/example/HoudiniApp.html | 356 + .../java_smt/example/Interpolation.html | 275 + .../sosy_lab/java_smt/example/NQueens.html | 284 + .../example/OptimizationFormulaWeights.html | 277 + .../java_smt/example/OptimizationIntReal.html | 276 + .../java_smt/example/PrettyPrinter.html | 277 + .../example/SimpleUserPropagator.html | 275 + .../SolverOverviewTable.RowBuilder.html | 338 + .../SolverOverviewTable.SolverInfo.html | 312 + .../java_smt/example/SolverOverviewTable.html | 374 + .../Sudoku.BooleanBasedSudokuSolver.html | 283 + .../Sudoku.EnumerationBasedSudokuSolver.html | 283 + .../Sudoku.IntegerBasedSudokuSolver.html | 283 + .../java_smt/example/Sudoku.SudokuSolver.html | 285 + api/org/sosy_lab/java_smt/example/Sudoku.html | 408 + .../nqueens_user_propagator/NQueens.html | 326 + .../NQueensConstraintPropagator.html | 375 + .../NQueensEnumeratingPropagator.html | 561 + .../package-summary.html | 186 + .../nqueens_user_propagator/package-tree.html | 171 + .../java_smt/example/package-summary.html | 283 + .../java_smt/example/package-tree.html | 188 + .../sosy_lab/java_smt/package-summary.html | 198 + api/org/sosy_lab/java_smt/package-tree.html | 176 + .../java_smt/test/BooleanFormulaSubject.html | 470 + .../test/ProverEnvironmentSubject.html | 372 + ...edTest0.ParameterizedSolverBasedTest0.html | 414 + .../java_smt/test/SolverBasedTest0.html | 1065 ++ .../java_smt/test/SolverStackTest0.html | 1003 ++ .../java_smt/test/package-summary.html | 198 + .../sosy_lab/java_smt/test/package-tree.html | 176 + .../utils/PrettyPrinter.PrinterOption.html | 371 + .../java_smt/utils/PrettyPrinter.html | 366 + .../sosy_lab/java_smt/utils/SolverUtils.html | 298 + .../java_smt/utils/UfElimination.Result.html | 323 + .../java_smt/utils/UfElimination.html | 326 + .../java_smt/utils/package-summary.html | 207 + .../sosy_lab/java_smt/utils/package-tree.html | 179 + api/overview-summary.html | 23 + api/overview-tree.html | 419 + api/package-search-index.js | 1 + api/package-search-index.zip | Bin 0 -> 359 bytes api/resources/glass.png | Bin 0 -> 499 bytes api/resources/x.png | Bin 0 -> 394 bytes api/script.js | 149 + api/search.js | 326 + api/serialized-form.html | 166 + api/stylesheet.css | 910 ++ api/type-search-index.js | 1 + api/type-search-index.zip | Bin 0 -> 1406 bytes index.html | 21 + 219 files changed, 119122 insertions(+) create mode 100644 ConfigurationOptions.txt create mode 100644 api/allclasses-index.html create mode 100644 api/allclasses.html create mode 100644 api/allpackages-index.html create mode 100644 api/constant-values.html create mode 100644 api/deprecated-list.html create mode 100644 api/element-list create mode 100644 api/help-doc.html create mode 100644 api/index-all.html create mode 100644 api/index.html create mode 100644 api/jquery-ui.overrides.css create mode 100644 api/jquery/external/jquery/jquery.js create mode 100644 api/jquery/jquery-3.6.1.min.js create mode 100644 api/jquery/jquery-ui.min.css create mode 100644 api/jquery/jquery-ui.min.js create mode 100644 api/jquery/jszip-utils/dist/jszip-utils-ie.js create mode 100644 api/jquery/jszip-utils/dist/jszip-utils-ie.min.js create mode 100644 api/jquery/jszip-utils/dist/jszip-utils.js create mode 100644 api/jquery/jszip-utils/dist/jszip-utils.min.js create mode 100644 api/jquery/jszip/dist/jszip.js create mode 100644 api/jquery/jszip/dist/jszip.min.js create mode 100644 api/legal/ASSEMBLY_EXCEPTION create mode 100644 api/legal/jquery.md create mode 100644 api/legal/jqueryUI.md create mode 100644 api/legal/jszip.md create mode 100644 api/legal/pako.md create mode 100644 api/member-search-index.js create mode 100644 api/member-search-index.zip create mode 100644 api/org/sosy_lab/java_smt/SolverContextFactory.Solvers.html create mode 100644 api/org/sosy_lab/java_smt/SolverContextFactory.html create mode 100644 api/org/sosy_lab/java_smt/api/ArrayFormula.html create mode 100644 api/org/sosy_lab/java_smt/api/ArrayFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/api/BasicProverEnvironment.AllSatCallback.html create mode 100644 api/org/sosy_lab/java_smt/api/BasicProverEnvironment.html create mode 100644 api/org/sosy_lab/java_smt/api/BitvectorFormula.html create mode 100644 api/org/sosy_lab/java_smt/api/BitvectorFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/api/BooleanFormula.html create mode 100644 api/org/sosy_lab/java_smt/api/BooleanFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/api/EnumerationFormula.html create mode 100644 api/org/sosy_lab/java_smt/api/EnumerationFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/api/Evaluator.html create mode 100644 api/org/sosy_lab/java_smt/api/FloatingPointFormula.html create mode 100644 api/org/sosy_lab/java_smt/api/FloatingPointFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/api/FloatingPointNumber.html create mode 100644 api/org/sosy_lab/java_smt/api/FloatingPointRoundingMode.html create mode 100644 api/org/sosy_lab/java_smt/api/FloatingPointRoundingModeFormula.html create mode 100644 api/org/sosy_lab/java_smt/api/Formula.html create mode 100644 api/org/sosy_lab/java_smt/api/FormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/api/FormulaType.ArrayFormulaType.html create mode 100644 api/org/sosy_lab/java_smt/api/FormulaType.BitvectorType.html create mode 100644 api/org/sosy_lab/java_smt/api/FormulaType.EnumerationFormulaType.html create mode 100644 api/org/sosy_lab/java_smt/api/FormulaType.FloatingPointType.html create mode 100644 api/org/sosy_lab/java_smt/api/FormulaType.NumeralType.html create mode 100644 api/org/sosy_lab/java_smt/api/FormulaType.html create mode 100644 api/org/sosy_lab/java_smt/api/FunctionDeclaration.html create mode 100644 api/org/sosy_lab/java_smt/api/FunctionDeclarationKind.html create mode 100644 api/org/sosy_lab/java_smt/api/IntegerFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/api/InterpolatingProverEnvironment.html create mode 100644 api/org/sosy_lab/java_smt/api/Model.ValueAssignment.html create mode 100644 api/org/sosy_lab/java_smt/api/Model.html create mode 100644 api/org/sosy_lab/java_smt/api/NumeralFormula.IntegerFormula.html create mode 100644 api/org/sosy_lab/java_smt/api/NumeralFormula.RationalFormula.html create mode 100644 api/org/sosy_lab/java_smt/api/NumeralFormula.html create mode 100644 api/org/sosy_lab/java_smt/api/NumeralFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/api/OptimizationProverEnvironment.OptStatus.html create mode 100644 api/org/sosy_lab/java_smt/api/OptimizationProverEnvironment.html create mode 100644 api/org/sosy_lab/java_smt/api/PropagatorBackend.html create mode 100644 api/org/sosy_lab/java_smt/api/ProverEnvironment.html create mode 100644 api/org/sosy_lab/java_smt/api/QuantifiedFormulaManager.Quantifier.html create mode 100644 api/org/sosy_lab/java_smt/api/QuantifiedFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/api/RationalFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/api/RegexFormula.html create mode 100644 api/org/sosy_lab/java_smt/api/SLFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/api/SolverContext.ProverOptions.html create mode 100644 api/org/sosy_lab/java_smt/api/SolverContext.html create mode 100644 api/org/sosy_lab/java_smt/api/SolverException.html create mode 100644 api/org/sosy_lab/java_smt/api/StringFormula.html create mode 100644 api/org/sosy_lab/java_smt/api/StringFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/api/Tactic.html create mode 100644 api/org/sosy_lab/java_smt/api/UFManager.html create mode 100644 api/org/sosy_lab/java_smt/api/UserPropagator.html create mode 100644 api/org/sosy_lab/java_smt/api/package-summary.html create mode 100644 api/org/sosy_lab/java_smt/api/package-tree.html create mode 100644 api/org/sosy_lab/java_smt/api/visitors/BooleanFormulaTransformationVisitor.html create mode 100644 api/org/sosy_lab/java_smt/api/visitors/BooleanFormulaVisitor.html create mode 100644 api/org/sosy_lab/java_smt/api/visitors/DefaultBooleanFormulaVisitor.html create mode 100644 api/org/sosy_lab/java_smt/api/visitors/DefaultFormulaVisitor.html create mode 100644 api/org/sosy_lab/java_smt/api/visitors/ExpectedFormulaVisitor.html create mode 100644 api/org/sosy_lab/java_smt/api/visitors/FormulaTransformationVisitor.html create mode 100644 api/org/sosy_lab/java_smt/api/visitors/FormulaVisitor.html create mode 100644 api/org/sosy_lab/java_smt/api/visitors/TraversalProcess.TraversalType.html create mode 100644 api/org/sosy_lab/java_smt/api/visitors/TraversalProcess.html create mode 100644 api/org/sosy_lab/java_smt/api/visitors/package-summary.html create mode 100644 api/org/sosy_lab/java_smt/api/visitors/package-tree.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/AbstractArrayFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/AbstractBitvectorFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/AbstractBooleanFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/AbstractEnumerationFormulaManager.EnumType.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/AbstractEnumerationFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/AbstractEvaluator.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/AbstractFloatingPointFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/AbstractFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/AbstractModel.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/AbstractNumeralFormulaManager.NonLinearArithmetic.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/AbstractNumeralFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/AbstractProver.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/AbstractProverWithAllSat.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/AbstractQuantifiedFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/AbstractSLFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/AbstractSolverContext.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/AbstractStringFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/AbstractUFManager.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/AbstractUserPropagator.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/CachingModel.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/FormulaCreator.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/FunctionDeclarationImpl.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/ShutdownHook.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/package-summary.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/package-tree.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/tactics/NNFVisitor.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/tactics/package-summary.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/tactics/package-tree.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/withAssumptionsWrapper/BasicProverWithAssumptionsWrapper.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/withAssumptionsWrapper/InterpolatingProverWithAssumptionsWrapper.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/withAssumptionsWrapper/ProverWithAssumptionsWrapper.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/withAssumptionsWrapper/package-summary.html create mode 100644 api/org/sosy_lab/java_smt/basicimpl/withAssumptionsWrapper/package-tree.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/DebuggingArrayFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/DebuggingBitvectorFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/DebuggingBooleanFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/DebuggingEnumerationFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/DebuggingFloatingPointFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/DebuggingFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/DebuggingIntegerFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/DebuggingInterpolatingProverEnvironment.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/DebuggingModel.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/DebuggingNumeralFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/DebuggingOptimizationProverEnvironment.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/DebuggingProverEnvironment.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/DebuggingQuantifiedFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/DebuggingRationalFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/DebuggingSLFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/DebuggingSolverContext.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/DebuggingSolverInformation.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/DebuggingStringFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/DebuggingUFManager.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/package-summary.html create mode 100644 api/org/sosy_lab/java_smt/delegate/debugging/package-tree.html create mode 100644 api/org/sosy_lab/java_smt/delegate/logging/LoggingSolverContext.html create mode 100644 api/org/sosy_lab/java_smt/delegate/logging/package-summary.html create mode 100644 api/org/sosy_lab/java_smt/delegate/logging/package-tree.html create mode 100644 api/org/sosy_lab/java_smt/delegate/statistics/SolverStatistics.html create mode 100644 api/org/sosy_lab/java_smt/delegate/statistics/StatisticsEnumerationFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/delegate/statistics/StatisticsSolverContext.html create mode 100644 api/org/sosy_lab/java_smt/delegate/statistics/TimerPool.TimerWrapper.html create mode 100644 api/org/sosy_lab/java_smt/delegate/statistics/TimerPool.html create mode 100644 api/org/sosy_lab/java_smt/delegate/statistics/package-summary.html create mode 100644 api/org/sosy_lab/java_smt/delegate/statistics/package-tree.html create mode 100644 api/org/sosy_lab/java_smt/delegate/synchronize/SynchronizedEnumerationFormulaManager.html create mode 100644 api/org/sosy_lab/java_smt/delegate/synchronize/SynchronizedSolverContext.html create mode 100644 api/org/sosy_lab/java_smt/delegate/synchronize/package-summary.html create mode 100644 api/org/sosy_lab/java_smt/delegate/synchronize/package-tree.html create mode 100644 api/org/sosy_lab/java_smt/example/AllSatExample.html create mode 100644 api/org/sosy_lab/java_smt/example/Binoxxo.BinoxxoSolver.html create mode 100644 api/org/sosy_lab/java_smt/example/Binoxxo.BooleanBasedBinoxxoSolver.html create mode 100644 api/org/sosy_lab/java_smt/example/Binoxxo.IntegerBasedBinoxxoSolver.html create mode 100644 api/org/sosy_lab/java_smt/example/Binoxxo.html create mode 100644 api/org/sosy_lab/java_smt/example/FormulaClassifier.html create mode 100644 api/org/sosy_lab/java_smt/example/HoudiniApp.html create mode 100644 api/org/sosy_lab/java_smt/example/Interpolation.html create mode 100644 api/org/sosy_lab/java_smt/example/NQueens.html create mode 100644 api/org/sosy_lab/java_smt/example/OptimizationFormulaWeights.html create mode 100644 api/org/sosy_lab/java_smt/example/OptimizationIntReal.html create mode 100644 api/org/sosy_lab/java_smt/example/PrettyPrinter.html create mode 100644 api/org/sosy_lab/java_smt/example/SimpleUserPropagator.html create mode 100644 api/org/sosy_lab/java_smt/example/SolverOverviewTable.RowBuilder.html create mode 100644 api/org/sosy_lab/java_smt/example/SolverOverviewTable.SolverInfo.html create mode 100644 api/org/sosy_lab/java_smt/example/SolverOverviewTable.html create mode 100644 api/org/sosy_lab/java_smt/example/Sudoku.BooleanBasedSudokuSolver.html create mode 100644 api/org/sosy_lab/java_smt/example/Sudoku.EnumerationBasedSudokuSolver.html create mode 100644 api/org/sosy_lab/java_smt/example/Sudoku.IntegerBasedSudokuSolver.html create mode 100644 api/org/sosy_lab/java_smt/example/Sudoku.SudokuSolver.html create mode 100644 api/org/sosy_lab/java_smt/example/Sudoku.html create mode 100644 api/org/sosy_lab/java_smt/example/nqueens_user_propagator/NQueens.html create mode 100644 api/org/sosy_lab/java_smt/example/nqueens_user_propagator/NQueensConstraintPropagator.html create mode 100644 api/org/sosy_lab/java_smt/example/nqueens_user_propagator/NQueensEnumeratingPropagator.html create mode 100644 api/org/sosy_lab/java_smt/example/nqueens_user_propagator/package-summary.html create mode 100644 api/org/sosy_lab/java_smt/example/nqueens_user_propagator/package-tree.html create mode 100644 api/org/sosy_lab/java_smt/example/package-summary.html create mode 100644 api/org/sosy_lab/java_smt/example/package-tree.html create mode 100644 api/org/sosy_lab/java_smt/package-summary.html create mode 100644 api/org/sosy_lab/java_smt/package-tree.html create mode 100644 api/org/sosy_lab/java_smt/test/BooleanFormulaSubject.html create mode 100644 api/org/sosy_lab/java_smt/test/ProverEnvironmentSubject.html create mode 100644 api/org/sosy_lab/java_smt/test/SolverBasedTest0.ParameterizedSolverBasedTest0.html create mode 100644 api/org/sosy_lab/java_smt/test/SolverBasedTest0.html create mode 100644 api/org/sosy_lab/java_smt/test/SolverStackTest0.html create mode 100644 api/org/sosy_lab/java_smt/test/package-summary.html create mode 100644 api/org/sosy_lab/java_smt/test/package-tree.html create mode 100644 api/org/sosy_lab/java_smt/utils/PrettyPrinter.PrinterOption.html create mode 100644 api/org/sosy_lab/java_smt/utils/PrettyPrinter.html create mode 100644 api/org/sosy_lab/java_smt/utils/SolverUtils.html create mode 100644 api/org/sosy_lab/java_smt/utils/UfElimination.Result.html create mode 100644 api/org/sosy_lab/java_smt/utils/UfElimination.html create mode 100644 api/org/sosy_lab/java_smt/utils/package-summary.html create mode 100644 api/org/sosy_lab/java_smt/utils/package-tree.html create mode 100644 api/overview-summary.html create mode 100644 api/overview-tree.html create mode 100644 api/package-search-index.js create mode 100644 api/package-search-index.zip create mode 100644 api/resources/glass.png create mode 100644 api/resources/x.png create mode 100644 api/script.js create mode 100644 api/search.js create mode 100644 api/serialized-form.html create mode 100644 api/stylesheet.css create mode 100644 api/type-search-index.js create mode 100644 api/type-search-index.zip create mode 100644 index.html diff --git a/ConfigurationOptions.txt b/ConfigurationOptions.txt new file mode 100644 index 0000000000..89490fda61 --- /dev/null +++ b/ConfigurationOptions.txt @@ -0,0 +1,146 @@ +# SPDX-FileCopyrightText: 2020 Dirk Beyer +# SPDX-FileCopyrightText: 2022 Dirk Beyer +# SPDX-FileCopyrightText: 2023 Dirk Beyer +# SPDX-FileCopyrightText: 2024 Dirk Beyer +# +# SPDX-License-Identifier: Apache-2.0 + +# Further options for Bitwuzla in addition to the default options. Format: +# "option_name=value" with ’,’ to separate options. Option names and values +# can be found in the Bitwuzla documentation online: +# https://bitwuzla.github.io/docs/cpp/enums/option.html#_CPPv4N8bitwuzla6OptionE +# Example: "PRODUCE_MODELS=2,SAT_SOLVER=kissat". +solver.bitwuzla.furtherOptions = "" + +# The SAT solver used by Bitwuzla. +solver.bitwuzla.satSolver = CADICAL + enum: [LINGELING, CMS, CADICAL, KISSAT] + +# Further options for Boolector in addition to the default options. Format: +# "Optionname=value" with ’,’ to separate options. Option names and values +# can be found in BtorOption or Boolector C Api. Example: +# "BTOR_OPT_MODEL_GEN=2,BTOR_OPT_INCREMENTAL=1". +solver.boolector.furtherOptions = "" + +# The SAT solver used by Boolector. +solver.boolector.satSolver = CADICAL + enum: [LINGELING, PICOSAT, MINISAT, CMS, CADICAL] + +# Counts all operations and interactions towards the SMT solver. +solver.collectStatistics = false + +# apply additional validation checks for interpolation results +solver.cvc5.validateInterpolants = false + +# Enable assertions that make sure that functions are only used in the +# context that declared them. +solver.debugMode.noSharedDeclarations = false + +# Enable assertions that make sure formula terms are only used in the context +# that created them. +solver.debugMode.noSharedFormulas = false + +# Enable assertions that make sure that solver instances are only used on the +# thread that created them. +solver.debugMode.threadLocal = false + +# Default rounding mode for floating point operations. +solver.floatingPointRoundingMode = NEAREST_TIES_TO_EVEN + enum: [NEAREST_TIES_TO_EVEN, NEAREST_TIES_AWAY, TOWARD_POSITIVE, TOWARD_NEGATIVE, + TOWARD_ZERO] + +# Export solver queries in SmtLib format into a file. +solver.logAllQueries = false +solver.logfile = no default value + +# Further options that will be passed to Mathsat in addition to the default +# options. Format is 'key1=value1,key2=value2' +solver.mathsat5.furtherOptions = "" + +# Load less stable optimizing version of mathsat5 solver. +solver.mathsat5.loadOptimathsat5 = false + +# Use non-linear arithmetic of the solver if supported and throw exception +# otherwise, approximate non-linear arithmetic with UFs if unsupported, or +# always approximate non-linear arithmetic. This affects only the theories of +# integer and rational arithmetic. +solver.nonLinearArithmetic = USE + enum: [USE, APPROXIMATE_FALLBACK, APPROXIMATE_ALWAYS] + +# Algorithm for boolean interpolation +solver.opensmt.algBool = 0 + +# Algorithm for LRA interpolation +solver.opensmt.algLra = 0 + +# Algorithm for UF interpolation +solver.opensmt.algUf = 0 + +# SMT-LIB2 name of the logic to be used by the solver. +solver.opensmt.logic = QF_AUFLIRA + enum: [CORE, QF_AX, QF_UF, QF_IDL, QF_RDL, QF_LIA, QF_LRA, QF_ALIA, QF_ALRA, + QF_UFLIA, QF_UFLRA, QF_AUFLIA, QF_AUFLRA, QF_AUFLIRA] + +# Enable additional assertion checks within Princess. The main usage is +# debugging. This option can cause a performance overhead. +solver.princess.enableAssertions = false + +# log all queries as Princess-specific Scala code +solver.princess.logAllQueriesAsScala = false + +# file for Princess-specific dump of queries as Scala code +solver.princess.logAllQueriesAsScalaFile = "princess-query-%03d-" + +# The number of atoms a term has to have before it gets abbreviated if there +# are more identical terms. +solver.princess.minAtomsForAbbreviation = 100 + +# Random seed for SMT solver. +solver.randomSeed = 42 + +# If logging from the same application, avoid conflicting logfile names. +solver.renameLogfileToAvoidConflicts = true + +# Double check generated results like interpolants and models whether they +# are correct +solver.smtinterpol.checkResults = false + +# Further options that will be set to true for SMTInterpol in addition to the +# default options. Format is 'option1,option2,option3' +solver.smtinterpol.furtherOptions = [] + +# Which SMT solver to use. +solver.solver = SMTINTERPOL + enum: [OPENSMT, MATHSAT5, SMTINTERPOL, Z3, PRINCESS, BOOLECTOR, CVC4, CVC5, + YICES2, BITWUZLA] + +# Sequentialize all solver actions to allow concurrent access! +solver.synchronize = false + +# Use provers from a seperate context to solve queries. This allows more +# parallelity when solving larger queries. +solver.synchronized.useSeperateProvers = false + +# Apply additional checks to catch common user errors. +solver.useDebugMode = false + +# Log solver actions, this may be slow! +solver.useLogger = false + +# Activate replayable logging in Z3. The log can be given as an input to the +# solver and replayed. +solver.z3.log = no default value + +# Ordering for objectives in the optimization context +solver.z3.objectivePrioritizationMode = "box" + allowed values: [lex, pareto, box] + +# Engine to use for the optimization +solver.z3.optimizationEngine = "basic" + allowed values: [basic, farkas, symba] + +# Require proofs from SMT solver +solver.z3.requireProofs = false + +# Whether to use PhantomReferences for discarding Z3 AST +solver.z3.usePhantomReferences = false diff --git a/api/allclasses-index.html b/api/allclasses-index.html new file mode 100644 index 0000000000..596fb2abdf --- /dev/null +++ b/api/allclasses-index.html @@ -0,0 +1,949 @@ + + + + + +All Classes (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

All Classes

+
+
+ +
+
+
+ +
+ + diff --git a/api/allclasses.html b/api/allclasses.html new file mode 100644 index 0000000000..d9d4704fa3 --- /dev/null +++ b/api/allclasses.html @@ -0,0 +1,179 @@ + + + + + +All Classes (JavaSMT Solver Library) + + + + + + + + + + + + + +
+

All Classes

+
+ +
+
+ + diff --git a/api/allpackages-index.html b/api/allpackages-index.html new file mode 100644 index 0000000000..ac68a48413 --- /dev/null +++ b/api/allpackages-index.html @@ -0,0 +1,245 @@ + + + + + +All Packages (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

All Packages

+
+
+ +
+
+
+ +
+ + diff --git a/api/constant-values.html b/api/constant-values.html new file mode 100644 index 0000000000..018278b6af --- /dev/null +++ b/api/constant-values.html @@ -0,0 +1,241 @@ + + + + + +Constant Field Values (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Constant Field Values

+
+

Contents

+ +
+
+
+ + +
+

org.sosy_lab.*

+ +
    +
  • + + + + + + + + + + + + + + +
    org.sosy_lab.java_smt.example.Sudoku 
    Modifier and TypeConstant FieldValue
    + +public static final intSIZE9
    +
    • +
+
+
+
+
+ +
+ + diff --git a/api/deprecated-list.html b/api/deprecated-list.html new file mode 100644 index 0000000000..c42645a171 --- /dev/null +++ b/api/deprecated-list.html @@ -0,0 +1,192 @@ + + + + + +Deprecated List (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Deprecated API

+

Contents

+ +
+
+ + + + + + + +
+
+
+ +
+ + diff --git a/api/element-list b/api/element-list new file mode 100644 index 0000000000..f1bdc7a97b --- /dev/null +++ b/api/element-list @@ -0,0 +1,14 @@ +org.sosy_lab.java_smt +org.sosy_lab.java_smt.api +org.sosy_lab.java_smt.api.visitors +org.sosy_lab.java_smt.basicimpl +org.sosy_lab.java_smt.basicimpl.tactics +org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper +org.sosy_lab.java_smt.delegate.debugging +org.sosy_lab.java_smt.delegate.logging +org.sosy_lab.java_smt.delegate.statistics +org.sosy_lab.java_smt.delegate.synchronize +org.sosy_lab.java_smt.example +org.sosy_lab.java_smt.example.nqueens_user_propagator +org.sosy_lab.java_smt.test +org.sosy_lab.java_smt.utils diff --git a/api/help-doc.html b/api/help-doc.html new file mode 100644 index 0000000000..73a741df24 --- /dev/null +++ b/api/help-doc.html @@ -0,0 +1,273 @@ + + + + + +API Help (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

How This API Document Is Organized

+
This API (Application Programming Interface) document has pages corresponding to the items in the navigation bar, described as follows.
+
+
+
    +
  • +
    +

    Overview

    +

    The Overview page is the front page of this API document and provides a list of all packages with a summary for each. This page can also contain an overall description of the set of packages.

    +
    +
    • +
  • +
    +

    Package

    +

    Each package has a page that contains a list of its classes and interfaces, with a summary for each. These pages may contain six categories:

    +
      +
    • Interfaces
      • +
    • Classes
      • +
    • Enums
      • +
    • Exceptions
      • +
    • Errors
      • +
    • Annotation Types
      • +
    +
    +
    • +
  • +
    +

    Class or Interface

    +

    Each class, interface, nested class and nested interface has its own separate page. Each of these pages has three sections consisting of a class/interface description, summary tables, and detailed member descriptions:

    +
      +
    • Class Inheritance Diagram
      • +
    • Direct Subclasses
      • +
    • All Known Subinterfaces
      • +
    • All Known Implementing Classes
      • +
    • Class or Interface Declaration
      • +
    • Class or Interface Description
      • +
    +
    +
      +
    • Nested Class Summary
      • +
    • Field Summary
      • +
    • Property Summary
      • +
    • Constructor Summary
      • +
    • Method Summary
      • +
    +
    +
      +
    • Field Detail
      • +
    • Property Detail
      • +
    • Constructor Detail
      • +
    • Method Detail
      • +
    +

    Each summary entry contains the first sentence from the detailed description for that item. The summary entries are alphabetical, while the detailed descriptions are in the order they appear in the source code. This preserves the logical groupings established by the programmer.

    +
    +
    • +
  • +
    +

    Annotation Type

    +

    Each annotation type has its own separate page with the following sections:

    +
      +
    • Annotation Type Declaration
      • +
    • Annotation Type Description
      • +
    • Required Element Summary
      • +
    • Optional Element Summary
      • +
    • Element Detail
      • +
    +
    +
    • +
  • +
    +

    Enum

    +

    Each enum has its own separate page with the following sections:

    +
      +
    • Enum Declaration
      • +
    • Enum Description
      • +
    • Enum Constant Summary
      • +
    • Enum Constant Detail
      • +
    +
    +
    • +
  • +
    +

    Tree (Class Hierarchy)

    +

    There is a Class Hierarchy page for all packages, plus a hierarchy for each package. Each hierarchy page contains a list of classes and a list of interfaces. Classes are organized by inheritance structure starting with java.lang.Object. Interfaces do not inherit from java.lang.Object.

    +
      +
    • When viewing the Overview page, clicking on "Tree" displays the hierarchy for all packages.
      • +
    • When viewing a particular package, class or interface page, clicking on "Tree" displays the hierarchy for only that package.
      • +
    +
    +
    • +
  • +
    +

    Deprecated API

    +

    The Deprecated API page lists all of the API that have been deprecated. A deprecated API is not recommended for use, generally due to improvements, and a replacement API is usually given. Deprecated APIs may be removed in future implementations.

    +
    +
    • +
  • +
    +

    Index

    +

    The Index contains an alphabetic index of all classes, interfaces, constructors, methods, and fields, as well as lists of all packages and all classes.

    +
    +
    • +
  • +
    +

    All Classes

    +

    The All Classes link shows all classes and interfaces except non-static nested types.

    +
    +
    • +
  • +
    +

    Serialized Form

    +

    Each serializable or externalizable class has a description of its serialization fields and methods. This information is of interest to re-implementors, not to developers using the API. While there is no link in the navigation bar, you can get to this information by going to any serialized class and clicking "Serialized Form" in the "See also" section of the class description.

    +
    +
    • +
  • +
    +

    Constant Field Values

    +

    The Constant Field Values page lists the static final fields and their values.

    +
    +
    • +
  • +
    +

    Search

    +

    You can search for definitions of modules, packages, types, fields, methods and other terms defined in the API, using some or all of the name. "Camel-case" abbreviations are supported: for example, "InpStr" will find "InputStream" and "InputStreamReader".

    +
    +
    • +
+
+This help file applies to API documentation generated by the standard doclet.
+
+
+ +
+ + diff --git a/api/index-all.html b/api/index-all.html new file mode 100644 index 0000000000..c45d2c50d0 --- /dev/null +++ b/api/index-all.html @@ -0,0 +1,5167 @@ + + + + + +Index (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
A B C D E F G H I L M N O P Q R S T U V W X Y Z 
All Classes All Packages + + +

A

+
+
ABORT - Static variable in class org.sosy_lab.java_smt.api.visitors.TraversalProcess
+
+
Immediately abort traversal and return to caller.
+
+
ABORT_TYPE - org.sosy_lab.java_smt.api.visitors.TraversalProcess.TraversalType
+
 
+
abs(FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
abs(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
abs(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
abs(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
AbstractArrayFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl> - Class in org.sosy_lab.java_smt.basicimpl
+
 
+
AbstractArrayFormulaManager(FormulaCreator<TFormulaInfo, TType, TEnv, TFuncDecl>) - Constructor for class org.sosy_lab.java_smt.basicimpl.AbstractArrayFormulaManager
+
 
+
AbstractBitvectorFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl> - Class in org.sosy_lab.java_smt.basicimpl
+
 
+
AbstractBitvectorFormulaManager(FormulaCreator<TFormulaInfo, TType, TEnv, TFuncDecl>, AbstractBooleanFormulaManager<TFormulaInfo, TType, TEnv, TFuncDecl>) - Constructor for class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
AbstractBooleanFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl> - Class in org.sosy_lab.java_smt.basicimpl
+
 
+
AbstractBooleanFormulaManager(FormulaCreator<TFormulaInfo, TType, TEnv, TFuncDecl>) - Constructor for class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
AbstractEnumerationFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl> - Class in org.sosy_lab.java_smt.basicimpl
+
 
+
AbstractEnumerationFormulaManager(FormulaCreator<TFormulaInfo, TType, TEnv, TFuncDecl>) - Constructor for class org.sosy_lab.java_smt.basicimpl.AbstractEnumerationFormulaManager
+
 
+
AbstractEnumerationFormulaManager.EnumType - Class in org.sosy_lab.java_smt.basicimpl
+
+
The class 'EnumType' is just a plain internal value-holding class.
+
+
AbstractEvaluator<TFormulaInfo,​TType,​TEnv> - Class in org.sosy_lab.java_smt.basicimpl
+
 
+
AbstractEvaluator(AbstractProver<?>, FormulaCreator<TFormulaInfo, TType, TEnv, ?>) - Constructor for class org.sosy_lab.java_smt.basicimpl.AbstractEvaluator
+
 
+
AbstractFloatingPointFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl> - Class in org.sosy_lab.java_smt.basicimpl
+
+
Similar to the other Abstract*FormulaManager classes in this package, this class serves as a + helper for implementing FloatingPointFormulaManager.
+
+
AbstractFloatingPointFormulaManager(FormulaCreator<TFormulaInfo, TType, TEnv, TFuncDecl>) - Constructor for class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
AbstractFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl> - Class in org.sosy_lab.java_smt.basicimpl
+
+
Simplifies building a solver from the specific theories.
+
+
AbstractFormulaManager(FormulaCreator<TFormulaInfo, TType, TEnv, TFuncDecl>, AbstractUFManager<TFormulaInfo, ?, TType, TEnv>, AbstractBooleanFormulaManager<TFormulaInfo, TType, TEnv, TFuncDecl>, IntegerFormulaManager, RationalFormulaManager, AbstractBitvectorFormulaManager<TFormulaInfo, TType, TEnv, TFuncDecl>, AbstractFloatingPointFormulaManager<TFormulaInfo, TType, TEnv, TFuncDecl>, AbstractQuantifiedFormulaManager<TFormulaInfo, TType, TEnv, TFuncDecl>, AbstractArrayFormulaManager<TFormulaInfo, TType, TEnv, TFuncDecl>, AbstractSLFormulaManager<TFormulaInfo, TType, TEnv, TFuncDecl>, AbstractStringFormulaManager<TFormulaInfo, TType, TEnv, TFuncDecl>, AbstractEnumerationFormulaManager<TFormulaInfo, TType, TEnv, TFuncDecl>) - Constructor for class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
+
Builds a solver from the given theory implementations.
+
+
AbstractModel<TFormulaInfo,​TType,​TEnv> - Class in org.sosy_lab.java_smt.basicimpl
+
 
+
AbstractModel(AbstractProver<?>, FormulaCreator<TFormulaInfo, TType, TEnv, ?>) - Constructor for class org.sosy_lab.java_smt.basicimpl.AbstractModel
+
 
+
AbstractNumeralFormulaManager<TFormulaInfo,​TType,​TEnv,​ParamFormulaType extends NumeralFormula,​ResultFormulaType extends NumeralFormula,​TFuncDecl> - Class in org.sosy_lab.java_smt.basicimpl
+
+
Similar to the other Abstract*FormulaManager classes in this package, this class serves as a + helper for implementing NumeralFormulaManager.
+
+
AbstractNumeralFormulaManager(FormulaCreator<TFormulaInfo, TType, TEnv, TFuncDecl>, AbstractNumeralFormulaManager.NonLinearArithmetic) - Constructor for class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
AbstractNumeralFormulaManager.NonLinearArithmetic - Enum in org.sosy_lab.java_smt.basicimpl
+
 
+
AbstractProver<T> - Class in org.sosy_lab.java_smt.basicimpl
+
 
+
AbstractProver(Set<SolverContext.ProverOptions>) - Constructor for class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
AbstractProverWithAllSat<T> - Class in org.sosy_lab.java_smt.basicimpl
+
+
This class is a utility-class to avoid repeated implementation of the AllSAT computation.
+
+
AbstractProverWithAllSat(Set<SolverContext.ProverOptions>, BooleanFormulaManager, ShutdownNotifier) - Constructor for class org.sosy_lab.java_smt.basicimpl.AbstractProverWithAllSat
+
 
+
AbstractQuantifiedFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl> - Class in org.sosy_lab.java_smt.basicimpl
+
 
+
AbstractQuantifiedFormulaManager(FormulaCreator<TFormulaInfo, TType, TEnv, TFuncDecl>) - Constructor for class org.sosy_lab.java_smt.basicimpl.AbstractQuantifiedFormulaManager
+
 
+
AbstractSLFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl> - Class in org.sosy_lab.java_smt.basicimpl
+
 
+
AbstractSLFormulaManager(FormulaCreator<TFormulaInfo, TType, TEnv, TFuncDecl>) - Constructor for class org.sosy_lab.java_smt.basicimpl.AbstractSLFormulaManager
+
 
+
AbstractSolverContext - Class in org.sosy_lab.java_smt.basicimpl
+
 
+
AbstractSolverContext(FormulaManager) - Constructor for class org.sosy_lab.java_smt.basicimpl.AbstractSolverContext
+
 
+
AbstractStringFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl> - Class in org.sosy_lab.java_smt.basicimpl
+
 
+
AbstractStringFormulaManager(FormulaCreator<TFormulaInfo, TType, TEnv, TFuncDecl>) - Constructor for class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
AbstractUFManager<TFormulaInfo,​TFunctionDecl,​TType,​TEnv> - Class in org.sosy_lab.java_smt.basicimpl
+
+
This class simplifies the implementation of the FunctionFormulaManager by converting the types to + the solver specific type.
+
+
AbstractUFManager(FormulaCreator<TFormulaInfo, TType, TEnv, TFunctionDecl>) - Constructor for class org.sosy_lab.java_smt.basicimpl.AbstractUFManager
+
 
+
AbstractUserPropagator - Class in org.sosy_lab.java_smt.basicimpl
+
 
+
AbstractUserPropagator() - Constructor for class org.sosy_lab.java_smt.basicimpl.AbstractUserPropagator
+
 
+
ACKERMANNIZATION - org.sosy_lab.java_smt.api.Tactic
+
+
Replaces all applications of UFs with fresh variables and adds constraints to enforce the + functional consistency.
+
+
add(BitvectorFormula, BitvectorFormula) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
This method returns the addition of the given bitvectors.
+
+
add(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
add(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
add(FloatingPointFormula, FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
add(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
add(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
add(FloatingPointFormula, FloatingPointFormula, FloatingPointRoundingMode) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
add(FloatingPointFormula, FloatingPointFormula, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
add(FloatingPointFormula, FloatingPointFormula, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
add(ParamFormulaType, ParamFormulaType) - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
 
+
add(ParamFormulaType, ParamFormulaType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
add(ParamFormulaType, ParamFormulaType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
add(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
add(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
add(TFormulaInfo, TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
ADD - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Addition over integers and rationals.
+
+
addConstraint(BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.BasicProverEnvironment
+
+
Add a constraint to the latest backtracking point.
+
+
addConstraint(BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
addConstraint(BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.BasicProverWithAssumptionsWrapper
+
 
+
addConstraintImpl(BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
addFunctionDeclaration(FunctionDeclaration<?>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingSolverInformation
+
+
Needs to be called after a new function is declared to associate it with this context.
+
+
addSolver(SolverOverviewTable.SolverInfo) - Method in class org.sosy_lab.java_smt.example.SolverOverviewTable.RowBuilder
+
+
Takes a SolverInfo object and splits it into multiple lines which are added to the row.
+
+
all() - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
+
Note: The size of the used alphabet depends on the underlying SMT solver.
+
+
all() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
all() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
allChar() - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
+
Note: The size of the used alphabet depends on the underlying SMT solver.
+
+
allChar() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
allChar() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
allCharImpl() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
allImpl() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
allSat(BasicProverEnvironment.AllSatCallback<R>, List<BooleanFormula>) - Method in interface org.sosy_lab.java_smt.api.BasicProverEnvironment
+
+
Get all satisfying assignments of the current environment with regard to a subset of terms, and + create a region representing all those models.
+
+
allSat(BasicProverEnvironment.AllSatCallback<R>, List<BooleanFormula>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractProverWithAllSat
+
 
+
allSat(BasicProverEnvironment.AllSatCallback<R>, List<BooleanFormula>) - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.BasicProverWithAssumptionsWrapper
+
 
+
AllSatExample - Class in org.sosy_lab.java_smt.example
+
+
This example shows different ways to get all satisfiable models for a given set of constraints.
+
+
AllSatExample(SolverContext, ProverEnvironment) - Constructor for class org.sosy_lab.java_smt.example.AllSatExample
+
 
+
amgr - Variable in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
and(Collection<BooleanFormula>) - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
 
+
and(Collection<BooleanFormula>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
and(Collection<BooleanFormula>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
and(BitvectorFormula, BitvectorFormula) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
This method returns the bit-wise AND of the given bitvectors.
+
+
and(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
and(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
and(BooleanFormula...) - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
 
+
and(BooleanFormula...) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
and(BooleanFormula...) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
and(BooleanFormula, BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
+
Creates a formula representing an AND of the two arguments.
+
+
and(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
and(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
and(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
and(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
AND - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
andImpl(Collection<TFormulaInfo>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
+
Create an n-ary conjunction.
+
+
apply(List<BooleanFormula>) - Method in interface org.sosy_lab.java_smt.api.BasicProverEnvironment.AllSatCallback
+
+
Callback for each possible satisfying assignment to given important predicates.
+
+
applyCNFImpl(BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
+
Apply conjunctive normal form (CNF) transformation to the given input formula.
+
+
applyNNFImpl(BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
+
Apply negation normal form (NNF) transformation to the given input formula.
+
+
applyQELightImpl(BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
+
Eliminate quantifiers from the given input formula.
+
+
applyTactic(BooleanFormula, Tactic) - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Apply a tactic which performs formula transformation.
+
+
applyTactic(BooleanFormula, Tactic) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
applyTactic(BooleanFormula, Tactic) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
applyUFEImpl(BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
+
Eliminate UFs from the given input formula.
+
+
APPROXIMATE_ALWAYS - org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager.NonLinearArithmetic
+
 
+
APPROXIMATE_FALLBACK - org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager.NonLinearArithmetic
+
 
+
ArrayFormula<TI extends Formula,​TE extends Formula> - Interface in org.sosy_lab.java_smt.api
+
+
A formula of the array sort.
+
+
ArrayFormulaManager - Interface in org.sosy_lab.java_smt.api
+
+
This interface represents the theory of (arbitrarily nested) arrays.
+
+
asList() - Method in interface org.sosy_lab.java_smt.api.Model
+
+
Build a list of assignments that stays valid after closing the model.
+
+
asList() - Method in class org.sosy_lab.java_smt.basicimpl.CachingModel
+
 
+
asList() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingModel
+
 
+
asMap() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
assertThat(BasicProverEnvironment<?>) - Static method in class org.sosy_lab.java_smt.test.ProverEnvironmentSubject
+
+
Use this for checking assertions about ProverEnvironments with Truth: + assertThat(stack).is...().
+
+
assertThatEnvironment(BasicProverEnvironment<?>) - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
+
Use this for checking assertions about ProverEnvironments with Truth: + assertThatEnvironment(stack).is...().
+
+
assertThatFormula(BooleanFormula) - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
+
Use this for checking assertions about BooleanFormulas with Truth: + assertThatFormula(formula).is...().
+
+
assertUsing(SolverContext) - Static method in class org.sosy_lab.java_smt.test.BooleanFormulaSubject
+
+
Use this for checking assertions about BooleanFormulas (given the corresponding solver) with + Truth: assertUsing(context)).that(formula).is...().
+
+
assignment(FloatingPointFormula, FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
+
Create a term for assigning one floating-point term to another.
+
+
assignment(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
assignment(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
assignment(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
avoidDualStacksIfNotSupported() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
+ + + +

B

+
+
BASIC_OPERATORS - Static variable in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
+
Avoid using basic mathematical or logical operators of SMT-LIB2 as names for symbols.
+
+
BasicProverEnvironment<T> - Interface in org.sosy_lab.java_smt.api
+
+
Super interface for ProverEnvironment and InterpolatingProverEnvironment that + provides only the common operations.
+
+
BasicProverEnvironment.AllSatCallback<R> - Interface in org.sosy_lab.java_smt.api
+
+
Interface for the BasicProverEnvironment.allSat(org.sosy_lab.java_smt.api.BasicProverEnvironment.AllSatCallback<R>, java.util.List<org.sosy_lab.java_smt.api.BooleanFormula>) callback.
+
+
BasicProverWithAssumptionsWrapper<T,​P extends BasicProverEnvironment<T>> - Class in org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper
+
 
+
Binoxxo - Class in org.sosy_lab.java_smt.example
+
+
This program parses a user-given Binoxxo and solves it with an SMT solver.
+
+
Binoxxo.BinoxxoSolver<S> - Class in org.sosy_lab.java_smt.example
+
 
+
Binoxxo.BooleanBasedBinoxxoSolver - Class in org.sosy_lab.java_smt.example
+
+
This solver encodes nore steps into boolean logic, which makes it about 10x faster than the + Binoxxo.IntegerBasedBinoxxoSolver.
+
+
Binoxxo.IntegerBasedBinoxxoSolver - Class in org.sosy_lab.java_smt.example
+
 
+
BitvectorFormula - Interface in org.sosy_lab.java_smt.api
+
+
A formula of the bitvector sort.
+
+
BitvectorFormulaManager - Interface in org.sosy_lab.java_smt.api
+
+
Manager for dealing with formulas of the bitvector sort.
+
+
BITWUZLA - org.sosy_lab.java_smt.SolverContextFactory.Solvers
+
 
+
bmgr - Variable in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
BooleanBasedBinoxxoSolver(SolverContext) - Constructor for class org.sosy_lab.java_smt.example.Binoxxo.BooleanBasedBinoxxoSolver
+
 
+
BooleanBasedSudokuSolver(SolverContext) - Constructor for class org.sosy_lab.java_smt.example.Sudoku.BooleanBasedSudokuSolver
+
 
+
BooleanFormula - Interface in org.sosy_lab.java_smt.api
+
+
A formula of the boolean sort.
+
+
BooleanFormulaManager - Interface in org.sosy_lab.java_smt.api
+
+
Manager for dealing with boolean formulas.
+
+
booleanFormulasOf(SolverContext) - Static method in class org.sosy_lab.java_smt.test.BooleanFormulaSubject
+
+
Use this for checking assertions about BooleanFormulas (given the corresponding solver) with + Truth: assert_().about(booleanFormulasOf(context)).that(formula).is...().
+
+
BooleanFormulaSubject - Class in org.sosy_lab.java_smt.test
+
+
Subject subclass for testing assertions about BooleanFormulas with Truth (allows using + assert_().about(...).that(formula).isUnsatisfiable() etc.).
+
+
BooleanFormulaTransformationVisitor - Class in org.sosy_lab.java_smt.api.visitors
+
+
Base class for visitors for boolean formulas that recursively transform boolean formulas.
+
+
BooleanFormulaTransformationVisitor(FormulaManager) - Constructor for class org.sosy_lab.java_smt.api.visitors.BooleanFormulaTransformationVisitor
+
 
+
BooleanFormulaVisitor<R> - Interface in org.sosy_lab.java_smt.api.visitors
+
+
Visitor iterating through the boolean part of the formula.
+
+
BooleanType - Static variable in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
BOOLECTOR - org.sosy_lab.java_smt.SolverContextFactory.Solvers
+
 
+
BV_ADD - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Addition over bitvectors.
+
+
BV_AND - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Bitwise AND over bitvectors.
+
+
BV_ASHR - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Arithmetic right-shift over bitvectors (fill from left with value of first bit).
+
+
BV_CONCAT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Concatenation over bitvectors.
+
+
BV_EQ - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Equality over bitvectors.
+
+
BV_EXTRACT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Extraction over bitvectors.
+
+
BV_LSHR - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Logical right-shift over bitvectors (fill from left with zeroes).
+
+
BV_MUL - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Multiplication over bitvectors.
+
+
BV_NEG - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Negation of a bitvector.
+
+
BV_NOT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Bitwise negation of a bitvector.
+
+
BV_OR - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Bitwise OR over bitvectors.
+
+
BV_SCASTTO_FP - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Cast a signed bitvector to a floating-point number.
+
+
BV_SDIV - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Signed division over bitvectors.
+
+
BV_SGE - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Signed greater-than-or-equal over bitvectors.
+
+
BV_SGT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Unsigned greater-than over bitvectors.
+
+
BV_SHL - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Logical left-shift over bitvectors (fill from right with zeroes).
+
+
BV_SIGN_EXTENSION - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Extend bitvectors according to their sign.
+
+
BV_SLE - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Signed greater-than-or-equal over bitvectors.
+
+
BV_SLT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Unsigned less-than over bitvectors.
+
+
BV_SMOD - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Signed modulo over bitvectors.
+
+
BV_SREM - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Signed remainder over bitvectors.
+
+
BV_SUB - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Subtraction over bitvectors.
+
+
BV_UCASTTO_FP - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Cast an unsigned bitvector to a floating-point number.
+
+
BV_UDIV - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Unsigned division over bitvectors.
+
+
BV_UGE - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Unsigned greater-than-or-equal over bitvectors.
+
+
BV_UGT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Signed greater-than over bitvectors.
+
+
BV_ULE - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Unsigned less-than-or-equal over bitvectors.
+
+
BV_ULT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Signed less-than over bitvectors.
+
+
BV_UREM - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Unsigned remainder over bitvectors.
+
+
BV_XOR - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Bitwise XOR over bitvectors.
+
+
BV_ZERO_EXTENSION - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Extend bitvectors with zeros.
+
+
bvmgr - Variable in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
+ + + +

C

+
+
CachingModel - Class in org.sosy_lab.java_smt.basicimpl
+
 
+
CachingModel(Model) - Constructor for class org.sosy_lab.java_smt.basicimpl.CachingModel
+
 
+
callFunction(FunctionDeclaration<T>, List<? extends Formula>) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
callFunctionImpl(TFuncDecl, List<TFormulaInfo>) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
callUF(FunctionDeclaration<T>, List<? extends Formula>) - Method in interface org.sosy_lab.java_smt.api.UFManager
+
+
Create an uninterpreted function call.
+
+
callUF(FunctionDeclaration<T>, List<? extends Formula>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractUFManager
+
 
+
callUF(FunctionDeclaration<T>, List<? extends Formula>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingUFManager
+
 
+
callUF(FunctionDeclaration<T>, Formula...) - Method in interface org.sosy_lab.java_smt.api.UFManager
+
 
+
callUF(FunctionDeclaration<T>, Formula...) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractUFManager
+
 
+
callUF(FunctionDeclaration<T>, Formula...) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingUFManager
+
 
+
castFrom(Formula, boolean, FormulaType.FloatingPointType) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
+
Build a FloatingPointFormula from another compatible formula.
+
+
castFrom(Formula, boolean, FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
castFrom(Formula, boolean, FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
castFrom(Formula, boolean, FormulaType.FloatingPointType, FloatingPointRoundingMode) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
+
Build a FloatingPointFormula from another compatible formula.
+
+
castFrom(Formula, boolean, FormulaType.FloatingPointType, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
castFrom(Formula, boolean, FormulaType.FloatingPointType, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
castFromImpl(TFormulaInfo, boolean, FormulaType.FloatingPointType, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
castTo(FloatingPointFormula, boolean, FormulaType<T>) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
+
Build a formula of compatible type from a FloatingPointFormula.
+
+
castTo(FloatingPointFormula, boolean, FormulaType<T>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
castTo(FloatingPointFormula, boolean, FormulaType<T>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
castTo(FloatingPointFormula, boolean, FormulaType<T>, FloatingPointRoundingMode) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
+
Build a formula of compatible type from a FloatingPointFormula.
+
+
castTo(FloatingPointFormula, boolean, FormulaType<T>, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
castTo(FloatingPointFormula, boolean, FormulaType<T>, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
castToImpl(TFormulaInfo, boolean, FormulaType<?>, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
charAt(StringFormula, NumeralFormula.IntegerFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
+
Get a substring of length 1 from the given String.
+
+
charAt(StringFormula, NumeralFormula.IntegerFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
charAt(StringFormula, NumeralFormula.IntegerFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
charAt(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
check() - Method in interface org.sosy_lab.java_smt.api.OptimizationProverEnvironment
+
+
Optimize the objective function subject to the previously imposed constraints.
+
+
check() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingOptimizationProverEnvironment
+
 
+
checkEnableSeparationLogic() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
checkGenerateAllSat() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
checkGenerateModels() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
checkGenerateUnsatCores() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
checkGenerateUnsatCoresOverAssumptions() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
checkTreeStructure(int, int[]) - Static method in interface org.sosy_lab.java_smt.api.InterpolatingProverEnvironment
+
+
Checks for a valid subtree-structure.
+
+
checkVariableName(String) - Static method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
+
This method is similar to AbstractFormulaManager.isValidName(java.lang.String) and throws an exception for invalid symbol + names.
+
+
clearAssumptions() - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.BasicProverWithAssumptionsWrapper
+
 
+
clearAssumptions() - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.InterpolatingProverWithAssumptionsWrapper
+
 
+
close() - Method in interface org.sosy_lab.java_smt.api.BasicProverEnvironment
+
+
Closes the prover environment.
+
+
close() - Method in interface org.sosy_lab.java_smt.api.Evaluator
+
+
Free resources associated with this evaluator (existing Formula instances stay valid, + but Evaluator.evaluate(Formula) etc.
+
+
close() - Method in interface org.sosy_lab.java_smt.api.Model
+
+
Free resources associated with this model (existing Model.ValueAssignment instances stay + valid, but Evaluator.evaluate(Formula) etc.
+
+
close() - Method in interface org.sosy_lab.java_smt.api.SolverContext
+
+
Close the solver context.
+
+
close() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEvaluator
+
 
+
close() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
close() - Method in class org.sosy_lab.java_smt.basicimpl.CachingModel
+
 
+
close() - Method in class org.sosy_lab.java_smt.basicimpl.ShutdownHook
+
 
+
close() - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.BasicProverWithAssumptionsWrapper
+
 
+
close() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingModel
+
 
+
close() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingSolverContext
+
 
+
close() - Method in class org.sosy_lab.java_smt.delegate.logging.LoggingSolverContext
+
 
+
close() - Method in class org.sosy_lab.java_smt.delegate.statistics.StatisticsSolverContext
+
 
+
close() - Method in class org.sosy_lab.java_smt.delegate.synchronize.SynchronizedSolverContext
+
 
+
closeAllEvaluators() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
closed - Variable in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
closeSolver() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
closure(RegexFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
closure(RegexFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
closure(RegexFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
closure(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
complement(RegexFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
complement(RegexFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
complement(RegexFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
complement(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
concat(List<StringFormula>) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
concat(List<StringFormula>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
concat(List<StringFormula>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
concat(BitvectorFormula, BitvectorFormula) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
Concatenate two bitvectors.
+
+
concat(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
concat(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
concat(RegexFormula...) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
concat(StringFormula...) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
concat(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
concatImpl(List<TFormulaInfo>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
concatRegex(List<RegexFormula>) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
concatRegex(List<RegexFormula>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
concatRegex(List<RegexFormula>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
concatRegexImpl(List<TFormulaInfo>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
config - Variable in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
CONST - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
constraintTestBool1() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
constraintTestBool2() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
constraintTestBool3() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
constraintTestBool4() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
contains(Formula) - Method in class org.sosy_lab.java_smt.api.visitors.TraversalProcess
+
 
+
contains(StringFormula, StringFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
contains(StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
contains(StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
contains(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
context - Variable in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
CONTINUE - Static variable in class org.sosy_lab.java_smt.api.visitors.TraversalProcess
+
+
Continue traversal and recurse into current formula subtree.
+
+
CONTINUE_TYPE - org.sosy_lab.java_smt.api.visitors.TraversalProcess.TraversalType
+
 
+
convertValue(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
+
Convert the formula into a Java object as far as possible, i.e., try to match a primitive or + simple type like Boolean, BigInteger, Rational, or String.
+
+
convertValue(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
+
Convert the formula into a Java object as far as possible, i.e., try to match a primitive or + simple type.
+
+
createSolverContext(Configuration, LogManager, ShutdownNotifier) - Static method in class org.sosy_lab.java_smt.SolverContextFactory
+
+
Shortcut for getting a SolverContext, the solver is selected using the configuration + config.
+
+
createSolverContext(Configuration, LogManager, ShutdownNotifier, SolverContextFactory.Solvers) - Static method in class org.sosy_lab.java_smt.SolverContextFactory
+
+
Shortcut for getting a SolverContext, the solver is selected using an argument.
+
+
createSolverContext(Configuration, LogManager, ShutdownNotifier, SolverContextFactory.Solvers, Consumer<String>) - Static method in class org.sosy_lab.java_smt.SolverContextFactory
+
+
This is the most explicit method for getting a SolverContext, the solver, the logger, + the shutdownNotifier, and the libraryLoader are provided as parameters by the caller.
+
+
createSolverContext(SolverContextFactory.Solvers) - Static method in class org.sosy_lab.java_smt.SolverContextFactory
+
+
Minimalistic shortcut for creating a solver context.
+
+
createTestConfigBuilder() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
creator - Variable in class org.sosy_lab.java_smt.basicimpl.AbstractEvaluator
+
 
+
cross(RegexFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
cross(RegexFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
cross(RegexFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
currentModel - Variable in class org.sosy_lab.java_smt.example.nqueens_user_propagator.NQueensEnumeratingPropagator
+
 
+
custom(Iterable<? extends Formula>) - Static method in class org.sosy_lab.java_smt.api.visitors.TraversalProcess
+
+
Traverse only the given children.
+
+
custom(Formula) - Static method in class org.sosy_lab.java_smt.api.visitors.TraversalProcess
+
+
Traverse only the given child.
+
+
CUSTOM_TYPE - org.sosy_lab.java_smt.api.visitors.TraversalProcess.TraversalType
+
 
+
CVC4 - org.sosy_lab.java_smt.SolverContextFactory.Solvers
+
 
+
CVC5 - org.sosy_lab.java_smt.SolverContextFactory.Solvers
+
 
+
+ + + +

D

+
+
DebuggingArrayFormulaManager - Class in org.sosy_lab.java_smt.delegate.debugging
+
 
+
DebuggingArrayFormulaManager(ArrayFormulaManager, DebuggingAssertions) - Constructor for class org.sosy_lab.java_smt.delegate.debugging.DebuggingArrayFormulaManager
+
 
+
DebuggingBitvectorFormulaManager - Class in org.sosy_lab.java_smt.delegate.debugging
+
 
+
DebuggingBitvectorFormulaManager(BitvectorFormulaManager, DebuggingAssertions) - Constructor for class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
DebuggingBooleanFormulaManager - Class in org.sosy_lab.java_smt.delegate.debugging
+
 
+
DebuggingBooleanFormulaManager(BooleanFormulaManager, DebuggingAssertions) - Constructor for class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
DebuggingEnumerationFormulaManager - Class in org.sosy_lab.java_smt.delegate.debugging
+
 
+
DebuggingEnumerationFormulaManager(EnumerationFormulaManager, DebuggingAssertions) - Constructor for class org.sosy_lab.java_smt.delegate.debugging.DebuggingEnumerationFormulaManager
+
 
+
DebuggingFloatingPointFormulaManager - Class in org.sosy_lab.java_smt.delegate.debugging
+
 
+
DebuggingFloatingPointFormulaManager(FloatingPointFormulaManager, DebuggingAssertions) - Constructor for class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
DebuggingFormulaManager - Class in org.sosy_lab.java_smt.delegate.debugging
+
 
+
DebuggingFormulaManager(FormulaManager, DebuggingAssertions) - Constructor for class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
DebuggingIntegerFormulaManager - Class in org.sosy_lab.java_smt.delegate.debugging
+
 
+
DebuggingIntegerFormulaManager(IntegerFormulaManager, DebuggingAssertions) - Constructor for class org.sosy_lab.java_smt.delegate.debugging.DebuggingIntegerFormulaManager
+
 
+
DebuggingInterpolatingProverEnvironment<T> - Class in org.sosy_lab.java_smt.delegate.debugging
+
 
+
DebuggingInterpolatingProverEnvironment(InterpolatingProverEnvironment<T>, DebuggingAssertions) - Constructor for class org.sosy_lab.java_smt.delegate.debugging.DebuggingInterpolatingProverEnvironment
+
 
+
DebuggingModel - Class in org.sosy_lab.java_smt.delegate.debugging
+
 
+
DebuggingModel(Model, DebuggingAssertions) - Constructor for class org.sosy_lab.java_smt.delegate.debugging.DebuggingModel
+
 
+
DebuggingNumeralFormulaManager<ParamFormulaType extends NumeralFormula,​ResultFormulaType extends NumeralFormula> - Class in org.sosy_lab.java_smt.delegate.debugging
+
 
+
DebuggingNumeralFormulaManager(NumeralFormulaManager<ParamFormulaType, ResultFormulaType>, DebuggingAssertions) - Constructor for class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
DebuggingOptimizationProverEnvironment - Class in org.sosy_lab.java_smt.delegate.debugging
+
 
+
DebuggingOptimizationProverEnvironment(OptimizationProverEnvironment, DebuggingAssertions) - Constructor for class org.sosy_lab.java_smt.delegate.debugging.DebuggingOptimizationProverEnvironment
+
 
+
DebuggingProverEnvironment - Class in org.sosy_lab.java_smt.delegate.debugging
+
 
+
DebuggingProverEnvironment(BasicProverEnvironment<Void>, DebuggingAssertions) - Constructor for class org.sosy_lab.java_smt.delegate.debugging.DebuggingProverEnvironment
+
 
+
DebuggingQuantifiedFormulaManager - Class in org.sosy_lab.java_smt.delegate.debugging
+
 
+
DebuggingQuantifiedFormulaManager(QuantifiedFormulaManager, DebuggingAssertions) - Constructor for class org.sosy_lab.java_smt.delegate.debugging.DebuggingQuantifiedFormulaManager
+
 
+
DebuggingRationalFormulaManager - Class in org.sosy_lab.java_smt.delegate.debugging
+
 
+
DebuggingRationalFormulaManager(RationalFormulaManager, DebuggingAssertions) - Constructor for class org.sosy_lab.java_smt.delegate.debugging.DebuggingRationalFormulaManager
+
 
+
DebuggingSLFormulaManager - Class in org.sosy_lab.java_smt.delegate.debugging
+
 
+
DebuggingSLFormulaManager(SLFormulaManager, DebuggingAssertions) - Constructor for class org.sosy_lab.java_smt.delegate.debugging.DebuggingSLFormulaManager
+
 
+
DebuggingSolverContext - Class in org.sosy_lab.java_smt.delegate.debugging
+
 
+
DebuggingSolverContext(SolverContextFactory.Solvers, Configuration, SolverContext) - Constructor for class org.sosy_lab.java_smt.delegate.debugging.DebuggingSolverContext
+
 
+
DebuggingSolverInformation - Class in org.sosy_lab.java_smt.delegate.debugging
+
 
+
DebuggingStringFormulaManager - Class in org.sosy_lab.java_smt.delegate.debugging
+
 
+
DebuggingStringFormulaManager(StringFormulaManager, DebuggingAssertions) - Constructor for class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
DebuggingUFManager - Class in org.sosy_lab.java_smt.delegate.debugging
+
 
+
DebuggingUFManager(UFManager, DebuggingAssertions) - Constructor for class org.sosy_lab.java_smt.delegate.debugging.DebuggingUFManager
+
 
+
decimalAsInteger(BigDecimal) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
+
This method tries to represent a BigDecimal using only BigInteger.
+
+
declareAndCallUF(String, FormulaType<T>, List<Formula>) - Method in interface org.sosy_lab.java_smt.api.UFManager
+
+
Declares and calls an uninterpreted function with exactly the given name.
+
+
declareAndCallUF(String, FormulaType<T>, List<Formula>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractUFManager
+
 
+
declareAndCallUF(String, FormulaType<T>, List<Formula>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingUFManager
+
 
+
declareAndCallUF(String, FormulaType<T>, Formula...) - Method in interface org.sosy_lab.java_smt.api.UFManager
+
 
+
declareAndCallUF(String, FormulaType<T>, Formula...) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractUFManager
+
 
+
declareAndCallUF(String, FormulaType<T>, Formula...) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingUFManager
+
 
+
declareEnumeration(String, String...) - Method in interface org.sosy_lab.java_smt.api.EnumerationFormulaManager
+
 
+
declareEnumeration(String, Set<String>) - Method in interface org.sosy_lab.java_smt.api.EnumerationFormulaManager
+
+
Declare an enumeration.
+
+
declareEnumeration(String, Set<String>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEnumerationFormulaManager
+
 
+
declareEnumeration(String, Set<String>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingEnumerationFormulaManager
+
 
+
declareEnumeration(String, Set<String>) - Method in class org.sosy_lab.java_smt.delegate.statistics.StatisticsEnumerationFormulaManager
+
 
+
declareEnumeration(String, Set<String>) - Method in class org.sosy_lab.java_smt.delegate.synchronize.SynchronizedEnumerationFormulaManager
+
 
+
declareEnumeration0(FormulaType.EnumerationFormulaType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEnumerationFormulaManager
+
 
+
declareEnumerationImpl(String, Set<String>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEnumerationFormulaManager
+
 
+
declareUF(String, FormulaType<T>, List<FormulaType<?>>) - Method in interface org.sosy_lab.java_smt.api.UFManager
+
+
Declare an uninterpreted function.
+
+
declareUF(String, FormulaType<T>, List<FormulaType<?>>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractUFManager
+
 
+
declareUF(String, FormulaType<T>, List<FormulaType<?>>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingUFManager
+
 
+
declareUF(String, FormulaType<T>, FormulaType<?>...) - Method in interface org.sosy_lab.java_smt.api.UFManager
+
+
Declare an uninterpreted function.
+
+
declareUF(String, FormulaType<T>, FormulaType<?>...) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractUFManager
+
 
+
declareUF(String, FormulaType<T>, FormulaType<?>...) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingUFManager
+
 
+
declareUFImpl(String, TType, List<TType>) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
DefaultBooleanFormulaVisitor<R> - Class in org.sosy_lab.java_smt.api.visitors
+
+
A formula visitor which allows for the default implementation.
+
+
DefaultBooleanFormulaVisitor() - Constructor for class org.sosy_lab.java_smt.api.visitors.DefaultBooleanFormulaVisitor
+
 
+
DefaultFormulaVisitor<R> - Class in org.sosy_lab.java_smt.api.visitors
+
 
+
DefaultFormulaVisitor() - Constructor for class org.sosy_lab.java_smt.api.visitors.DefaultFormulaVisitor
+
 
+
delegate - Variable in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.BasicProverWithAssumptionsWrapper
+
 
+
dequote(String) - Static method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
+
Variable names (symbols) can be wrapped with "|".
+
+
difference(RegexFormula, RegexFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
difference(RegexFormula, RegexFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
difference(RegexFormula, RegexFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
difference(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
DISALLOWED_CHARACTER_REPLACEMENT - Static variable in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
+
Mapping of disallowed char to their escaped counterparts.
+
+
distinct(List<BitvectorFormula>) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
All given bitvectors are pairwise unequal.
+
+
distinct(List<BitvectorFormula>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
distinct(List<BitvectorFormula>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
distinct(List<ParamFormulaType>) - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
+
All given numbers are pairwise unequal.
+
+
distinct(List<ParamFormulaType>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
distinct(List<ParamFormulaType>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
DISTINCT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Distinct operator for a set of numeric formulas.
+
+
distinctImpl(List<TFormulaInfo>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
distinctImpl(List<TFormulaInfo>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
DIV - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Division over rationals and integer division over integers.
+
+
divide(BitvectorFormula, BitvectorFormula, boolean) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
This method returns the division for two bitvector formulas.
+
+
divide(BitvectorFormula, BitvectorFormula, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
divide(BitvectorFormula, BitvectorFormula, boolean) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
divide(FloatingPointFormula, FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
divide(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
divide(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
divide(FloatingPointFormula, FloatingPointFormula, FloatingPointRoundingMode) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
divide(FloatingPointFormula, FloatingPointFormula, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
divide(FloatingPointFormula, FloatingPointFormula, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
divide(ParamFormulaType, ParamFormulaType) - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
+
Create a formula representing the division of two operands according to Boute's Euclidean + definition.
+
+
divide(ParamFormulaType, ParamFormulaType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
divide(ParamFormulaType, ParamFormulaType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
divide(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
+
If a solver does not support this operation, e.g.
+
+
divide(TFormulaInfo, TFormulaInfo, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
divide(TFormulaInfo, TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
DOUBLE_PRECISION_EXPONENT_SIZE - Static variable in class org.sosy_lab.java_smt.api.FloatingPointNumber
+
 
+
DOUBLE_PRECISION_MANTISSA_SIZE - Static variable in class org.sosy_lab.java_smt.api.FloatingPointNumber
+
 
+
doubleValue() - Method in class org.sosy_lab.java_smt.api.FloatingPointNumber
+
+
compute a representation as Java-based double value, if possible.
+
+
dualStackGlobalDeclarations() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
+
This test checks that an SMT solver uses "global declarations": regardless of the stack at + declaration time, declarations always live for the full lifetime of the solver (i.e., they do + not get deleted on pop()).
+
+
dualStackTest() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
dualStackTest2() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
dumpFormula(BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Serialize an input formula to an SMT-LIB format.
+
+
dumpFormula(BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
dumpFormula(BooleanFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
dumpFormula(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
+ + + +

E

+
+
eliminateQuantifiers(BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.QuantifiedFormulaManager
+
+
Eliminate the quantifiers for a given formula.
+
+
eliminateQuantifiers(BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractQuantifiedFormulaManager
+
 
+
eliminateQuantifiers(BooleanFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingQuantifiedFormulaManager
+
 
+
eliminateQuantifiers(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractQuantifiedFormulaManager
+
 
+
eliminateUfs(BooleanFormula) - Method in class org.sosy_lab.java_smt.utils.UfElimination
+
+
Applies the Ackermann transformation to the given Formula.
+
+
eliminateUfs(BooleanFormula, UfElimination.Result) - Method in class org.sosy_lab.java_smt.utils.UfElimination
+
+
Applies the Ackermann transformation to the given Formula with respect to the UfElimination.Result of another formula.
+
+
emgr - Variable in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
empty(FormulaManager) - Static method in class org.sosy_lab.java_smt.utils.UfElimination.Result
+
 
+
ENABLE_SEPARATION_LOGIC - org.sosy_lab.java_smt.api.SolverContext.ProverOptions
+
+
Whether the solver should enable support for formulae build in SL theory.
+
+
enableSL - Variable in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
encapsulate(FormulaType<T>, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
encapsulateArray(TFormulaInfo, FormulaType<TI>, FormulaType<TE>) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
encapsulateBitvector(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
encapsulateBoolean(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
encapsulateEnumeration(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
encapsulateFloatingPoint(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
encapsulateRegex(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
encapsulateString(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
encapsulateWithTypeOf(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
EnumerationBasedSudokuSolver(SolverContext) - Constructor for class org.sosy_lab.java_smt.example.Sudoku.EnumerationBasedSudokuSolver
+
 
+
EnumerationFormula - Interface in org.sosy_lab.java_smt.api
+
+
A formula of the enumeration sort.
+
+
EnumerationFormulaManager - Interface in org.sosy_lab.java_smt.api
+
+
This interface represents the theory of enumeration, i.e., datatype of limited domain sort (as + defined in the SMTLIB2 standard).
+
+
enumerations - Variable in class org.sosy_lab.java_smt.basicimpl.AbstractEnumerationFormulaManager
+
 
+
EnumType(FormulaType.EnumerationFormulaType, TType, ImmutableMap<String, TFormulaInfo>) - Constructor for class org.sosy_lab.java_smt.basicimpl.AbstractEnumerationFormulaManager.EnumType
+
 
+
environment - Variable in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
EQ - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Equality over integers and rationals.
+
+
EQ_ZERO - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Unary comparison to zero.
+
+
equal(BitvectorFormula, BitvectorFormula) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
This method returns the bit-wise equality of the given bitvectors.
+
+
equal(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
equal(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
equal(StringFormula, StringFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
equal(StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
equal(StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
equal(ParamFormulaType, ParamFormulaType) - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
 
+
equal(ParamFormulaType, ParamFormulaType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
equal(ParamFormulaType, ParamFormulaType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
equal(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
equal(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
equal(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
equals(Object) - Method in interface org.sosy_lab.java_smt.api.Formula
+
+
checks whether the other object is a formula of the same structure.
+
+
equals(Object) - Method in class org.sosy_lab.java_smt.api.FormulaType.ArrayFormulaType
+
 
+
equals(Object) - Method in class org.sosy_lab.java_smt.api.FormulaType.BitvectorType
+
 
+
equals(Object) - Method in class org.sosy_lab.java_smt.api.FormulaType.EnumerationFormulaType
+
 
+
equals(Object) - Method in class org.sosy_lab.java_smt.api.FormulaType.FloatingPointType
+
 
+
equals(Object) - Method in class org.sosy_lab.java_smt.api.Model.ValueAssignment
+
 
+
equalWithFPSemantics(FloatingPointFormula, FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
+
Create a term for comparing the equality of two floating-point terms, according to standard + floating-point semantics (i.e., NaN != NaN).
+
+
equalWithFPSemantics(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
equalWithFPSemantics(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
equalWithFPSemantics(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
equivalence(ArrayFormula<TI, TE>, ArrayFormula<TI, TE>) - Method in interface org.sosy_lab.java_smt.api.ArrayFormulaManager
+
+
Make a BooleanFormula that represents the equality of two ArrayFormula.
+
+
equivalence(ArrayFormula<TI, TE>, ArrayFormula<TI, TE>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractArrayFormulaManager
+
 
+
equivalence(ArrayFormula<TI, TE>, ArrayFormula<TI, TE>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingArrayFormulaManager
+
 
+
equivalence(BooleanFormula, BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
+
Creates a formula representing an equivalence of the two arguments.
+
+
equivalence(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
+
Creates a formula representing an equivalence of the two arguments.
+
+
equivalence(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
equivalence(EnumerationFormula, EnumerationFormula) - Method in interface org.sosy_lab.java_smt.api.EnumerationFormulaManager
+
+
Make a BooleanFormula that represents the equality of two EnumerationFormula of + identical enumeration type.
+
+
equivalence(EnumerationFormula, EnumerationFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEnumerationFormulaManager
+
 
+
equivalence(EnumerationFormula, EnumerationFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingEnumerationFormulaManager
+
 
+
equivalence(EnumerationFormula, EnumerationFormula) - Method in class org.sosy_lab.java_smt.delegate.statistics.StatisticsEnumerationFormulaManager
+
 
+
equivalence(EnumerationFormula, EnumerationFormula) - Method in class org.sosy_lab.java_smt.delegate.synchronize.SynchronizedEnumerationFormulaManager
+
 
+
equivalence(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractArrayFormulaManager
+
 
+
equivalence(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
equivalenceImpl(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEnumerationFormulaManager
+
 
+
escape(String) - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Get an escaped symbol/name for variables or undefined functions, if necessary.
+
+
escape(String) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
escape(String) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
eval(T) - Method in interface org.sosy_lab.java_smt.api.Evaluator
+
+
Evaluate a given formula substituting the values from the model and return it as formula.
+
+
eval(T) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEvaluator
+
 
+
eval(T) - Method in class org.sosy_lab.java_smt.basicimpl.CachingModel
+
 
+
eval(T) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingModel
+
 
+
evalImpl(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEvaluator
+
+
Simplify the given formula and replace all symbols with their model values.
+
+
evaluate(BitvectorFormula) - Method in interface org.sosy_lab.java_smt.api.Evaluator
+
+
Type-safe evaluation for bitvector formulas.
+
+
evaluate(BitvectorFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEvaluator
+
 
+
evaluate(BitvectorFormula) - Method in class org.sosy_lab.java_smt.basicimpl.CachingModel
+
 
+
evaluate(BitvectorFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingModel
+
 
+
evaluate(BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.Evaluator
+
+
Type-safe evaluation for boolean formulas.
+
+
evaluate(BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEvaluator
+
 
+
evaluate(BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.CachingModel
+
 
+
evaluate(BooleanFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingModel
+
 
+
evaluate(EnumerationFormula) - Method in interface org.sosy_lab.java_smt.api.Evaluator
+
+
Type-safe evaluation for enumeration formulas.
+
+
evaluate(EnumerationFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEvaluator
+
 
+
evaluate(EnumerationFormula) - Method in class org.sosy_lab.java_smt.basicimpl.CachingModel
+
 
+
evaluate(EnumerationFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingModel
+
 
+
evaluate(FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.Evaluator
+
+
Type-safe evaluation for floating-point formulas.
+
+
evaluate(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEvaluator
+
 
+
evaluate(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.CachingModel
+
 
+
evaluate(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingModel
+
 
+
evaluate(Formula) - Method in interface org.sosy_lab.java_smt.api.Evaluator
+
+
Evaluate a given formula substituting the values from the model.
+
+
evaluate(Formula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEvaluator
+
 
+
evaluate(Formula) - Method in class org.sosy_lab.java_smt.basicimpl.CachingModel
+
 
+
evaluate(Formula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingModel
+
 
+
evaluate(NumeralFormula.IntegerFormula) - Method in interface org.sosy_lab.java_smt.api.Evaluator
+
+
Type-safe evaluation for integer formulas.
+
+
evaluate(NumeralFormula.IntegerFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEvaluator
+
 
+
evaluate(NumeralFormula.IntegerFormula) - Method in class org.sosy_lab.java_smt.basicimpl.CachingModel
+
 
+
evaluate(NumeralFormula.IntegerFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingModel
+
 
+
evaluate(NumeralFormula.RationalFormula) - Method in interface org.sosy_lab.java_smt.api.Evaluator
+
+
Type-safe evaluation for rational formulas.
+
+
evaluate(NumeralFormula.RationalFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEvaluator
+
 
+
evaluate(NumeralFormula.RationalFormula) - Method in class org.sosy_lab.java_smt.basicimpl.CachingModel
+
 
+
evaluate(NumeralFormula.RationalFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingModel
+
 
+
evaluate(StringFormula) - Method in interface org.sosy_lab.java_smt.api.Evaluator
+
+
Type-safe evaluation for string formulas.
+
+
evaluate(StringFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEvaluator
+
 
+
evaluate(StringFormula) - Method in class org.sosy_lab.java_smt.basicimpl.CachingModel
+
 
+
evaluate(StringFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingModel
+
 
+
evaluateImpl(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEvaluator
+
+
Simplify the given formula and replace all symbols with their model values.
+
+
evaluateInModel(BooleanFormula, Formula, Collection<Object>, Collection<Formula>) - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
Evaluator - Interface in org.sosy_lab.java_smt.api
+
+
This class provides methods to get concrete evaluations for formulas from the satisfiable solver + environment.
+
+
exists(List<? extends Formula>, BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.QuantifiedFormulaManager
+
 
+
exists(Formula, BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.QuantifiedFormulaManager
+
+
Syntax sugar, see QuantifiedFormulaManager.exists(List, BooleanFormula).
+
+
EXISTS - org.sosy_lab.java_smt.api.QuantifiedFormulaManager.Quantifier
+
 
+
ExpectedFormulaVisitor<R> - Class in org.sosy_lab.java_smt.api.visitors
+
+
Like DefaultFormulaVisitor, but throws UnsupportedOperationException on + unexpected formula types.
+
+
ExpectedFormulaVisitor() - Constructor for class org.sosy_lab.java_smt.api.visitors.ExpectedFormulaVisitor
+
 
+
extend(BitvectorFormula, int, boolean) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
Extend a bitvector to the left (add most significant bits).
+
+
extend(BitvectorFormula, int, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
extend(BitvectorFormula, int, boolean) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
extend(TFormulaInfo, int, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
extract(BitvectorFormula, int, int) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
Extract a range of bits from a bitvector.
+
+
extract(BitvectorFormula, int, int) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
extract(BitvectorFormula, int, int) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
extract(TFormulaInfo, int, int) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
extractInfo(List<? extends Formula>) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
extractInfo(Formula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
extractInfo(Formula) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
extractVariables(Formula) - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Extract the names of all free variables and UFs in a formula.
+
+
extractVariables(Formula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
+
Extract names of all free variables in a formula.
+
+
extractVariables(Formula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
extractVariablesAndUFs(Formula) - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Extract the names of all free variables and UFs in a formula.
+
+
extractVariablesAndUFs(Formula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
+
Extract the names of all free variables and UFs in a formula.
+
+
extractVariablesAndUFs(Formula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
extractVariablesAndUFs(Formula, boolean, BiConsumer<String, Formula>) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
+
Extract all free variables from the formula, optionally including UFs.
+
+
extractVariablesAndUFs(TFormulaInfo, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
+
Wrapper for FormulaCreator.extractVariablesAndUFs(Formula, boolean, BiConsumer) which unwraps both + input and output.
+
+
extractVariablesAndUFs(TFormulaInfo, boolean, BiConsumer<String, TFormulaInfo>) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
+
Wrapper for FormulaCreator.extractVariablesAndUFs(Formula, boolean, BiConsumer) which unwraps both + input and output.
+
+
+ + + +

F

+
+
factory - Variable in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
fixedCount - Variable in class org.sosy_lab.java_smt.example.nqueens_user_propagator.NQueensEnumeratingPropagator
+
 
+
fixedVariables - Variable in class org.sosy_lab.java_smt.example.nqueens_user_propagator.NQueensEnumeratingPropagator
+
 
+
FloatingPointFormula - Interface in org.sosy_lab.java_smt.api
+
+
Formula of the floating point sort.
+
+
FloatingPointFormulaManager - Interface in org.sosy_lab.java_smt.api
+
+
Floating point operations.
+
+
FloatingPointNumber - Class in org.sosy_lab.java_smt.api
+
+
Represents a floating-point number with customizable precision, consisting of sign, exponent, and + mantissa components.
+
+
FloatingPointNumber() - Constructor for class org.sosy_lab.java_smt.api.FloatingPointNumber
+
 
+
FloatingPointRoundingMode - Enum in org.sosy_lab.java_smt.api
+
+
Possible floating point rounding modes.
+
+
FloatingPointRoundingModeFormula - Interface in org.sosy_lab.java_smt.api
+
+
Formula representing a rounding mode for floating-point operations.
+
+
FloatingPointRoundingModeType - Static variable in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
floatValue() - Method in class org.sosy_lab.java_smt.api.FloatingPointNumber
+
+
compute a representation as Java-based float value, if possible.
+
+
floor(ParamFormulaType) - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
+
The floor operation returns the nearest integer formula that is less or equal to the + given argument formula.
+
+
floor(ParamFormulaType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
floor(ParamFormulaType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
floor(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
FLOOR - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Floor operation, converts from rationals to integers, also known as to_int.
+
+
fmgr - Variable in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
forall(List<? extends Formula>, BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.QuantifiedFormulaManager
+
 
+
forall(Formula, BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.QuantifiedFormulaManager
+
+
Syntax sugar, see QuantifiedFormulaManager.forall(List, BooleanFormula).
+
+
FORALL - org.sosy_lab.java_smt.api.QuantifiedFormulaManager.Quantifier
+
 
+
Formula - Interface in org.sosy_lab.java_smt.api
+
+
An arbitrary SMT formula.
+
+
FormulaClassifier - Class in org.sosy_lab.java_smt.example
+
+
This program parses user-given formulas and prints out the (minimal) matching theory for them.
+
+
FormulaClassifier(SolverContext) - Constructor for class org.sosy_lab.java_smt.example.FormulaClassifier
+
 
+
FormulaCreator<TFormulaInfo,​TType,​TEnv,​TFuncDecl> - Class in org.sosy_lab.java_smt.basicimpl
+
+
This is a helper class with several methods that are commonly used throughout the basicimpl + package and may have solver-specific implementations.
+
+
FormulaCreator(TEnv, TType, TType, TType, TType, TType) - Constructor for class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
FormulaManager - Interface in org.sosy_lab.java_smt.api
+
+
FormulaManager class contains all operations which can be performed on formulas.
+
+
formulaToDot(Formula, PrettyPrinter.PrinterOption...) - Method in class org.sosy_lab.java_smt.utils.PrettyPrinter
+
+
This method returns a Graphviz/Dot representation of the given formula.
+
+
formulaToString(Formula, PrettyPrinter.PrinterOption...) - Method in class org.sosy_lab.java_smt.utils.PrettyPrinter
+
+
This method returns a multi-line String with pretty-formatted and indented subformulas.
+
+
FormulaTransformationVisitor - Class in org.sosy_lab.java_smt.api.visitors
+
+
Abstract class for formula transformation.
+
+
FormulaTransformationVisitor(FormulaManager) - Constructor for class org.sosy_lab.java_smt.api.visitors.FormulaTransformationVisitor
+
 
+
FormulaType<T extends Formula> - Class in org.sosy_lab.java_smt.api
+
+
Type of a formula.
+
+
FormulaType.ArrayFormulaType<TI extends Formula,​TE extends Formula> - Class in org.sosy_lab.java_smt.api
+
 
+
FormulaType.BitvectorType - Class in org.sosy_lab.java_smt.api
+
 
+
FormulaType.EnumerationFormulaType - Class in org.sosy_lab.java_smt.api
+
 
+
FormulaType.FloatingPointType - Class in org.sosy_lab.java_smt.api
+
 
+
FormulaType.NumeralType<T extends NumeralFormula> - Class in org.sosy_lab.java_smt.api
+
 
+
FormulaVisitor<R> - Interface in org.sosy_lab.java_smt.api.visitors
+
+
Visitor iterating through entire formula.
+
+
FP_ABS - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Absolute value of a floating point.
+
+
FP_ADD - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Addition over floating points.
+
+
FP_AS_IEEEBV - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
FP_CASTTO_FP - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
FP_CASTTO_SBV - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
FP_CASTTO_UBV - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
FP_DIV - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Division over floating points.
+
+
FP_EQ - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Equal over floating points.
+
+
FP_FROM_IEEEBV - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
FP_GE - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Greater-than-or-equal over floating points.
+
+
FP_GT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Greater-than over floating points.
+
+
FP_IS_INF - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
FP_IS_NAN - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Further FP queries.
+
+
FP_IS_NEGATIVE - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
FP_IS_NORMAL - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
FP_IS_SUBNORMAL - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
FP_IS_ZERO - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
FP_LE - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Less-than-or-equal over floating points.
+
+
FP_LT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Less-than over floating points.
+
+
FP_MAX - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Maximum of two floating points.
+
+
FP_MIN - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Minimum of two floating points.
+
+
FP_MUL - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Multiplication over floating points.
+
+
FP_NEG - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Negation of a floating point.
+
+
FP_ROUND_AWAY - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Rounding over floating points.
+
+
FP_ROUND_EVEN - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Rounding over floating points.
+
+
FP_ROUND_NEGATIVE - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Rounding over floating points.
+
+
FP_ROUND_POSITIVE - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Rounding over floating points.
+
+
FP_ROUND_TO_INTEGRAL - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Rounding over floating points.
+
+
FP_ROUND_ZERO - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Rounding over floating points.
+
+
FP_SQRT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Square root of a floating point.
+
+
FP_SUB - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Subtraction over floating points.
+
+
fpmgr - Variable in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
fromIeeeBitvector(BitvectorFormula, FormulaType.FloatingPointType) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
+
Create a formula that interprets the given bitvector as a floating-point value in the IEEE + format, according to the given type.
+
+
fromIeeeBitvector(BitvectorFormula, FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
fromIeeeBitvector(BitvectorFormula, FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
fromIeeeBitvectorImpl(TFormulaInfo, FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
fromString(String) - Static method in class org.sosy_lab.java_smt.api.FormulaType
+
+
Parse a string and return the corresponding type.
+
+
FunctionDeclaration<E extends Formula> - Interface in org.sosy_lab.java_smt.api
+
+
Function declaration, for both UFs and built-in functions (theory and boolean).
+
+
FunctionDeclarationImpl<F extends Formula,​T> - Class in org.sosy_lab.java_smt.basicimpl
+
+
Declaration of a function.
+
+
FunctionDeclarationImpl() - Constructor for class org.sosy_lab.java_smt.basicimpl.FunctionDeclarationImpl
+
 
+
FunctionDeclarationKind - Enum in org.sosy_lab.java_smt.api
+
+
Types of function declarations.
+
+
+ + + +

G

+
+
GENERATE_ALL_SAT - org.sosy_lab.java_smt.api.SolverContext.ProverOptions
+
+
Whether the solver should allow to query all satisfying assignments for satisfiable formulas.
+
+
GENERATE_MODELS - org.sosy_lab.java_smt.api.SolverContext.ProverOptions
+
+
Whether the solver should generate models (i.e., satisfying assignments) for satisfiable + formulas.
+
+
GENERATE_UNSAT_CORE - org.sosy_lab.java_smt.api.SolverContext.ProverOptions
+
+
Whether the solver should generate an unsat core for unsatisfiable formulas.
+
+
GENERATE_UNSAT_CORE_OVER_ASSUMPTIONS - org.sosy_lab.java_smt.api.SolverContext.ProverOptions
+
+
Whether the solver should generate an unsat core for unsatisfiable formulas only over + the assumptions explicitly passed to the solver.
+
+
generateContext() - Method in class org.sosy_lab.java_smt.SolverContextFactory
+
+
Create new context with solver chosen according to the supplied configuration.
+
+
generateContext(SolverContextFactory.Solvers) - Method in class org.sosy_lab.java_smt.SolverContextFactory
+
+
Create new context with solver name supplied.
+
+
generateUnsatCores - Variable in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
getAllSolvers() - Static method in class org.sosy_lab.java_smt.test.SolverBasedTest0.ParameterizedSolverBasedTest0
+
 
+
getArgInterpretation(int) - Method in class org.sosy_lab.java_smt.api.Model.ValueAssignment
+
 
+
getArgumentsInterpretation() - Method in class org.sosy_lab.java_smt.api.Model.ValueAssignment
+
+
Interpretation assigned for function arguments.
+
+
getArgumentTypes() - Method in interface org.sosy_lab.java_smt.api.FunctionDeclaration
+
 
+
getArity() - Method in class org.sosy_lab.java_smt.api.Model.ValueAssignment
+
 
+
getArrayFormulaElementType(ArrayFormula<TI, TE>) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
getArrayFormulaIndexType(ArrayFormula<TI, TE>) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
getArrayFormulaManager() - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Returns the Array-Theory.
+
+
getArrayFormulaManager() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
getArrayFormulaManager() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
getArrayType(FormulaType<TD>, FormulaType<TR>) - Static method in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
getArrayType(TType, TType) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
getAssertedConstraintIds() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
getAssertedFormulas() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
getAssignmentAsFormula() - Method in class org.sosy_lab.java_smt.api.Model.ValueAssignment
+
+
The formula AST representing the equality of key and value.
+
+
getBackend() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractUserPropagator
+
 
+
getBitvectorFormulaManager() - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Returns the Bitvector-Theory.
+
+
getBitvectorFormulaManager() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
getBitvectorFormulaManager() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
getBitvectorType(int) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
getBitvectorTypeWithSize(int) - Static method in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
getBooleanFormulaManager() - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Returns the Boolean-Theory.
+
+
getBooleanFormulaManager() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
getBooleanFormulaManager() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
getBooleanVarDeclaration(BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
getBooleanVarDeclarationImpl(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
getBoolType() - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
getBvRepresentation(BigInteger, int) - Static method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
getCardinality() - Method in class org.sosy_lab.java_smt.api.FormulaType.EnumerationFormulaType
+
 
+
getConstraints() - Method in class org.sosy_lab.java_smt.utils.UfElimination.Result
+
 
+
getDefaultRoundingMode() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
getDoublePrecisionFloatingPointType() - Static method in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
getElements() - Method in class org.sosy_lab.java_smt.api.FormulaType.EnumerationFormulaType
+
 
+
getElementType() - Method in class org.sosy_lab.java_smt.api.FormulaType.ArrayFormulaType
+
 
+
getElementType(ArrayFormula<?, TE>) - Method in interface org.sosy_lab.java_smt.api.ArrayFormulaManager
+
 
+
getElementType(ArrayFormula<?, TE>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractArrayFormulaManager
+
 
+
getElementType(ArrayFormula<?, TE>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingArrayFormulaManager
+
 
+
getEnumerationFormulaManager() - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Returns the Enumeration Theory, e.g., also known as 'limited domain'.
+
+
getEnumerationFormulaManager() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
getEnumerationFormulaManager() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
getEnumerationFormulaType() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEnumerationFormulaManager.EnumType
+
 
+
getEnumerationType(String, Set<String>) - Static method in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
getEnv() - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
getEnvironment() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
getEvaluator() - Method in interface org.sosy_lab.java_smt.api.BasicProverEnvironment
+
+
Get a temporary view on the current satisfying assignment.
+
+
getEvaluatorWithoutChecks() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractProverWithAllSat
+
+
Get an evaluator instance for model evaluation without executing checks for prover options.
+
+
getExponent() - Method in class org.sosy_lab.java_smt.api.FloatingPointNumber
+
+
The exponent of the floating-point number, given as numeric value.
+
+
getExponentSize() - Method in class org.sosy_lab.java_smt.api.FloatingPointNumber
+
 
+
getExponentSize() - Method in class org.sosy_lab.java_smt.api.FormulaType.FloatingPointType
+
 
+
getFeatures() - Method in class org.sosy_lab.java_smt.example.SolverOverviewTable.SolverInfo
+
 
+
getFloatingPointFormulaManager() - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Returns the Floating-Point-Theory.
+
+
getFloatingPointFormulaManager() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
getFloatingPointFormulaManager() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
getFloatingPointType(int, int) - Static method in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
getFloatingPointType(FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
getFormula() - Method in class org.sosy_lab.java_smt.utils.UfElimination.Result
+
 
+
getFormulaCreator() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
getFormulaManager() - Method in interface org.sosy_lab.java_smt.api.SolverContext
+
+
Get the formula manager, which is used for formula manipulation.
+
+
getFormulaManager() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractSolverContext
+
 
+
getFormulaManager() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingSolverContext
+
 
+
getFormulaManager() - Method in class org.sosy_lab.java_smt.delegate.logging.LoggingSolverContext
+
 
+
getFormulaManager() - Method in class org.sosy_lab.java_smt.delegate.statistics.StatisticsSolverContext
+
 
+
getFormulaManager() - Method in class org.sosy_lab.java_smt.delegate.synchronize.SynchronizedSolverContext
+
 
+
getFormulaType() - Method in interface org.sosy_lab.java_smt.api.IntegerFormulaManager
+
 
+
getFormulaType() - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
 
+
getFormulaType() - Method in interface org.sosy_lab.java_smt.api.RationalFormulaManager
+
 
+
getFormulaType() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
getFormulaType(T) - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Returns the type of the given Formula.
+
+
getFormulaType(T) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
getFormulaType(T) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
+
Returns the type of the given Formula.
+
+
getFormulaType(T) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
getFormulaType(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
getGlobalFunctionsForSolver(SolverContextFactory.Solvers) - Static method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingSolverInformation
+
 
+
getGlobalTermsForSolver(SolverContextFactory.Solvers) - Static method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingSolverInformation
+
 
+
getIndexType() - Method in class org.sosy_lab.java_smt.api.FormulaType.ArrayFormulaType
+
 
+
getIndexType(ArrayFormula<TI, ?>) - Method in interface org.sosy_lab.java_smt.api.ArrayFormulaManager
+
 
+
getIndexType(ArrayFormula<TI, ?>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractArrayFormulaManager
+
 
+
getIndexType(ArrayFormula<TI, ?>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingArrayFormulaManager
+
 
+
getIntegerFormulaManager() - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Returns the Integer-Theory.
+
+
getIntegerFormulaManager() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
getIntegerFormulaManager() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
getIntegerType() - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
getInterpolant(Collection<T>) - Method in interface org.sosy_lab.java_smt.api.InterpolatingProverEnvironment
+
+
Get an interpolant for two groups of formulas.
+
+
getInterpolant(Collection<T>) - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.InterpolatingProverWithAssumptionsWrapper
+
 
+
getInterpolant(Collection<T>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingInterpolatingProverEnvironment
+
 
+
getKey() - Method in class org.sosy_lab.java_smt.api.Model.ValueAssignment
+
+
The formula AST which is assigned a given value.
+
+
getKind() - Method in interface org.sosy_lab.java_smt.api.FunctionDeclaration
+
 
+
getLength(BitvectorFormula) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
This method returns the length of a bitvector, also denoted as bit-size.
+
+
getLength(BitvectorFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
getLength(BitvectorFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
getMantissa() - Method in class org.sosy_lab.java_smt.api.FloatingPointNumber
+
+
The mantissa (aka significand) of the floating-point number, given as numeric value.
+
+
getMantissaSize() - Method in class org.sosy_lab.java_smt.api.FloatingPointNumber
+
 
+
getMantissaSize() - Method in class org.sosy_lab.java_smt.api.FormulaType.FloatingPointType
+
 
+
getMaxTime() - Method in class org.sosy_lab.java_smt.delegate.statistics.TimerPool
+
+
Return the maximal time of all intervals.
+
+
getMaxTimeOfAllSatQueries() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getMaxTimeOfInterpolationQueries() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getMaxTimeOfIsUnsatQueries() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getModel() - Method in interface org.sosy_lab.java_smt.api.BasicProverEnvironment
+
+
Get a satisfying assignment.
+
+
getModel() - Method in interface org.sosy_lab.java_smt.api.OptimizationProverEnvironment
+
+
Get a satisfying assignment.
+
+
getModel() - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.BasicProverWithAssumptionsWrapper
+
 
+
getModelAssignments() - Method in interface org.sosy_lab.java_smt.api.BasicProverEnvironment
+
+
Get a list of satisfying assignments.
+
+
getModelAssignments() - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.BasicProverWithAssumptionsWrapper
+
 
+
getName() - Method in class org.sosy_lab.java_smt.api.FormulaType.EnumerationFormulaType
+
 
+
getName() - Method in interface org.sosy_lab.java_smt.api.FunctionDeclaration
+
 
+
getName() - Method in class org.sosy_lab.java_smt.api.Model.ValueAssignment
+
+
Variable name for variables, function name for UFs, and array name for arrays.
+
+
getName() - Method in class org.sosy_lab.java_smt.example.SolverOverviewTable.SolverInfo
+
 
+
getNewTimer() - Method in class org.sosy_lab.java_smt.delegate.statistics.TimerPool
+
 
+
getNumberOfAddConstraintQueries() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumberOfAllSatQueries() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumberOfArrayOperations() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumberOfBooleanOperations() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumberOfBVOperations() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumberOfFPOperations() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumberOfInterpolationQueries() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumberOfIntervals() - Method in class org.sosy_lab.java_smt.delegate.statistics.TimerPool
+
+
Return the number of intervals.
+
+
getNumberOfIsUnsatQueries() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumberOfModelEvaluationQueries() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumberOfModelListings() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumberOfModelQueries() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumberOfNumericOperations() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumberOfPopQueries() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumberOfProverEnvironments() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumberOfPushQueries() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumberOfQuantifierOperations() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumberOfSLOperations() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumberOfStringOperations() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumberOfUFOperations() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumberOfUnsatCoreQueries() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumberOfVisits() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getNumOfSolutions() - Method in class org.sosy_lab.java_smt.example.nqueens_user_propagator.NQueensEnumeratingPropagator
+
 
+
getQuantifiedFormulaManager() - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Returns the interface for handling quantifiers.
+
+
getQuantifiedFormulaManager() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
getQuantifiedFormulaManager() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
getRationalFormulaManager() - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Returns the Rational-Theory.
+
+
getRationalFormulaManager() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
getRationalFormulaManager() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
getRationalType() - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
getRegexType() - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
getResult() - Method in interface org.sosy_lab.java_smt.api.BasicProverEnvironment.AllSatCallback
+
+
Returning the result generated after all the BasicProverEnvironment.AllSatCallback.apply(java.util.List<org.sosy_lab.java_smt.api.BooleanFormula>) calls went through.
+
+
getRoundingModeImpl(FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
getSeqInterpolants(List<? extends Collection<T>>) - Method in interface org.sosy_lab.java_smt.api.InterpolatingProverEnvironment
+
+
This method returns interpolants of an 'inductive sequence'.
+
+
getSeqInterpolants(List<? extends Collection<T>>) - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.InterpolatingProverWithAssumptionsWrapper
+
 
+
getSeqInterpolants(List<? extends Collection<T>>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingInterpolatingProverEnvironment
+
 
+
getSeqInterpolants0(List<T>) - Method in interface org.sosy_lab.java_smt.api.InterpolatingProverEnvironment
+
+
This utility method wraps each formula in a collection and then forwards to InterpolatingProverEnvironment.getSeqInterpolants(java.util.List<? extends java.util.Collection<T>>).
+
+
getSign() - Method in class org.sosy_lab.java_smt.api.FloatingPointNumber
+
+
Whether the number is positive (TRUE) or negative (FALSE).
+
+
getSinglePrecisionFloatingPointType() - Static method in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
getSize() - Method in class org.sosy_lab.java_smt.api.FormulaType.BitvectorType
+
 
+
getSLFormulaManager() - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Returns the Seperation-Logic-Theory.
+
+
getSLFormulaManager() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
getSLFormulaManager() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
getSolverDeclaration() - Method in class org.sosy_lab.java_smt.basicimpl.FunctionDeclarationImpl
+
+
get a reference to the internal declaration used by the SMT solver.
+
+
getSolverInformation(SolverContextFactory.Solvers) - Method in class org.sosy_lab.java_smt.example.SolverOverviewTable
+
+
Checks for solver-name, version, theories and features.
+
+
getSolverName() - Method in interface org.sosy_lab.java_smt.api.SolverContext
+
+
Get solver name (MATHSAT5/Z3/etc...).
+
+
getSolverName() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingSolverContext
+
 
+
getSolverName() - Method in class org.sosy_lab.java_smt.delegate.logging.LoggingSolverContext
+
 
+
getSolverName() - Method in class org.sosy_lab.java_smt.delegate.statistics.StatisticsSolverContext
+
 
+
getSolverName() - Method in class org.sosy_lab.java_smt.delegate.synchronize.SynchronizedSolverContext
+
 
+
getSolverStatistics() - Method in class org.sosy_lab.java_smt.delegate.statistics.StatisticsSolverContext
+
+
export statistics about the solver interaction.
+
+
getStatistics() - Method in interface org.sosy_lab.java_smt.api.BasicProverEnvironment
+
+
Get statistics for a concrete ProverEnvironment in a solver.
+
+
getStatistics() - Method in interface org.sosy_lab.java_smt.api.SolverContext
+
+
Get statistics for a complete solver context.
+
+
getStatistics() - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.BasicProverWithAssumptionsWrapper
+
 
+
getStatistics() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingSolverContext
+
 
+
getStatistics() - Method in class org.sosy_lab.java_smt.delegate.logging.LoggingSolverContext
+
 
+
getStatistics() - Method in class org.sosy_lab.java_smt.delegate.statistics.StatisticsSolverContext
+
 
+
getStatistics() - Method in class org.sosy_lab.java_smt.delegate.synchronize.SynchronizedSolverContext
+
 
+
getStringFormulaManager() - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Returns the String Theory.
+
+
getStringFormulaManager() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
getStringFormulaManager() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
getStringType() - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
getSubstitution() - Method in class org.sosy_lab.java_smt.utils.UfElimination.Result
+
 
+
getSumTime() - Method in class org.sosy_lab.java_smt.delegate.statistics.TimerPool
+
 
+
getSumTimeOfAllSatQueries() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getSumTimeOfInterpolationQueries() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getSumTimeOfIsUnsatQueries() - Method in class org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
+
 
+
getTheories() - Method in class org.sosy_lab.java_smt.example.SolverOverviewTable.SolverInfo
+
 
+
getTotalSize() - Method in class org.sosy_lab.java_smt.api.FormulaType.FloatingPointType
+
+
Return the total size of a value of this type in bits.
+
+
getTreeInterpolants(List<? extends Collection<T>>, int[]) - Method in interface org.sosy_lab.java_smt.api.InterpolatingProverEnvironment
+
+
Compute a sequence of interpolants.
+
+
getTreeInterpolants(List<? extends Collection<T>>, int[]) - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.InterpolatingProverWithAssumptionsWrapper
+
 
+
getTreeInterpolants(List<? extends Collection<T>>, int[]) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingInterpolatingProverEnvironment
+
 
+
getTreeInterpolants0(List<T>, int[]) - Method in interface org.sosy_lab.java_smt.api.InterpolatingProverEnvironment
+
+
This utility method wraps each formula in a collection and then forwards to InterpolatingProverEnvironment.getTreeInterpolants(java.util.List<? extends java.util.Collection<T>>, int[]).
+
+
getType() - Method in interface org.sosy_lab.java_smt.api.FunctionDeclaration
+
 
+
getType() - Method in class org.sosy_lab.java_smt.api.visitors.TraversalProcess
+
 
+
getUFManager() - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Returns the function for dealing with uninterpreted functions (UFs).
+
+
getUFManager() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
getUFManager() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
getUnsatCore() - Method in interface org.sosy_lab.java_smt.api.BasicProverEnvironment
+
+
Get an unsat core.
+
+
getUnsatCore() - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.BasicProverWithAssumptionsWrapper
+
 
+
getValue() - Method in class org.sosy_lab.java_smt.api.Model.ValueAssignment
+
+
Value: see the Evaluator.evaluate(org.sosy_lab.java_smt.api.Formula) methods for the possible types.
+
+
getValueAsFormula() - Method in class org.sosy_lab.java_smt.api.Model.ValueAssignment
+
+
The formula AST which is assigned to a given key.
+
+
getVersion() - Method in interface org.sosy_lab.java_smt.api.SolverContext
+
+
Get version information out of the solver.
+
+
getVersion() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingSolverContext
+
 
+
getVersion() - Method in class org.sosy_lab.java_smt.delegate.logging.LoggingSolverContext
+
 
+
getVersion() - Method in class org.sosy_lab.java_smt.delegate.statistics.StatisticsSolverContext
+
 
+
getVersion() - Method in class org.sosy_lab.java_smt.delegate.synchronize.SynchronizedSolverContext
+
 
+
getVersion() - Method in class org.sosy_lab.java_smt.example.SolverOverviewTable.SolverInfo
+
 
+
greaterOrEquals(BitvectorFormula, BitvectorFormula, boolean) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
Compare the given bitvectors.
+
+
greaterOrEquals(BitvectorFormula, BitvectorFormula, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
greaterOrEquals(BitvectorFormula, BitvectorFormula, boolean) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
greaterOrEquals(FloatingPointFormula, FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
greaterOrEquals(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
greaterOrEquals(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
greaterOrEquals(StringFormula, StringFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
greaterOrEquals(StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
greaterOrEquals(StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
greaterOrEquals(ParamFormulaType, ParamFormulaType) - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
 
+
greaterOrEquals(ParamFormulaType, ParamFormulaType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
greaterOrEquals(ParamFormulaType, ParamFormulaType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
greaterOrEquals(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
greaterOrEquals(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
greaterOrEquals(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
greaterOrEquals(TFormulaInfo, TFormulaInfo, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
greaterThan(BitvectorFormula, BitvectorFormula, boolean) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
Compare the given bitvectors.
+
+
greaterThan(BitvectorFormula, BitvectorFormula, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
greaterThan(BitvectorFormula, BitvectorFormula, boolean) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
greaterThan(FloatingPointFormula, FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
greaterThan(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
greaterThan(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
greaterThan(StringFormula, StringFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
greaterThan(StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
greaterThan(StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
greaterThan(ParamFormulaType, ParamFormulaType) - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
 
+
greaterThan(ParamFormulaType, ParamFormulaType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
greaterThan(ParamFormulaType, ParamFormulaType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
greaterThan(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
greaterThan(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
greaterThan(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
greaterThan(TFormulaInfo, TFormulaInfo, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
GT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Greater-than over integers and rationals.
+
+
GTE - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Greater-than-or-equal over integers and rationals.
+
+
GTE_ZERO - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Unary comparison with zero.
+
+
+ + + +

H

+
+
hasConstants(String) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEnumerationFormulaManager.EnumType
+
 
+
hashCode() - Method in interface org.sosy_lab.java_smt.api.Formula
+
+
returns a valid hashCode satisfying the constraints given by Formula.equals(java.lang.Object).
+
+
hashCode() - Method in class org.sosy_lab.java_smt.api.FormulaType.ArrayFormulaType
+
 
+
hashCode() - Method in class org.sosy_lab.java_smt.api.FormulaType.BitvectorType
+
 
+
hashCode() - Method in class org.sosy_lab.java_smt.api.FormulaType.EnumerationFormulaType
+
 
+
hashCode() - Method in class org.sosy_lab.java_smt.api.FormulaType.FloatingPointType
+
 
+
hashCode() - Method in class org.sosy_lab.java_smt.api.Model.ValueAssignment
+
 
+
houdini(List<BooleanFormula>, BooleanFormula) - Method in class org.sosy_lab.java_smt.example.HoudiniApp
+
+
execute the Houdini algorithm to get the maximal inductive subset L_I for the given lemmas and + the transition.
+
+
HoudiniApp - Class in org.sosy_lab.java_smt.example
+
+
This application executes the inductive-invariant synthesis algorithm called "Houdini" taken from + the paper Flanagan and Leino: "Houdini, an Annotation Assistant for ESC/Java".
+
+
HoudiniApp(SolverContext) - Constructor for class org.sosy_lab.java_smt.example.HoudiniApp
+
 
+
+ + + +

I

+
+
IFF - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
If and only if.
+
+
ifThenElse(BooleanFormula, T, T) - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
+
Creates a formula representing IF cond THEN f1 ELSE f2.
+
+
ifThenElse(BooleanFormula, T, T) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
+
Creates a formula representing "IF cond THEN f1 ELSE f2".
+
+
ifThenElse(BooleanFormula, T, T) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
ifThenElse(TFormulaInfo, TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
imgr - Variable in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
implication(BooleanFormula, BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
 
+
implication(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
implication(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
implication(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
implies(BooleanFormula) - Method in class org.sosy_lab.java_smt.test.BooleanFormulaSubject
+
+
Check that the subject implies a given formula, i.e.
+
+
IMPLIES - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Implication between two boolean formulas.
+
+
in(StringFormula, RegexFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
in(StringFormula, RegexFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
in(StringFormula, RegexFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
in(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
indexOf(StringFormula, StringFormula, NumeralFormula.IntegerFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
+
Get the first index for a substring in a String, or -1 if the substring is not found.
+
+
indexOf(StringFormula, StringFormula, NumeralFormula.IntegerFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
indexOf(StringFormula, StringFormula, NumeralFormula.IntegerFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
indexOf(TFormulaInfo, TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
initializeWithBackend(PropagatorBackend) - Method in interface org.sosy_lab.java_smt.api.UserPropagator
+
+
This method is invoked after the user propagator is registered via BasicProverEnvironment.registerUserPropagator(UserPropagator).
+
+
initializeWithBackend(PropagatorBackend) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractUserPropagator
+
 
+
initializeWithBackend(PropagatorBackend) - Method in class org.sosy_lab.java_smt.example.nqueens_user_propagator.NQueensEnumeratingPropagator
+
 
+
initSolver() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
INT_TO_STR - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
IntegerBasedBinoxxoSolver(SolverContext) - Constructor for class org.sosy_lab.java_smt.example.Binoxxo.IntegerBasedBinoxxoSolver
+
 
+
IntegerBasedSudokuSolver(SolverContext) - Constructor for class org.sosy_lab.java_smt.example.Sudoku.IntegerBasedSudokuSolver
+
 
+
IntegerFormulaManager - Interface in org.sosy_lab.java_smt.api
+
+
Interface which operates over NumeralFormula.IntegerFormulas.
+
+
IntegerType - Static variable in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
internalMakeArray(String, FormulaType<TI>, FormulaType<TE>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractArrayFormulaManager
+
 
+
internalMakeArray(FormulaType<TI>, FormulaType<TE>, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractArrayFormulaManager
+
 
+
InterpolatingProverEnvironment<T> - Interface in org.sosy_lab.java_smt.api
+
+
This class provides an interface to an incremental SMT solver with methods for pushing and + popping formulas as well as SAT checks.
+
+
InterpolatingProverWithAssumptionsWrapper<T> - Class in org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper
+
 
+
InterpolatingProverWithAssumptionsWrapper(InterpolatingProverEnvironment<T>, FormulaManager) - Constructor for class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.InterpolatingProverWithAssumptionsWrapper
+
 
+
Interpolation - Class in org.sosy_lab.java_smt.example
+
+
Examples for Craig/sequential/tree interpolation.
+
+
intersection(RegexFormula, RegexFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
intersection(RegexFormula, RegexFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
intersection(RegexFormula, RegexFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
intersection(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
isArrayType() - Method in class org.sosy_lab.java_smt.api.FormulaType.ArrayFormulaType
+
 
+
isArrayType() - Method in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
isBitvectorType() - Method in class org.sosy_lab.java_smt.api.FormulaType.BitvectorType
+
 
+
isBitvectorType() - Method in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
isBooleanType() - Method in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
isClosed() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEvaluator
+
 
+
isCompatible(FormulaType<?>, FormulaType<?>) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
+
This function checks whether the used type of the function argument is compatible with the + declared type in the function declaration.
+
+
isEnumerationType() - Method in class org.sosy_lab.java_smt.api.FormulaType.EnumerationFormulaType
+
 
+
isEnumerationType() - Method in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
isEquisatisfiableTo(BooleanFormula) - Method in class org.sosy_lab.java_smt.test.BooleanFormulaSubject
+
 
+
isEquivalentTo(BooleanFormula) - Method in class org.sosy_lab.java_smt.test.BooleanFormulaSubject
+
+
Check that the subject is equivalent to a given formula, i.e.
+
+
isFalse(BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
+
Check, if the formula is the formula "FALSE".
+
+
isFalse(BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
isFalse(BooleanFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
isFalse(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
isFloatingPointRoundingModeType() - Method in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
isFloatingPointType() - Method in class org.sosy_lab.java_smt.api.FormulaType.FloatingPointType
+
 
+
isFloatingPointType() - Method in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
isFunction() - Method in class org.sosy_lab.java_smt.api.Model.ValueAssignment
+
 
+
isInfinity(FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
isInfinity(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
isInfinity(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
isInfinity(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
isIntegerType() - Method in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
isNaN(FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
isNaN(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
isNaN(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
isNaN(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
isNegative(FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
+
checks whether a formula is negative, including -0.0.
+
+
isNegative(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
isNegative(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
isNegative(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
isNegativeZero(Double) - Static method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
isNormal(FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
isNormal(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
isNormal(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
isNormal(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
isNumeral(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
+
Check whether the argument is a numeric constant (including negated constants).
+
+
isNumeralType() - Method in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
isNumeralType() - Method in class org.sosy_lab.java_smt.api.FormulaType.NumeralType
+
 
+
isRationalType() - Method in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
isRegexType() - Method in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
isSatisfiable() - Method in class org.sosy_lab.java_smt.test.BooleanFormulaSubject
+
+
Check that the subject is satisfiable.
+
+
isSatisfiable() - Method in class org.sosy_lab.java_smt.test.ProverEnvironmentSubject
+
+
Check that the subject stack is satisfiable.
+
+
isSLType() - Method in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
isStringType() - Method in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
isSubnormal(FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
isSubnormal(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
isSubnormal(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
isSubnormal(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
isTautological() - Method in class org.sosy_lab.java_smt.test.BooleanFormulaSubject
+
+
Check that the subject is tautological, i.e., always holds.
+
+
isTrue(BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
+
Check, if the formula is the formula "TRUE".
+
+
isTrue(BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
isTrue(BooleanFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
isTrue(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
isUnsat() - Method in interface org.sosy_lab.java_smt.api.BasicProverEnvironment
+
+
Check whether the conjunction of all formulas on the stack is unsatisfiable.
+
+
isUnsat() - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.BasicProverWithAssumptionsWrapper
+
 
+
isUnsatisfiable() - Method in class org.sosy_lab.java_smt.test.BooleanFormulaSubject
+
+
Check that the subject is unsatisfiable.
+
+
isUnsatisfiable() - Method in class org.sosy_lab.java_smt.test.ProverEnvironmentSubject
+
+
Check that the subject stack is unsatisfiable.
+
+
isUnsatWithAssumptions(Collection<BooleanFormula>) - Method in interface org.sosy_lab.java_smt.api.BasicProverEnvironment
+
+
Check whether the conjunction of all formulas on the stack together with the list of + assumptions is satisfiable.
+
+
isUnsatWithAssumptions(Collection<BooleanFormula>) - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.BasicProverWithAssumptionsWrapper
+
 
+
isValidName(String) - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Check whether the given String can be used as symbol/name for variables or undefined functions.
+
+
isValidName(String) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
+
Check whether the given String can be used as symbol/name for variables or undefined functions.
+
+
isValidName(String) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
isZero(FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
isZero(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
isZero(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
isZero(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
ITE - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
If-then-else operator.
+
+
iterator() - Method in interface org.sosy_lab.java_smt.api.Model
+
+
Iterate over all values present in the model.
+
+
+ + + +

L

+
+
largerStackUsageTest() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
largeStackUsageTest() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
length(StringFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
length(StringFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
length(StringFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
length(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
lessOrEquals(BitvectorFormula, BitvectorFormula, boolean) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
Compare the given bitvectors.
+
+
lessOrEquals(BitvectorFormula, BitvectorFormula, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
lessOrEquals(BitvectorFormula, BitvectorFormula, boolean) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
lessOrEquals(FloatingPointFormula, FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
lessOrEquals(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
lessOrEquals(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
lessOrEquals(StringFormula, StringFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
lessOrEquals(StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
lessOrEquals(StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
lessOrEquals(ParamFormulaType, ParamFormulaType) - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
 
+
lessOrEquals(ParamFormulaType, ParamFormulaType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
lessOrEquals(ParamFormulaType, ParamFormulaType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
lessOrEquals(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
lessOrEquals(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
lessOrEquals(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
lessOrEquals(TFormulaInfo, TFormulaInfo, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
lessThan(BitvectorFormula, BitvectorFormula, boolean) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
Compare the given bitvectors.
+
+
lessThan(BitvectorFormula, BitvectorFormula, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
lessThan(BitvectorFormula, BitvectorFormula, boolean) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
lessThan(FloatingPointFormula, FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
lessThan(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
lessThan(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
lessThan(StringFormula, StringFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
lessThan(StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
lessThan(StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
lessThan(ParamFormulaType, ParamFormulaType) - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
 
+
lessThan(ParamFormulaType, ParamFormulaType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
lessThan(ParamFormulaType, ParamFormulaType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
lessThan(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
lessThan(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
lessThan(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
lessThan(TFormulaInfo, TFormulaInfo, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
loadLibrariesWithFallback(Consumer<String>, List<String>, List<String>) - Static method in class org.sosy_lab.java_smt.basicimpl.AbstractSolverContext
+
+
This method loads the given libraries.
+
+
logger - Variable in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
LoggingSolverContext - Class in org.sosy_lab.java_smt.delegate.logging
+
+
SolverContext that wraps all prover environments in their logging versions.
+
+
LoggingSolverContext(LogManager, SolverContext) - Constructor for class org.sosy_lab.java_smt.delegate.logging.LoggingSolverContext
+
 
+
logicToUse() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
+
This method is only called, if OpenSMT is called.
+
+
lower(int, Rational) - Method in interface org.sosy_lab.java_smt.api.OptimizationProverEnvironment
+
 
+
lower(int, Rational) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingOptimizationProverEnvironment
+
 
+
LT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Less-than over integers and rationals.
+
+
LTE - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Less-than-or-equal over integers and rationals.
+
+
+ + + +

M

+
+
main(String...) - Static method in class org.sosy_lab.java_smt.example.AllSatExample
+
 
+
main(String...) - Static method in class org.sosy_lab.java_smt.example.Binoxxo
+
 
+
main(String...) - Static method in class org.sosy_lab.java_smt.example.FormulaClassifier
+
 
+
main(String...) - Static method in class org.sosy_lab.java_smt.example.HoudiniApp
+
 
+
main(String...) - Static method in class org.sosy_lab.java_smt.example.Interpolation
+
 
+
main(String...) - Static method in class org.sosy_lab.java_smt.example.nqueens_user_propagator.NQueens
+
 
+
main(String...) - Static method in class org.sosy_lab.java_smt.example.NQueens
+
 
+
main(String...) - Static method in class org.sosy_lab.java_smt.example.OptimizationFormulaWeights
+
 
+
main(String...) - Static method in class org.sosy_lab.java_smt.example.OptimizationIntReal
+
 
+
main(String...) - Static method in class org.sosy_lab.java_smt.example.PrettyPrinter
+
 
+
main(String[]) - Static method in class org.sosy_lab.java_smt.example.SimpleUserPropagator
+
 
+
main(String[]) - Static method in class org.sosy_lab.java_smt.example.SolverOverviewTable
+
 
+
main(String...) - Static method in class org.sosy_lab.java_smt.example.Sudoku
+
 
+
makeApplication(FunctionDeclaration<T>, List<? extends Formula>) - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Create a function application to the given list of arguments.
+
+
makeApplication(FunctionDeclaration<T>, List<? extends Formula>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
makeApplication(FunctionDeclaration<T>, List<? extends Formula>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
makeApplication(FunctionDeclaration<T>, Formula...) - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Create a function application to the given list of arguments.
+
+
makeApplication(FunctionDeclaration<T>, Formula...) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
makeApplication(FunctionDeclaration<T>, Formula...) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
makeArray(FTI, FTE, TE) - Method in interface org.sosy_lab.java_smt.api.ArrayFormulaManager
+
+
Create a new array constant with values initialized to defaultElement.
+
+
makeArray(FTI, FTE, TE) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractArrayFormulaManager
+
 
+
makeArray(FTI, FTE, TE) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingArrayFormulaManager
+
 
+
makeArray(String, FTI, FTE) - Method in interface org.sosy_lab.java_smt.api.ArrayFormulaManager
+
+
Declare a new array with exactly the given name.
+
+
makeArray(String, FTI, FTE) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractArrayFormulaManager
+
 
+
makeArray(String, FTI, FTE) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingArrayFormulaManager
+
 
+
makeArray(String, FormulaType.ArrayFormulaType<TI, TE>) - Method in interface org.sosy_lab.java_smt.api.ArrayFormulaManager
+
+
Declare a new array with exactly the given name.
+
+
makeArray(String, FormulaType.ArrayFormulaType<TI, TE>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingArrayFormulaManager
+
 
+
makeArray(FormulaType.ArrayFormulaType<TI, TE>, TE) - Method in interface org.sosy_lab.java_smt.api.ArrayFormulaManager
+
+
Create a new array constant with values initialized to defaultElement.
+
+
makeBitvector(int, long) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
Convert a number into a bitvector with given size.
+
+
makeBitvector(int, long) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
makeBitvector(int, long) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
makeBitvector(int, BigInteger) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
Convert a number into a bitvector with given size.
+
+
makeBitvector(int, BigInteger) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
makeBitvector(int, BigInteger) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
makeBitvector(int, NumeralFormula.IntegerFormula) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
Convert/Cast/Interpret a numeral formula into a bitvector with given size.
+
+
makeBitvector(int, NumeralFormula.IntegerFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
makeBitvector(int, NumeralFormula.IntegerFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
makeBitvectorImpl(int, long) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
makeBitvectorImpl(int, BigInteger) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
makeBitvectorImpl(int, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
makeBoolean(boolean) - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
+
Returns a BooleanFormula representing the given value.
+
+
makeBooleanImpl(boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
makeConstant(String, FormulaType.EnumerationFormulaType) - Method in interface org.sosy_lab.java_smt.api.EnumerationFormulaManager
+
+
Creates a constant of given enumeration type with exactly the given name.
+
+
makeConstant(String, FormulaType.EnumerationFormulaType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEnumerationFormulaManager
+
 
+
makeConstant(String, FormulaType.EnumerationFormulaType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingEnumerationFormulaManager
+
 
+
makeConstant(String, FormulaType.EnumerationFormulaType) - Method in class org.sosy_lab.java_smt.delegate.statistics.StatisticsEnumerationFormulaManager
+
 
+
makeConstant(String, FormulaType.EnumerationFormulaType) - Method in class org.sosy_lab.java_smt.delegate.synchronize.SynchronizedEnumerationFormulaManager
+
 
+
makeConstantImpl(String, FormulaType.EnumerationFormulaType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEnumerationFormulaManager
+
 
+
makeEmptyHeap(AT, VT) - Method in interface org.sosy_lab.java_smt.api.SLFormulaManager
+
 
+
makeEmptyHeap(AT, VT) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractSLFormulaManager
+
 
+
makeEmptyHeap(AT, VT) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingSLFormulaManager
+
 
+
makeEmptyHeap(TType, TType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractSLFormulaManager
+
 
+
makeFalse() - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
+
Shortcut for makeBoolean(false).
+
+
makeFalse() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
makeFalse() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
makeMagicWand(BooleanFormula, BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.SLFormulaManager
+
 
+
makeMagicWand(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractSLFormulaManager
+
 
+
makeMagicWand(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingSLFormulaManager
+
 
+
makeMagicWand(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractSLFormulaManager
+
 
+
makeMinusInfinity(FormulaType.FloatingPointType) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
makeMinusInfinity(FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
makeMinusInfinity(FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
makeMinusInfinityImpl(FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
makeNaN(FormulaType.FloatingPointType) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
makeNaN(FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
makeNaN(FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
makeNaNImpl(FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
makeNilElement(AT) - Method in interface org.sosy_lab.java_smt.api.SLFormulaManager
+
 
+
makeNilElement(AT) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractSLFormulaManager
+
 
+
makeNilElement(AT) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingSLFormulaManager
+
 
+
makeNilElement(TType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractSLFormulaManager
+
 
+
makeNumber(double) - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
+
Create a numeric literal with a given value.
+
+
makeNumber(double) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
makeNumber(double) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
makeNumber(double, FormulaType.FloatingPointType) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
+
Creates a floating point formula representing the given double value with the specified type.
+
+
makeNumber(double, FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
makeNumber(double, FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
makeNumber(double, FormulaType.FloatingPointType, FloatingPointRoundingMode) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
+
Creates a floating point formula representing the given double value with the specified type + and rounding mode.
+
+
makeNumber(double, FormulaType.FloatingPointType, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
makeNumber(double, FormulaType.FloatingPointType, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
makeNumber(long) - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
 
+
makeNumber(long) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
makeNumber(long) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
makeNumber(String) - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
 
+
makeNumber(String) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
makeNumber(String) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
makeNumber(String, FormulaType.FloatingPointType) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
+
Creates a floating point formula representing the given string value with the specified type.
+
+
makeNumber(String, FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
makeNumber(String, FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
makeNumber(String, FormulaType.FloatingPointType, FloatingPointRoundingMode) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
+
Creates a floating point formula representing the given string value with the specified type + and rounding mode.
+
+
makeNumber(String, FormulaType.FloatingPointType, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
makeNumber(String, FormulaType.FloatingPointType, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
makeNumber(BigDecimal) - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
+
Create a numeric literal with a given value.
+
+
makeNumber(BigDecimal) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
makeNumber(BigDecimal) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
makeNumber(BigDecimal, FormulaType.FloatingPointType) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
+
Creates a floating point formula representing the given BigDecimal value with the specified + type.
+
+
makeNumber(BigDecimal, FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
makeNumber(BigDecimal, FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
makeNumber(BigDecimal, FormulaType.FloatingPointType, FloatingPointRoundingMode) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
+
Creates a floating point formula representing the given BigDecimal value with the specified + type and rounding mode.
+
+
makeNumber(BigDecimal, FormulaType.FloatingPointType, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
makeNumber(BigDecimal, FormulaType.FloatingPointType, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
makeNumber(BigInteger) - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
 
+
makeNumber(BigInteger) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
makeNumber(BigInteger) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
makeNumber(BigInteger, BigInteger, boolean, FormulaType.FloatingPointType) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
+
Creates a floating point formula from the given exponent, mantissa, and sign bit with the + specified type.
+
+
makeNumber(BigInteger, BigInteger, boolean, FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
makeNumber(BigInteger, BigInteger, boolean, FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
makeNumber(Rational) - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
 
+
makeNumber(Rational) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
makeNumber(Rational) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
makeNumber(Rational, FormulaType.FloatingPointType) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
+
Creates a floating point formula representing the given Rational value with the specified type.
+
+
makeNumber(Rational, FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
makeNumber(Rational, FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
makeNumber(Rational, FormulaType.FloatingPointType, FloatingPointRoundingMode) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
+
Creates a floating point formula representing the given Rational value with the specified type + and rounding mode.
+
+
makeNumber(Rational, FormulaType.FloatingPointType, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
makeNumber(Rational, FormulaType.FloatingPointType, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
makeNumberAndRound(String, FormulaType.FloatingPointType, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
makeNumberImpl(double) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
makeNumberImpl(double, FormulaType.FloatingPointType, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
makeNumberImpl(long) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
makeNumberImpl(String) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
makeNumberImpl(String, FormulaType.FloatingPointType, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
+
directly catch the most common special String constants.
+
+
makeNumberImpl(BigDecimal) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
makeNumberImpl(BigDecimal, FormulaType.FloatingPointType, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
makeNumberImpl(BigInteger) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
makeNumberImpl(BigInteger, BigInteger, boolean, FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
makeNumberImpl(Rational) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
makePlusInfinity(FormulaType.FloatingPointType) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
makePlusInfinity(FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
makePlusInfinity(FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
makePlusInfinityImpl(FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
makePointsTo(AF, VF) - Method in interface org.sosy_lab.java_smt.api.SLFormulaManager
+
 
+
makePointsTo(AF, VF) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingSLFormulaManager
+
 
+
makePointsTo(Formula, Formula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractSLFormulaManager
+
 
+
makePointsTo(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractSLFormulaManager
+
 
+
makeRegex(String) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
+
Returns a RegexFormula representing the given constant.
+
+
makeRegex(String) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
makeRegex(String) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
makeRegexImpl(String) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
makeStar(BooleanFormula, BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.SLFormulaManager
+
 
+
makeStar(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractSLFormulaManager
+
 
+
makeStar(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingSLFormulaManager
+
 
+
makeStar(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractSLFormulaManager
+
 
+
makeString(String) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
+
Returns a StringFormula representing the given constant.
+
+
makeString(String) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
makeString(String) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
makeStringImpl(String) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
makeTrue() - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
+
Shortcut for makeBoolean(true).
+
+
makeTrue() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
makeTrue() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
makeVariable(int, String) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
Creates a variable with exactly the given name and bitwidth.
+
+
makeVariable(int, String) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
makeVariable(int, String) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
makeVariable(String) - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
+
Creates a variable with exactly the given name.
+
+
makeVariable(String) - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
+
Creates a variable with exactly the given name.
+
+
makeVariable(String) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
+
Creates a variable of type String with exactly the given name.
+
+
makeVariable(String) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
makeVariable(String) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
makeVariable(String) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
makeVariable(String) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
makeVariable(String) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
makeVariable(String) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
makeVariable(String, FormulaType.EnumerationFormulaType) - Method in interface org.sosy_lab.java_smt.api.EnumerationFormulaManager
+
+
Creates a variable of given enumeration type with exactly the given name.
+
+
makeVariable(String, FormulaType.EnumerationFormulaType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEnumerationFormulaManager
+
 
+
makeVariable(String, FormulaType.EnumerationFormulaType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingEnumerationFormulaManager
+
 
+
makeVariable(String, FormulaType.EnumerationFormulaType) - Method in class org.sosy_lab.java_smt.delegate.statistics.StatisticsEnumerationFormulaManager
+
 
+
makeVariable(String, FormulaType.EnumerationFormulaType) - Method in class org.sosy_lab.java_smt.delegate.synchronize.SynchronizedEnumerationFormulaManager
+
 
+
makeVariable(String, FormulaType.FloatingPointType) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
+
Creates a variable with exactly the given name.
+
+
makeVariable(String, FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
makeVariable(String, FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
makeVariable(FormulaType.BitvectorType, String) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
 
+
makeVariable(FormulaType.BitvectorType, String) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
makeVariable(FormulaType.BitvectorType, String) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
makeVariable(FormulaType<T>, String) - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Create variable of the type equal to formulaType.
+
+
makeVariable(FormulaType<T>, String) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
makeVariable(FormulaType<T>, String) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
makeVariable(TType, String) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
makeVariableImpl(int, String) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
makeVariableImpl(String) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
makeVariableImpl(String) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
makeVariableImpl(String) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
makeVariableImpl(String, FormulaType.EnumerationFormulaType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractEnumerationFormulaManager
+
 
+
makeVariableImpl(String, FormulaType.FloatingPointType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
MATHSAT5 - org.sosy_lab.java_smt.SolverContextFactory.Solvers
+
 
+
max(FloatingPointFormula, FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
max(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
max(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
max(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
maximize(Formula) - Method in interface org.sosy_lab.java_smt.api.OptimizationProverEnvironment
+
+
Add the maximization objective.
+
+
maximize(Formula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingOptimizationProverEnvironment
+
 
+
mgr - Variable in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
min(FloatingPointFormula, FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
min(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
min(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
min(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
minimize(Formula) - Method in interface org.sosy_lab.java_smt.api.OptimizationProverEnvironment
+
+
Add minimization objective.
+
+
minimize(Formula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingOptimizationProverEnvironment
+
 
+
mkQuantifier(QuantifiedFormulaManager.Quantifier, List<? extends Formula>, BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.QuantifiedFormulaManager
+
 
+
mkQuantifier(QuantifiedFormulaManager.Quantifier, List<? extends Formula>, BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractQuantifiedFormulaManager
+
 
+
mkQuantifier(QuantifiedFormulaManager.Quantifier, List<? extends Formula>, BooleanFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingQuantifiedFormulaManager
+
 
+
mkQuantifier(QuantifiedFormulaManager.Quantifier, List<TFormulaInfo>, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractQuantifiedFormulaManager
+
 
+
Model - Interface in org.sosy_lab.java_smt.api
+
+
This class provides a model with concrete evaluations for symbols and formulas from the + satisfiable solver environment.
+
+
Model.ValueAssignment - Class in org.sosy_lab.java_smt.api
+
 
+
modelForSatFormula() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
modelForSatFormulaWithLargeValue() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
modelForSatFormulaWithUF() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
modelForUnsatFormula() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
modelForUnsatFormula2() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
modelSet - Variable in class org.sosy_lab.java_smt.example.nqueens_user_propagator.NQueensEnumeratingPropagator
+
 
+
modularCongruence(NumeralFormula.IntegerFormula, NumeralFormula.IntegerFormula, long) - Method in interface org.sosy_lab.java_smt.api.IntegerFormulaManager
+
+
Create a term representing the constraint number1 == number2 (mod n).
+
+
modularCongruence(NumeralFormula.IntegerFormula, NumeralFormula.IntegerFormula, long) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingIntegerFormulaManager
+
 
+
modularCongruence(NumeralFormula.IntegerFormula, NumeralFormula.IntegerFormula, BigInteger) - Method in interface org.sosy_lab.java_smt.api.IntegerFormulaManager
+
+
Create a term representing the constraint number1 == number2 (mod n).
+
+
modularCongruence(NumeralFormula.IntegerFormula, NumeralFormula.IntegerFormula, BigInteger) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingIntegerFormulaManager
+
 
+
modularCongruence(ParamFormulaType, ParamFormulaType, long) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
modularCongruence(ParamFormulaType, ParamFormulaType, BigInteger) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
modularCongruence(TFormulaInfo, TFormulaInfo, long) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
modularCongruence(TFormulaInfo, TFormulaInfo, BigInteger) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
modulo(BitvectorFormula, BitvectorFormula, boolean) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
Deprecated, for removal: This API element is subject to removal in a future version.
+
+
modulo(NumeralFormula.IntegerFormula, NumeralFormula.IntegerFormula) - Method in interface org.sosy_lab.java_smt.api.IntegerFormulaManager
+
+
Create a formula representing the modulo of two operands according to Boute's Euclidean + definition.
+
+
modulo(NumeralFormula.IntegerFormula, NumeralFormula.IntegerFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingIntegerFormulaManager
+
 
+
modulo(ParamFormulaType, ParamFormulaType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
modulo(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
+
If a solver does not support this operation, e.g.
+
+
MODULO - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Modulo operator over integers.
+
+
MUL - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Multiplication over integers and rationals.
+
+
multiCloseTest() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
multiply(BitvectorFormula, BitvectorFormula) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
This method returns the multiplication of the given bitvectors.
+
+
multiply(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
multiply(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
multiply(FloatingPointFormula, FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
multiply(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
multiply(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
multiply(FloatingPointFormula, FloatingPointFormula, FloatingPointRoundingMode) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
multiply(FloatingPointFormula, FloatingPointFormula, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
multiply(FloatingPointFormula, FloatingPointFormula, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
multiply(ParamFormulaType, ParamFormulaType) - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
 
+
multiply(ParamFormulaType, ParamFormulaType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
multiply(ParamFormulaType, ParamFormulaType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
multiply(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
multiply(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
+
If a solver does not support this operation, e.g.
+
+
multiply(TFormulaInfo, TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
multiStackTest() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
+ + + +

N

+
+
NEAREST_TIES_AWAY - org.sosy_lab.java_smt.api.FloatingPointRoundingMode
+
 
+
NEAREST_TIES_TO_EVEN - org.sosy_lab.java_smt.api.FloatingPointRoundingMode
+
 
+
negate(BitvectorFormula) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
This method returns the negated number, i.e., it is multiplied by "-1".
+
+
negate(BitvectorFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
negate(BitvectorFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
negate(FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
negate(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
negate(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
negate(ParamFormulaType) - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
 
+
negate(ParamFormulaType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
negate(ParamFormulaType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
negate(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
negate(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
negate(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
newEnvironmentForTest(SolverContext, SolverContext.ProverOptions...) - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
newOptimizationProverEnvironment(SolverContext.ProverOptions...) - Method in interface org.sosy_lab.java_smt.api.SolverContext
+
+
Create a fresh new OptimizationProverEnvironment which encapsulates an assertion stack + and allows solving optimization queries.
+
+
newOptimizationProverEnvironment(SolverContext.ProverOptions...) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractSolverContext
+
 
+
newOptimizationProverEnvironment(SolverContext.ProverOptions...) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingSolverContext
+
 
+
newOptimizationProverEnvironment(SolverContext.ProverOptions...) - Method in class org.sosy_lab.java_smt.delegate.logging.LoggingSolverContext
+
 
+
newOptimizationProverEnvironment(SolverContext.ProverOptions...) - Method in class org.sosy_lab.java_smt.delegate.statistics.StatisticsSolverContext
+
 
+
newOptimizationProverEnvironment(SolverContext.ProverOptions...) - Method in class org.sosy_lab.java_smt.delegate.synchronize.SynchronizedSolverContext
+
 
+
newOptimizationProverEnvironment0(Set<SolverContext.ProverOptions>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractSolverContext
+
 
+
newProverEnvironment(SolverContext.ProverOptions...) - Method in interface org.sosy_lab.java_smt.api.SolverContext
+
+
Create a fresh new ProverEnvironment which encapsulates an assertion stack and can be + used to check formulas for unsatisfiability.
+
+
newProverEnvironment(SolverContext.ProverOptions...) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractSolverContext
+
 
+
newProverEnvironment(SolverContext.ProverOptions...) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingSolverContext
+
 
+
newProverEnvironment(SolverContext.ProverOptions...) - Method in class org.sosy_lab.java_smt.delegate.logging.LoggingSolverContext
+
 
+
newProverEnvironment(SolverContext.ProverOptions...) - Method in class org.sosy_lab.java_smt.delegate.statistics.StatisticsSolverContext
+
 
+
newProverEnvironment(SolverContext.ProverOptions...) - Method in class org.sosy_lab.java_smt.delegate.synchronize.SynchronizedSolverContext
+
 
+
newProverEnvironment0(Set<SolverContext.ProverOptions>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractSolverContext
+
 
+
newProverEnvironmentWithInterpolation(SolverContext.ProverOptions...) - Method in interface org.sosy_lab.java_smt.api.SolverContext
+
+
Create a fresh new InterpolatingProverEnvironment which encapsulates an assertion stack + and allows generating and retrieve interpolants for unsatisfiable formulas.
+
+
newProverEnvironmentWithInterpolation(SolverContext.ProverOptions...) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractSolverContext
+
 
+
newProverEnvironmentWithInterpolation(SolverContext.ProverOptions...) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingSolverContext
+
 
+
newProverEnvironmentWithInterpolation(SolverContext.ProverOptions...) - Method in class org.sosy_lab.java_smt.delegate.logging.LoggingSolverContext
+
 
+
newProverEnvironmentWithInterpolation(SolverContext.ProverOptions...) - Method in class org.sosy_lab.java_smt.delegate.statistics.StatisticsSolverContext
+
 
+
newProverEnvironmentWithInterpolation(SolverContext.ProverOptions...) - Method in class org.sosy_lab.java_smt.delegate.synchronize.SynchronizedSolverContext
+
 
+
newProverEnvironmentWithInterpolation0(Set<SolverContext.ProverOptions>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractSolverContext
+
 
+
NNF - org.sosy_lab.java_smt.api.Tactic
+
+
Convert the formula to NNF (negated normal form).
+
+
NNFVisitor - Class in org.sosy_lab.java_smt.basicimpl.tactics
+
 
+
NNFVisitor(FormulaManager) - Constructor for class org.sosy_lab.java_smt.basicimpl.tactics.NNFVisitor
+
 
+
NO_MODEL_HELP - Static variable in interface org.sosy_lab.java_smt.api.BasicProverEnvironment
+
 
+
none() - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
none() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
none() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
noneImpl() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
not(BitvectorFormula) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
This method returns the bit-wise complement of the given bitvector.
+
+
not(BitvectorFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
not(BitvectorFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
not(BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
+
Creates a formula representing a negation of the argument.
+
+
not(BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
not(BooleanFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
not(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
not(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
NOT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
notifyOnDecision() - Method in interface org.sosy_lab.java_smt.api.PropagatorBackend
+
+
Enables tracking of decisions made for the associated UserPropagator via UserPropagator.onDecision(BooleanFormula, boolean).
+
+
notifyOnFinalCheck() - Method in interface org.sosy_lab.java_smt.api.PropagatorBackend
+
+
Enables the final callback UserPropagator.onFinalCheck() that is invoked when the + solver finds a full satisfying assignment.
+
+
notifyOnKnownValue() - Method in interface org.sosy_lab.java_smt.api.PropagatorBackend
+
+
Enables tracking of expression values for the associated UserPropagator via UserPropagator.onKnownValue(org.sosy_lab.java_smt.api.BooleanFormula, boolean).
+
+
NQueens - Class in org.sosy_lab.java_smt.example
+
+
This example program solves a NQueens problem of given size and prints a possible solution.
+
+
NQueens - Class in org.sosy_lab.java_smt.example.nqueens_user_propagator
+
+
This example program solves a NQueens problem of given size and prints a possible solution.
+
+
NQueens(SolverContext, int) - Constructor for class org.sosy_lab.java_smt.example.nqueens_user_propagator.NQueens
+
 
+
NQueensConstraintPropagator - Class in org.sosy_lab.java_smt.example.nqueens_user_propagator
+
+
In addition to the enumeration done by NQueensEnumeratingPropagator, this propagator also + enforces the queen placement constraints without explicit encoding.
+
+
NQueensConstraintPropagator(BooleanFormula[][]) - Constructor for class org.sosy_lab.java_smt.example.nqueens_user_propagator.NQueensConstraintPropagator
+
 
+
NQueensEnumeratingPropagator - Class in org.sosy_lab.java_smt.example.nqueens_user_propagator
+
+
This propagator enumerates the solutions of the NQueens problem by raising a conflict whenever + the solver finds a model.
+
+
NQueensEnumeratingPropagator() - Constructor for class org.sosy_lab.java_smt.example.nqueens_user_propagator.NQueensEnumeratingPropagator
+
 
+
NumeralFormula - Interface in org.sosy_lab.java_smt.api
+
+
Formulas of any numeral sort.
+
+
NumeralFormula.IntegerFormula - Interface in org.sosy_lab.java_smt.api
+
 
+
NumeralFormula.RationalFormula - Interface in org.sosy_lab.java_smt.api
+
 
+
NumeralFormulaManager<ParamFormulaType extends NumeralFormula,​ResultFormulaType extends NumeralFormula> - Interface in org.sosy_lab.java_smt.api
+
+
This interface represents the Numeral Theory.
+
+
NumeralType() - Constructor for class org.sosy_lab.java_smt.api.FormulaType.NumeralType
+
 
+
+ + + +

O

+
+
of(boolean, BigInteger, BigInteger, int, int) - Static method in class org.sosy_lab.java_smt.api.FloatingPointNumber
+
 
+
of(String, int, int) - Static method in class org.sosy_lab.java_smt.api.FloatingPointNumber
+
 
+
of(String, FunctionDeclarationKind, List<FormulaType<?>>, FormulaType<F>, T) - Static method in class org.sosy_lab.java_smt.basicimpl.FunctionDeclarationImpl
+
 
+
onDecision(BooleanFormula, boolean) - Method in interface org.sosy_lab.java_smt.api.UserPropagator
+
+
This callback is invoked if the solver decides to branch on a registered expression.
+
+
onDecision(BooleanFormula, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractUserPropagator
+
 
+
onFinalCheck() - Method in interface org.sosy_lab.java_smt.api.UserPropagator
+
+
This callback is invoked when the solver finds a complete satisfying assignment.
+
+
onFinalCheck() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractUserPropagator
+
 
+
onFinalCheck() - Method in class org.sosy_lab.java_smt.example.nqueens_user_propagator.NQueensEnumeratingPropagator
+
 
+
onKnownValue(BooleanFormula, boolean) - Method in interface org.sosy_lab.java_smt.api.UserPropagator
+
+
This callback is invoked if the solver gets to know the value of a registered expression + (UserPropagator.registerExpression(org.sosy_lab.java_smt.api.BooleanFormula)).
+
+
onKnownValue(BooleanFormula, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractUserPropagator
+
 
+
onKnownValue(BooleanFormula, boolean) - Method in class org.sosy_lab.java_smt.example.nqueens_user_propagator.NQueensConstraintPropagator
+
 
+
onKnownValue(BooleanFormula, boolean) - Method in class org.sosy_lab.java_smt.example.nqueens_user_propagator.NQueensEnumeratingPropagator
+
 
+
onPop(int) - Method in interface org.sosy_lab.java_smt.api.UserPropagator
+
+
This callback is invoked when the solver backtracks.
+
+
onPop(int) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractUserPropagator
+
 
+
onPop(int) - Method in class org.sosy_lab.java_smt.example.nqueens_user_propagator.NQueensEnumeratingPropagator
+
 
+
onPush() - Method in interface org.sosy_lab.java_smt.api.UserPropagator
+
+
This callback is invoked whenever the solver creates a new decision level.
+
+
onPush() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractUserPropagator
+
 
+
onPush() - Method in class org.sosy_lab.java_smt.example.nqueens_user_propagator.NQueensEnumeratingPropagator
+
 
+
OPENSMT - org.sosy_lab.java_smt.SolverContextFactory.Solvers
+
 
+
OPT - org.sosy_lab.java_smt.api.OptimizationProverEnvironment.OptStatus
+
+
The solution was found (may be unbounded).
+
+
OptimizationFormulaWeights - Class in org.sosy_lab.java_smt.example
+
+
Example for optimizing the weight of some constraints.
+
+
OptimizationIntReal - Class in org.sosy_lab.java_smt.example
+
+
Example for optimizing 'x' with the constraint '0 <= x < 10'.
+
+
OptimizationProverEnvironment - Interface in org.sosy_lab.java_smt.api
+
+
Interface for optimization modulo SMT.
+
+
OptimizationProverEnvironment.OptStatus - Enum in org.sosy_lab.java_smt.api
+
+
Status of the optimization problem.
+
+
optional(RegexFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
optional(RegexFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
optional(RegexFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
or(Collection<BooleanFormula>) - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
 
+
or(Collection<BooleanFormula>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
or(Collection<BooleanFormula>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
or(BitvectorFormula, BitvectorFormula) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
This method returns the bit-wise OR of the given bitvectors.
+
+
or(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
or(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
or(BooleanFormula...) - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
 
+
or(BooleanFormula...) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
or(BooleanFormula...) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
or(BooleanFormula, BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
+
Creates a formula representing an OR of the two arguments.
+
+
or(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
or(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
or(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
or(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
OR - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
org.sosy_lab.java_smt - package org.sosy_lab.java_smt
+
+
JavaSMT: a generic SMT solver API.
+
+
org.sosy_lab.java_smt.api - package org.sosy_lab.java_smt.api
+
+
The core interfaces for abstracting from SMT solvers and providing a common API for all solvers.
+
+
org.sosy_lab.java_smt.api.visitors - package org.sosy_lab.java_smt.api.visitors
+
+
The visitors of this package allow for efficient traversal, manipulation and transformation of + formulas.
+
+
org.sosy_lab.java_smt.basicimpl - package org.sosy_lab.java_smt.basicimpl
+
+
Abstract base classes for easier implementation of a solver backend.
+
+
org.sosy_lab.java_smt.basicimpl.tactics - package org.sosy_lab.java_smt.basicimpl.tactics
+
+
Default tactics implementations (formula-to-formula transformations).
+
+
org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper - package org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper
+
+
Wrapper-classes to guarantee identical behavior for all solvers.
+
+
org.sosy_lab.java_smt.delegate.debugging - package org.sosy_lab.java_smt.delegate.debugging
+
 
+
org.sosy_lab.java_smt.delegate.logging - package org.sosy_lab.java_smt.delegate.logging
+
+
Wraps the proving environment with loggers.
+
+
org.sosy_lab.java_smt.delegate.statistics - package org.sosy_lab.java_smt.delegate.statistics
+
+
The classes of this package wrap the whole proving environment and measure all accesses to it.
+
+
org.sosy_lab.java_smt.delegate.synchronize - package org.sosy_lab.java_smt.delegate.synchronize
+
+
The classes of this package wrap the whole solver context and all corresponding proving + environment and synchronize all accesses to it.
+
+
org.sosy_lab.java_smt.example - package org.sosy_lab.java_smt.example
+
+
Some basic examples for using Java-SMT.
+
+
org.sosy_lab.java_smt.example.nqueens_user_propagator - package org.sosy_lab.java_smt.example.nqueens_user_propagator
+
+
Some basic examples for using Java-SMT.
+
+
org.sosy_lab.java_smt.test - package org.sosy_lab.java_smt.test
+
+
Solver-independent tests and test utilities for the solver API.
+
+
org.sosy_lab.java_smt.utils - package org.sosy_lab.java_smt.utils
+
+
Utility classes implementing algorithms based on the API of JavaSMT.
+
+
orImpl(Collection<TFormulaInfo>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
+
Create an n-ary disjunction.
+
+
OTHER - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Solvers support a lot of different built-in theories.
+
+
+ + + +

P

+
+
ParameterizedSolverBasedTest0() - Constructor for class org.sosy_lab.java_smt.test.SolverBasedTest0.ParameterizedSolverBasedTest0
+
 
+
parse(String) - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Parse a boolean formula given as a String in an SMTLIB file format.
+
+
parse(String) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
pop() - Method in interface org.sosy_lab.java_smt.api.BasicProverEnvironment
+
+
Remove one backtracking point/level from the current stack.
+
+
pop() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
pop() - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.BasicProverWithAssumptionsWrapper
+
 
+
popImpl() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
prefix(StringFormula, StringFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
+
Check whether the given prefix is a real prefix of str.
+
+
prefix(StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
prefix(StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
prefix(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
prettyPrinter(FormulaManager) - Static method in class org.sosy_lab.java_smt.utils.SolverUtils
+
+
Creates a new PrettyPrinter instance.
+
+
PrettyPrinter - Class in org.sosy_lab.java_smt.example
+
+
This program parses user-given formulas and prints them in a pretty format.
+
+
PrettyPrinter - Class in org.sosy_lab.java_smt.utils
+
 
+
PrettyPrinter(FormulaManager) - Constructor for class org.sosy_lab.java_smt.utils.PrettyPrinter
+
 
+
PrettyPrinter.PrinterOption - Enum in org.sosy_lab.java_smt.utils
+
 
+
PRINCESS - org.sosy_lab.java_smt.SolverContextFactory.Solvers
+
 
+
propagateConflict(BooleanFormula[]) - Method in interface org.sosy_lab.java_smt.api.PropagatorBackend
+
+
Raises a conflict caused by a set of conflicting assignments.
+
+
propagateConsequence(BooleanFormula[], BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.PropagatorBackend
+
+
Propagates a consequence implied by a set of assigned expressions.
+
+
propagateNextDecision(BooleanFormula, Optional<Boolean>) - Method in interface org.sosy_lab.java_smt.api.PropagatorBackend
+
+
Propagates a decision to be made by the solver.
+
+
PropagatorBackend - Interface in org.sosy_lab.java_smt.api
+
+
The PropagatorBackend class is used by UserPropagator to implement custom user + propagators.
+
+
ProverEnvironment - Interface in org.sosy_lab.java_smt.api
+
+
An interface to an incremental SMT solver with methods for pushing and popping formulas as well + as SAT checks.
+
+
proverEnvironments() - Static method in class org.sosy_lab.java_smt.test.ProverEnvironmentSubject
+
+
Use this for checking assertions about ProverEnvironments with Truth: + assert_().about(proverEnvironments()).that(stack).is...().
+
+
ProverEnvironmentSubject - Class in org.sosy_lab.java_smt.test
+
+
Subject subclass for testing assertions about ProverEnvironments with Truth (allows using + assert_().about(...).that(stack).isUnsatisfiable() etc.).
+
+
ProverWithAssumptionsWrapper - Class in org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper
+
 
+
ProverWithAssumptionsWrapper(ProverEnvironment) - Constructor for class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.ProverWithAssumptionsWrapper
+
 
+
push() - Method in interface org.sosy_lab.java_smt.api.BasicProverEnvironment
+
+
Create a new backtracking point, i.e., a new level on the assertion stack.
+
+
push() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
push() - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.BasicProverWithAssumptionsWrapper
+
 
+
push(BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.BasicProverEnvironment
+
+
Push a backtracking point and add a formula to the current stack, asserting it.
+
+
pushImpl() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
+ + + +

Q

+
+
QE_LIGHT - org.sosy_lab.java_smt.api.Tactic
+
+
Perform "best-effort" quantifier elimination: when the bound variable can be "cheaply" + eliminated using a pattern-matching approach, eliminate it, and otherwise leave it as-is.
+
+
qmgr - Variable in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
QuantifiedFormulaManager - Interface in org.sosy_lab.java_smt.api
+
+
This interface contains methods for working with any theory with quantifiers.
+
+
QuantifiedFormulaManager.Quantifier - Enum in org.sosy_lab.java_smt.api
+
 
+
+ + + +

R

+
+
range(char, char) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
range(StringFormula, StringFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
range(StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
range(StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
range(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
RationalFormulaManager - Interface in org.sosy_lab.java_smt.api
+
+
Interface for operating over NumeralFormula.RationalFormula.
+
+
RationalType - Static variable in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
RE_COMPLEMENT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
RE_CONCAT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
RE_DIFFERENCE - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
RE_INTERSECT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
RE_OPTIONAL - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
RE_PLUS - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
RE_RANGE - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
RE_STAR - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
RE_UNION - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
RegexFormula - Interface in org.sosy_lab.java_smt.api
+
+
A formula of the string sort.
+
+
RegexType - Static variable in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
registerEvaluator(E) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
+
This method registers the Evaluator to be cleaned up before the next change on the prover + stack.
+
+
registerExpression(BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.PropagatorBackend
+
+
Registers an expression to be observed by a UserPropagator.
+
+
registerExpression(BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.UserPropagator
+
+
Registers an expression to be observed by the UserPropagator.
+
+
registerExpression(BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractUserPropagator
+
 
+
registerPushedFormula(T) - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.BasicProverWithAssumptionsWrapper
+
+
overridden in sub-class.
+
+
registerPushedFormula(T) - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.InterpolatingProverWithAssumptionsWrapper
+
 
+
registerUserPropagator(UserPropagator) - Method in interface org.sosy_lab.java_smt.api.BasicProverEnvironment
+
+
Registers a UserPropagator for this prover environment.
+
+
remainder(BitvectorFormula, BitvectorFormula, boolean) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
This method returns the remainder for two bitvector formulas using the BitvectorFormulaManager.divide(BitvectorFormula, BitvectorFormula, boolean) operation.
+
+
remainder(BitvectorFormula, BitvectorFormula, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
remainder(BitvectorFormula, BitvectorFormula, boolean) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
remainder(FloatingPointFormula, FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
+
remainder: x - y * n, where n in Z is nearest to x/y.
+
+
remainder(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
remainder(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
remainder(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
remainder(TFormulaInfo, TFormulaInfo, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
replace(StringFormula, StringFormula, StringFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
+
Replace the first appearances of target in fullStr with the replacement.
+
+
replace(StringFormula, StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
replace(StringFormula, StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
replace(TFormulaInfo, TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
replaceAll(StringFormula, StringFormula, StringFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
+
Replace all appearances of target in fullStr with the replacement.
+
+
replaceAll(StringFormula, StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
replaceAll(StringFormula, StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
replaceAll(TFormulaInfo, TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
requireArrayModel() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
requireArrays() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
+
Skip test if the solver does not support arrays.
+
+
requireBitvectors() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
+
Skip test if the solver does not support bitvectors.
+
+
requireBitvectorToInt() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
requireEnumeration() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
+
Skip test if the solver does not support enumeration theory.
+
+
requireFloats() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
requireIntegers() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
+
Skip test if the solver does not support integers.
+
+
requireInterpolation() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
requireModel() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
requireOptimization() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
+
Skip test if the solver does not support optimization.
+
+
requireParser() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
requireQuantifiers() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
+
Skip test if the solver does not support quantifiers.
+
+
requireRationalFloor() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
requireRationals() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
+
Skip test if the solver does not support rationals.
+
+
requireStrings() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
+
Skip test if the solver does not support strings.
+
+
requireSubstitution() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
requireTheoryCombination() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
requireUfValuesInModel() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
requireUnsatCore() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
requireUnsatCoreOverAssumptions() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
requireUserPropagators() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
requireVisitor() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
rmgr - Variable in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
rotateLeft(BitvectorFormula, int) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
This method returns a term representing the left rotation (towards most-significant bit) of + number by toRotate.
+
+
rotateLeft(BitvectorFormula, int) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
rotateLeft(BitvectorFormula, int) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
rotateLeft(BitvectorFormula, BitvectorFormula) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
This method returns a term representing the left rotation (towards most-significant bit) of + number by toRotate.
+
+
rotateLeft(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
rotateLeft(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
rotateLeft(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
rotateLeftByConstant(TFormulaInfo, int) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
rotateRight(BitvectorFormula, int) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
This method returns a term representing the right rotation (towards least-significant bit) of + number by toRotate.
+
+
rotateRight(BitvectorFormula, int) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
rotateRight(BitvectorFormula, int) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
rotateRight(BitvectorFormula, BitvectorFormula) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
This method returns a term representing the right rotation (towards least-significant bit) of + number by toRotate.
+
+
rotateRight(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
rotateRight(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
rotateRight(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
rotateRightByConstant(TFormulaInfo, int) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
round(FloatingPointFormula, FloatingPointRoundingMode) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
round(FloatingPointFormula, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
round(FloatingPointFormula, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
round(TFormulaInfo, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
RowBuilder() - Constructor for class org.sosy_lab.java_smt.example.SolverOverviewTable.RowBuilder
+
+
The constructor builds the header of the table.
+
+
+ + + +

S

+
+
satTestBool5() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
select(ArrayFormula<TI, TE>, TI) - Method in interface org.sosy_lab.java_smt.api.ArrayFormulaManager
+
+
Read a value that is stored in the array at the specified position.
+
+
select(ArrayFormula<TI, TE>, TI) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractArrayFormulaManager
+
 
+
select(ArrayFormula<TI, TE>, TI) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingArrayFormulaManager
+
 
+
select(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractArrayFormulaManager
+
 
+
SELECT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
shiftLeft(BitvectorFormula, BitvectorFormula) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
This method returns a term representing the left shift (towards most-significant bit) of number + by toShift.
+
+
shiftLeft(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
shiftLeft(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
shiftLeft(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
shiftRight(BitvectorFormula, BitvectorFormula, boolean) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
This method returns a term representing the right shift (towards least-significant bit) of + number by toShift.
+
+
shiftRight(BitvectorFormula, BitvectorFormula, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
+
Return a term representing the (arithmetic if signed is true) right shift of number by toShift.
+
+
shiftRight(BitvectorFormula, BitvectorFormula, boolean) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
shiftRight(TFormulaInfo, TFormulaInfo, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
ShutdownHook - Class in org.sosy_lab.java_smt.basicimpl
+
+
A utility class for interrupting a parallel running solver thread.
+
+
ShutdownHook(ShutdownNotifier, Runnable) - Constructor for class org.sosy_lab.java_smt.basicimpl.ShutdownHook
+
 
+
shutdownManager - Variable in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
shutdownNotifier - Variable in class org.sosy_lab.java_smt.basicimpl.AbstractProverWithAllSat
+
 
+
shutdownNotifierToUse() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
shutdownRequested(String) - Method in class org.sosy_lab.java_smt.basicimpl.ShutdownHook
+
 
+
simpleStackTestBool() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
SimpleUserPropagator - Class in org.sosy_lab.java_smt.example
+
+
Example of a simple user propagator that prohibits variables/expressions to be set to true.
+
+
simplify(T) - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Simplify an input formula, while ensuring equivalence.
+
+
simplify(T) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
simplify(T) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
simplify(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
+
Apply a simplification procedure for the given formula.
+
+
SINGLE_PRECISION_EXPONENT_SIZE - Static variable in class org.sosy_lab.java_smt.api.FloatingPointNumber
+
 
+
SINGLE_PRECISION_MANTISSA_SIZE - Static variable in class org.sosy_lab.java_smt.api.FloatingPointNumber
+
 
+
singleStackTestInteger() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
singleStackTestRational() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
size() - Method in interface org.sosy_lab.java_smt.api.BasicProverEnvironment
+
+
Get the number of backtracking points/levels on the current stack.
+
+
size() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
size() - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.BasicProverWithAssumptionsWrapper
+
 
+
SIZE - Static variable in class org.sosy_lab.java_smt.example.Sudoku
+
 
+
SKIP - Static variable in class org.sosy_lab.java_smt.api.visitors.TraversalProcess
+
+
Continue traversal, but do not recurse into current formula subtree.
+
+
SKIP_TYPE - org.sosy_lab.java_smt.api.visitors.TraversalProcess.TraversalType
+
 
+
SLFormulaManager - Interface in org.sosy_lab.java_smt.api
+
+
The SLFormulaManager can build formulae for separation logic.
+
+
smgr - Variable in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
smodulo(BitvectorFormula, BitvectorFormula) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
This method returns the two complement signed remainder for the Euclidean division (modulo) of + two bitvector formulas.
+
+
smodulo(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
smodulo(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
smodulo(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
SMTINTERPOL - org.sosy_lab.java_smt.SolverContextFactory.Solvers
+
 
+
SMTLIB2_KEYWORDS - Static variable in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
+
Avoid using basic keywords of SMT-LIB2 as names for symbols.
+
+
solve(char[][]) - Method in class org.sosy_lab.java_smt.example.Binoxxo.BinoxxoSolver
+
+
Solves a Binoxxo using the given grid values and returns a possible solution.
+
+
solve(Integer[][]) - Method in class org.sosy_lab.java_smt.example.Sudoku.SudokuSolver
+
+
Solves a sudoku using the given grid values and returns a possible solution.
+
+
solver - Variable in class org.sosy_lab.java_smt.test.SolverBasedTest0.ParameterizedSolverBasedTest0
+
 
+
solverAssumptionsAsFormula - Variable in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.BasicProverWithAssumptionsWrapper
+
 
+
SolverBasedTest0 - Class in org.sosy_lab.java_smt.test
+
+
Abstract base class with helpful utilities for writing tests that use an SMT solver.
+
+
SolverBasedTest0() - Constructor for class org.sosy_lab.java_smt.test.SolverBasedTest0
+
 
+
SolverBasedTest0.ParameterizedSolverBasedTest0 - Class in org.sosy_lab.java_smt.test
+
 
+
SolverContext - Interface in org.sosy_lab.java_smt.api
+
+
Instances of this interface provide access to an SMT solver.
+
+
SolverContext.ProverOptions - Enum in org.sosy_lab.java_smt.api
+
+
Options for the prover environment.
+
+
SolverContextFactory - Class in org.sosy_lab.java_smt
+
+
Factory class for loading and generating solver contexts.
+
+
SolverContextFactory(Configuration, LogManager, ShutdownNotifier) - Constructor for class org.sosy_lab.java_smt.SolverContextFactory
+
+
This constructor uses the default JavaSMT loader for accessing native libraries.
+
+
SolverContextFactory(Configuration, LogManager, ShutdownNotifier, Consumer<String>) - Constructor for class org.sosy_lab.java_smt.SolverContextFactory
+
+
This constructor instantiates a factory for building solver contexts for a configured SMT + solver (via the parameter pConfig).
+
+
SolverContextFactory.Solvers - Enum in org.sosy_lab.java_smt
+
 
+
SolverException - Exception in org.sosy_lab.java_smt.api
+
+
Exception thrown if there is an error during SMT solving.
+
+
SolverException(String) - Constructor for exception org.sosy_lab.java_smt.api.SolverException
+
 
+
SolverException(String, Throwable) - Constructor for exception org.sosy_lab.java_smt.api.SolverException
+
 
+
solverHasSharedFormulas(SolverContextFactory.Solvers) - Static method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingSolverInformation
+
 
+
solverHasSharedFunctions(SolverContextFactory.Solvers) - Static method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingSolverInformation
+
 
+
SolverOverviewTable - Class in org.sosy_lab.java_smt.example
+
+
This program takes all installed solvers and checks them for version, theories and features and + prints them to StdOut in a nice table.
+
+
SolverOverviewTable() - Constructor for class org.sosy_lab.java_smt.example.SolverOverviewTable
+
 
+
SolverOverviewTable.RowBuilder - Class in org.sosy_lab.java_smt.example
+
+
This class builds the table row-by-row.
+
+
SolverOverviewTable.SolverInfo - Class in org.sosy_lab.java_smt.example
+
+
just a wrapper for some data.
+
+
SolverStackTest0 - Class in org.sosy_lab.java_smt.test
+
 
+
SolverStackTest0() - Constructor for class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
SolverStatistics - Class in org.sosy_lab.java_smt.delegate.statistics
+
 
+
solverToUse() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0.ParameterizedSolverBasedTest0
+
 
+
solverToUse() - Method in class org.sosy_lab.java_smt.test.SolverBasedTest0
+
+
Return the solver to use in this test.
+
+
SolverUtils - Class in org.sosy_lab.java_smt.utils
+
+
Central entry point for all utility classes.
+
+
SPLIT_ONLY_BOOLEAN_OPERATIONS - org.sosy_lab.java_smt.utils.PrettyPrinter.PrinterOption
+
+
introduce newlines only for boolean operations, instead of for all operations.
+
+
sqrt(FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
sqrt(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
sqrt(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
sqrt(FloatingPointFormula, FloatingPointRoundingMode) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
sqrt(FloatingPointFormula, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
sqrt(FloatingPointFormula, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
sqrt(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
stackTest() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
stackTest2() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
stackTest3() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
stackTest4() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
stackTest5() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
stackTestUnsat() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
stackTestUnsat2() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
 
+
start() - Method in class org.sosy_lab.java_smt.delegate.statistics.TimerPool.TimerWrapper
+
 
+
StatisticsEnumerationFormulaManager - Class in org.sosy_lab.java_smt.delegate.statistics
+
 
+
StatisticsSolverContext - Class in org.sosy_lab.java_smt.delegate.statistics
+
 
+
StatisticsSolverContext(SolverContext) - Constructor for class org.sosy_lab.java_smt.delegate.statistics.StatisticsSolverContext
+
 
+
stop() - Method in class org.sosy_lab.java_smt.delegate.statistics.TimerPool.TimerWrapper
+
 
+
store(ArrayFormula<TI, TE>, TI, TE) - Method in interface org.sosy_lab.java_smt.api.ArrayFormulaManager
+
+
Store a value into a cell of the specified array.
+
+
store(ArrayFormula<TI, TE>, TI, TE) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractArrayFormulaManager
+
 
+
store(ArrayFormula<TI, TE>, TI, TE) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingArrayFormulaManager
+
 
+
store(TFormulaInfo, TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractArrayFormulaManager
+
 
+
STORE - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Store and select on arrays, and constant initialization.
+
+
STR_CHAR_AT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
STR_CONCAT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
STR_CONTAINS - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
STR_IN_RE - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
STR_INDEX_OF - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
STR_LE - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
STR_LENGTH - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
STR_LT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
STR_PREFIX - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
STR_REPLACE - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
STR_REPLACE_ALL - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
STR_SUBSTRING - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
STR_SUFFIX - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
STR_TO_INT - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
STR_TO_RE - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
 
+
StringFormula - Interface in org.sosy_lab.java_smt.api
+
+
A formula of the string sort.
+
+
StringFormulaManager - Interface in org.sosy_lab.java_smt.api
+
+
Manager for dealing with string formulas.
+
+
StringType - Static variable in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
SUB - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Subtraction over integers and rationals.
+
+
substitute(T, Map<? extends Formula, ? extends Formula>) - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Substitute every occurrence of any item from changeFrom in formula f to the + corresponding occurrence from changeTo.
+
+
substitute(T, Map<? extends Formula, ? extends Formula>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
substitute(T, Map<? extends Formula, ? extends Formula>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
substring(StringFormula, NumeralFormula.IntegerFormula, NumeralFormula.IntegerFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
+
Get a substring from the given String.
+
+
substring(StringFormula, NumeralFormula.IntegerFormula, NumeralFormula.IntegerFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
substring(StringFormula, NumeralFormula.IntegerFormula, NumeralFormula.IntegerFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
substring(TFormulaInfo, TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
subtract(BitvectorFormula, BitvectorFormula) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
This method returns the subtraction of the given bitvectors.
+
+
subtract(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
subtract(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
subtract(FloatingPointFormula, FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
subtract(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
subtract(FloatingPointFormula, FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
subtract(FloatingPointFormula, FloatingPointFormula, FloatingPointRoundingMode) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
 
+
subtract(FloatingPointFormula, FloatingPointFormula, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
subtract(FloatingPointFormula, FloatingPointFormula, FloatingPointRoundingMode) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
subtract(ParamFormulaType, ParamFormulaType) - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
 
+
subtract(ParamFormulaType, ParamFormulaType) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
subtract(ParamFormulaType, ParamFormulaType) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
subtract(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
subtract(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
subtract(TFormulaInfo, TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
Sudoku - Class in org.sosy_lab.java_smt.example
+
+
This program parses user-given Sudoku and solves it with an SMT solver.
+
+
Sudoku.BooleanBasedSudokuSolver - Class in org.sosy_lab.java_smt.example
+
 
+
Sudoku.EnumerationBasedSudokuSolver - Class in org.sosy_lab.java_smt.example
+
 
+
Sudoku.IntegerBasedSudokuSolver - Class in org.sosy_lab.java_smt.example
+
 
+
Sudoku.SudokuSolver<S> - Class in org.sosy_lab.java_smt.example
+
 
+
suffix(StringFormula, StringFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
+
Check whether the given suffix is a real suffix of str.
+
+
suffix(StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
suffix(StringFormula, StringFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
suffix(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
sum(List<ParamFormulaType>) - Method in interface org.sosy_lab.java_smt.api.NumeralFormulaManager
+
 
+
sum(List<ParamFormulaType>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
sum(List<ParamFormulaType>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager
+
 
+
sumImpl(List<TFormulaInfo>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
supportsAssumptionSolving() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractSolverContext
+
+
Whether the solver supports solving under some given assumptions (with all corresponding + features) by itself, i.e., whether BasicProverEnvironment.isUnsatWithAssumptions(java.util.Collection) and BasicProverEnvironment.isUnsatWithAssumptions(java.util.Collection) are fully + implemented.
+
+
symbolsOnStackTest() - Method in class org.sosy_lab.java_smt.test.SolverStackTest0
+
+
Create a symbol on a level and pop this level.
+
+
SynchronizedEnumerationFormulaManager - Class in org.sosy_lab.java_smt.delegate.synchronize
+
 
+
SynchronizedSolverContext - Class in org.sosy_lab.java_smt.delegate.synchronize
+
 
+
SynchronizedSolverContext(Configuration, LogManager, ShutdownNotifier, SolverContext) - Constructor for class org.sosy_lab.java_smt.delegate.synchronize.SynchronizedSolverContext
+
 
+
+ + + +

T

+
+
Tactic - Enum in org.sosy_lab.java_smt.api
+
+
Tactic is a generic formula to formula transformation.
+
+
TimerPool - Class in org.sosy_lab.java_smt.delegate.statistics
+
 
+
TimerPool() - Constructor for class org.sosy_lab.java_smt.delegate.statistics.TimerPool
+
 
+
TimerPool.TimerWrapper - Class in org.sosy_lab.java_smt.delegate.statistics
+
+
A minimal wrapper to keep a reference on the timer and provide a limited view.
+
+
times(RegexFormula, int) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
times(RegexFormula, int) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
times(RegexFormula, int) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
TO_REAL - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Identity operation, converts from integers to rationals, also known as to_real.
+
+
toConjunction() - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
+
Return a stream Collector that creates a conjunction of all elements in the stream.
+
+
toConjunction() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
toConjunction() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
toConjunctionArgs(BooleanFormula, boolean) - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
+
Return a set of formulas such that a conjunction over them is equivalent to the input formula.
+
+
toConjunctionArgs(BooleanFormula, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
toConjunctionArgs(BooleanFormula, boolean) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
toDisjunction() - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
+
Return a stream Collector that creates a disjunction of all elements in the stream.
+
+
toDisjunction() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
toDisjunction() - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
toDisjunctionArgs(BooleanFormula, boolean) - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
+
Return a set of formulas such that a disjunction over them is equivalent to the input formula.
+
+
toDisjunctionArgs(BooleanFormula, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
toDisjunctionArgs(BooleanFormula, boolean) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
toIeeeBitvector(FloatingPointFormula) - Method in interface org.sosy_lab.java_smt.api.FloatingPointFormulaManager
+
+
Create a formula that produces a representation of the given floating-point value as a + bitvector conforming to the IEEE format.
+
+
toIeeeBitvector(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
toIeeeBitvector(FloatingPointFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
+
 
+
toIeeeBitvectorImpl(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
toIntegerFormula(BitvectorFormula, boolean) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
Convert/Cast/Interpret a signed/unsigned bitvector formula as an integer formula.
+
+
toIntegerFormula(BitvectorFormula, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
toIntegerFormula(BitvectorFormula, boolean) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
toIntegerFormula(StringFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
+
Interpret a String formula as an Integer formula.
+
+
toIntegerFormula(StringFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
toIntegerFormula(StringFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
toIntegerFormula(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
toIntegerFormulaImpl(TFormulaInfo, boolean) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
toSMTLIBString() - Method in class org.sosy_lab.java_smt.api.FormulaType.ArrayFormulaType
+
 
+
toSMTLIBString() - Method in class org.sosy_lab.java_smt.api.FormulaType.BitvectorType
+
 
+
toSMTLIBString() - Method in class org.sosy_lab.java_smt.api.FormulaType.EnumerationFormulaType
+
 
+
toSMTLIBString() - Method in class org.sosy_lab.java_smt.api.FormulaType.FloatingPointType
+
 
+
toSMTLIBString() - Method in class org.sosy_lab.java_smt.api.FormulaType
+
+
return the correctly formatted SMTLIB2 type declaration.
+
+
toString() - Method in class org.sosy_lab.java_smt.api.FloatingPointNumber
+
+
Return a bit-representation of sign-bit, exponent, and mantissa, i.e., a concatenation of their + bit-representations in this exact ordering.
+
+
toString() - Method in interface org.sosy_lab.java_smt.api.Formula
+
+
returns an arbitrary representation of the formula, might be human- or machine-readable.
+
+
toString() - Method in class org.sosy_lab.java_smt.api.FormulaType.ArrayFormulaType
+
 
+
toString() - Method in class org.sosy_lab.java_smt.api.FormulaType.BitvectorType
+
 
+
toString() - Method in class org.sosy_lab.java_smt.api.FormulaType.EnumerationFormulaType
+
 
+
toString() - Method in class org.sosy_lab.java_smt.api.FormulaType.FloatingPointType
+
 
+
toString() - Method in class org.sosy_lab.java_smt.api.FormulaType
+
 
+
toString() - Method in interface org.sosy_lab.java_smt.api.Model
+
+
Pretty-printing of the model values.
+
+
toString() - Method in class org.sosy_lab.java_smt.api.Model.ValueAssignment
+
 
+
toString() - Method in class org.sosy_lab.java_smt.basicimpl.AbstractModel
+
 
+
toString() - Method in class org.sosy_lab.java_smt.basicimpl.CachingModel
+
 
+
toString() - Method in class org.sosy_lab.java_smt.basicimpl.FunctionDeclarationImpl
+
 
+
toString() - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.BasicProverWithAssumptionsWrapper
+
 
+
toString() - Method in class org.sosy_lab.java_smt.delegate.statistics.TimerPool
+
 
+
toString() - Method in class org.sosy_lab.java_smt.example.FormulaClassifier
+
 
+
toString() - Method in class org.sosy_lab.java_smt.example.SolverOverviewTable.RowBuilder
+
 
+
toStringFormula(NumeralFormula.IntegerFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
+
Interpret an Integer formula as a String formula.
+
+
toStringFormula(NumeralFormula.IntegerFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
toStringFormula(NumeralFormula.IntegerFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
toStringFormula(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
TOWARD_NEGATIVE - org.sosy_lab.java_smt.api.FloatingPointRoundingMode
+
 
+
TOWARD_POSITIVE - org.sosy_lab.java_smt.api.FloatingPointRoundingMode
+
 
+
TOWARD_ZERO - org.sosy_lab.java_smt.api.FloatingPointRoundingMode
+
 
+
transformRecursively(BooleanFormula, BooleanFormulaTransformationVisitor) - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
+
Visit the formula recursively with a given BooleanFormulaVisitor.
+
+
transformRecursively(BooleanFormula, BooleanFormulaTransformationVisitor) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
transformRecursively(BooleanFormula, BooleanFormulaTransformationVisitor) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
transformRecursively(FormulaVisitor<? extends Formula>, T) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
transformRecursively(FormulaVisitor<? extends Formula>, T, Predicate<Object>) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
transformRecursively(T, FormulaTransformationVisitor) - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Visit the formula recursively with a given FormulaVisitor.
+
+
transformRecursively(T, FormulaTransformationVisitor) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
transformRecursively(T, FormulaTransformationVisitor) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
transformValueToRange(int, BigInteger) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
+
transform a negative value into its positive counterpart.
+
+
translateFrom(BooleanFormula, FormulaManager) - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Translates the formula from another context into the context represented by this.
+
+
translateFrom(BooleanFormula, FormulaManager) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
translateFrom(BooleanFormula, FormulaManager) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
TraversalProcess - Class in org.sosy_lab.java_smt.api.visitors
+
+
Return class that lets the visitor guide the recursive formula traversal process started with + FormulaManager.visitRecursively(org.sosy_lab.java_smt.api.Formula, org.sosy_lab.java_smt.api.visitors.FormulaVisitor<org.sosy_lab.java_smt.api.visitors.TraversalProcess>).
+
+
TraversalProcess.TraversalType - Enum in org.sosy_lab.java_smt.api.visitors
+
 
+
TSEITIN_CNF - org.sosy_lab.java_smt.api.Tactic
+
+
Convert the formula to CNF (conjunctive normal form), using extra fresh variables to avoid the + size explosion.
+
+
+ + + +

U

+
+
UF - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Uninterpreted function.
+
+
ufElimination(FormulaManager) - Static method in class org.sosy_lab.java_smt.utils.SolverUtils
+
+
Creates a new UfElimination instance.
+
+
UfElimination - Class in org.sosy_lab.java_smt.utils
+
+
UfElimination replaces UFs by fresh variables and adds constraints to enforce the functional + consistency.
+
+
UfElimination.Result - Class in org.sosy_lab.java_smt.utils
+
 
+
UFManager - Interface in org.sosy_lab.java_smt.api
+
+
Manager for dealing with uninterpreted functions (UFs).
+
+
UMINUS - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Unary minus.
+
+
UNDEF - org.sosy_lab.java_smt.api.OptimizationProverEnvironment.OptStatus
+
+
The result is unknown.
+
+
unescape(String) - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Unescape the symbol/name for variables or undefined functions, if necessary.
+
+
unescape(String) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
unescape(String) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
union(RegexFormula, RegexFormula) - Method in interface org.sosy_lab.java_smt.api.StringFormulaManager
+
 
+
union(RegexFormula, RegexFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
union(RegexFormula, RegexFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
+
 
+
union(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
unregisterEvaluator(Evaluator) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractProver
+
 
+
UNSAT - org.sosy_lab.java_smt.api.OptimizationProverEnvironment.OptStatus
+
+
The set of constraints is unsatisfiable.
+
+
unsatCoreOverAssumptions(Collection<BooleanFormula>) - Method in interface org.sosy_lab.java_smt.api.BasicProverEnvironment
+
+
Returns an UNSAT core (if it exists, otherwise Optional.empty()), over the chosen + assumptions.
+
+
unsatCoreOverAssumptions(Collection<BooleanFormula>) - Method in class org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.BasicProverWithAssumptionsWrapper
+
 
+
upper(int, Rational) - Method in interface org.sosy_lab.java_smt.api.OptimizationProverEnvironment
+
 
+
upper(int, Rational) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingOptimizationProverEnvironment
+
 
+
USE - org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager.NonLinearArithmetic
+
 
+
UserPropagator - Interface in org.sosy_lab.java_smt.api
+
+
Allows user-defined propagators (~ theory solvers) to be implemented.
+
+
+ + + +

V

+
+
ValueAssignment(Formula, Formula, BooleanFormula, String, Object, List<?>) - Constructor for class org.sosy_lab.java_smt.api.Model.ValueAssignment
+
 
+
valueOf(String) - Static method in enum org.sosy_lab.java_smt.api.FloatingPointRoundingMode
+
+
Returns the enum constant of this type with the specified name.
+
+
valueOf(String) - Static method in enum org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Returns the enum constant of this type with the specified name.
+
+
valueOf(String) - Static method in enum org.sosy_lab.java_smt.api.OptimizationProverEnvironment.OptStatus
+
+
Returns the enum constant of this type with the specified name.
+
+
valueOf(String) - Static method in enum org.sosy_lab.java_smt.api.QuantifiedFormulaManager.Quantifier
+
+
Returns the enum constant of this type with the specified name.
+
+
valueOf(String) - Static method in enum org.sosy_lab.java_smt.api.SolverContext.ProverOptions
+
+
Returns the enum constant of this type with the specified name.
+
+
valueOf(String) - Static method in enum org.sosy_lab.java_smt.api.Tactic
+
+
Returns the enum constant of this type with the specified name.
+
+
valueOf(String) - Static method in enum org.sosy_lab.java_smt.api.visitors.TraversalProcess.TraversalType
+
+
Returns the enum constant of this type with the specified name.
+
+
valueOf(String) - Static method in enum org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager.NonLinearArithmetic
+
+
Returns the enum constant of this type with the specified name.
+
+
valueOf(String) - Static method in enum org.sosy_lab.java_smt.SolverContextFactory.Solvers
+
+
Returns the enum constant of this type with the specified name.
+
+
valueOf(String) - Static method in enum org.sosy_lab.java_smt.utils.PrettyPrinter.PrinterOption
+
+
Returns the enum constant of this type with the specified name.
+
+
values() - Static method in enum org.sosy_lab.java_smt.api.FloatingPointRoundingMode
+
+
Returns an array containing the constants of this enum type, in +the order they are declared.
+
+
values() - Static method in enum org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Returns an array containing the constants of this enum type, in +the order they are declared.
+
+
values() - Static method in enum org.sosy_lab.java_smt.api.OptimizationProverEnvironment.OptStatus
+
+
Returns an array containing the constants of this enum type, in +the order they are declared.
+
+
values() - Static method in enum org.sosy_lab.java_smt.api.QuantifiedFormulaManager.Quantifier
+
+
Returns an array containing the constants of this enum type, in +the order they are declared.
+
+
values() - Static method in enum org.sosy_lab.java_smt.api.SolverContext.ProverOptions
+
+
Returns an array containing the constants of this enum type, in +the order they are declared.
+
+
values() - Static method in enum org.sosy_lab.java_smt.api.Tactic
+
+
Returns an array containing the constants of this enum type, in +the order they are declared.
+
+
values() - Static method in enum org.sosy_lab.java_smt.api.visitors.TraversalProcess.TraversalType
+
+
Returns an array containing the constants of this enum type, in +the order they are declared.
+
+
values() - Static method in enum org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager.NonLinearArithmetic
+
+
Returns an array containing the constants of this enum type, in +the order they are declared.
+
+
values() - Static method in enum org.sosy_lab.java_smt.SolverContextFactory.Solvers
+
+
Returns an array containing the constants of this enum type, in +the order they are declared.
+
+
values() - Static method in enum org.sosy_lab.java_smt.utils.PrettyPrinter.PrinterOption
+
+
Returns an array containing the constants of this enum type, in +the order they are declared.
+
+
VAR - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
User-defined variable.
+
+
visit(BooleanFormula) - Method in class org.sosy_lab.java_smt.example.FormulaClassifier
+
 
+
visit(BooleanFormula, BooleanFormulaVisitor<R>) - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
+
Visit the formula with the given visitor.
+
+
visit(BooleanFormula, BooleanFormulaVisitor<R>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
visit(BooleanFormula, BooleanFormulaVisitor<R>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
visit(Formula, FormulaVisitor<R>) - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Visit the formula with a given visitor.
+
+
visit(Formula, FormulaVisitor<R>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
visit(Formula, FormulaVisitor<R>) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
visit(Formula, FormulaVisitor<R>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
visit(FormulaVisitor<R>, Formula, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
visitAnd(List<BooleanFormula>) - Method in class org.sosy_lab.java_smt.api.visitors.BooleanFormulaTransformationVisitor
+
 
+
visitAnd(List<BooleanFormula>) - Method in interface org.sosy_lab.java_smt.api.visitors.BooleanFormulaVisitor
+
+
Visit an AND-expression with an arbitrary number of boolean arguments.
+
+
visitAnd(List<BooleanFormula>) - Method in class org.sosy_lab.java_smt.api.visitors.DefaultBooleanFormulaVisitor
+
 
+
visitAtom(BooleanFormula, FunctionDeclaration<BooleanFormula>) - Method in class org.sosy_lab.java_smt.api.visitors.BooleanFormulaTransformationVisitor
+
 
+
visitAtom(BooleanFormula, FunctionDeclaration<BooleanFormula>) - Method in interface org.sosy_lab.java_smt.api.visitors.BooleanFormulaVisitor
+
+
Visit an SMT atom.
+
+
visitAtom(BooleanFormula, FunctionDeclaration<BooleanFormula>) - Method in class org.sosy_lab.java_smt.api.visitors.DefaultBooleanFormulaVisitor
+
 
+
visitBoundVar(BooleanFormula, int) - Method in class org.sosy_lab.java_smt.api.visitors.BooleanFormulaTransformationVisitor
+
 
+
visitBoundVar(BooleanFormula, int) - Method in interface org.sosy_lab.java_smt.api.visitors.BooleanFormulaVisitor
+
+
Visit a boolean variable bound by a quantifier.
+
+
visitBoundVar(BooleanFormula, int) - Method in class org.sosy_lab.java_smt.api.visitors.DefaultBooleanFormulaVisitor
+
 
+
visitBoundVariable(Formula, int) - Method in class org.sosy_lab.java_smt.api.visitors.DefaultFormulaVisitor
+
 
+
visitBoundVariable(Formula, int) - Method in class org.sosy_lab.java_smt.api.visitors.FormulaTransformationVisitor
+
 
+
visitBoundVariable(Formula, int) - Method in interface org.sosy_lab.java_smt.api.visitors.FormulaVisitor
+
+
Visit a variable bound by a quantifier.
+
+
visitConstant(boolean) - Method in class org.sosy_lab.java_smt.api.visitors.BooleanFormulaTransformationVisitor
+
 
+
visitConstant(boolean) - Method in interface org.sosy_lab.java_smt.api.visitors.BooleanFormulaVisitor
+
+
Visit a constant with a given value.
+
+
visitConstant(boolean) - Method in class org.sosy_lab.java_smt.api.visitors.DefaultBooleanFormulaVisitor
+
 
+
visitConstant(Formula, Object) - Method in class org.sosy_lab.java_smt.api.visitors.DefaultFormulaVisitor
+
 
+
visitConstant(Formula, Object) - Method in class org.sosy_lab.java_smt.api.visitors.FormulaTransformationVisitor
+
 
+
visitConstant(Formula, Object) - Method in interface org.sosy_lab.java_smt.api.visitors.FormulaVisitor
+
+
Visit a constant, such as "true"/"false", a numeric constant like "1" or "1.0", a String + constant like 2hello world" or enumeration constant like "Blue".
+
+
visitDefault() - Method in class org.sosy_lab.java_smt.api.visitors.DefaultBooleanFormulaVisitor
+
 
+
visitDefault(Formula) - Method in class org.sosy_lab.java_smt.api.visitors.DefaultFormulaVisitor
+
+
Method for default case, is called by all methods from this class if they are not overridden.
+
+
visitDefault(Formula) - Method in class org.sosy_lab.java_smt.api.visitors.ExpectedFormulaVisitor
+
 
+
visitEquivalence(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.api.visitors.BooleanFormulaTransformationVisitor
+
 
+
visitEquivalence(BooleanFormula, BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.visitors.BooleanFormulaVisitor
+
+
Visit an equivalence between two formulas of boolean sort: operand1 = operand2.
+
+
visitEquivalence(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.api.visitors.DefaultBooleanFormulaVisitor
+
 
+
visitEquivalence(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.tactics.NNFVisitor
+
 
+
visitFreeVariable(Formula, String) - Method in class org.sosy_lab.java_smt.api.visitors.DefaultFormulaVisitor
+
 
+
visitFreeVariable(Formula, String) - Method in class org.sosy_lab.java_smt.api.visitors.FormulaTransformationVisitor
+
 
+
visitFreeVariable(Formula, String) - Method in interface org.sosy_lab.java_smt.api.visitors.FormulaVisitor
+
+
Visit a free variable (such as "x", "y" or "z"), not bound by a quantifier.
+
+
visitFunction(Formula, List<Formula>, FunctionDeclaration<?>) - Method in class org.sosy_lab.java_smt.api.visitors.DefaultFormulaVisitor
+
 
+
visitFunction(Formula, List<Formula>, FunctionDeclaration<?>) - Method in class org.sosy_lab.java_smt.api.visitors.FormulaTransformationVisitor
+
 
+
visitFunction(Formula, List<Formula>, FunctionDeclaration<?>) - Method in interface org.sosy_lab.java_smt.api.visitors.FormulaVisitor
+
+
Visit an arbitrary, potentially uninterpreted function.
+
+
visitIfThenElse(BooleanFormula, BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.api.visitors.BooleanFormulaTransformationVisitor
+
 
+
visitIfThenElse(BooleanFormula, BooleanFormula, BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.visitors.BooleanFormulaVisitor
+
+
Visit an if-then-else expression.
+
+
visitIfThenElse(BooleanFormula, BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.api.visitors.DefaultBooleanFormulaVisitor
+
 
+
visitIfThenElse(BooleanFormula, BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.tactics.NNFVisitor
+
 
+
visitImplication(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.api.visitors.BooleanFormulaTransformationVisitor
+
 
+
visitImplication(BooleanFormula, BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.visitors.BooleanFormulaVisitor
+
+
Visit an implication.
+
+
visitImplication(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.api.visitors.DefaultBooleanFormulaVisitor
+
 
+
visitImplication(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.tactics.NNFVisitor
+
 
+
visitNot(BooleanFormula) - Method in class org.sosy_lab.java_smt.api.visitors.BooleanFormulaTransformationVisitor
+
 
+
visitNot(BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.visitors.BooleanFormulaVisitor
+
+
Visit a NOT-expression.
+
+
visitNot(BooleanFormula) - Method in class org.sosy_lab.java_smt.api.visitors.DefaultBooleanFormulaVisitor
+
 
+
visitNot(BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.tactics.NNFVisitor
+
 
+
visitOr(List<BooleanFormula>) - Method in class org.sosy_lab.java_smt.api.visitors.BooleanFormulaTransformationVisitor
+
 
+
visitOr(List<BooleanFormula>) - Method in interface org.sosy_lab.java_smt.api.visitors.BooleanFormulaVisitor
+
+
Visit an OR-expression with an arbitrary number of boolean arguments.
+
+
visitOr(List<BooleanFormula>) - Method in class org.sosy_lab.java_smt.api.visitors.DefaultBooleanFormulaVisitor
+
 
+
visitQuantifier(BooleanFormula, QuantifiedFormulaManager.Quantifier, List<Formula>, BooleanFormula) - Method in class org.sosy_lab.java_smt.api.visitors.DefaultFormulaVisitor
+
 
+
visitQuantifier(BooleanFormula, QuantifiedFormulaManager.Quantifier, List<Formula>, BooleanFormula) - Method in class org.sosy_lab.java_smt.api.visitors.FormulaTransformationVisitor
+
 
+
visitQuantifier(BooleanFormula, QuantifiedFormulaManager.Quantifier, List<Formula>, BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.visitors.FormulaVisitor
+
+
Visit a quantified node.
+
+
visitQuantifier(QuantifiedFormulaManager.Quantifier, BooleanFormula, List<Formula>, BooleanFormula) - Method in class org.sosy_lab.java_smt.api.visitors.BooleanFormulaTransformationVisitor
+
 
+
visitQuantifier(QuantifiedFormulaManager.Quantifier, BooleanFormula, List<Formula>, BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.visitors.BooleanFormulaVisitor
+
+
Visit a quantifier: forall- or exists-.
+
+
visitQuantifier(QuantifiedFormulaManager.Quantifier, BooleanFormula, List<Formula>, BooleanFormula) - Method in class org.sosy_lab.java_smt.api.visitors.DefaultBooleanFormulaVisitor
+
 
+
visitRecursively(BooleanFormula, BooleanFormulaVisitor<TraversalProcess>) - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
+
Visit the formula recursively with a given BooleanFormulaVisitor.
+
+
visitRecursively(BooleanFormula, BooleanFormulaVisitor<TraversalProcess>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
visitRecursively(BooleanFormula, BooleanFormulaVisitor<TraversalProcess>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
visitRecursively(Formula, FormulaVisitor<TraversalProcess>) - Method in interface org.sosy_lab.java_smt.api.FormulaManager
+
+
Visit the formula recursively with a given FormulaVisitor.
+
+
visitRecursively(Formula, FormulaVisitor<TraversalProcess>) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager
+
 
+
visitRecursively(Formula, FormulaVisitor<TraversalProcess>) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
+
 
+
visitRecursively(FormulaVisitor<TraversalProcess>, Formula) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
visitRecursively(FormulaVisitor<TraversalProcess>, Formula, Predicate<Formula>) - Method in class org.sosy_lab.java_smt.basicimpl.FormulaCreator
+
 
+
visitXor(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.api.visitors.BooleanFormulaTransformationVisitor
+
 
+
visitXor(BooleanFormula, BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.visitors.BooleanFormulaVisitor
+
+
Visit a XOR-expression.
+
+
visitXor(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.api.visitors.DefaultBooleanFormulaVisitor
+
 
+
visitXor(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.tactics.NNFVisitor
+
 
+
+ + + +

W

+
+
wrap(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager
+
 
+
wrap(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager
+
 
+
wrapRegex(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
wrapString(TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager
+
 
+
+ + + +

X

+
+
xor(BitvectorFormula, BitvectorFormula) - Method in interface org.sosy_lab.java_smt.api.BitvectorFormulaManager
+
+
This method returns the bit-wise XOR of the given bitvectors.
+
+
xor(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
xor(BitvectorFormula, BitvectorFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
+
 
+
xor(BooleanFormula, BooleanFormula) - Method in interface org.sosy_lab.java_smt.api.BooleanFormulaManager
+
+
Creates a formula representing XOR of the two arguments.
+
+
xor(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
xor(BooleanFormula, BooleanFormula) - Method in class org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
+
 
+
xor(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager
+
 
+
xor(TFormulaInfo, TFormulaInfo) - Method in class org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager
+
 
+
XOR - org.sosy_lab.java_smt.api.FunctionDeclarationKind
+
+
Exclusive OR over two formulas.
+
+
+ + + +

Y

+
+
YICES2 - org.sosy_lab.java_smt.SolverContextFactory.Solvers
+
 
+
+ + + +

Z

+
+
Z3 - org.sosy_lab.java_smt.SolverContextFactory.Solvers
+
 
+
+A B C D E F G H I L M N O P Q R S T U V W X Y Z 
All Classes All Packages
+
+
+ +
+ + diff --git a/api/index.html b/api/index.html new file mode 100644 index 0000000000..1ad17adaaf --- /dev/null +++ b/api/index.html @@ -0,0 +1,250 @@ + + + + + +Overview (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

JavaSMT Solver Library

+
+
+

JavaSMT is a generic API allowing unified access to different SMT solvers.

+ +

All the interaction with a solver is performed through the +SolverContext interface, which encapsulates a +single context. +SolverContext instances are created using +SolverContextFactory.

+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Packages 
PackageDescription
org.sosy_lab.java_smt +
JavaSMT: a generic SMT solver API.
+
org.sosy_lab.java_smt.api +
The core interfaces for abstracting from SMT solvers and providing a common API for all solvers.
+
org.sosy_lab.java_smt.api.visitors +
The visitors of this package allow for efficient traversal, manipulation and transformation of + formulas.
+
org.sosy_lab.java_smt.basicimpl +
Abstract base classes for easier implementation of a solver backend.
+
org.sosy_lab.java_smt.basicimpl.tactics +
Default tactics implementations (formula-to-formula transformations).
+
org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper +
Wrapper-classes to guarantee identical behavior for all solvers.
+
org.sosy_lab.java_smt.delegate.debugging 
org.sosy_lab.java_smt.delegate.logging +
Wraps the proving environment with loggers.
+
org.sosy_lab.java_smt.delegate.statistics +
The classes of this package wrap the whole proving environment and measure all accesses to it.
+
org.sosy_lab.java_smt.delegate.synchronize +
The classes of this package wrap the whole solver context and all corresponding proving + environment and synchronize all accesses to it.
+
org.sosy_lab.java_smt.example +
Some basic examples for using Java-SMT.
+
org.sosy_lab.java_smt.example.nqueens_user_propagator +
Some basic examples for using Java-SMT.
+
org.sosy_lab.java_smt.test +
Solver-independent tests and test utilities for the solver API.
+
org.sosy_lab.java_smt.utils +
Utility classes implementing algorithms based on the API of JavaSMT.
+
+
+
+
+ +
+ + diff --git a/api/jquery-ui.overrides.css b/api/jquery-ui.overrides.css new file mode 100644 index 0000000000..facf852c27 --- /dev/null +++ b/api/jquery-ui.overrides.css @@ -0,0 +1,35 @@ +/* + * Copyright (c) 2020, 2022, Oracle and/or its affiliates. All rights reserved. + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. + * + * This code is free software; you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 2 only, as + * published by the Free Software Foundation. Oracle designates this + * particular file as subject to the "Classpath" exception as provided + * by Oracle in the LICENSE file that accompanied this code. + * + * This code is distributed in the hope that it will be useful, but WITHOUT + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License + * version 2 for more details (a copy is included in the LICENSE file that + * accompanied this code). + * + * You should have received a copy of the GNU General Public License version + * 2 along with this work; if not, write to the Free Software Foundation, + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. + * + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA + * or visit www.oracle.com if you need additional information or have any + * questions. + */ + +.ui-state-active, +.ui-widget-content .ui-state-active, +.ui-widget-header .ui-state-active, +a.ui-button:active, +.ui-button:active, +.ui-button.ui-state-active:hover { + /* Overrides the color of selection used in jQuery UI */ + background: #F8981D; + border: 1px solid #F8981D; +} diff --git a/api/jquery/external/jquery/jquery.js b/api/jquery/external/jquery/jquery.js new file mode 100644 index 0000000000..50937333b9 --- /dev/null +++ b/api/jquery/external/jquery/jquery.js @@ -0,0 +1,10872 @@ +/*! + * jQuery JavaScript Library v3.5.1 + * https://jquery.com/ + * + * Includes Sizzle.js + * https://sizzlejs.com/ + * + * Copyright JS Foundation and other contributors + * Released under the MIT license + * https://jquery.org/license + * + * Date: 2020-05-04T22:49Z + */ +( function( global, factory ) { + + "use strict"; + + if ( typeof module === "object" && typeof module.exports === "object" ) { + + // For CommonJS and CommonJS-like environments where a proper `window` + // is present, execute the factory and get jQuery. + // For environments that do not have a `window` with a `document` + // (such as Node.js), expose a factory as module.exports. + // This accentuates the need for the creation of a real `window`. + // e.g. var jQuery = require("jquery")(window); + // See ticket #14549 for more info. + module.exports = global.document ? + factory( global, true ) : + function( w ) { + if ( !w.document ) { + throw new Error( "jQuery requires a window with a document" ); + } + return factory( w ); + }; + } else { + factory( global ); + } + +// Pass this if window is not defined yet +} )( typeof window !== "undefined" ? window : this, function( window, noGlobal ) { + +// Edge <= 12 - 13+, Firefox <=18 - 45+, IE 10 - 11, Safari 5.1 - 9+, iOS 6 - 9.1 +// throw exceptions when non-strict code (e.g., ASP.NET 4.5) accesses strict mode +// arguments.callee.caller (trac-13335). But as of jQuery 3.0 (2016), strict mode should be common +// enough that all such attempts are guarded in a try block. +"use strict"; + +var arr = []; + +var getProto = Object.getPrototypeOf; + +var slice = arr.slice; + +var flat = arr.flat ? function( array ) { + return arr.flat.call( array ); +} : function( array ) { + return arr.concat.apply( [], array ); +}; + + +var push = arr.push; + +var indexOf = arr.indexOf; + +var class2type = {}; + +var toString = class2type.toString; + +var hasOwn = class2type.hasOwnProperty; + +var fnToString = hasOwn.toString; + +var ObjectFunctionString = fnToString.call( Object ); + +var support = {}; + +var isFunction = function isFunction( obj ) { + + // Support: Chrome <=57, Firefox <=52 + // In some browsers, typeof returns "function" for HTML elements + // (i.e., `typeof document.createElement( "object" ) === "function"`). + // We don't want to classify *any* DOM node as a function. + return typeof obj === "function" && typeof obj.nodeType !== "number"; + }; + + +var isWindow = function isWindow( obj ) { + return obj != null && obj === obj.window; + }; + + +var document = window.document; + + + + var preservedScriptAttributes = { + type: true, + src: true, + nonce: true, + noModule: true + }; + + function DOMEval( code, node, doc ) { + doc = doc || document; + + var i, val, + script = doc.createElement( "script" ); + + script.text = code; + if ( node ) { + for ( i in preservedScriptAttributes ) { + + // Support: Firefox 64+, Edge 18+ + // Some browsers don't support the "nonce" property on scripts. + // On the other hand, just using `getAttribute` is not enough as + // the `nonce` attribute is reset to an empty string whenever it + // becomes browsing-context connected. + // See https://github.com/whatwg/html/issues/2369 + // See https://html.spec.whatwg.org/#nonce-attributes + // The `node.getAttribute` check was added for the sake of + // `jQuery.globalEval` so that it can fake a nonce-containing node + // via an object. + val = node[ i ] || node.getAttribute && node.getAttribute( i ); + if ( val ) { + script.setAttribute( i, val ); + } + } + } + doc.head.appendChild( script ).parentNode.removeChild( script ); + } + + +function toType( obj ) { + if ( obj == null ) { + return obj + ""; + } + + // Support: Android <=2.3 only (functionish RegExp) + return typeof obj === "object" || typeof obj === "function" ? + class2type[ toString.call( obj ) ] || "object" : + typeof obj; +} +/* global Symbol */ +// Defining this global in .eslintrc.json would create a danger of using the global +// unguarded in another place, it seems safer to define global only for this module + + + +var + version = "3.5.1", + + // Define a local copy of jQuery + jQuery = function( selector, context ) { + + // The jQuery object is actually just the init constructor 'enhanced' + // Need init if jQuery is called (just allow error to be thrown if not included) + return new jQuery.fn.init( selector, context ); + }; + +jQuery.fn = jQuery.prototype = { + + // The current version of jQuery being used + jquery: version, + + constructor: jQuery, + + // The default length of a jQuery object is 0 + length: 0, + + toArray: function() { + return slice.call( this ); + }, + + // Get the Nth element in the matched element set OR + // Get the whole matched element set as a clean array + get: function( num ) { + + // Return all the elements in a clean array + if ( num == null ) { + return slice.call( this ); + } + + // Return just the one element from the set + return num < 0 ? this[ num + this.length ] : this[ num ]; + }, + + // Take an array of elements and push it onto the stack + // (returning the new matched element set) + pushStack: function( elems ) { + + // Build a new jQuery matched element set + var ret = jQuery.merge( this.constructor(), elems ); + + // Add the old object onto the stack (as a reference) + ret.prevObject = this; + + // Return the newly-formed element set + return ret; + }, + + // Execute a callback for every element in the matched set. + each: function( callback ) { + return jQuery.each( this, callback ); + }, + + map: function( callback ) { + return this.pushStack( jQuery.map( this, function( elem, i ) { + return callback.call( elem, i, elem ); + } ) ); + }, + + slice: function() { + return this.pushStack( slice.apply( this, arguments ) ); + }, + + first: function() { + return this.eq( 0 ); + }, + + last: function() { + return this.eq( -1 ); + }, + + even: function() { + return this.pushStack( jQuery.grep( this, function( _elem, i ) { + return ( i + 1 ) % 2; + } ) ); + }, + + odd: function() { + return this.pushStack( jQuery.grep( this, function( _elem, i ) { + return i % 2; + } ) ); + }, + + eq: function( i ) { + var len = this.length, + j = +i + ( i < 0 ? len : 0 ); + return this.pushStack( j >= 0 && j < len ? [ this[ j ] ] : [] ); + }, + + end: function() { + return this.prevObject || this.constructor(); + }, + + // For internal use only. + // Behaves like an Array's method, not like a jQuery method. + push: push, + sort: arr.sort, + splice: arr.splice +}; + +jQuery.extend = jQuery.fn.extend = function() { + var options, name, src, copy, copyIsArray, clone, + target = arguments[ 0 ] || {}, + i = 1, + length = arguments.length, + deep = false; + + // Handle a deep copy situation + if ( typeof target === "boolean" ) { + deep = target; + + // Skip the boolean and the target + target = arguments[ i ] || {}; + i++; + } + + // Handle case when target is a string or something (possible in deep copy) + if ( typeof target !== "object" && !isFunction( target ) ) { + target = {}; + } + + // Extend jQuery itself if only one argument is passed + if ( i === length ) { + target = this; + i--; + } + + for ( ; i < length; i++ ) { + + // Only deal with non-null/undefined values + if ( ( options = arguments[ i ] ) != null ) { + + // Extend the base object + for ( name in options ) { + copy = options[ name ]; + + // Prevent Object.prototype pollution + // Prevent never-ending loop + if ( name === "__proto__" || target === copy ) { + continue; + } + + // Recurse if we're merging plain objects or arrays + if ( deep && copy && ( jQuery.isPlainObject( copy ) || + ( copyIsArray = Array.isArray( copy ) ) ) ) { + src = target[ name ]; + + // Ensure proper type for the source value + if ( copyIsArray && !Array.isArray( src ) ) { + clone = []; + } else if ( !copyIsArray && !jQuery.isPlainObject( src ) ) { + clone = {}; + } else { + clone = src; + } + copyIsArray = false; + + // Never move original objects, clone them + target[ name ] = jQuery.extend( deep, clone, copy ); + + // Don't bring in undefined values + } else if ( copy !== undefined ) { + target[ name ] = copy; + } + } + } + } + + // Return the modified object + return target; +}; + +jQuery.extend( { + + // Unique for each copy of jQuery on the page + expando: "jQuery" + ( version + Math.random() ).replace( /\D/g, "" ), + + // Assume jQuery is ready without the ready module + isReady: true, + + error: function( msg ) { + throw new Error( msg ); + }, + + noop: function() {}, + + isPlainObject: function( obj ) { + var proto, Ctor; + + // Detect obvious negatives + // Use toString instead of jQuery.type to catch host objects + if ( !obj || toString.call( obj ) !== "[object Object]" ) { + return false; + } + + proto = getProto( obj ); + + // Objects with no prototype (e.g., `Object.create( null )`) are plain + if ( !proto ) { + return true; + } + + // Objects with prototype are plain iff they were constructed by a global Object function + Ctor = hasOwn.call( proto, "constructor" ) && proto.constructor; + return typeof Ctor === "function" && fnToString.call( Ctor ) === ObjectFunctionString; + }, + + isEmptyObject: function( obj ) { + var name; + + for ( name in obj ) { + return false; + } + return true; + }, + + // Evaluates a script in a provided context; falls back to the global one + // if not specified. + globalEval: function( code, options, doc ) { + DOMEval( code, { nonce: options && options.nonce }, doc ); + }, + + each: function( obj, callback ) { + var length, i = 0; + + if ( isArrayLike( obj ) ) { + length = obj.length; + for ( ; i < length; i++ ) { + if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) { + break; + } + } + } else { + for ( i in obj ) { + if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) { + break; + } + } + } + + return obj; + }, + + // results is for internal usage only + makeArray: function( arr, results ) { + var ret = results || []; + + if ( arr != null ) { + if ( isArrayLike( Object( arr ) ) ) { + jQuery.merge( ret, + typeof arr === "string" ? + [ arr ] : arr + ); + } else { + push.call( ret, arr ); + } + } + + return ret; + }, + + inArray: function( elem, arr, i ) { + return arr == null ? -1 : indexOf.call( arr, elem, i ); + }, + + // Support: Android <=4.0 only, PhantomJS 1 only + // push.apply(_, arraylike) throws on ancient WebKit + merge: function( first, second ) { + var len = +second.length, + j = 0, + i = first.length; + + for ( ; j < len; j++ ) { + first[ i++ ] = second[ j ]; + } + + first.length = i; + + return first; + }, + + grep: function( elems, callback, invert ) { + var callbackInverse, + matches = [], + i = 0, + length = elems.length, + callbackExpect = !invert; + + // Go through the array, only saving the items + // that pass the validator function + for ( ; i < length; i++ ) { + callbackInverse = !callback( elems[ i ], i ); + if ( callbackInverse !== callbackExpect ) { + matches.push( elems[ i ] ); + } + } + + return matches; + }, + + // arg is for internal usage only + map: function( elems, callback, arg ) { + var length, value, + i = 0, + ret = []; + + // Go through the array, translating each of the items to their new values + if ( isArrayLike( elems ) ) { + length = elems.length; + for ( ; i < length; i++ ) { + value = callback( elems[ i ], i, arg ); + + if ( value != null ) { + ret.push( value ); + } + } + + // Go through every key on the object, + } else { + for ( i in elems ) { + value = callback( elems[ i ], i, arg ); + + if ( value != null ) { + ret.push( value ); + } + } + } + + // Flatten any nested arrays + return flat( ret ); + }, + + // A global GUID counter for objects + guid: 1, + + // jQuery.support is not used in Core but other projects attach their + // properties to it so it needs to exist. + support: support +} ); + +if ( typeof Symbol === "function" ) { + jQuery.fn[ Symbol.iterator ] = arr[ Symbol.iterator ]; +} + +// Populate the class2type map +jQuery.each( "Boolean Number String Function Array Date RegExp Object Error Symbol".split( " " ), +function( _i, name ) { + class2type[ "[object " + name + "]" ] = name.toLowerCase(); +} ); + +function isArrayLike( obj ) { + + // Support: real iOS 8.2 only (not reproducible in simulator) + // `in` check used to prevent JIT error (gh-2145) + // hasOwn isn't used here due to false negatives + // regarding Nodelist length in IE + var length = !!obj && "length" in obj && obj.length, + type = toType( obj ); + + if ( isFunction( obj ) || isWindow( obj ) ) { + return false; + } + + return type === "array" || length === 0 || + typeof length === "number" && length > 0 && ( length - 1 ) in obj; +} +var Sizzle = +/*! + * Sizzle CSS Selector Engine v2.3.5 + * https://sizzlejs.com/ + * + * Copyright JS Foundation and other contributors + * Released under the MIT license + * https://js.foundation/ + * + * Date: 2020-03-14 + */ +( function( window ) { +var i, + support, + Expr, + getText, + isXML, + tokenize, + compile, + select, + outermostContext, + sortInput, + hasDuplicate, + + // Local document vars + setDocument, + document, + docElem, + documentIsHTML, + rbuggyQSA, + rbuggyMatches, + matches, + contains, + + // Instance-specific data + expando = "sizzle" + 1 * new Date(), + preferredDoc = window.document, + dirruns = 0, + done = 0, + classCache = createCache(), + tokenCache = createCache(), + compilerCache = createCache(), + nonnativeSelectorCache = createCache(), + sortOrder = function( a, b ) { + if ( a === b ) { + hasDuplicate = true; + } + return 0; + }, + + // Instance methods + hasOwn = ( {} ).hasOwnProperty, + arr = [], + pop = arr.pop, + pushNative = arr.push, + push = arr.push, + slice = arr.slice, + + // Use a stripped-down indexOf as it's faster than native + // https://jsperf.com/thor-indexof-vs-for/5 + indexOf = function( list, elem ) { + var i = 0, + len = list.length; + for ( ; i < len; i++ ) { + if ( list[ i ] === elem ) { + return i; + } + } + return -1; + }, + + booleans = "checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|" + + "ismap|loop|multiple|open|readonly|required|scoped", + + // Regular expressions + + // http://www.w3.org/TR/css3-selectors/#whitespace + whitespace = "[\\x20\\t\\r\\n\\f]", + + // https://www.w3.org/TR/css-syntax-3/#ident-token-diagram + identifier = "(?:\\\\[\\da-fA-F]{1,6}" + whitespace + + "?|\\\\[^\\r\\n\\f]|[\\w-]|[^\0-\\x7f])+", + + // Attribute selectors: http://www.w3.org/TR/selectors/#attribute-selectors + attributes = "\\[" + whitespace + "*(" + identifier + ")(?:" + whitespace + + + // Operator (capture 2) + "*([*^$|!~]?=)" + whitespace + + + // "Attribute values must be CSS identifiers [capture 5] + // or strings [capture 3 or capture 4]" + "*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|(" + identifier + "))|)" + + whitespace + "*\\]", + + pseudos = ":(" + identifier + ")(?:\\((" + + + // To reduce the number of selectors needing tokenize in the preFilter, prefer arguments: + // 1. quoted (capture 3; capture 4 or capture 5) + "('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|" + + + // 2. simple (capture 6) + "((?:\\\\.|[^\\\\()[\\]]|" + attributes + ")*)|" + + + // 3. anything else (capture 2) + ".*" + + ")\\)|)", + + // Leading and non-escaped trailing whitespace, capturing some non-whitespace characters preceding the latter + rwhitespace = new RegExp( whitespace + "+", "g" ), + rtrim = new RegExp( "^" + whitespace + "+|((?:^|[^\\\\])(?:\\\\.)*)" + + whitespace + "+$", "g" ), + + rcomma = new RegExp( "^" + whitespace + "*," + whitespace + "*" ), + rcombinators = new RegExp( "^" + whitespace + "*([>+~]|" + whitespace + ")" + whitespace + + "*" ), + rdescend = new RegExp( whitespace + "|>" ), + + rpseudo = new RegExp( pseudos ), + ridentifier = new RegExp( "^" + identifier + "$" ), + + matchExpr = { + "ID": new RegExp( "^#(" + identifier + ")" ), + "CLASS": new RegExp( "^\\.(" + identifier + ")" ), + "TAG": new RegExp( "^(" + identifier + "|[*])" ), + "ATTR": new RegExp( "^" + attributes ), + "PSEUDO": new RegExp( "^" + pseudos ), + "CHILD": new RegExp( "^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\(" + + whitespace + "*(even|odd|(([+-]|)(\\d*)n|)" + whitespace + "*(?:([+-]|)" + + whitespace + "*(\\d+)|))" + whitespace + "*\\)|)", "i" ), + "bool": new RegExp( "^(?:" + booleans + ")$", "i" ), + + // For use in libraries implementing .is() + // We use this for POS matching in `select` + "needsContext": new RegExp( "^" + whitespace + + "*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\(" + whitespace + + "*((?:-\\d)?\\d*)" + whitespace + "*\\)|)(?=[^-]|$)", "i" ) + }, + + rhtml = /HTML$/i, + rinputs = /^(?:input|select|textarea|button)$/i, + rheader = /^h\d$/i, + + rnative = /^[^{]+\{\s*\[native \w/, + + // Easily-parseable/retrievable ID or TAG or CLASS selectors + rquickExpr = /^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/, + + rsibling = /[+~]/, + + // CSS escapes + // http://www.w3.org/TR/CSS21/syndata.html#escaped-characters + runescape = new RegExp( "\\\\[\\da-fA-F]{1,6}" + whitespace + "?|\\\\([^\\r\\n\\f])", "g" ), + funescape = function( escape, nonHex ) { + var high = "0x" + escape.slice( 1 ) - 0x10000; + + return nonHex ? + + // Strip the backslash prefix from a non-hex escape sequence + nonHex : + + // Replace a hexadecimal escape sequence with the encoded Unicode code point + // Support: IE <=11+ + // For values outside the Basic Multilingual Plane (BMP), manually construct a + // surrogate pair + high < 0 ? + String.fromCharCode( high + 0x10000 ) : + String.fromCharCode( high >> 10 | 0xD800, high & 0x3FF | 0xDC00 ); + }, + + // CSS string/identifier serialization + // https://drafts.csswg.org/cssom/#common-serializing-idioms + rcssescape = /([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g, + fcssescape = function( ch, asCodePoint ) { + if ( asCodePoint ) { + + // U+0000 NULL becomes U+FFFD REPLACEMENT CHARACTER + if ( ch === "\0" ) { + return "\uFFFD"; + } + + // Control characters and (dependent upon position) numbers get escaped as code points + return ch.slice( 0, -1 ) + "\\" + + ch.charCodeAt( ch.length - 1 ).toString( 16 ) + " "; + } + + // Other potentially-special ASCII characters get backslash-escaped + return "\\" + ch; + }, + + // Used for iframes + // See setDocument() + // Removing the function wrapper causes a "Permission Denied" + // error in IE + unloadHandler = function() { + setDocument(); + }, + + inDisabledFieldset = addCombinator( + function( elem ) { + return elem.disabled === true && elem.nodeName.toLowerCase() === "fieldset"; + }, + { dir: "parentNode", next: "legend" } + ); + +// Optimize for push.apply( _, NodeList ) +try { + push.apply( + ( arr = slice.call( preferredDoc.childNodes ) ), + preferredDoc.childNodes + ); + + // Support: Android<4.0 + // Detect silently failing push.apply + // eslint-disable-next-line no-unused-expressions + arr[ preferredDoc.childNodes.length ].nodeType; +} catch ( e ) { + push = { apply: arr.length ? + + // Leverage slice if possible + function( target, els ) { + pushNative.apply( target, slice.call( els ) ); + } : + + // Support: IE<9 + // Otherwise append directly + function( target, els ) { + var j = target.length, + i = 0; + + // Can't trust NodeList.length + while ( ( target[ j++ ] = els[ i++ ] ) ) {} + target.length = j - 1; + } + }; +} + +function Sizzle( selector, context, results, seed ) { + var m, i, elem, nid, match, groups, newSelector, + newContext = context && context.ownerDocument, + + // nodeType defaults to 9, since context defaults to document + nodeType = context ? context.nodeType : 9; + + results = results || []; + + // Return early from calls with invalid selector or context + if ( typeof selector !== "string" || !selector || + nodeType !== 1 && nodeType !== 9 && nodeType !== 11 ) { + + return results; + } + + // Try to shortcut find operations (as opposed to filters) in HTML documents + if ( !seed ) { + setDocument( context ); + context = context || document; + + if ( documentIsHTML ) { + + // If the selector is sufficiently simple, try using a "get*By*" DOM method + // (excepting DocumentFragment context, where the methods don't exist) + if ( nodeType !== 11 && ( match = rquickExpr.exec( selector ) ) ) { + + // ID selector + if ( ( m = match[ 1 ] ) ) { + + // Document context + if ( nodeType === 9 ) { + if ( ( elem = context.getElementById( m ) ) ) { + + // Support: IE, Opera, Webkit + // TODO: identify versions + // getElementById can match elements by name instead of ID + if ( elem.id === m ) { + results.push( elem ); + return results; + } + } else { + return results; + } + + // Element context + } else { + + // Support: IE, Opera, Webkit + // TODO: identify versions + // getElementById can match elements by name instead of ID + if ( newContext && ( elem = newContext.getElementById( m ) ) && + contains( context, elem ) && + elem.id === m ) { + + results.push( elem ); + return results; + } + } + + // Type selector + } else if ( match[ 2 ] ) { + push.apply( results, context.getElementsByTagName( selector ) ); + return results; + + // Class selector + } else if ( ( m = match[ 3 ] ) && support.getElementsByClassName && + context.getElementsByClassName ) { + + push.apply( results, context.getElementsByClassName( m ) ); + return results; + } + } + + // Take advantage of querySelectorAll + if ( support.qsa && + !nonnativeSelectorCache[ selector + " " ] && + ( !rbuggyQSA || !rbuggyQSA.test( selector ) ) && + + // Support: IE 8 only + // Exclude object elements + ( nodeType !== 1 || context.nodeName.toLowerCase() !== "object" ) ) { + + newSelector = selector; + newContext = context; + + // qSA considers elements outside a scoping root when evaluating child or + // descendant combinators, which is not what we want. + // In such cases, we work around the behavior by prefixing every selector in the + // list with an ID selector referencing the scope context. + // The technique has to be used as well when a leading combinator is used + // as such selectors are not recognized by querySelectorAll. + // Thanks to Andrew Dupont for this technique. + if ( nodeType === 1 && + ( rdescend.test( selector ) || rcombinators.test( selector ) ) ) { + + // Expand context for sibling selectors + newContext = rsibling.test( selector ) && testContext( context.parentNode ) || + context; + + // We can use :scope instead of the ID hack if the browser + // supports it & if we're not changing the context. + if ( newContext !== context || !support.scope ) { + + // Capture the context ID, setting it first if necessary + if ( ( nid = context.getAttribute( "id" ) ) ) { + nid = nid.replace( rcssescape, fcssescape ); + } else { + context.setAttribute( "id", ( nid = expando ) ); + } + } + + // Prefix every selector in the list + groups = tokenize( selector ); + i = groups.length; + while ( i-- ) { + groups[ i ] = ( nid ? "#" + nid : ":scope" ) + " " + + toSelector( groups[ i ] ); + } + newSelector = groups.join( "," ); + } + + try { + push.apply( results, + newContext.querySelectorAll( newSelector ) + ); + return results; + } catch ( qsaError ) { + nonnativeSelectorCache( selector, true ); + } finally { + if ( nid === expando ) { + context.removeAttribute( "id" ); + } + } + } + } + } + + // All others + return select( selector.replace( rtrim, "$1" ), context, results, seed ); +} + +/** + * Create key-value caches of limited size + * @returns {function(string, object)} Returns the Object data after storing it on itself with + * property name the (space-suffixed) string and (if the cache is larger than Expr.cacheLength) + * deleting the oldest entry + */ +function createCache() { + var keys = []; + + function cache( key, value ) { + + // Use (key + " ") to avoid collision with native prototype properties (see Issue #157) + if ( keys.push( key + " " ) > Expr.cacheLength ) { + + // Only keep the most recent entries + delete cache[ keys.shift() ]; + } + return ( cache[ key + " " ] = value ); + } + return cache; +} + +/** + * Mark a function for special use by Sizzle + * @param {Function} fn The function to mark + */ +function markFunction( fn ) { + fn[ expando ] = true; + return fn; +} + +/** + * Support testing using an element + * @param {Function} fn Passed the created element and returns a boolean result + */ +function assert( fn ) { + var el = document.createElement( "fieldset" ); + + try { + return !!fn( el ); + } catch ( e ) { + return false; + } finally { + + // Remove from its parent by default + if ( el.parentNode ) { + el.parentNode.removeChild( el ); + } + + // release memory in IE + el = null; + } +} + +/** + * Adds the same handler for all of the specified attrs + * @param {String} attrs Pipe-separated list of attributes + * @param {Function} handler The method that will be applied + */ +function addHandle( attrs, handler ) { + var arr = attrs.split( "|" ), + i = arr.length; + + while ( i-- ) { + Expr.attrHandle[ arr[ i ] ] = handler; + } +} + +/** + * Checks document order of two siblings + * @param {Element} a + * @param {Element} b + * @returns {Number} Returns less than 0 if a precedes b, greater than 0 if a follows b + */ +function siblingCheck( a, b ) { + var cur = b && a, + diff = cur && a.nodeType === 1 && b.nodeType === 1 && + a.sourceIndex - b.sourceIndex; + + // Use IE sourceIndex if available on both nodes + if ( diff ) { + return diff; + } + + // Check if b follows a + if ( cur ) { + while ( ( cur = cur.nextSibling ) ) { + if ( cur === b ) { + return -1; + } + } + } + + return a ? 1 : -1; +} + +/** + * Returns a function to use in pseudos for input types + * @param {String} type + */ +function createInputPseudo( type ) { + return function( elem ) { + var name = elem.nodeName.toLowerCase(); + return name === "input" && elem.type === type; + }; +} + +/** + * Returns a function to use in pseudos for buttons + * @param {String} type + */ +function createButtonPseudo( type ) { + return function( elem ) { + var name = elem.nodeName.toLowerCase(); + return ( name === "input" || name === "button" ) && elem.type === type; + }; +} + +/** + * Returns a function to use in pseudos for :enabled/:disabled + * @param {Boolean} disabled true for :disabled; false for :enabled + */ +function createDisabledPseudo( disabled ) { + + // Known :disabled false positives: fieldset[disabled] > legend:nth-of-type(n+2) :can-disable + return function( elem ) { + + // Only certain elements can match :enabled or :disabled + // https://html.spec.whatwg.org/multipage/scripting.html#selector-enabled + // https://html.spec.whatwg.org/multipage/scripting.html#selector-disabled + if ( "form" in elem ) { + + // Check for inherited disabledness on relevant non-disabled elements: + // * listed form-associated elements in a disabled fieldset + // https://html.spec.whatwg.org/multipage/forms.html#category-listed + // https://html.spec.whatwg.org/multipage/forms.html#concept-fe-disabled + // * option elements in a disabled optgroup + // https://html.spec.whatwg.org/multipage/forms.html#concept-option-disabled + // All such elements have a "form" property. + if ( elem.parentNode && elem.disabled === false ) { + + // Option elements defer to a parent optgroup if present + if ( "label" in elem ) { + if ( "label" in elem.parentNode ) { + return elem.parentNode.disabled === disabled; + } else { + return elem.disabled === disabled; + } + } + + // Support: IE 6 - 11 + // Use the isDisabled shortcut property to check for disabled fieldset ancestors + return elem.isDisabled === disabled || + + // Where there is no isDisabled, check manually + /* jshint -W018 */ + elem.isDisabled !== !disabled && + inDisabledFieldset( elem ) === disabled; + } + + return elem.disabled === disabled; + + // Try to winnow out elements that can't be disabled before trusting the disabled property. + // Some victims get caught in our net (label, legend, menu, track), but it shouldn't + // even exist on them, let alone have a boolean value. + } else if ( "label" in elem ) { + return elem.disabled === disabled; + } + + // Remaining elements are neither :enabled nor :disabled + return false; + }; +} + +/** + * Returns a function to use in pseudos for positionals + * @param {Function} fn + */ +function createPositionalPseudo( fn ) { + return markFunction( function( argument ) { + argument = +argument; + return markFunction( function( seed, matches ) { + var j, + matchIndexes = fn( [], seed.length, argument ), + i = matchIndexes.length; + + // Match elements found at the specified indexes + while ( i-- ) { + if ( seed[ ( j = matchIndexes[ i ] ) ] ) { + seed[ j ] = !( matches[ j ] = seed[ j ] ); + } + } + } ); + } ); +} + +/** + * Checks a node for validity as a Sizzle context + * @param {Element|Object=} context + * @returns {Element|Object|Boolean} The input node if acceptable, otherwise a falsy value + */ +function testContext( context ) { + return context && typeof context.getElementsByTagName !== "undefined" && context; +} + +// Expose support vars for convenience +support = Sizzle.support = {}; + +/** + * Detects XML nodes + * @param {Element|Object} elem An element or a document + * @returns {Boolean} True iff elem is a non-HTML XML node + */ +isXML = Sizzle.isXML = function( elem ) { + var namespace = elem.namespaceURI, + docElem = ( elem.ownerDocument || elem ).documentElement; + + // Support: IE <=8 + // Assume HTML when documentElement doesn't yet exist, such as inside loading iframes + // https://bugs.jquery.com/ticket/4833 + return !rhtml.test( namespace || docElem && docElem.nodeName || "HTML" ); +}; + +/** + * Sets document-related variables once based on the current document + * @param {Element|Object} [doc] An element or document object to use to set the document + * @returns {Object} Returns the current document + */ +setDocument = Sizzle.setDocument = function( node ) { + var hasCompare, subWindow, + doc = node ? node.ownerDocument || node : preferredDoc; + + // Return early if doc is invalid or already selected + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( doc == document || doc.nodeType !== 9 || !doc.documentElement ) { + return document; + } + + // Update global variables + document = doc; + docElem = document.documentElement; + documentIsHTML = !isXML( document ); + + // Support: IE 9 - 11+, Edge 12 - 18+ + // Accessing iframe documents after unload throws "permission denied" errors (jQuery #13936) + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( preferredDoc != document && + ( subWindow = document.defaultView ) && subWindow.top !== subWindow ) { + + // Support: IE 11, Edge + if ( subWindow.addEventListener ) { + subWindow.addEventListener( "unload", unloadHandler, false ); + + // Support: IE 9 - 10 only + } else if ( subWindow.attachEvent ) { + subWindow.attachEvent( "onunload", unloadHandler ); + } + } + + // Support: IE 8 - 11+, Edge 12 - 18+, Chrome <=16 - 25 only, Firefox <=3.6 - 31 only, + // Safari 4 - 5 only, Opera <=11.6 - 12.x only + // IE/Edge & older browsers don't support the :scope pseudo-class. + // Support: Safari 6.0 only + // Safari 6.0 supports :scope but it's an alias of :root there. + support.scope = assert( function( el ) { + docElem.appendChild( el ).appendChild( document.createElement( "div" ) ); + return typeof el.querySelectorAll !== "undefined" && + !el.querySelectorAll( ":scope fieldset div" ).length; + } ); + + /* Attributes + ---------------------------------------------------------------------- */ + + // Support: IE<8 + // Verify that getAttribute really returns attributes and not properties + // (excepting IE8 booleans) + support.attributes = assert( function( el ) { + el.className = "i"; + return !el.getAttribute( "className" ); + } ); + + /* getElement(s)By* + ---------------------------------------------------------------------- */ + + // Check if getElementsByTagName("*") returns only elements + support.getElementsByTagName = assert( function( el ) { + el.appendChild( document.createComment( "" ) ); + return !el.getElementsByTagName( "*" ).length; + } ); + + // Support: IE<9 + support.getElementsByClassName = rnative.test( document.getElementsByClassName ); + + // Support: IE<10 + // Check if getElementById returns elements by name + // The broken getElementById methods don't pick up programmatically-set names, + // so use a roundabout getElementsByName test + support.getById = assert( function( el ) { + docElem.appendChild( el ).id = expando; + return !document.getElementsByName || !document.getElementsByName( expando ).length; + } ); + + // ID filter and find + if ( support.getById ) { + Expr.filter[ "ID" ] = function( id ) { + var attrId = id.replace( runescape, funescape ); + return function( elem ) { + return elem.getAttribute( "id" ) === attrId; + }; + }; + Expr.find[ "ID" ] = function( id, context ) { + if ( typeof context.getElementById !== "undefined" && documentIsHTML ) { + var elem = context.getElementById( id ); + return elem ? [ elem ] : []; + } + }; + } else { + Expr.filter[ "ID" ] = function( id ) { + var attrId = id.replace( runescape, funescape ); + return function( elem ) { + var node = typeof elem.getAttributeNode !== "undefined" && + elem.getAttributeNode( "id" ); + return node && node.value === attrId; + }; + }; + + // Support: IE 6 - 7 only + // getElementById is not reliable as a find shortcut + Expr.find[ "ID" ] = function( id, context ) { + if ( typeof context.getElementById !== "undefined" && documentIsHTML ) { + var node, i, elems, + elem = context.getElementById( id ); + + if ( elem ) { + + // Verify the id attribute + node = elem.getAttributeNode( "id" ); + if ( node && node.value === id ) { + return [ elem ]; + } + + // Fall back on getElementsByName + elems = context.getElementsByName( id ); + i = 0; + while ( ( elem = elems[ i++ ] ) ) { + node = elem.getAttributeNode( "id" ); + if ( node && node.value === id ) { + return [ elem ]; + } + } + } + + return []; + } + }; + } + + // Tag + Expr.find[ "TAG" ] = support.getElementsByTagName ? + function( tag, context ) { + if ( typeof context.getElementsByTagName !== "undefined" ) { + return context.getElementsByTagName( tag ); + + // DocumentFragment nodes don't have gEBTN + } else if ( support.qsa ) { + return context.querySelectorAll( tag ); + } + } : + + function( tag, context ) { + var elem, + tmp = [], + i = 0, + + // By happy coincidence, a (broken) gEBTN appears on DocumentFragment nodes too + results = context.getElementsByTagName( tag ); + + // Filter out possible comments + if ( tag === "*" ) { + while ( ( elem = results[ i++ ] ) ) { + if ( elem.nodeType === 1 ) { + tmp.push( elem ); + } + } + + return tmp; + } + return results; + }; + + // Class + Expr.find[ "CLASS" ] = support.getElementsByClassName && function( className, context ) { + if ( typeof context.getElementsByClassName !== "undefined" && documentIsHTML ) { + return context.getElementsByClassName( className ); + } + }; + + /* QSA/matchesSelector + ---------------------------------------------------------------------- */ + + // QSA and matchesSelector support + + // matchesSelector(:active) reports false when true (IE9/Opera 11.5) + rbuggyMatches = []; + + // qSa(:focus) reports false when true (Chrome 21) + // We allow this because of a bug in IE8/9 that throws an error + // whenever `document.activeElement` is accessed on an iframe + // So, we allow :focus to pass through QSA all the time to avoid the IE error + // See https://bugs.jquery.com/ticket/13378 + rbuggyQSA = []; + + if ( ( support.qsa = rnative.test( document.querySelectorAll ) ) ) { + + // Build QSA regex + // Regex strategy adopted from Diego Perini + assert( function( el ) { + + var input; + + // Select is set to empty string on purpose + // This is to test IE's treatment of not explicitly + // setting a boolean content attribute, + // since its presence should be enough + // https://bugs.jquery.com/ticket/12359 + docElem.appendChild( el ).innerHTML = "" + + ""; + + // Support: IE8, Opera 11-12.16 + // Nothing should be selected when empty strings follow ^= or $= or *= + // The test attribute must be unknown in Opera but "safe" for WinRT + // https://msdn.microsoft.com/en-us/library/ie/hh465388.aspx#attribute_section + if ( el.querySelectorAll( "[msallowcapture^='']" ).length ) { + rbuggyQSA.push( "[*^$]=" + whitespace + "*(?:''|\"\")" ); + } + + // Support: IE8 + // Boolean attributes and "value" are not treated correctly + if ( !el.querySelectorAll( "[selected]" ).length ) { + rbuggyQSA.push( "\\[" + whitespace + "*(?:value|" + booleans + ")" ); + } + + // Support: Chrome<29, Android<4.4, Safari<7.0+, iOS<7.0+, PhantomJS<1.9.8+ + if ( !el.querySelectorAll( "[id~=" + expando + "-]" ).length ) { + rbuggyQSA.push( "~=" ); + } + + // Support: IE 11+, Edge 15 - 18+ + // IE 11/Edge don't find elements on a `[name='']` query in some cases. + // Adding a temporary attribute to the document before the selection works + // around the issue. + // Interestingly, IE 10 & older don't seem to have the issue. + input = document.createElement( "input" ); + input.setAttribute( "name", "" ); + el.appendChild( input ); + if ( !el.querySelectorAll( "[name='']" ).length ) { + rbuggyQSA.push( "\\[" + whitespace + "*name" + whitespace + "*=" + + whitespace + "*(?:''|\"\")" ); + } + + // Webkit/Opera - :checked should return selected option elements + // http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked + // IE8 throws error here and will not see later tests + if ( !el.querySelectorAll( ":checked" ).length ) { + rbuggyQSA.push( ":checked" ); + } + + // Support: Safari 8+, iOS 8+ + // https://bugs.webkit.org/show_bug.cgi?id=136851 + // In-page `selector#id sibling-combinator selector` fails + if ( !el.querySelectorAll( "a#" + expando + "+*" ).length ) { + rbuggyQSA.push( ".#.+[+~]" ); + } + + // Support: Firefox <=3.6 - 5 only + // Old Firefox doesn't throw on a badly-escaped identifier. + el.querySelectorAll( "\\\f" ); + rbuggyQSA.push( "[\\r\\n\\f]" ); + } ); + + assert( function( el ) { + el.innerHTML = "" + + ""; + + // Support: Windows 8 Native Apps + // The type and name attributes are restricted during .innerHTML assignment + var input = document.createElement( "input" ); + input.setAttribute( "type", "hidden" ); + el.appendChild( input ).setAttribute( "name", "D" ); + + // Support: IE8 + // Enforce case-sensitivity of name attribute + if ( el.querySelectorAll( "[name=d]" ).length ) { + rbuggyQSA.push( "name" + whitespace + "*[*^$|!~]?=" ); + } + + // FF 3.5 - :enabled/:disabled and hidden elements (hidden elements are still enabled) + // IE8 throws error here and will not see later tests + if ( el.querySelectorAll( ":enabled" ).length !== 2 ) { + rbuggyQSA.push( ":enabled", ":disabled" ); + } + + // Support: IE9-11+ + // IE's :disabled selector does not pick up the children of disabled fieldsets + docElem.appendChild( el ).disabled = true; + if ( el.querySelectorAll( ":disabled" ).length !== 2 ) { + rbuggyQSA.push( ":enabled", ":disabled" ); + } + + // Support: Opera 10 - 11 only + // Opera 10-11 does not throw on post-comma invalid pseudos + el.querySelectorAll( "*,:x" ); + rbuggyQSA.push( ",.*:" ); + } ); + } + + if ( ( support.matchesSelector = rnative.test( ( matches = docElem.matches || + docElem.webkitMatchesSelector || + docElem.mozMatchesSelector || + docElem.oMatchesSelector || + docElem.msMatchesSelector ) ) ) ) { + + assert( function( el ) { + + // Check to see if it's possible to do matchesSelector + // on a disconnected node (IE 9) + support.disconnectedMatch = matches.call( el, "*" ); + + // This should fail with an exception + // Gecko does not error, returns false instead + matches.call( el, "[s!='']:x" ); + rbuggyMatches.push( "!=", pseudos ); + } ); + } + + rbuggyQSA = rbuggyQSA.length && new RegExp( rbuggyQSA.join( "|" ) ); + rbuggyMatches = rbuggyMatches.length && new RegExp( rbuggyMatches.join( "|" ) ); + + /* Contains + ---------------------------------------------------------------------- */ + hasCompare = rnative.test( docElem.compareDocumentPosition ); + + // Element contains another + // Purposefully self-exclusive + // As in, an element does not contain itself + contains = hasCompare || rnative.test( docElem.contains ) ? + function( a, b ) { + var adown = a.nodeType === 9 ? a.documentElement : a, + bup = b && b.parentNode; + return a === bup || !!( bup && bup.nodeType === 1 && ( + adown.contains ? + adown.contains( bup ) : + a.compareDocumentPosition && a.compareDocumentPosition( bup ) & 16 + ) ); + } : + function( a, b ) { + if ( b ) { + while ( ( b = b.parentNode ) ) { + if ( b === a ) { + return true; + } + } + } + return false; + }; + + /* Sorting + ---------------------------------------------------------------------- */ + + // Document order sorting + sortOrder = hasCompare ? + function( a, b ) { + + // Flag for duplicate removal + if ( a === b ) { + hasDuplicate = true; + return 0; + } + + // Sort on method existence if only one input has compareDocumentPosition + var compare = !a.compareDocumentPosition - !b.compareDocumentPosition; + if ( compare ) { + return compare; + } + + // Calculate position if both inputs belong to the same document + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + compare = ( a.ownerDocument || a ) == ( b.ownerDocument || b ) ? + a.compareDocumentPosition( b ) : + + // Otherwise we know they are disconnected + 1; + + // Disconnected nodes + if ( compare & 1 || + ( !support.sortDetached && b.compareDocumentPosition( a ) === compare ) ) { + + // Choose the first element that is related to our preferred document + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( a == document || a.ownerDocument == preferredDoc && + contains( preferredDoc, a ) ) { + return -1; + } + + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( b == document || b.ownerDocument == preferredDoc && + contains( preferredDoc, b ) ) { + return 1; + } + + // Maintain original order + return sortInput ? + ( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) : + 0; + } + + return compare & 4 ? -1 : 1; + } : + function( a, b ) { + + // Exit early if the nodes are identical + if ( a === b ) { + hasDuplicate = true; + return 0; + } + + var cur, + i = 0, + aup = a.parentNode, + bup = b.parentNode, + ap = [ a ], + bp = [ b ]; + + // Parentless nodes are either documents or disconnected + if ( !aup || !bup ) { + + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + /* eslint-disable eqeqeq */ + return a == document ? -1 : + b == document ? 1 : + /* eslint-enable eqeqeq */ + aup ? -1 : + bup ? 1 : + sortInput ? + ( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) : + 0; + + // If the nodes are siblings, we can do a quick check + } else if ( aup === bup ) { + return siblingCheck( a, b ); + } + + // Otherwise we need full lists of their ancestors for comparison + cur = a; + while ( ( cur = cur.parentNode ) ) { + ap.unshift( cur ); + } + cur = b; + while ( ( cur = cur.parentNode ) ) { + bp.unshift( cur ); + } + + // Walk down the tree looking for a discrepancy + while ( ap[ i ] === bp[ i ] ) { + i++; + } + + return i ? + + // Do a sibling check if the nodes have a common ancestor + siblingCheck( ap[ i ], bp[ i ] ) : + + // Otherwise nodes in our document sort first + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + /* eslint-disable eqeqeq */ + ap[ i ] == preferredDoc ? -1 : + bp[ i ] == preferredDoc ? 1 : + /* eslint-enable eqeqeq */ + 0; + }; + + return document; +}; + +Sizzle.matches = function( expr, elements ) { + return Sizzle( expr, null, null, elements ); +}; + +Sizzle.matchesSelector = function( elem, expr ) { + setDocument( elem ); + + if ( support.matchesSelector && documentIsHTML && + !nonnativeSelectorCache[ expr + " " ] && + ( !rbuggyMatches || !rbuggyMatches.test( expr ) ) && + ( !rbuggyQSA || !rbuggyQSA.test( expr ) ) ) { + + try { + var ret = matches.call( elem, expr ); + + // IE 9's matchesSelector returns false on disconnected nodes + if ( ret || support.disconnectedMatch || + + // As well, disconnected nodes are said to be in a document + // fragment in IE 9 + elem.document && elem.document.nodeType !== 11 ) { + return ret; + } + } catch ( e ) { + nonnativeSelectorCache( expr, true ); + } + } + + return Sizzle( expr, document, null, [ elem ] ).length > 0; +}; + +Sizzle.contains = function( context, elem ) { + + // Set document vars if needed + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( ( context.ownerDocument || context ) != document ) { + setDocument( context ); + } + return contains( context, elem ); +}; + +Sizzle.attr = function( elem, name ) { + + // Set document vars if needed + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( ( elem.ownerDocument || elem ) != document ) { + setDocument( elem ); + } + + var fn = Expr.attrHandle[ name.toLowerCase() ], + + // Don't get fooled by Object.prototype properties (jQuery #13807) + val = fn && hasOwn.call( Expr.attrHandle, name.toLowerCase() ) ? + fn( elem, name, !documentIsHTML ) : + undefined; + + return val !== undefined ? + val : + support.attributes || !documentIsHTML ? + elem.getAttribute( name ) : + ( val = elem.getAttributeNode( name ) ) && val.specified ? + val.value : + null; +}; + +Sizzle.escape = function( sel ) { + return ( sel + "" ).replace( rcssescape, fcssescape ); +}; + +Sizzle.error = function( msg ) { + throw new Error( "Syntax error, unrecognized expression: " + msg ); +}; + +/** + * Document sorting and removing duplicates + * @param {ArrayLike} results + */ +Sizzle.uniqueSort = function( results ) { + var elem, + duplicates = [], + j = 0, + i = 0; + + // Unless we *know* we can detect duplicates, assume their presence + hasDuplicate = !support.detectDuplicates; + sortInput = !support.sortStable && results.slice( 0 ); + results.sort( sortOrder ); + + if ( hasDuplicate ) { + while ( ( elem = results[ i++ ] ) ) { + if ( elem === results[ i ] ) { + j = duplicates.push( i ); + } + } + while ( j-- ) { + results.splice( duplicates[ j ], 1 ); + } + } + + // Clear input after sorting to release objects + // See https://github.com/jquery/sizzle/pull/225 + sortInput = null; + + return results; +}; + +/** + * Utility function for retrieving the text value of an array of DOM nodes + * @param {Array|Element} elem + */ +getText = Sizzle.getText = function( elem ) { + var node, + ret = "", + i = 0, + nodeType = elem.nodeType; + + if ( !nodeType ) { + + // If no nodeType, this is expected to be an array + while ( ( node = elem[ i++ ] ) ) { + + // Do not traverse comment nodes + ret += getText( node ); + } + } else if ( nodeType === 1 || nodeType === 9 || nodeType === 11 ) { + + // Use textContent for elements + // innerText usage removed for consistency of new lines (jQuery #11153) + if ( typeof elem.textContent === "string" ) { + return elem.textContent; + } else { + + // Traverse its children + for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) { + ret += getText( elem ); + } + } + } else if ( nodeType === 3 || nodeType === 4 ) { + return elem.nodeValue; + } + + // Do not include comment or processing instruction nodes + + return ret; +}; + +Expr = Sizzle.selectors = { + + // Can be adjusted by the user + cacheLength: 50, + + createPseudo: markFunction, + + match: matchExpr, + + attrHandle: {}, + + find: {}, + + relative: { + ">": { dir: "parentNode", first: true }, + " ": { dir: "parentNode" }, + "+": { dir: "previousSibling", first: true }, + "~": { dir: "previousSibling" } + }, + + preFilter: { + "ATTR": function( match ) { + match[ 1 ] = match[ 1 ].replace( runescape, funescape ); + + // Move the given value to match[3] whether quoted or unquoted + match[ 3 ] = ( match[ 3 ] || match[ 4 ] || + match[ 5 ] || "" ).replace( runescape, funescape ); + + if ( match[ 2 ] === "~=" ) { + match[ 3 ] = " " + match[ 3 ] + " "; + } + + return match.slice( 0, 4 ); + }, + + "CHILD": function( match ) { + + /* matches from matchExpr["CHILD"] + 1 type (only|nth|...) + 2 what (child|of-type) + 3 argument (even|odd|\d*|\d*n([+-]\d+)?|...) + 4 xn-component of xn+y argument ([+-]?\d*n|) + 5 sign of xn-component + 6 x of xn-component + 7 sign of y-component + 8 y of y-component + */ + match[ 1 ] = match[ 1 ].toLowerCase(); + + if ( match[ 1 ].slice( 0, 3 ) === "nth" ) { + + // nth-* requires argument + if ( !match[ 3 ] ) { + Sizzle.error( match[ 0 ] ); + } + + // numeric x and y parameters for Expr.filter.CHILD + // remember that false/true cast respectively to 0/1 + match[ 4 ] = +( match[ 4 ] ? + match[ 5 ] + ( match[ 6 ] || 1 ) : + 2 * ( match[ 3 ] === "even" || match[ 3 ] === "odd" ) ); + match[ 5 ] = +( ( match[ 7 ] + match[ 8 ] ) || match[ 3 ] === "odd" ); + + // other types prohibit arguments + } else if ( match[ 3 ] ) { + Sizzle.error( match[ 0 ] ); + } + + return match; + }, + + "PSEUDO": function( match ) { + var excess, + unquoted = !match[ 6 ] && match[ 2 ]; + + if ( matchExpr[ "CHILD" ].test( match[ 0 ] ) ) { + return null; + } + + // Accept quoted arguments as-is + if ( match[ 3 ] ) { + match[ 2 ] = match[ 4 ] || match[ 5 ] || ""; + + // Strip excess characters from unquoted arguments + } else if ( unquoted && rpseudo.test( unquoted ) && + + // Get excess from tokenize (recursively) + ( excess = tokenize( unquoted, true ) ) && + + // advance to the next closing parenthesis + ( excess = unquoted.indexOf( ")", unquoted.length - excess ) - unquoted.length ) ) { + + // excess is a negative index + match[ 0 ] = match[ 0 ].slice( 0, excess ); + match[ 2 ] = unquoted.slice( 0, excess ); + } + + // Return only captures needed by the pseudo filter method (type and argument) + return match.slice( 0, 3 ); + } + }, + + filter: { + + "TAG": function( nodeNameSelector ) { + var nodeName = nodeNameSelector.replace( runescape, funescape ).toLowerCase(); + return nodeNameSelector === "*" ? + function() { + return true; + } : + function( elem ) { + return elem.nodeName && elem.nodeName.toLowerCase() === nodeName; + }; + }, + + "CLASS": function( className ) { + var pattern = classCache[ className + " " ]; + + return pattern || + ( pattern = new RegExp( "(^|" + whitespace + + ")" + className + "(" + whitespace + "|$)" ) ) && classCache( + className, function( elem ) { + return pattern.test( + typeof elem.className === "string" && elem.className || + typeof elem.getAttribute !== "undefined" && + elem.getAttribute( "class" ) || + "" + ); + } ); + }, + + "ATTR": function( name, operator, check ) { + return function( elem ) { + var result = Sizzle.attr( elem, name ); + + if ( result == null ) { + return operator === "!="; + } + if ( !operator ) { + return true; + } + + result += ""; + + /* eslint-disable max-len */ + + return operator === "=" ? result === check : + operator === "!=" ? result !== check : + operator === "^=" ? check && result.indexOf( check ) === 0 : + operator === "*=" ? check && result.indexOf( check ) > -1 : + operator === "$=" ? check && result.slice( -check.length ) === check : + operator === "~=" ? ( " " + result.replace( rwhitespace, " " ) + " " ).indexOf( check ) > -1 : + operator === "|=" ? result === check || result.slice( 0, check.length + 1 ) === check + "-" : + false; + /* eslint-enable max-len */ + + }; + }, + + "CHILD": function( type, what, _argument, first, last ) { + var simple = type.slice( 0, 3 ) !== "nth", + forward = type.slice( -4 ) !== "last", + ofType = what === "of-type"; + + return first === 1 && last === 0 ? + + // Shortcut for :nth-*(n) + function( elem ) { + return !!elem.parentNode; + } : + + function( elem, _context, xml ) { + var cache, uniqueCache, outerCache, node, nodeIndex, start, + dir = simple !== forward ? "nextSibling" : "previousSibling", + parent = elem.parentNode, + name = ofType && elem.nodeName.toLowerCase(), + useCache = !xml && !ofType, + diff = false; + + if ( parent ) { + + // :(first|last|only)-(child|of-type) + if ( simple ) { + while ( dir ) { + node = elem; + while ( ( node = node[ dir ] ) ) { + if ( ofType ? + node.nodeName.toLowerCase() === name : + node.nodeType === 1 ) { + + return false; + } + } + + // Reverse direction for :only-* (if we haven't yet done so) + start = dir = type === "only" && !start && "nextSibling"; + } + return true; + } + + start = [ forward ? parent.firstChild : parent.lastChild ]; + + // non-xml :nth-child(...) stores cache data on `parent` + if ( forward && useCache ) { + + // Seek `elem` from a previously-cached index + + // ...in a gzip-friendly way + node = parent; + outerCache = node[ expando ] || ( node[ expando ] = {} ); + + // Support: IE <9 only + // Defend against cloned attroperties (jQuery gh-1709) + uniqueCache = outerCache[ node.uniqueID ] || + ( outerCache[ node.uniqueID ] = {} ); + + cache = uniqueCache[ type ] || []; + nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ]; + diff = nodeIndex && cache[ 2 ]; + node = nodeIndex && parent.childNodes[ nodeIndex ]; + + while ( ( node = ++nodeIndex && node && node[ dir ] || + + // Fallback to seeking `elem` from the start + ( diff = nodeIndex = 0 ) || start.pop() ) ) { + + // When found, cache indexes on `parent` and break + if ( node.nodeType === 1 && ++diff && node === elem ) { + uniqueCache[ type ] = [ dirruns, nodeIndex, diff ]; + break; + } + } + + } else { + + // Use previously-cached element index if available + if ( useCache ) { + + // ...in a gzip-friendly way + node = elem; + outerCache = node[ expando ] || ( node[ expando ] = {} ); + + // Support: IE <9 only + // Defend against cloned attroperties (jQuery gh-1709) + uniqueCache = outerCache[ node.uniqueID ] || + ( outerCache[ node.uniqueID ] = {} ); + + cache = uniqueCache[ type ] || []; + nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ]; + diff = nodeIndex; + } + + // xml :nth-child(...) + // or :nth-last-child(...) or :nth(-last)?-of-type(...) + if ( diff === false ) { + + // Use the same loop as above to seek `elem` from the start + while ( ( node = ++nodeIndex && node && node[ dir ] || + ( diff = nodeIndex = 0 ) || start.pop() ) ) { + + if ( ( ofType ? + node.nodeName.toLowerCase() === name : + node.nodeType === 1 ) && + ++diff ) { + + // Cache the index of each encountered element + if ( useCache ) { + outerCache = node[ expando ] || + ( node[ expando ] = {} ); + + // Support: IE <9 only + // Defend against cloned attroperties (jQuery gh-1709) + uniqueCache = outerCache[ node.uniqueID ] || + ( outerCache[ node.uniqueID ] = {} ); + + uniqueCache[ type ] = [ dirruns, diff ]; + } + + if ( node === elem ) { + break; + } + } + } + } + } + + // Incorporate the offset, then check against cycle size + diff -= last; + return diff === first || ( diff % first === 0 && diff / first >= 0 ); + } + }; + }, + + "PSEUDO": function( pseudo, argument ) { + + // pseudo-class names are case-insensitive + // http://www.w3.org/TR/selectors/#pseudo-classes + // Prioritize by case sensitivity in case custom pseudos are added with uppercase letters + // Remember that setFilters inherits from pseudos + var args, + fn = Expr.pseudos[ pseudo ] || Expr.setFilters[ pseudo.toLowerCase() ] || + Sizzle.error( "unsupported pseudo: " + pseudo ); + + // The user may use createPseudo to indicate that + // arguments are needed to create the filter function + // just as Sizzle does + if ( fn[ expando ] ) { + return fn( argument ); + } + + // But maintain support for old signatures + if ( fn.length > 1 ) { + args = [ pseudo, pseudo, "", argument ]; + return Expr.setFilters.hasOwnProperty( pseudo.toLowerCase() ) ? + markFunction( function( seed, matches ) { + var idx, + matched = fn( seed, argument ), + i = matched.length; + while ( i-- ) { + idx = indexOf( seed, matched[ i ] ); + seed[ idx ] = !( matches[ idx ] = matched[ i ] ); + } + } ) : + function( elem ) { + return fn( elem, 0, args ); + }; + } + + return fn; + } + }, + + pseudos: { + + // Potentially complex pseudos + "not": markFunction( function( selector ) { + + // Trim the selector passed to compile + // to avoid treating leading and trailing + // spaces as combinators + var input = [], + results = [], + matcher = compile( selector.replace( rtrim, "$1" ) ); + + return matcher[ expando ] ? + markFunction( function( seed, matches, _context, xml ) { + var elem, + unmatched = matcher( seed, null, xml, [] ), + i = seed.length; + + // Match elements unmatched by `matcher` + while ( i-- ) { + if ( ( elem = unmatched[ i ] ) ) { + seed[ i ] = !( matches[ i ] = elem ); + } + } + } ) : + function( elem, _context, xml ) { + input[ 0 ] = elem; + matcher( input, null, xml, results ); + + // Don't keep the element (issue #299) + input[ 0 ] = null; + return !results.pop(); + }; + } ), + + "has": markFunction( function( selector ) { + return function( elem ) { + return Sizzle( selector, elem ).length > 0; + }; + } ), + + "contains": markFunction( function( text ) { + text = text.replace( runescape, funescape ); + return function( elem ) { + return ( elem.textContent || getText( elem ) ).indexOf( text ) > -1; + }; + } ), + + // "Whether an element is represented by a :lang() selector + // is based solely on the element's language value + // being equal to the identifier C, + // or beginning with the identifier C immediately followed by "-". + // The matching of C against the element's language value is performed case-insensitively. + // The identifier C does not have to be a valid language name." + // http://www.w3.org/TR/selectors/#lang-pseudo + "lang": markFunction( function( lang ) { + + // lang value must be a valid identifier + if ( !ridentifier.test( lang || "" ) ) { + Sizzle.error( "unsupported lang: " + lang ); + } + lang = lang.replace( runescape, funescape ).toLowerCase(); + return function( elem ) { + var elemLang; + do { + if ( ( elemLang = documentIsHTML ? + elem.lang : + elem.getAttribute( "xml:lang" ) || elem.getAttribute( "lang" ) ) ) { + + elemLang = elemLang.toLowerCase(); + return elemLang === lang || elemLang.indexOf( lang + "-" ) === 0; + } + } while ( ( elem = elem.parentNode ) && elem.nodeType === 1 ); + return false; + }; + } ), + + // Miscellaneous + "target": function( elem ) { + var hash = window.location && window.location.hash; + return hash && hash.slice( 1 ) === elem.id; + }, + + "root": function( elem ) { + return elem === docElem; + }, + + "focus": function( elem ) { + return elem === document.activeElement && + ( !document.hasFocus || document.hasFocus() ) && + !!( elem.type || elem.href || ~elem.tabIndex ); + }, + + // Boolean properties + "enabled": createDisabledPseudo( false ), + "disabled": createDisabledPseudo( true ), + + "checked": function( elem ) { + + // In CSS3, :checked should return both checked and selected elements + // http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked + var nodeName = elem.nodeName.toLowerCase(); + return ( nodeName === "input" && !!elem.checked ) || + ( nodeName === "option" && !!elem.selected ); + }, + + "selected": function( elem ) { + + // Accessing this property makes selected-by-default + // options in Safari work properly + if ( elem.parentNode ) { + // eslint-disable-next-line no-unused-expressions + elem.parentNode.selectedIndex; + } + + return elem.selected === true; + }, + + // Contents + "empty": function( elem ) { + + // http://www.w3.org/TR/selectors/#empty-pseudo + // :empty is negated by element (1) or content nodes (text: 3; cdata: 4; entity ref: 5), + // but not by others (comment: 8; processing instruction: 7; etc.) + // nodeType < 6 works because attributes (2) do not appear as children + for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) { + if ( elem.nodeType < 6 ) { + return false; + } + } + return true; + }, + + "parent": function( elem ) { + return !Expr.pseudos[ "empty" ]( elem ); + }, + + // Element/input types + "header": function( elem ) { + return rheader.test( elem.nodeName ); + }, + + "input": function( elem ) { + return rinputs.test( elem.nodeName ); + }, + + "button": function( elem ) { + var name = elem.nodeName.toLowerCase(); + return name === "input" && elem.type === "button" || name === "button"; + }, + + "text": function( elem ) { + var attr; + return elem.nodeName.toLowerCase() === "input" && + elem.type === "text" && + + // Support: IE<8 + // New HTML5 attribute values (e.g., "search") appear with elem.type === "text" + ( ( attr = elem.getAttribute( "type" ) ) == null || + attr.toLowerCase() === "text" ); + }, + + // Position-in-collection + "first": createPositionalPseudo( function() { + return [ 0 ]; + } ), + + "last": createPositionalPseudo( function( _matchIndexes, length ) { + return [ length - 1 ]; + } ), + + "eq": createPositionalPseudo( function( _matchIndexes, length, argument ) { + return [ argument < 0 ? argument + length : argument ]; + } ), + + "even": createPositionalPseudo( function( matchIndexes, length ) { + var i = 0; + for ( ; i < length; i += 2 ) { + matchIndexes.push( i ); + } + return matchIndexes; + } ), + + "odd": createPositionalPseudo( function( matchIndexes, length ) { + var i = 1; + for ( ; i < length; i += 2 ) { + matchIndexes.push( i ); + } + return matchIndexes; + } ), + + "lt": createPositionalPseudo( function( matchIndexes, length, argument ) { + var i = argument < 0 ? + argument + length : + argument > length ? + length : + argument; + for ( ; --i >= 0; ) { + matchIndexes.push( i ); + } + return matchIndexes; + } ), + + "gt": createPositionalPseudo( function( matchIndexes, length, argument ) { + var i = argument < 0 ? argument + length : argument; + for ( ; ++i < length; ) { + matchIndexes.push( i ); + } + return matchIndexes; + } ) + } +}; + +Expr.pseudos[ "nth" ] = Expr.pseudos[ "eq" ]; + +// Add button/input type pseudos +for ( i in { radio: true, checkbox: true, file: true, password: true, image: true } ) { + Expr.pseudos[ i ] = createInputPseudo( i ); +} +for ( i in { submit: true, reset: true } ) { + Expr.pseudos[ i ] = createButtonPseudo( i ); +} + +// Easy API for creating new setFilters +function setFilters() {} +setFilters.prototype = Expr.filters = Expr.pseudos; +Expr.setFilters = new setFilters(); + +tokenize = Sizzle.tokenize = function( selector, parseOnly ) { + var matched, match, tokens, type, + soFar, groups, preFilters, + cached = tokenCache[ selector + " " ]; + + if ( cached ) { + return parseOnly ? 0 : cached.slice( 0 ); + } + + soFar = selector; + groups = []; + preFilters = Expr.preFilter; + + while ( soFar ) { + + // Comma and first run + if ( !matched || ( match = rcomma.exec( soFar ) ) ) { + if ( match ) { + + // Don't consume trailing commas as valid + soFar = soFar.slice( match[ 0 ].length ) || soFar; + } + groups.push( ( tokens = [] ) ); + } + + matched = false; + + // Combinators + if ( ( match = rcombinators.exec( soFar ) ) ) { + matched = match.shift(); + tokens.push( { + value: matched, + + // Cast descendant combinators to space + type: match[ 0 ].replace( rtrim, " " ) + } ); + soFar = soFar.slice( matched.length ); + } + + // Filters + for ( type in Expr.filter ) { + if ( ( match = matchExpr[ type ].exec( soFar ) ) && ( !preFilters[ type ] || + ( match = preFilters[ type ]( match ) ) ) ) { + matched = match.shift(); + tokens.push( { + value: matched, + type: type, + matches: match + } ); + soFar = soFar.slice( matched.length ); + } + } + + if ( !matched ) { + break; + } + } + + // Return the length of the invalid excess + // if we're just parsing + // Otherwise, throw an error or return tokens + return parseOnly ? + soFar.length : + soFar ? + Sizzle.error( selector ) : + + // Cache the tokens + tokenCache( selector, groups ).slice( 0 ); +}; + +function toSelector( tokens ) { + var i = 0, + len = tokens.length, + selector = ""; + for ( ; i < len; i++ ) { + selector += tokens[ i ].value; + } + return selector; +} + +function addCombinator( matcher, combinator, base ) { + var dir = combinator.dir, + skip = combinator.next, + key = skip || dir, + checkNonElements = base && key === "parentNode", + doneName = done++; + + return combinator.first ? + + // Check against closest ancestor/preceding element + function( elem, context, xml ) { + while ( ( elem = elem[ dir ] ) ) { + if ( elem.nodeType === 1 || checkNonElements ) { + return matcher( elem, context, xml ); + } + } + return false; + } : + + // Check against all ancestor/preceding elements + function( elem, context, xml ) { + var oldCache, uniqueCache, outerCache, + newCache = [ dirruns, doneName ]; + + // We can't set arbitrary data on XML nodes, so they don't benefit from combinator caching + if ( xml ) { + while ( ( elem = elem[ dir ] ) ) { + if ( elem.nodeType === 1 || checkNonElements ) { + if ( matcher( elem, context, xml ) ) { + return true; + } + } + } + } else { + while ( ( elem = elem[ dir ] ) ) { + if ( elem.nodeType === 1 || checkNonElements ) { + outerCache = elem[ expando ] || ( elem[ expando ] = {} ); + + // Support: IE <9 only + // Defend against cloned attroperties (jQuery gh-1709) + uniqueCache = outerCache[ elem.uniqueID ] || + ( outerCache[ elem.uniqueID ] = {} ); + + if ( skip && skip === elem.nodeName.toLowerCase() ) { + elem = elem[ dir ] || elem; + } else if ( ( oldCache = uniqueCache[ key ] ) && + oldCache[ 0 ] === dirruns && oldCache[ 1 ] === doneName ) { + + // Assign to newCache so results back-propagate to previous elements + return ( newCache[ 2 ] = oldCache[ 2 ] ); + } else { + + // Reuse newcache so results back-propagate to previous elements + uniqueCache[ key ] = newCache; + + // A match means we're done; a fail means we have to keep checking + if ( ( newCache[ 2 ] = matcher( elem, context, xml ) ) ) { + return true; + } + } + } + } + } + return false; + }; +} + +function elementMatcher( matchers ) { + return matchers.length > 1 ? + function( elem, context, xml ) { + var i = matchers.length; + while ( i-- ) { + if ( !matchers[ i ]( elem, context, xml ) ) { + return false; + } + } + return true; + } : + matchers[ 0 ]; +} + +function multipleContexts( selector, contexts, results ) { + var i = 0, + len = contexts.length; + for ( ; i < len; i++ ) { + Sizzle( selector, contexts[ i ], results ); + } + return results; +} + +function condense( unmatched, map, filter, context, xml ) { + var elem, + newUnmatched = [], + i = 0, + len = unmatched.length, + mapped = map != null; + + for ( ; i < len; i++ ) { + if ( ( elem = unmatched[ i ] ) ) { + if ( !filter || filter( elem, context, xml ) ) { + newUnmatched.push( elem ); + if ( mapped ) { + map.push( i ); + } + } + } + } + + return newUnmatched; +} + +function setMatcher( preFilter, selector, matcher, postFilter, postFinder, postSelector ) { + if ( postFilter && !postFilter[ expando ] ) { + postFilter = setMatcher( postFilter ); + } + if ( postFinder && !postFinder[ expando ] ) { + postFinder = setMatcher( postFinder, postSelector ); + } + return markFunction( function( seed, results, context, xml ) { + var temp, i, elem, + preMap = [], + postMap = [], + preexisting = results.length, + + // Get initial elements from seed or context + elems = seed || multipleContexts( + selector || "*", + context.nodeType ? [ context ] : context, + [] + ), + + // Prefilter to get matcher input, preserving a map for seed-results synchronization + matcherIn = preFilter && ( seed || !selector ) ? + condense( elems, preMap, preFilter, context, xml ) : + elems, + + matcherOut = matcher ? + + // If we have a postFinder, or filtered seed, or non-seed postFilter or preexisting results, + postFinder || ( seed ? preFilter : preexisting || postFilter ) ? + + // ...intermediate processing is necessary + [] : + + // ...otherwise use results directly + results : + matcherIn; + + // Find primary matches + if ( matcher ) { + matcher( matcherIn, matcherOut, context, xml ); + } + + // Apply postFilter + if ( postFilter ) { + temp = condense( matcherOut, postMap ); + postFilter( temp, [], context, xml ); + + // Un-match failing elements by moving them back to matcherIn + i = temp.length; + while ( i-- ) { + if ( ( elem = temp[ i ] ) ) { + matcherOut[ postMap[ i ] ] = !( matcherIn[ postMap[ i ] ] = elem ); + } + } + } + + if ( seed ) { + if ( postFinder || preFilter ) { + if ( postFinder ) { + + // Get the final matcherOut by condensing this intermediate into postFinder contexts + temp = []; + i = matcherOut.length; + while ( i-- ) { + if ( ( elem = matcherOut[ i ] ) ) { + + // Restore matcherIn since elem is not yet a final match + temp.push( ( matcherIn[ i ] = elem ) ); + } + } + postFinder( null, ( matcherOut = [] ), temp, xml ); + } + + // Move matched elements from seed to results to keep them synchronized + i = matcherOut.length; + while ( i-- ) { + if ( ( elem = matcherOut[ i ] ) && + ( temp = postFinder ? indexOf( seed, elem ) : preMap[ i ] ) > -1 ) { + + seed[ temp ] = !( results[ temp ] = elem ); + } + } + } + + // Add elements to results, through postFinder if defined + } else { + matcherOut = condense( + matcherOut === results ? + matcherOut.splice( preexisting, matcherOut.length ) : + matcherOut + ); + if ( postFinder ) { + postFinder( null, results, matcherOut, xml ); + } else { + push.apply( results, matcherOut ); + } + } + } ); +} + +function matcherFromTokens( tokens ) { + var checkContext, matcher, j, + len = tokens.length, + leadingRelative = Expr.relative[ tokens[ 0 ].type ], + implicitRelative = leadingRelative || Expr.relative[ " " ], + i = leadingRelative ? 1 : 0, + + // The foundational matcher ensures that elements are reachable from top-level context(s) + matchContext = addCombinator( function( elem ) { + return elem === checkContext; + }, implicitRelative, true ), + matchAnyContext = addCombinator( function( elem ) { + return indexOf( checkContext, elem ) > -1; + }, implicitRelative, true ), + matchers = [ function( elem, context, xml ) { + var ret = ( !leadingRelative && ( xml || context !== outermostContext ) ) || ( + ( checkContext = context ).nodeType ? + matchContext( elem, context, xml ) : + matchAnyContext( elem, context, xml ) ); + + // Avoid hanging onto element (issue #299) + checkContext = null; + return ret; + } ]; + + for ( ; i < len; i++ ) { + if ( ( matcher = Expr.relative[ tokens[ i ].type ] ) ) { + matchers = [ addCombinator( elementMatcher( matchers ), matcher ) ]; + } else { + matcher = Expr.filter[ tokens[ i ].type ].apply( null, tokens[ i ].matches ); + + // Return special upon seeing a positional matcher + if ( matcher[ expando ] ) { + + // Find the next relative operator (if any) for proper handling + j = ++i; + for ( ; j < len; j++ ) { + if ( Expr.relative[ tokens[ j ].type ] ) { + break; + } + } + return setMatcher( + i > 1 && elementMatcher( matchers ), + i > 1 && toSelector( + + // If the preceding token was a descendant combinator, insert an implicit any-element `*` + tokens + .slice( 0, i - 1 ) + .concat( { value: tokens[ i - 2 ].type === " " ? "*" : "" } ) + ).replace( rtrim, "$1" ), + matcher, + i < j && matcherFromTokens( tokens.slice( i, j ) ), + j < len && matcherFromTokens( ( tokens = tokens.slice( j ) ) ), + j < len && toSelector( tokens ) + ); + } + matchers.push( matcher ); + } + } + + return elementMatcher( matchers ); +} + +function matcherFromGroupMatchers( elementMatchers, setMatchers ) { + var bySet = setMatchers.length > 0, + byElement = elementMatchers.length > 0, + superMatcher = function( seed, context, xml, results, outermost ) { + var elem, j, matcher, + matchedCount = 0, + i = "0", + unmatched = seed && [], + setMatched = [], + contextBackup = outermostContext, + + // We must always have either seed elements or outermost context + elems = seed || byElement && Expr.find[ "TAG" ]( "*", outermost ), + + // Use integer dirruns iff this is the outermost matcher + dirrunsUnique = ( dirruns += contextBackup == null ? 1 : Math.random() || 0.1 ), + len = elems.length; + + if ( outermost ) { + + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + outermostContext = context == document || context || outermost; + } + + // Add elements passing elementMatchers directly to results + // Support: IE<9, Safari + // Tolerate NodeList properties (IE: "length"; Safari: ) matching elements by id + for ( ; i !== len && ( elem = elems[ i ] ) != null; i++ ) { + if ( byElement && elem ) { + j = 0; + + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( !context && elem.ownerDocument != document ) { + setDocument( elem ); + xml = !documentIsHTML; + } + while ( ( matcher = elementMatchers[ j++ ] ) ) { + if ( matcher( elem, context || document, xml ) ) { + results.push( elem ); + break; + } + } + if ( outermost ) { + dirruns = dirrunsUnique; + } + } + + // Track unmatched elements for set filters + if ( bySet ) { + + // They will have gone through all possible matchers + if ( ( elem = !matcher && elem ) ) { + matchedCount--; + } + + // Lengthen the array for every element, matched or not + if ( seed ) { + unmatched.push( elem ); + } + } + } + + // `i` is now the count of elements visited above, and adding it to `matchedCount` + // makes the latter nonnegative. + matchedCount += i; + + // Apply set filters to unmatched elements + // NOTE: This can be skipped if there are no unmatched elements (i.e., `matchedCount` + // equals `i`), unless we didn't visit _any_ elements in the above loop because we have + // no element matchers and no seed. + // Incrementing an initially-string "0" `i` allows `i` to remain a string only in that + // case, which will result in a "00" `matchedCount` that differs from `i` but is also + // numerically zero. + if ( bySet && i !== matchedCount ) { + j = 0; + while ( ( matcher = setMatchers[ j++ ] ) ) { + matcher( unmatched, setMatched, context, xml ); + } + + if ( seed ) { + + // Reintegrate element matches to eliminate the need for sorting + if ( matchedCount > 0 ) { + while ( i-- ) { + if ( !( unmatched[ i ] || setMatched[ i ] ) ) { + setMatched[ i ] = pop.call( results ); + } + } + } + + // Discard index placeholder values to get only actual matches + setMatched = condense( setMatched ); + } + + // Add matches to results + push.apply( results, setMatched ); + + // Seedless set matches succeeding multiple successful matchers stipulate sorting + if ( outermost && !seed && setMatched.length > 0 && + ( matchedCount + setMatchers.length ) > 1 ) { + + Sizzle.uniqueSort( results ); + } + } + + // Override manipulation of globals by nested matchers + if ( outermost ) { + dirruns = dirrunsUnique; + outermostContext = contextBackup; + } + + return unmatched; + }; + + return bySet ? + markFunction( superMatcher ) : + superMatcher; +} + +compile = Sizzle.compile = function( selector, match /* Internal Use Only */ ) { + var i, + setMatchers = [], + elementMatchers = [], + cached = compilerCache[ selector + " " ]; + + if ( !cached ) { + + // Generate a function of recursive functions that can be used to check each element + if ( !match ) { + match = tokenize( selector ); + } + i = match.length; + while ( i-- ) { + cached = matcherFromTokens( match[ i ] ); + if ( cached[ expando ] ) { + setMatchers.push( cached ); + } else { + elementMatchers.push( cached ); + } + } + + // Cache the compiled function + cached = compilerCache( + selector, + matcherFromGroupMatchers( elementMatchers, setMatchers ) + ); + + // Save selector and tokenization + cached.selector = selector; + } + return cached; +}; + +/** + * A low-level selection function that works with Sizzle's compiled + * selector functions + * @param {String|Function} selector A selector or a pre-compiled + * selector function built with Sizzle.compile + * @param {Element} context + * @param {Array} [results] + * @param {Array} [seed] A set of elements to match against + */ +select = Sizzle.select = function( selector, context, results, seed ) { + var i, tokens, token, type, find, + compiled = typeof selector === "function" && selector, + match = !seed && tokenize( ( selector = compiled.selector || selector ) ); + + results = results || []; + + // Try to minimize operations if there is only one selector in the list and no seed + // (the latter of which guarantees us context) + if ( match.length === 1 ) { + + // Reduce context if the leading compound selector is an ID + tokens = match[ 0 ] = match[ 0 ].slice( 0 ); + if ( tokens.length > 2 && ( token = tokens[ 0 ] ).type === "ID" && + context.nodeType === 9 && documentIsHTML && Expr.relative[ tokens[ 1 ].type ] ) { + + context = ( Expr.find[ "ID" ]( token.matches[ 0 ] + .replace( runescape, funescape ), context ) || [] )[ 0 ]; + if ( !context ) { + return results; + + // Precompiled matchers will still verify ancestry, so step up a level + } else if ( compiled ) { + context = context.parentNode; + } + + selector = selector.slice( tokens.shift().value.length ); + } + + // Fetch a seed set for right-to-left matching + i = matchExpr[ "needsContext" ].test( selector ) ? 0 : tokens.length; + while ( i-- ) { + token = tokens[ i ]; + + // Abort if we hit a combinator + if ( Expr.relative[ ( type = token.type ) ] ) { + break; + } + if ( ( find = Expr.find[ type ] ) ) { + + // Search, expanding context for leading sibling combinators + if ( ( seed = find( + token.matches[ 0 ].replace( runescape, funescape ), + rsibling.test( tokens[ 0 ].type ) && testContext( context.parentNode ) || + context + ) ) ) { + + // If seed is empty or no tokens remain, we can return early + tokens.splice( i, 1 ); + selector = seed.length && toSelector( tokens ); + if ( !selector ) { + push.apply( results, seed ); + return results; + } + + break; + } + } + } + } + + // Compile and execute a filtering function if one is not provided + // Provide `match` to avoid retokenization if we modified the selector above + ( compiled || compile( selector, match ) )( + seed, + context, + !documentIsHTML, + results, + !context || rsibling.test( selector ) && testContext( context.parentNode ) || context + ); + return results; +}; + +// One-time assignments + +// Sort stability +support.sortStable = expando.split( "" ).sort( sortOrder ).join( "" ) === expando; + +// Support: Chrome 14-35+ +// Always assume duplicates if they aren't passed to the comparison function +support.detectDuplicates = !!hasDuplicate; + +// Initialize against the default document +setDocument(); + +// Support: Webkit<537.32 - Safari 6.0.3/Chrome 25 (fixed in Chrome 27) +// Detached nodes confoundingly follow *each other* +support.sortDetached = assert( function( el ) { + + // Should return 1, but returns 4 (following) + return el.compareDocumentPosition( document.createElement( "fieldset" ) ) & 1; +} ); + +// Support: IE<8 +// Prevent attribute/property "interpolation" +// https://msdn.microsoft.com/en-us/library/ms536429%28VS.85%29.aspx +if ( !assert( function( el ) { + el.innerHTML = ""; + return el.firstChild.getAttribute( "href" ) === "#"; +} ) ) { + addHandle( "type|href|height|width", function( elem, name, isXML ) { + if ( !isXML ) { + return elem.getAttribute( name, name.toLowerCase() === "type" ? 1 : 2 ); + } + } ); +} + +// Support: IE<9 +// Use defaultValue in place of getAttribute("value") +if ( !support.attributes || !assert( function( el ) { + el.innerHTML = ""; + el.firstChild.setAttribute( "value", "" ); + return el.firstChild.getAttribute( "value" ) === ""; +} ) ) { + addHandle( "value", function( elem, _name, isXML ) { + if ( !isXML && elem.nodeName.toLowerCase() === "input" ) { + return elem.defaultValue; + } + } ); +} + +// Support: IE<9 +// Use getAttributeNode to fetch booleans when getAttribute lies +if ( !assert( function( el ) { + return el.getAttribute( "disabled" ) == null; +} ) ) { + addHandle( booleans, function( elem, name, isXML ) { + var val; + if ( !isXML ) { + return elem[ name ] === true ? name.toLowerCase() : + ( val = elem.getAttributeNode( name ) ) && val.specified ? + val.value : + null; + } + } ); +} + +return Sizzle; + +} )( window ); + + + +jQuery.find = Sizzle; +jQuery.expr = Sizzle.selectors; + +// Deprecated +jQuery.expr[ ":" ] = jQuery.expr.pseudos; +jQuery.uniqueSort = jQuery.unique = Sizzle.uniqueSort; +jQuery.text = Sizzle.getText; +jQuery.isXMLDoc = Sizzle.isXML; +jQuery.contains = Sizzle.contains; +jQuery.escapeSelector = Sizzle.escape; + + + + +var dir = function( elem, dir, until ) { + var matched = [], + truncate = until !== undefined; + + while ( ( elem = elem[ dir ] ) && elem.nodeType !== 9 ) { + if ( elem.nodeType === 1 ) { + if ( truncate && jQuery( elem ).is( until ) ) { + break; + } + matched.push( elem ); + } + } + return matched; +}; + + +var siblings = function( n, elem ) { + var matched = []; + + for ( ; n; n = n.nextSibling ) { + if ( n.nodeType === 1 && n !== elem ) { + matched.push( n ); + } + } + + return matched; +}; + + +var rneedsContext = jQuery.expr.match.needsContext; + + + +function nodeName( elem, name ) { + + return elem.nodeName && elem.nodeName.toLowerCase() === name.toLowerCase(); + +}; +var rsingleTag = ( /^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i ); + + + +// Implement the identical functionality for filter and not +function winnow( elements, qualifier, not ) { + if ( isFunction( qualifier ) ) { + return jQuery.grep( elements, function( elem, i ) { + return !!qualifier.call( elem, i, elem ) !== not; + } ); + } + + // Single element + if ( qualifier.nodeType ) { + return jQuery.grep( elements, function( elem ) { + return ( elem === qualifier ) !== not; + } ); + } + + // Arraylike of elements (jQuery, arguments, Array) + if ( typeof qualifier !== "string" ) { + return jQuery.grep( elements, function( elem ) { + return ( indexOf.call( qualifier, elem ) > -1 ) !== not; + } ); + } + + // Filtered directly for both simple and complex selectors + return jQuery.filter( qualifier, elements, not ); +} + +jQuery.filter = function( expr, elems, not ) { + var elem = elems[ 0 ]; + + if ( not ) { + expr = ":not(" + expr + ")"; + } + + if ( elems.length === 1 && elem.nodeType === 1 ) { + return jQuery.find.matchesSelector( elem, expr ) ? [ elem ] : []; + } + + return jQuery.find.matches( expr, jQuery.grep( elems, function( elem ) { + return elem.nodeType === 1; + } ) ); +}; + +jQuery.fn.extend( { + find: function( selector ) { + var i, ret, + len = this.length, + self = this; + + if ( typeof selector !== "string" ) { + return this.pushStack( jQuery( selector ).filter( function() { + for ( i = 0; i < len; i++ ) { + if ( jQuery.contains( self[ i ], this ) ) { + return true; + } + } + } ) ); + } + + ret = this.pushStack( [] ); + + for ( i = 0; i < len; i++ ) { + jQuery.find( selector, self[ i ], ret ); + } + + return len > 1 ? jQuery.uniqueSort( ret ) : ret; + }, + filter: function( selector ) { + return this.pushStack( winnow( this, selector || [], false ) ); + }, + not: function( selector ) { + return this.pushStack( winnow( this, selector || [], true ) ); + }, + is: function( selector ) { + return !!winnow( + this, + + // If this is a positional/relative selector, check membership in the returned set + // so $("p:first").is("p:last") won't return true for a doc with two "p". + typeof selector === "string" && rneedsContext.test( selector ) ? + jQuery( selector ) : + selector || [], + false + ).length; + } +} ); + + +// Initialize a jQuery object + + +// A central reference to the root jQuery(document) +var rootjQuery, + + // A simple way to check for HTML strings + // Prioritize #id over to avoid XSS via location.hash (#9521) + // Strict HTML recognition (#11290: must start with <) + // Shortcut simple #id case for speed + rquickExpr = /^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/, + + init = jQuery.fn.init = function( selector, context, root ) { + var match, elem; + + // HANDLE: $(""), $(null), $(undefined), $(false) + if ( !selector ) { + return this; + } + + // Method init() accepts an alternate rootjQuery + // so migrate can support jQuery.sub (gh-2101) + root = root || rootjQuery; + + // Handle HTML strings + if ( typeof selector === "string" ) { + if ( selector[ 0 ] === "<" && + selector[ selector.length - 1 ] === ">" && + selector.length >= 3 ) { + + // Assume that strings that start and end with <> are HTML and skip the regex check + match = [ null, selector, null ]; + + } else { + match = rquickExpr.exec( selector ); + } + + // Match html or make sure no context is specified for #id + if ( match && ( match[ 1 ] || !context ) ) { + + // HANDLE: $(html) -> $(array) + if ( match[ 1 ] ) { + context = context instanceof jQuery ? context[ 0 ] : context; + + // Option to run scripts is true for back-compat + // Intentionally let the error be thrown if parseHTML is not present + jQuery.merge( this, jQuery.parseHTML( + match[ 1 ], + context && context.nodeType ? context.ownerDocument || context : document, + true + ) ); + + // HANDLE: $(html, props) + if ( rsingleTag.test( match[ 1 ] ) && jQuery.isPlainObject( context ) ) { + for ( match in context ) { + + // Properties of context are called as methods if possible + if ( isFunction( this[ match ] ) ) { + this[ match ]( context[ match ] ); + + // ...and otherwise set as attributes + } else { + this.attr( match, context[ match ] ); + } + } + } + + return this; + + // HANDLE: $(#id) + } else { + elem = document.getElementById( match[ 2 ] ); + + if ( elem ) { + + // Inject the element directly into the jQuery object + this[ 0 ] = elem; + this.length = 1; + } + return this; + } + + // HANDLE: $(expr, $(...)) + } else if ( !context || context.jquery ) { + return ( context || root ).find( selector ); + + // HANDLE: $(expr, context) + // (which is just equivalent to: $(context).find(expr) + } else { + return this.constructor( context ).find( selector ); + } + + // HANDLE: $(DOMElement) + } else if ( selector.nodeType ) { + this[ 0 ] = selector; + this.length = 1; + return this; + + // HANDLE: $(function) + // Shortcut for document ready + } else if ( isFunction( selector ) ) { + return root.ready !== undefined ? + root.ready( selector ) : + + // Execute immediately if ready is not present + selector( jQuery ); + } + + return jQuery.makeArray( selector, this ); + }; + +// Give the init function the jQuery prototype for later instantiation +init.prototype = jQuery.fn; + +// Initialize central reference +rootjQuery = jQuery( document ); + + +var rparentsprev = /^(?:parents|prev(?:Until|All))/, + + // Methods guaranteed to produce a unique set when starting from a unique set + guaranteedUnique = { + children: true, + contents: true, + next: true, + prev: true + }; + +jQuery.fn.extend( { + has: function( target ) { + var targets = jQuery( target, this ), + l = targets.length; + + return this.filter( function() { + var i = 0; + for ( ; i < l; i++ ) { + if ( jQuery.contains( this, targets[ i ] ) ) { + return true; + } + } + } ); + }, + + closest: function( selectors, context ) { + var cur, + i = 0, + l = this.length, + matched = [], + targets = typeof selectors !== "string" && jQuery( selectors ); + + // Positional selectors never match, since there's no _selection_ context + if ( !rneedsContext.test( selectors ) ) { + for ( ; i < l; i++ ) { + for ( cur = this[ i ]; cur && cur !== context; cur = cur.parentNode ) { + + // Always skip document fragments + if ( cur.nodeType < 11 && ( targets ? + targets.index( cur ) > -1 : + + // Don't pass non-elements to Sizzle + cur.nodeType === 1 && + jQuery.find.matchesSelector( cur, selectors ) ) ) { + + matched.push( cur ); + break; + } + } + } + } + + return this.pushStack( matched.length > 1 ? jQuery.uniqueSort( matched ) : matched ); + }, + + // Determine the position of an element within the set + index: function( elem ) { + + // No argument, return index in parent + if ( !elem ) { + return ( this[ 0 ] && this[ 0 ].parentNode ) ? this.first().prevAll().length : -1; + } + + // Index in selector + if ( typeof elem === "string" ) { + return indexOf.call( jQuery( elem ), this[ 0 ] ); + } + + // Locate the position of the desired element + return indexOf.call( this, + + // If it receives a jQuery object, the first element is used + elem.jquery ? elem[ 0 ] : elem + ); + }, + + add: function( selector, context ) { + return this.pushStack( + jQuery.uniqueSort( + jQuery.merge( this.get(), jQuery( selector, context ) ) + ) + ); + }, + + addBack: function( selector ) { + return this.add( selector == null ? + this.prevObject : this.prevObject.filter( selector ) + ); + } +} ); + +function sibling( cur, dir ) { + while ( ( cur = cur[ dir ] ) && cur.nodeType !== 1 ) {} + return cur; +} + +jQuery.each( { + parent: function( elem ) { + var parent = elem.parentNode; + return parent && parent.nodeType !== 11 ? parent : null; + }, + parents: function( elem ) { + return dir( elem, "parentNode" ); + }, + parentsUntil: function( elem, _i, until ) { + return dir( elem, "parentNode", until ); + }, + next: function( elem ) { + return sibling( elem, "nextSibling" ); + }, + prev: function( elem ) { + return sibling( elem, "previousSibling" ); + }, + nextAll: function( elem ) { + return dir( elem, "nextSibling" ); + }, + prevAll: function( elem ) { + return dir( elem, "previousSibling" ); + }, + nextUntil: function( elem, _i, until ) { + return dir( elem, "nextSibling", until ); + }, + prevUntil: function( elem, _i, until ) { + return dir( elem, "previousSibling", until ); + }, + siblings: function( elem ) { + return siblings( ( elem.parentNode || {} ).firstChild, elem ); + }, + children: function( elem ) { + return siblings( elem.firstChild ); + }, + contents: function( elem ) { + if ( elem.contentDocument != null && + + // Support: IE 11+ + // elements with no `data` attribute has an object + // `contentDocument` with a `null` prototype. + getProto( elem.contentDocument ) ) { + + return elem.contentDocument; + } + + // Support: IE 9 - 11 only, iOS 7 only, Android Browser <=4.3 only + // Treat the template element as a regular one in browsers that + // don't support it. + if ( nodeName( elem, "template" ) ) { + elem = elem.content || elem; + } + + return jQuery.merge( [], elem.childNodes ); + } +}, function( name, fn ) { + jQuery.fn[ name ] = function( until, selector ) { + var matched = jQuery.map( this, fn, until ); + + if ( name.slice( -5 ) !== "Until" ) { + selector = until; + } + + if ( selector && typeof selector === "string" ) { + matched = jQuery.filter( selector, matched ); + } + + if ( this.length > 1 ) { + + // Remove duplicates + if ( !guaranteedUnique[ name ] ) { + jQuery.uniqueSort( matched ); + } + + // Reverse order for parents* and prev-derivatives + if ( rparentsprev.test( name ) ) { + matched.reverse(); + } + } + + return this.pushStack( matched ); + }; +} ); +var rnothtmlwhite = ( /[^\x20\t\r\n\f]+/g ); + + + +// Convert String-formatted options into Object-formatted ones +function createOptions( options ) { + var object = {}; + jQuery.each( options.match( rnothtmlwhite ) || [], function( _, flag ) { + object[ flag ] = true; + } ); + return object; +} + +/* + * Create a callback list using the following parameters: + * + * options: an optional list of space-separated options that will change how + * the callback list behaves or a more traditional option object + * + * By default a callback list will act like an event callback list and can be + * "fired" multiple times. + * + * Possible options: + * + * once: will ensure the callback list can only be fired once (like a Deferred) + * + * memory: will keep track of previous values and will call any callback added + * after the list has been fired right away with the latest "memorized" + * values (like a Deferred) + * + * unique: will ensure a callback can only be added once (no duplicate in the list) + * + * stopOnFalse: interrupt callings when a callback returns false + * + */ +jQuery.Callbacks = function( options ) { + + // Convert options from String-formatted to Object-formatted if needed + // (we check in cache first) + options = typeof options === "string" ? + createOptions( options ) : + jQuery.extend( {}, options ); + + var // Flag to know if list is currently firing + firing, + + // Last fire value for non-forgettable lists + memory, + + // Flag to know if list was already fired + fired, + + // Flag to prevent firing + locked, + + // Actual callback list + list = [], + + // Queue of execution data for repeatable lists + queue = [], + + // Index of currently firing callback (modified by add/remove as needed) + firingIndex = -1, + + // Fire callbacks + fire = function() { + + // Enforce single-firing + locked = locked || options.once; + + // Execute callbacks for all pending executions, + // respecting firingIndex overrides and runtime changes + fired = firing = true; + for ( ; queue.length; firingIndex = -1 ) { + memory = queue.shift(); + while ( ++firingIndex < list.length ) { + + // Run callback and check for early termination + if ( list[ firingIndex ].apply( memory[ 0 ], memory[ 1 ] ) === false && + options.stopOnFalse ) { + + // Jump to end and forget the data so .add doesn't re-fire + firingIndex = list.length; + memory = false; + } + } + } + + // Forget the data if we're done with it + if ( !options.memory ) { + memory = false; + } + + firing = false; + + // Clean up if we're done firing for good + if ( locked ) { + + // Keep an empty list if we have data for future add calls + if ( memory ) { + list = []; + + // Otherwise, this object is spent + } else { + list = ""; + } + } + }, + + // Actual Callbacks object + self = { + + // Add a callback or a collection of callbacks to the list + add: function() { + if ( list ) { + + // If we have memory from a past run, we should fire after adding + if ( memory && !firing ) { + firingIndex = list.length - 1; + queue.push( memory ); + } + + ( function add( args ) { + jQuery.each( args, function( _, arg ) { + if ( isFunction( arg ) ) { + if ( !options.unique || !self.has( arg ) ) { + list.push( arg ); + } + } else if ( arg && arg.length && toType( arg ) !== "string" ) { + + // Inspect recursively + add( arg ); + } + } ); + } )( arguments ); + + if ( memory && !firing ) { + fire(); + } + } + return this; + }, + + // Remove a callback from the list + remove: function() { + jQuery.each( arguments, function( _, arg ) { + var index; + while ( ( index = jQuery.inArray( arg, list, index ) ) > -1 ) { + list.splice( index, 1 ); + + // Handle firing indexes + if ( index <= firingIndex ) { + firingIndex--; + } + } + } ); + return this; + }, + + // Check if a given callback is in the list. + // If no argument is given, return whether or not list has callbacks attached. + has: function( fn ) { + return fn ? + jQuery.inArray( fn, list ) > -1 : + list.length > 0; + }, + + // Remove all callbacks from the list + empty: function() { + if ( list ) { + list = []; + } + return this; + }, + + // Disable .fire and .add + // Abort any current/pending executions + // Clear all callbacks and values + disable: function() { + locked = queue = []; + list = memory = ""; + return this; + }, + disabled: function() { + return !list; + }, + + // Disable .fire + // Also disable .add unless we have memory (since it would have no effect) + // Abort any pending executions + lock: function() { + locked = queue = []; + if ( !memory && !firing ) { + list = memory = ""; + } + return this; + }, + locked: function() { + return !!locked; + }, + + // Call all callbacks with the given context and arguments + fireWith: function( context, args ) { + if ( !locked ) { + args = args || []; + args = [ context, args.slice ? args.slice() : args ]; + queue.push( args ); + if ( !firing ) { + fire(); + } + } + return this; + }, + + // Call all the callbacks with the given arguments + fire: function() { + self.fireWith( this, arguments ); + return this; + }, + + // To know if the callbacks have already been called at least once + fired: function() { + return !!fired; + } + }; + + return self; +}; + + +function Identity( v ) { + return v; +} +function Thrower( ex ) { + throw ex; +} + +function adoptValue( value, resolve, reject, noValue ) { + var method; + + try { + + // Check for promise aspect first to privilege synchronous behavior + if ( value && isFunction( ( method = value.promise ) ) ) { + method.call( value ).done( resolve ).fail( reject ); + + // Other thenables + } else if ( value && isFunction( ( method = value.then ) ) ) { + method.call( value, resolve, reject ); + + // Other non-thenables + } else { + + // Control `resolve` arguments by letting Array#slice cast boolean `noValue` to integer: + // * false: [ value ].slice( 0 ) => resolve( value ) + // * true: [ value ].slice( 1 ) => resolve() + resolve.apply( undefined, [ value ].slice( noValue ) ); + } + + // For Promises/A+, convert exceptions into rejections + // Since jQuery.when doesn't unwrap thenables, we can skip the extra checks appearing in + // Deferred#then to conditionally suppress rejection. + } catch ( value ) { + + // Support: Android 4.0 only + // Strict mode functions invoked without .call/.apply get global-object context + reject.apply( undefined, [ value ] ); + } +} + +jQuery.extend( { + + Deferred: function( func ) { + var tuples = [ + + // action, add listener, callbacks, + // ... .then handlers, argument index, [final state] + [ "notify", "progress", jQuery.Callbacks( "memory" ), + jQuery.Callbacks( "memory" ), 2 ], + [ "resolve", "done", jQuery.Callbacks( "once memory" ), + jQuery.Callbacks( "once memory" ), 0, "resolved" ], + [ "reject", "fail", jQuery.Callbacks( "once memory" ), + jQuery.Callbacks( "once memory" ), 1, "rejected" ] + ], + state = "pending", + promise = { + state: function() { + return state; + }, + always: function() { + deferred.done( arguments ).fail( arguments ); + return this; + }, + "catch": function( fn ) { + return promise.then( null, fn ); + }, + + // Keep pipe for back-compat + pipe: function( /* fnDone, fnFail, fnProgress */ ) { + var fns = arguments; + + return jQuery.Deferred( function( newDefer ) { + jQuery.each( tuples, function( _i, tuple ) { + + // Map tuples (progress, done, fail) to arguments (done, fail, progress) + var fn = isFunction( fns[ tuple[ 4 ] ] ) && fns[ tuple[ 4 ] ]; + + // deferred.progress(function() { bind to newDefer or newDefer.notify }) + // deferred.done(function() { bind to newDefer or newDefer.resolve }) + // deferred.fail(function() { bind to newDefer or newDefer.reject }) + deferred[ tuple[ 1 ] ]( function() { + var returned = fn && fn.apply( this, arguments ); + if ( returned && isFunction( returned.promise ) ) { + returned.promise() + .progress( newDefer.notify ) + .done( newDefer.resolve ) + .fail( newDefer.reject ); + } else { + newDefer[ tuple[ 0 ] + "With" ]( + this, + fn ? [ returned ] : arguments + ); + } + } ); + } ); + fns = null; + } ).promise(); + }, + then: function( onFulfilled, onRejected, onProgress ) { + var maxDepth = 0; + function resolve( depth, deferred, handler, special ) { + return function() { + var that = this, + args = arguments, + mightThrow = function() { + var returned, then; + + // Support: Promises/A+ section 2.3.3.3.3 + // https://promisesaplus.com/#point-59 + // Ignore double-resolution attempts + if ( depth < maxDepth ) { + return; + } + + returned = handler.apply( that, args ); + + // Support: Promises/A+ section 2.3.1 + // https://promisesaplus.com/#point-48 + if ( returned === deferred.promise() ) { + throw new TypeError( "Thenable self-resolution" ); + } + + // Support: Promises/A+ sections 2.3.3.1, 3.5 + // https://promisesaplus.com/#point-54 + // https://promisesaplus.com/#point-75 + // Retrieve `then` only once + then = returned && + + // Support: Promises/A+ section 2.3.4 + // https://promisesaplus.com/#point-64 + // Only check objects and functions for thenability + ( typeof returned === "object" || + typeof returned === "function" ) && + returned.then; + + // Handle a returned thenable + if ( isFunction( then ) ) { + + // Special processors (notify) just wait for resolution + if ( special ) { + then.call( + returned, + resolve( maxDepth, deferred, Identity, special ), + resolve( maxDepth, deferred, Thrower, special ) + ); + + // Normal processors (resolve) also hook into progress + } else { + + // ...and disregard older resolution values + maxDepth++; + + then.call( + returned, + resolve( maxDepth, deferred, Identity, special ), + resolve( maxDepth, deferred, Thrower, special ), + resolve( maxDepth, deferred, Identity, + deferred.notifyWith ) + ); + } + + // Handle all other returned values + } else { + + // Only substitute handlers pass on context + // and multiple values (non-spec behavior) + if ( handler !== Identity ) { + that = undefined; + args = [ returned ]; + } + + // Process the value(s) + // Default process is resolve + ( special || deferred.resolveWith )( that, args ); + } + }, + + // Only normal processors (resolve) catch and reject exceptions + process = special ? + mightThrow : + function() { + try { + mightThrow(); + } catch ( e ) { + + if ( jQuery.Deferred.exceptionHook ) { + jQuery.Deferred.exceptionHook( e, + process.stackTrace ); + } + + // Support: Promises/A+ section 2.3.3.3.4.1 + // https://promisesaplus.com/#point-61 + // Ignore post-resolution exceptions + if ( depth + 1 >= maxDepth ) { + + // Only substitute handlers pass on context + // and multiple values (non-spec behavior) + if ( handler !== Thrower ) { + that = undefined; + args = [ e ]; + } + + deferred.rejectWith( that, args ); + } + } + }; + + // Support: Promises/A+ section 2.3.3.3.1 + // https://promisesaplus.com/#point-57 + // Re-resolve promises immediately to dodge false rejection from + // subsequent errors + if ( depth ) { + process(); + } else { + + // Call an optional hook to record the stack, in case of exception + // since it's otherwise lost when execution goes async + if ( jQuery.Deferred.getStackHook ) { + process.stackTrace = jQuery.Deferred.getStackHook(); + } + window.setTimeout( process ); + } + }; + } + + return jQuery.Deferred( function( newDefer ) { + + // progress_handlers.add( ... ) + tuples[ 0 ][ 3 ].add( + resolve( + 0, + newDefer, + isFunction( onProgress ) ? + onProgress : + Identity, + newDefer.notifyWith + ) + ); + + // fulfilled_handlers.add( ... ) + tuples[ 1 ][ 3 ].add( + resolve( + 0, + newDefer, + isFunction( onFulfilled ) ? + onFulfilled : + Identity + ) + ); + + // rejected_handlers.add( ... ) + tuples[ 2 ][ 3 ].add( + resolve( + 0, + newDefer, + isFunction( onRejected ) ? + onRejected : + Thrower + ) + ); + } ).promise(); + }, + + // Get a promise for this deferred + // If obj is provided, the promise aspect is added to the object + promise: function( obj ) { + return obj != null ? jQuery.extend( obj, promise ) : promise; + } + }, + deferred = {}; + + // Add list-specific methods + jQuery.each( tuples, function( i, tuple ) { + var list = tuple[ 2 ], + stateString = tuple[ 5 ]; + + // promise.progress = list.add + // promise.done = list.add + // promise.fail = list.add + promise[ tuple[ 1 ] ] = list.add; + + // Handle state + if ( stateString ) { + list.add( + function() { + + // state = "resolved" (i.e., fulfilled) + // state = "rejected" + state = stateString; + }, + + // rejected_callbacks.disable + // fulfilled_callbacks.disable + tuples[ 3 - i ][ 2 ].disable, + + // rejected_handlers.disable + // fulfilled_handlers.disable + tuples[ 3 - i ][ 3 ].disable, + + // progress_callbacks.lock + tuples[ 0 ][ 2 ].lock, + + // progress_handlers.lock + tuples[ 0 ][ 3 ].lock + ); + } + + // progress_handlers.fire + // fulfilled_handlers.fire + // rejected_handlers.fire + list.add( tuple[ 3 ].fire ); + + // deferred.notify = function() { deferred.notifyWith(...) } + // deferred.resolve = function() { deferred.resolveWith(...) } + // deferred.reject = function() { deferred.rejectWith(...) } + deferred[ tuple[ 0 ] ] = function() { + deferred[ tuple[ 0 ] + "With" ]( this === deferred ? undefined : this, arguments ); + return this; + }; + + // deferred.notifyWith = list.fireWith + // deferred.resolveWith = list.fireWith + // deferred.rejectWith = list.fireWith + deferred[ tuple[ 0 ] + "With" ] = list.fireWith; + } ); + + // Make the deferred a promise + promise.promise( deferred ); + + // Call given func if any + if ( func ) { + func.call( deferred, deferred ); + } + + // All done! + return deferred; + }, + + // Deferred helper + when: function( singleValue ) { + var + + // count of uncompleted subordinates + remaining = arguments.length, + + // count of unprocessed arguments + i = remaining, + + // subordinate fulfillment data + resolveContexts = Array( i ), + resolveValues = slice.call( arguments ), + + // the master Deferred + master = jQuery.Deferred(), + + // subordinate callback factory + updateFunc = function( i ) { + return function( value ) { + resolveContexts[ i ] = this; + resolveValues[ i ] = arguments.length > 1 ? slice.call( arguments ) : value; + if ( !( --remaining ) ) { + master.resolveWith( resolveContexts, resolveValues ); + } + }; + }; + + // Single- and empty arguments are adopted like Promise.resolve + if ( remaining <= 1 ) { + adoptValue( singleValue, master.done( updateFunc( i ) ).resolve, master.reject, + !remaining ); + + // Use .then() to unwrap secondary thenables (cf. gh-3000) + if ( master.state() === "pending" || + isFunction( resolveValues[ i ] && resolveValues[ i ].then ) ) { + + return master.then(); + } + } + + // Multiple arguments are aggregated like Promise.all array elements + while ( i-- ) { + adoptValue( resolveValues[ i ], updateFunc( i ), master.reject ); + } + + return master.promise(); + } +} ); + + +// These usually indicate a programmer mistake during development, +// warn about them ASAP rather than swallowing them by default. +var rerrorNames = /^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/; + +jQuery.Deferred.exceptionHook = function( error, stack ) { + + // Support: IE 8 - 9 only + // Console exists when dev tools are open, which can happen at any time + if ( window.console && window.console.warn && error && rerrorNames.test( error.name ) ) { + window.console.warn( "jQuery.Deferred exception: " + error.message, error.stack, stack ); + } +}; + + + + +jQuery.readyException = function( error ) { + window.setTimeout( function() { + throw error; + } ); +}; + + + + +// The deferred used on DOM ready +var readyList = jQuery.Deferred(); + +jQuery.fn.ready = function( fn ) { + + readyList + .then( fn ) + + // Wrap jQuery.readyException in a function so that the lookup + // happens at the time of error handling instead of callback + // registration. + .catch( function( error ) { + jQuery.readyException( error ); + } ); + + return this; +}; + +jQuery.extend( { + + // Is the DOM ready to be used? Set to true once it occurs. + isReady: false, + + // A counter to track how many items to wait for before + // the ready event fires. See #6781 + readyWait: 1, + + // Handle when the DOM is ready + ready: function( wait ) { + + // Abort if there are pending holds or we're already ready + if ( wait === true ? --jQuery.readyWait : jQuery.isReady ) { + return; + } + + // Remember that the DOM is ready + jQuery.isReady = true; + + // If a normal DOM Ready event fired, decrement, and wait if need be + if ( wait !== true && --jQuery.readyWait > 0 ) { + return; + } + + // If there are functions bound, to execute + readyList.resolveWith( document, [ jQuery ] ); + } +} ); + +jQuery.ready.then = readyList.then; + +// The ready event handler and self cleanup method +function completed() { + document.removeEventListener( "DOMContentLoaded", completed ); + window.removeEventListener( "load", completed ); + jQuery.ready(); +} + +// Catch cases where $(document).ready() is called +// after the browser event has already occurred. +// Support: IE <=9 - 10 only +// Older IE sometimes signals "interactive" too soon +if ( document.readyState === "complete" || + ( document.readyState !== "loading" && !document.documentElement.doScroll ) ) { + + // Handle it asynchronously to allow scripts the opportunity to delay ready + window.setTimeout( jQuery.ready ); + +} else { + + // Use the handy event callback + document.addEventListener( "DOMContentLoaded", completed ); + + // A fallback to window.onload, that will always work + window.addEventListener( "load", completed ); +} + + + + +// Multifunctional method to get and set values of a collection +// The value/s can optionally be executed if it's a function +var access = function( elems, fn, key, value, chainable, emptyGet, raw ) { + var i = 0, + len = elems.length, + bulk = key == null; + + // Sets many values + if ( toType( key ) === "object" ) { + chainable = true; + for ( i in key ) { + access( elems, fn, i, key[ i ], true, emptyGet, raw ); + } + + // Sets one value + } else if ( value !== undefined ) { + chainable = true; + + if ( !isFunction( value ) ) { + raw = true; + } + + if ( bulk ) { + + // Bulk operations run against the entire set + if ( raw ) { + fn.call( elems, value ); + fn = null; + + // ...except when executing function values + } else { + bulk = fn; + fn = function( elem, _key, value ) { + return bulk.call( jQuery( elem ), value ); + }; + } + } + + if ( fn ) { + for ( ; i < len; i++ ) { + fn( + elems[ i ], key, raw ? + value : + value.call( elems[ i ], i, fn( elems[ i ], key ) ) + ); + } + } + } + + if ( chainable ) { + return elems; + } + + // Gets + if ( bulk ) { + return fn.call( elems ); + } + + return len ? fn( elems[ 0 ], key ) : emptyGet; +}; + + +// Matches dashed string for camelizing +var rmsPrefix = /^-ms-/, + rdashAlpha = /-([a-z])/g; + +// Used by camelCase as callback to replace() +function fcamelCase( _all, letter ) { + return letter.toUpperCase(); +} + +// Convert dashed to camelCase; used by the css and data modules +// Support: IE <=9 - 11, Edge 12 - 15 +// Microsoft forgot to hump their vendor prefix (#9572) +function camelCase( string ) { + return string.replace( rmsPrefix, "ms-" ).replace( rdashAlpha, fcamelCase ); +} +var acceptData = function( owner ) { + + // Accepts only: + // - Node + // - Node.ELEMENT_NODE + // - Node.DOCUMENT_NODE + // - Object + // - Any + return owner.nodeType === 1 || owner.nodeType === 9 || !( +owner.nodeType ); +}; + + + + +function Data() { + this.expando = jQuery.expando + Data.uid++; +} + +Data.uid = 1; + +Data.prototype = { + + cache: function( owner ) { + + // Check if the owner object already has a cache + var value = owner[ this.expando ]; + + // If not, create one + if ( !value ) { + value = {}; + + // We can accept data for non-element nodes in modern browsers, + // but we should not, see #8335. + // Always return an empty object. + if ( acceptData( owner ) ) { + + // If it is a node unlikely to be stringify-ed or looped over + // use plain assignment + if ( owner.nodeType ) { + owner[ this.expando ] = value; + + // Otherwise secure it in a non-enumerable property + // configurable must be true to allow the property to be + // deleted when data is removed + } else { + Object.defineProperty( owner, this.expando, { + value: value, + configurable: true + } ); + } + } + } + + return value; + }, + set: function( owner, data, value ) { + var prop, + cache = this.cache( owner ); + + // Handle: [ owner, key, value ] args + // Always use camelCase key (gh-2257) + if ( typeof data === "string" ) { + cache[ camelCase( data ) ] = value; + + // Handle: [ owner, { properties } ] args + } else { + + // Copy the properties one-by-one to the cache object + for ( prop in data ) { + cache[ camelCase( prop ) ] = data[ prop ]; + } + } + return cache; + }, + get: function( owner, key ) { + return key === undefined ? + this.cache( owner ) : + + // Always use camelCase key (gh-2257) + owner[ this.expando ] && owner[ this.expando ][ camelCase( key ) ]; + }, + access: function( owner, key, value ) { + + // In cases where either: + // + // 1. No key was specified + // 2. A string key was specified, but no value provided + // + // Take the "read" path and allow the get method to determine + // which value to return, respectively either: + // + // 1. The entire cache object + // 2. The data stored at the key + // + if ( key === undefined || + ( ( key && typeof key === "string" ) && value === undefined ) ) { + + return this.get( owner, key ); + } + + // When the key is not a string, or both a key and value + // are specified, set or extend (existing objects) with either: + // + // 1. An object of properties + // 2. A key and value + // + this.set( owner, key, value ); + + // Since the "set" path can have two possible entry points + // return the expected data based on which path was taken[*] + return value !== undefined ? value : key; + }, + remove: function( owner, key ) { + var i, + cache = owner[ this.expando ]; + + if ( cache === undefined ) { + return; + } + + if ( key !== undefined ) { + + // Support array or space separated string of keys + if ( Array.isArray( key ) ) { + + // If key is an array of keys... + // We always set camelCase keys, so remove that. + key = key.map( camelCase ); + } else { + key = camelCase( key ); + + // If a key with the spaces exists, use it. + // Otherwise, create an array by matching non-whitespace + key = key in cache ? + [ key ] : + ( key.match( rnothtmlwhite ) || [] ); + } + + i = key.length; + + while ( i-- ) { + delete cache[ key[ i ] ]; + } + } + + // Remove the expando if there's no more data + if ( key === undefined || jQuery.isEmptyObject( cache ) ) { + + // Support: Chrome <=35 - 45 + // Webkit & Blink performance suffers when deleting properties + // from DOM nodes, so set to undefined instead + // https://bugs.chromium.org/p/chromium/issues/detail?id=378607 (bug restricted) + if ( owner.nodeType ) { + owner[ this.expando ] = undefined; + } else { + delete owner[ this.expando ]; + } + } + }, + hasData: function( owner ) { + var cache = owner[ this.expando ]; + return cache !== undefined && !jQuery.isEmptyObject( cache ); + } +}; +var dataPriv = new Data(); + +var dataUser = new Data(); + + + +// Implementation Summary +// +// 1. Enforce API surface and semantic compatibility with 1.9.x branch +// 2. Improve the module's maintainability by reducing the storage +// paths to a single mechanism. +// 3. Use the same single mechanism to support "private" and "user" data. +// 4. _Never_ expose "private" data to user code (TODO: Drop _data, _removeData) +// 5. Avoid exposing implementation details on user objects (eg. expando properties) +// 6. Provide a clear path for implementation upgrade to WeakMap in 2014 + +var rbrace = /^(?:\{[\w\W]*\}|\[[\w\W]*\])$/, + rmultiDash = /[A-Z]/g; + +function getData( data ) { + if ( data === "true" ) { + return true; + } + + if ( data === "false" ) { + return false; + } + + if ( data === "null" ) { + return null; + } + + // Only convert to a number if it doesn't change the string + if ( data === +data + "" ) { + return +data; + } + + if ( rbrace.test( data ) ) { + return JSON.parse( data ); + } + + return data; +} + +function dataAttr( elem, key, data ) { + var name; + + // If nothing was found internally, try to fetch any + // data from the HTML5 data-* attribute + if ( data === undefined && elem.nodeType === 1 ) { + name = "data-" + key.replace( rmultiDash, "-$&" ).toLowerCase(); + data = elem.getAttribute( name ); + + if ( typeof data === "string" ) { + try { + data = getData( data ); + } catch ( e ) {} + + // Make sure we set the data so it isn't changed later + dataUser.set( elem, key, data ); + } else { + data = undefined; + } + } + return data; +} + +jQuery.extend( { + hasData: function( elem ) { + return dataUser.hasData( elem ) || dataPriv.hasData( elem ); + }, + + data: function( elem, name, data ) { + return dataUser.access( elem, name, data ); + }, + + removeData: function( elem, name ) { + dataUser.remove( elem, name ); + }, + + // TODO: Now that all calls to _data and _removeData have been replaced + // with direct calls to dataPriv methods, these can be deprecated. + _data: function( elem, name, data ) { + return dataPriv.access( elem, name, data ); + }, + + _removeData: function( elem, name ) { + dataPriv.remove( elem, name ); + } +} ); + +jQuery.fn.extend( { + data: function( key, value ) { + var i, name, data, + elem = this[ 0 ], + attrs = elem && elem.attributes; + + // Gets all values + if ( key === undefined ) { + if ( this.length ) { + data = dataUser.get( elem ); + + if ( elem.nodeType === 1 && !dataPriv.get( elem, "hasDataAttrs" ) ) { + i = attrs.length; + while ( i-- ) { + + // Support: IE 11 only + // The attrs elements can be null (#14894) + if ( attrs[ i ] ) { + name = attrs[ i ].name; + if ( name.indexOf( "data-" ) === 0 ) { + name = camelCase( name.slice( 5 ) ); + dataAttr( elem, name, data[ name ] ); + } + } + } + dataPriv.set( elem, "hasDataAttrs", true ); + } + } + + return data; + } + + // Sets multiple values + if ( typeof key === "object" ) { + return this.each( function() { + dataUser.set( this, key ); + } ); + } + + return access( this, function( value ) { + var data; + + // The calling jQuery object (element matches) is not empty + // (and therefore has an element appears at this[ 0 ]) and the + // `value` parameter was not undefined. An empty jQuery object + // will result in `undefined` for elem = this[ 0 ] which will + // throw an exception if an attempt to read a data cache is made. + if ( elem && value === undefined ) { + + // Attempt to get data from the cache + // The key will always be camelCased in Data + data = dataUser.get( elem, key ); + if ( data !== undefined ) { + return data; + } + + // Attempt to "discover" the data in + // HTML5 custom data-* attrs + data = dataAttr( elem, key ); + if ( data !== undefined ) { + return data; + } + + // We tried really hard, but the data doesn't exist. + return; + } + + // Set the data... + this.each( function() { + + // We always store the camelCased key + dataUser.set( this, key, value ); + } ); + }, null, value, arguments.length > 1, null, true ); + }, + + removeData: function( key ) { + return this.each( function() { + dataUser.remove( this, key ); + } ); + } +} ); + + +jQuery.extend( { + queue: function( elem, type, data ) { + var queue; + + if ( elem ) { + type = ( type || "fx" ) + "queue"; + queue = dataPriv.get( elem, type ); + + // Speed up dequeue by getting out quickly if this is just a lookup + if ( data ) { + if ( !queue || Array.isArray( data ) ) { + queue = dataPriv.access( elem, type, jQuery.makeArray( data ) ); + } else { + queue.push( data ); + } + } + return queue || []; + } + }, + + dequeue: function( elem, type ) { + type = type || "fx"; + + var queue = jQuery.queue( elem, type ), + startLength = queue.length, + fn = queue.shift(), + hooks = jQuery._queueHooks( elem, type ), + next = function() { + jQuery.dequeue( elem, type ); + }; + + // If the fx queue is dequeued, always remove the progress sentinel + if ( fn === "inprogress" ) { + fn = queue.shift(); + startLength--; + } + + if ( fn ) { + + // Add a progress sentinel to prevent the fx queue from being + // automatically dequeued + if ( type === "fx" ) { + queue.unshift( "inprogress" ); + } + + // Clear up the last queue stop function + delete hooks.stop; + fn.call( elem, next, hooks ); + } + + if ( !startLength && hooks ) { + hooks.empty.fire(); + } + }, + + // Not public - generate a queueHooks object, or return the current one + _queueHooks: function( elem, type ) { + var key = type + "queueHooks"; + return dataPriv.get( elem, key ) || dataPriv.access( elem, key, { + empty: jQuery.Callbacks( "once memory" ).add( function() { + dataPriv.remove( elem, [ type + "queue", key ] ); + } ) + } ); + } +} ); + +jQuery.fn.extend( { + queue: function( type, data ) { + var setter = 2; + + if ( typeof type !== "string" ) { + data = type; + type = "fx"; + setter--; + } + + if ( arguments.length < setter ) { + return jQuery.queue( this[ 0 ], type ); + } + + return data === undefined ? + this : + this.each( function() { + var queue = jQuery.queue( this, type, data ); + + // Ensure a hooks for this queue + jQuery._queueHooks( this, type ); + + if ( type === "fx" && queue[ 0 ] !== "inprogress" ) { + jQuery.dequeue( this, type ); + } + } ); + }, + dequeue: function( type ) { + return this.each( function() { + jQuery.dequeue( this, type ); + } ); + }, + clearQueue: function( type ) { + return this.queue( type || "fx", [] ); + }, + + // Get a promise resolved when queues of a certain type + // are emptied (fx is the type by default) + promise: function( type, obj ) { + var tmp, + count = 1, + defer = jQuery.Deferred(), + elements = this, + i = this.length, + resolve = function() { + if ( !( --count ) ) { + defer.resolveWith( elements, [ elements ] ); + } + }; + + if ( typeof type !== "string" ) { + obj = type; + type = undefined; + } + type = type || "fx"; + + while ( i-- ) { + tmp = dataPriv.get( elements[ i ], type + "queueHooks" ); + if ( tmp && tmp.empty ) { + count++; + tmp.empty.add( resolve ); + } + } + resolve(); + return defer.promise( obj ); + } +} ); +var pnum = ( /[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/ ).source; + +var rcssNum = new RegExp( "^(?:([+-])=|)(" + pnum + ")([a-z%]*)$", "i" ); + + +var cssExpand = [ "Top", "Right", "Bottom", "Left" ]; + +var documentElement = document.documentElement; + + + + var isAttached = function( elem ) { + return jQuery.contains( elem.ownerDocument, elem ); + }, + composed = { composed: true }; + + // Support: IE 9 - 11+, Edge 12 - 18+, iOS 10.0 - 10.2 only + // Check attachment across shadow DOM boundaries when possible (gh-3504) + // Support: iOS 10.0-10.2 only + // Early iOS 10 versions support `attachShadow` but not `getRootNode`, + // leading to errors. We need to check for `getRootNode`. + if ( documentElement.getRootNode ) { + isAttached = function( elem ) { + return jQuery.contains( elem.ownerDocument, elem ) || + elem.getRootNode( composed ) === elem.ownerDocument; + }; + } +var isHiddenWithinTree = function( elem, el ) { + + // isHiddenWithinTree might be called from jQuery#filter function; + // in that case, element will be second argument + elem = el || elem; + + // Inline style trumps all + return elem.style.display === "none" || + elem.style.display === "" && + + // Otherwise, check computed style + // Support: Firefox <=43 - 45 + // Disconnected elements can have computed display: none, so first confirm that elem is + // in the document. + isAttached( elem ) && + + jQuery.css( elem, "display" ) === "none"; + }; + + + +function adjustCSS( elem, prop, valueParts, tween ) { + var adjusted, scale, + maxIterations = 20, + currentValue = tween ? + function() { + return tween.cur(); + } : + function() { + return jQuery.css( elem, prop, "" ); + }, + initial = currentValue(), + unit = valueParts && valueParts[ 3 ] || ( jQuery.cssNumber[ prop ] ? "" : "px" ), + + // Starting value computation is required for potential unit mismatches + initialInUnit = elem.nodeType && + ( jQuery.cssNumber[ prop ] || unit !== "px" && +initial ) && + rcssNum.exec( jQuery.css( elem, prop ) ); + + if ( initialInUnit && initialInUnit[ 3 ] !== unit ) { + + // Support: Firefox <=54 + // Halve the iteration target value to prevent interference from CSS upper bounds (gh-2144) + initial = initial / 2; + + // Trust units reported by jQuery.css + unit = unit || initialInUnit[ 3 ]; + + // Iteratively approximate from a nonzero starting point + initialInUnit = +initial || 1; + + while ( maxIterations-- ) { + + // Evaluate and update our best guess (doubling guesses that zero out). + // Finish if the scale equals or crosses 1 (making the old*new product non-positive). + jQuery.style( elem, prop, initialInUnit + unit ); + if ( ( 1 - scale ) * ( 1 - ( scale = currentValue() / initial || 0.5 ) ) <= 0 ) { + maxIterations = 0; + } + initialInUnit = initialInUnit / scale; + + } + + initialInUnit = initialInUnit * 2; + jQuery.style( elem, prop, initialInUnit + unit ); + + // Make sure we update the tween properties later on + valueParts = valueParts || []; + } + + if ( valueParts ) { + initialInUnit = +initialInUnit || +initial || 0; + + // Apply relative offset (+=/-=) if specified + adjusted = valueParts[ 1 ] ? + initialInUnit + ( valueParts[ 1 ] + 1 ) * valueParts[ 2 ] : + +valueParts[ 2 ]; + if ( tween ) { + tween.unit = unit; + tween.start = initialInUnit; + tween.end = adjusted; + } + } + return adjusted; +} + + +var defaultDisplayMap = {}; + +function getDefaultDisplay( elem ) { + var temp, + doc = elem.ownerDocument, + nodeName = elem.nodeName, + display = defaultDisplayMap[ nodeName ]; + + if ( display ) { + return display; + } + + temp = doc.body.appendChild( doc.createElement( nodeName ) ); + display = jQuery.css( temp, "display" ); + + temp.parentNode.removeChild( temp ); + + if ( display === "none" ) { + display = "block"; + } + defaultDisplayMap[ nodeName ] = display; + + return display; +} + +function showHide( elements, show ) { + var display, elem, + values = [], + index = 0, + length = elements.length; + + // Determine new display value for elements that need to change + for ( ; index < length; index++ ) { + elem = elements[ index ]; + if ( !elem.style ) { + continue; + } + + display = elem.style.display; + if ( show ) { + + // Since we force visibility upon cascade-hidden elements, an immediate (and slow) + // check is required in this first loop unless we have a nonempty display value (either + // inline or about-to-be-restored) + if ( display === "none" ) { + values[ index ] = dataPriv.get( elem, "display" ) || null; + if ( !values[ index ] ) { + elem.style.display = ""; + } + } + if ( elem.style.display === "" && isHiddenWithinTree( elem ) ) { + values[ index ] = getDefaultDisplay( elem ); + } + } else { + if ( display !== "none" ) { + values[ index ] = "none"; + + // Remember what we're overwriting + dataPriv.set( elem, "display", display ); + } + } + } + + // Set the display of the elements in a second loop to avoid constant reflow + for ( index = 0; index < length; index++ ) { + if ( values[ index ] != null ) { + elements[ index ].style.display = values[ index ]; + } + } + + return elements; +} + +jQuery.fn.extend( { + show: function() { + return showHide( this, true ); + }, + hide: function() { + return showHide( this ); + }, + toggle: function( state ) { + if ( typeof state === "boolean" ) { + return state ? this.show() : this.hide(); + } + + return this.each( function() { + if ( isHiddenWithinTree( this ) ) { + jQuery( this ).show(); + } else { + jQuery( this ).hide(); + } + } ); + } +} ); +var rcheckableType = ( /^(?:checkbox|radio)$/i ); + +var rtagName = ( /<([a-z][^\/\0>\x20\t\r\n\f]*)/i ); + +var rscriptType = ( /^$|^module$|\/(?:java|ecma)script/i ); + + + +( function() { + var fragment = document.createDocumentFragment(), + div = fragment.appendChild( document.createElement( "div" ) ), + input = document.createElement( "input" ); + + // Support: Android 4.0 - 4.3 only + // Check state lost if the name is set (#11217) + // Support: Windows Web Apps (WWA) + // `name` and `type` must use .setAttribute for WWA (#14901) + input.setAttribute( "type", "radio" ); + input.setAttribute( "checked", "checked" ); + input.setAttribute( "name", "t" ); + + div.appendChild( input ); + + // Support: Android <=4.1 only + // Older WebKit doesn't clone checked state correctly in fragments + support.checkClone = div.cloneNode( true ).cloneNode( true ).lastChild.checked; + + // Support: IE <=11 only + // Make sure textarea (and checkbox) defaultValue is properly cloned + div.innerHTML = ""; + support.noCloneChecked = !!div.cloneNode( true ).lastChild.defaultValue; + + // Support: IE <=9 only + // IE <=9 replaces "; + support.option = !!div.lastChild; +} )(); + + +// We have to close these tags to support XHTML (#13200) +var wrapMap = { + + // XHTML parsers do not magically insert elements in the + // same way that tag soup parsers do. So we cannot shorten + // this by omitting or other required elements. + thead: [ 1, "", "
" ], + col: [ 2, "", "
" ], + tr: [ 2, "", "
" ], + td: [ 3, "", "
" ], + + _default: [ 0, "", "" ] +}; + +wrapMap.tbody = wrapMap.tfoot = wrapMap.colgroup = wrapMap.caption = wrapMap.thead; +wrapMap.th = wrapMap.td; + +// Support: IE <=9 only +if ( !support.option ) { + wrapMap.optgroup = wrapMap.option = [ 1, "" ]; +} + + +function getAll( context, tag ) { + + // Support: IE <=9 - 11 only + // Use typeof to avoid zero-argument method invocation on host objects (#15151) + var ret; + + if ( typeof context.getElementsByTagName !== "undefined" ) { + ret = context.getElementsByTagName( tag || "*" ); + + } else if ( typeof context.querySelectorAll !== "undefined" ) { + ret = context.querySelectorAll( tag || "*" ); + + } else { + ret = []; + } + + if ( tag === undefined || tag && nodeName( context, tag ) ) { + return jQuery.merge( [ context ], ret ); + } + + return ret; +} + + +// Mark scripts as having already been evaluated +function setGlobalEval( elems, refElements ) { + var i = 0, + l = elems.length; + + for ( ; i < l; i++ ) { + dataPriv.set( + elems[ i ], + "globalEval", + !refElements || dataPriv.get( refElements[ i ], "globalEval" ) + ); + } +} + + +var rhtml = /<|&#?\w+;/; + +function buildFragment( elems, context, scripts, selection, ignored ) { + var elem, tmp, tag, wrap, attached, j, + fragment = context.createDocumentFragment(), + nodes = [], + i = 0, + l = elems.length; + + for ( ; i < l; i++ ) { + elem = elems[ i ]; + + if ( elem || elem === 0 ) { + + // Add nodes directly + if ( toType( elem ) === "object" ) { + + // Support: Android <=4.0 only, PhantomJS 1 only + // push.apply(_, arraylike) throws on ancient WebKit + jQuery.merge( nodes, elem.nodeType ? [ elem ] : elem ); + + // Convert non-html into a text node + } else if ( !rhtml.test( elem ) ) { + nodes.push( context.createTextNode( elem ) ); + + // Convert html into DOM nodes + } else { + tmp = tmp || fragment.appendChild( context.createElement( "div" ) ); + + // Deserialize a standard representation + tag = ( rtagName.exec( elem ) || [ "", "" ] )[ 1 ].toLowerCase(); + wrap = wrapMap[ tag ] || wrapMap._default; + tmp.innerHTML = wrap[ 1 ] + jQuery.htmlPrefilter( elem ) + wrap[ 2 ]; + + // Descend through wrappers to the right content + j = wrap[ 0 ]; + while ( j-- ) { + tmp = tmp.lastChild; + } + + // Support: Android <=4.0 only, PhantomJS 1 only + // push.apply(_, arraylike) throws on ancient WebKit + jQuery.merge( nodes, tmp.childNodes ); + + // Remember the top-level container + tmp = fragment.firstChild; + + // Ensure the created nodes are orphaned (#12392) + tmp.textContent = ""; + } + } + } + + // Remove wrapper from fragment + fragment.textContent = ""; + + i = 0; + while ( ( elem = nodes[ i++ ] ) ) { + + // Skip elements already in the context collection (trac-4087) + if ( selection && jQuery.inArray( elem, selection ) > -1 ) { + if ( ignored ) { + ignored.push( elem ); + } + continue; + } + + attached = isAttached( elem ); + + // Append to fragment + tmp = getAll( fragment.appendChild( elem ), "script" ); + + // Preserve script evaluation history + if ( attached ) { + setGlobalEval( tmp ); + } + + // Capture executables + if ( scripts ) { + j = 0; + while ( ( elem = tmp[ j++ ] ) ) { + if ( rscriptType.test( elem.type || "" ) ) { + scripts.push( elem ); + } + } + } + } + + return fragment; +} + + +var + rkeyEvent = /^key/, + rmouseEvent = /^(?:mouse|pointer|contextmenu|drag|drop)|click/, + rtypenamespace = /^([^.]*)(?:\.(.+)|)/; + +function returnTrue() { + return true; +} + +function returnFalse() { + return false; +} + +// Support: IE <=9 - 11+ +// focus() and blur() are asynchronous, except when they are no-op. +// So expect focus to be synchronous when the element is already active, +// and blur to be synchronous when the element is not already active. +// (focus and blur are always synchronous in other supported browsers, +// this just defines when we can count on it). +function expectSync( elem, type ) { + return ( elem === safeActiveElement() ) === ( type === "focus" ); +} + +// Support: IE <=9 only +// Accessing document.activeElement can throw unexpectedly +// https://bugs.jquery.com/ticket/13393 +function safeActiveElement() { + try { + return document.activeElement; + } catch ( err ) { } +} + +function on( elem, types, selector, data, fn, one ) { + var origFn, type; + + // Types can be a map of types/handlers + if ( typeof types === "object" ) { + + // ( types-Object, selector, data ) + if ( typeof selector !== "string" ) { + + // ( types-Object, data ) + data = data || selector; + selector = undefined; + } + for ( type in types ) { + on( elem, type, selector, data, types[ type ], one ); + } + return elem; + } + + if ( data == null && fn == null ) { + + // ( types, fn ) + fn = selector; + data = selector = undefined; + } else if ( fn == null ) { + if ( typeof selector === "string" ) { + + // ( types, selector, fn ) + fn = data; + data = undefined; + } else { + + // ( types, data, fn ) + fn = data; + data = selector; + selector = undefined; + } + } + if ( fn === false ) { + fn = returnFalse; + } else if ( !fn ) { + return elem; + } + + if ( one === 1 ) { + origFn = fn; + fn = function( event ) { + + // Can use an empty set, since event contains the info + jQuery().off( event ); + return origFn.apply( this, arguments ); + }; + + // Use same guid so caller can remove using origFn + fn.guid = origFn.guid || ( origFn.guid = jQuery.guid++ ); + } + return elem.each( function() { + jQuery.event.add( this, types, fn, data, selector ); + } ); +} + +/* + * Helper functions for managing events -- not part of the public interface. + * Props to Dean Edwards' addEvent library for many of the ideas. + */ +jQuery.event = { + + global: {}, + + add: function( elem, types, handler, data, selector ) { + + var handleObjIn, eventHandle, tmp, + events, t, handleObj, + special, handlers, type, namespaces, origType, + elemData = dataPriv.get( elem ); + + // Only attach events to objects that accept data + if ( !acceptData( elem ) ) { + return; + } + + // Caller can pass in an object of custom data in lieu of the handler + if ( handler.handler ) { + handleObjIn = handler; + handler = handleObjIn.handler; + selector = handleObjIn.selector; + } + + // Ensure that invalid selectors throw exceptions at attach time + // Evaluate against documentElement in case elem is a non-element node (e.g., document) + if ( selector ) { + jQuery.find.matchesSelector( documentElement, selector ); + } + + // Make sure that the handler has a unique ID, used to find/remove it later + if ( !handler.guid ) { + handler.guid = jQuery.guid++; + } + + // Init the element's event structure and main handler, if this is the first + if ( !( events = elemData.events ) ) { + events = elemData.events = Object.create( null ); + } + if ( !( eventHandle = elemData.handle ) ) { + eventHandle = elemData.handle = function( e ) { + + // Discard the second event of a jQuery.event.trigger() and + // when an event is called after a page has unloaded + return typeof jQuery !== "undefined" && jQuery.event.triggered !== e.type ? + jQuery.event.dispatch.apply( elem, arguments ) : undefined; + }; + } + + // Handle multiple events separated by a space + types = ( types || "" ).match( rnothtmlwhite ) || [ "" ]; + t = types.length; + while ( t-- ) { + tmp = rtypenamespace.exec( types[ t ] ) || []; + type = origType = tmp[ 1 ]; + namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort(); + + // There *must* be a type, no attaching namespace-only handlers + if ( !type ) { + continue; + } + + // If event changes its type, use the special event handlers for the changed type + special = jQuery.event.special[ type ] || {}; + + // If selector defined, determine special event api type, otherwise given type + type = ( selector ? special.delegateType : special.bindType ) || type; + + // Update special based on newly reset type + special = jQuery.event.special[ type ] || {}; + + // handleObj is passed to all event handlers + handleObj = jQuery.extend( { + type: type, + origType: origType, + data: data, + handler: handler, + guid: handler.guid, + selector: selector, + needsContext: selector && jQuery.expr.match.needsContext.test( selector ), + namespace: namespaces.join( "." ) + }, handleObjIn ); + + // Init the event handler queue if we're the first + if ( !( handlers = events[ type ] ) ) { + handlers = events[ type ] = []; + handlers.delegateCount = 0; + + // Only use addEventListener if the special events handler returns false + if ( !special.setup || + special.setup.call( elem, data, namespaces, eventHandle ) === false ) { + + if ( elem.addEventListener ) { + elem.addEventListener( type, eventHandle ); + } + } + } + + if ( special.add ) { + special.add.call( elem, handleObj ); + + if ( !handleObj.handler.guid ) { + handleObj.handler.guid = handler.guid; + } + } + + // Add to the element's handler list, delegates in front + if ( selector ) { + handlers.splice( handlers.delegateCount++, 0, handleObj ); + } else { + handlers.push( handleObj ); + } + + // Keep track of which events have ever been used, for event optimization + jQuery.event.global[ type ] = true; + } + + }, + + // Detach an event or set of events from an element + remove: function( elem, types, handler, selector, mappedTypes ) { + + var j, origCount, tmp, + events, t, handleObj, + special, handlers, type, namespaces, origType, + elemData = dataPriv.hasData( elem ) && dataPriv.get( elem ); + + if ( !elemData || !( events = elemData.events ) ) { + return; + } + + // Once for each type.namespace in types; type may be omitted + types = ( types || "" ).match( rnothtmlwhite ) || [ "" ]; + t = types.length; + while ( t-- ) { + tmp = rtypenamespace.exec( types[ t ] ) || []; + type = origType = tmp[ 1 ]; + namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort(); + + // Unbind all events (on this namespace, if provided) for the element + if ( !type ) { + for ( type in events ) { + jQuery.event.remove( elem, type + types[ t ], handler, selector, true ); + } + continue; + } + + special = jQuery.event.special[ type ] || {}; + type = ( selector ? special.delegateType : special.bindType ) || type; + handlers = events[ type ] || []; + tmp = tmp[ 2 ] && + new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ); + + // Remove matching events + origCount = j = handlers.length; + while ( j-- ) { + handleObj = handlers[ j ]; + + if ( ( mappedTypes || origType === handleObj.origType ) && + ( !handler || handler.guid === handleObj.guid ) && + ( !tmp || tmp.test( handleObj.namespace ) ) && + ( !selector || selector === handleObj.selector || + selector === "**" && handleObj.selector ) ) { + handlers.splice( j, 1 ); + + if ( handleObj.selector ) { + handlers.delegateCount--; + } + if ( special.remove ) { + special.remove.call( elem, handleObj ); + } + } + } + + // Remove generic event handler if we removed something and no more handlers exist + // (avoids potential for endless recursion during removal of special event handlers) + if ( origCount && !handlers.length ) { + if ( !special.teardown || + special.teardown.call( elem, namespaces, elemData.handle ) === false ) { + + jQuery.removeEvent( elem, type, elemData.handle ); + } + + delete events[ type ]; + } + } + + // Remove data and the expando if it's no longer used + if ( jQuery.isEmptyObject( events ) ) { + dataPriv.remove( elem, "handle events" ); + } + }, + + dispatch: function( nativeEvent ) { + + var i, j, ret, matched, handleObj, handlerQueue, + args = new Array( arguments.length ), + + // Make a writable jQuery.Event from the native event object + event = jQuery.event.fix( nativeEvent ), + + handlers = ( + dataPriv.get( this, "events" ) || Object.create( null ) + )[ event.type ] || [], + special = jQuery.event.special[ event.type ] || {}; + + // Use the fix-ed jQuery.Event rather than the (read-only) native event + args[ 0 ] = event; + + for ( i = 1; i < arguments.length; i++ ) { + args[ i ] = arguments[ i ]; + } + + event.delegateTarget = this; + + // Call the preDispatch hook for the mapped type, and let it bail if desired + if ( special.preDispatch && special.preDispatch.call( this, event ) === false ) { + return; + } + + // Determine handlers + handlerQueue = jQuery.event.handlers.call( this, event, handlers ); + + // Run delegates first; they may want to stop propagation beneath us + i = 0; + while ( ( matched = handlerQueue[ i++ ] ) && !event.isPropagationStopped() ) { + event.currentTarget = matched.elem; + + j = 0; + while ( ( handleObj = matched.handlers[ j++ ] ) && + !event.isImmediatePropagationStopped() ) { + + // If the event is namespaced, then each handler is only invoked if it is + // specially universal or its namespaces are a superset of the event's. + if ( !event.rnamespace || handleObj.namespace === false || + event.rnamespace.test( handleObj.namespace ) ) { + + event.handleObj = handleObj; + event.data = handleObj.data; + + ret = ( ( jQuery.event.special[ handleObj.origType ] || {} ).handle || + handleObj.handler ).apply( matched.elem, args ); + + if ( ret !== undefined ) { + if ( ( event.result = ret ) === false ) { + event.preventDefault(); + event.stopPropagation(); + } + } + } + } + } + + // Call the postDispatch hook for the mapped type + if ( special.postDispatch ) { + special.postDispatch.call( this, event ); + } + + return event.result; + }, + + handlers: function( event, handlers ) { + var i, handleObj, sel, matchedHandlers, matchedSelectors, + handlerQueue = [], + delegateCount = handlers.delegateCount, + cur = event.target; + + // Find delegate handlers + if ( delegateCount && + + // Support: IE <=9 + // Black-hole SVG instance trees (trac-13180) + cur.nodeType && + + // Support: Firefox <=42 + // Suppress spec-violating clicks indicating a non-primary pointer button (trac-3861) + // https://www.w3.org/TR/DOM-Level-3-Events/#event-type-click + // Support: IE 11 only + // ...but not arrow key "clicks" of radio inputs, which can have `button` -1 (gh-2343) + !( event.type === "click" && event.button >= 1 ) ) { + + for ( ; cur !== this; cur = cur.parentNode || this ) { + + // Don't check non-elements (#13208) + // Don't process clicks on disabled elements (#6911, #8165, #11382, #11764) + if ( cur.nodeType === 1 && !( event.type === "click" && cur.disabled === true ) ) { + matchedHandlers = []; + matchedSelectors = {}; + for ( i = 0; i < delegateCount; i++ ) { + handleObj = handlers[ i ]; + + // Don't conflict with Object.prototype properties (#13203) + sel = handleObj.selector + " "; + + if ( matchedSelectors[ sel ] === undefined ) { + matchedSelectors[ sel ] = handleObj.needsContext ? + jQuery( sel, this ).index( cur ) > -1 : + jQuery.find( sel, this, null, [ cur ] ).length; + } + if ( matchedSelectors[ sel ] ) { + matchedHandlers.push( handleObj ); + } + } + if ( matchedHandlers.length ) { + handlerQueue.push( { elem: cur, handlers: matchedHandlers } ); + } + } + } + } + + // Add the remaining (directly-bound) handlers + cur = this; + if ( delegateCount < handlers.length ) { + handlerQueue.push( { elem: cur, handlers: handlers.slice( delegateCount ) } ); + } + + return handlerQueue; + }, + + addProp: function( name, hook ) { + Object.defineProperty( jQuery.Event.prototype, name, { + enumerable: true, + configurable: true, + + get: isFunction( hook ) ? + function() { + if ( this.originalEvent ) { + return hook( this.originalEvent ); + } + } : + function() { + if ( this.originalEvent ) { + return this.originalEvent[ name ]; + } + }, + + set: function( value ) { + Object.defineProperty( this, name, { + enumerable: true, + configurable: true, + writable: true, + value: value + } ); + } + } ); + }, + + fix: function( originalEvent ) { + return originalEvent[ jQuery.expando ] ? + originalEvent : + new jQuery.Event( originalEvent ); + }, + + special: { + load: { + + // Prevent triggered image.load events from bubbling to window.load + noBubble: true + }, + click: { + + // Utilize native event to ensure correct state for checkable inputs + setup: function( data ) { + + // For mutual compressibility with _default, replace `this` access with a local var. + // `|| data` is dead code meant only to preserve the variable through minification. + var el = this || data; + + // Claim the first handler + if ( rcheckableType.test( el.type ) && + el.click && nodeName( el, "input" ) ) { + + // dataPriv.set( el, "click", ... ) + leverageNative( el, "click", returnTrue ); + } + + // Return false to allow normal processing in the caller + return false; + }, + trigger: function( data ) { + + // For mutual compressibility with _default, replace `this` access with a local var. + // `|| data` is dead code meant only to preserve the variable through minification. + var el = this || data; + + // Force setup before triggering a click + if ( rcheckableType.test( el.type ) && + el.click && nodeName( el, "input" ) ) { + + leverageNative( el, "click" ); + } + + // Return non-false to allow normal event-path propagation + return true; + }, + + // For cross-browser consistency, suppress native .click() on links + // Also prevent it if we're currently inside a leveraged native-event stack + _default: function( event ) { + var target = event.target; + return rcheckableType.test( target.type ) && + target.click && nodeName( target, "input" ) && + dataPriv.get( target, "click" ) || + nodeName( target, "a" ); + } + }, + + beforeunload: { + postDispatch: function( event ) { + + // Support: Firefox 20+ + // Firefox doesn't alert if the returnValue field is not set. + if ( event.result !== undefined && event.originalEvent ) { + event.originalEvent.returnValue = event.result; + } + } + } + } +}; + +// Ensure the presence of an event listener that handles manually-triggered +// synthetic events by interrupting progress until reinvoked in response to +// *native* events that it fires directly, ensuring that state changes have +// already occurred before other listeners are invoked. +function leverageNative( el, type, expectSync ) { + + // Missing expectSync indicates a trigger call, which must force setup through jQuery.event.add + if ( !expectSync ) { + if ( dataPriv.get( el, type ) === undefined ) { + jQuery.event.add( el, type, returnTrue ); + } + return; + } + + // Register the controller as a special universal handler for all event namespaces + dataPriv.set( el, type, false ); + jQuery.event.add( el, type, { + namespace: false, + handler: function( event ) { + var notAsync, result, + saved = dataPriv.get( this, type ); + + if ( ( event.isTrigger & 1 ) && this[ type ] ) { + + // Interrupt processing of the outer synthetic .trigger()ed event + // Saved data should be false in such cases, but might be a leftover capture object + // from an async native handler (gh-4350) + if ( !saved.length ) { + + // Store arguments for use when handling the inner native event + // There will always be at least one argument (an event object), so this array + // will not be confused with a leftover capture object. + saved = slice.call( arguments ); + dataPriv.set( this, type, saved ); + + // Trigger the native event and capture its result + // Support: IE <=9 - 11+ + // focus() and blur() are asynchronous + notAsync = expectSync( this, type ); + this[ type ](); + result = dataPriv.get( this, type ); + if ( saved !== result || notAsync ) { + dataPriv.set( this, type, false ); + } else { + result = {}; + } + if ( saved !== result ) { + + // Cancel the outer synthetic event + event.stopImmediatePropagation(); + event.preventDefault(); + return result.value; + } + + // If this is an inner synthetic event for an event with a bubbling surrogate + // (focus or blur), assume that the surrogate already propagated from triggering the + // native event and prevent that from happening again here. + // This technically gets the ordering wrong w.r.t. to `.trigger()` (in which the + // bubbling surrogate propagates *after* the non-bubbling base), but that seems + // less bad than duplication. + } else if ( ( jQuery.event.special[ type ] || {} ).delegateType ) { + event.stopPropagation(); + } + + // If this is a native event triggered above, everything is now in order + // Fire an inner synthetic event with the original arguments + } else if ( saved.length ) { + + // ...and capture the result + dataPriv.set( this, type, { + value: jQuery.event.trigger( + + // Support: IE <=9 - 11+ + // Extend with the prototype to reset the above stopImmediatePropagation() + jQuery.extend( saved[ 0 ], jQuery.Event.prototype ), + saved.slice( 1 ), + this + ) + } ); + + // Abort handling of the native event + event.stopImmediatePropagation(); + } + } + } ); +} + +jQuery.removeEvent = function( elem, type, handle ) { + + // This "if" is needed for plain objects + if ( elem.removeEventListener ) { + elem.removeEventListener( type, handle ); + } +}; + +jQuery.Event = function( src, props ) { + + // Allow instantiation without the 'new' keyword + if ( !( this instanceof jQuery.Event ) ) { + return new jQuery.Event( src, props ); + } + + // Event object + if ( src && src.type ) { + this.originalEvent = src; + this.type = src.type; + + // Events bubbling up the document may have been marked as prevented + // by a handler lower down the tree; reflect the correct value. + this.isDefaultPrevented = src.defaultPrevented || + src.defaultPrevented === undefined && + + // Support: Android <=2.3 only + src.returnValue === false ? + returnTrue : + returnFalse; + + // Create target properties + // Support: Safari <=6 - 7 only + // Target should not be a text node (#504, #13143) + this.target = ( src.target && src.target.nodeType === 3 ) ? + src.target.parentNode : + src.target; + + this.currentTarget = src.currentTarget; + this.relatedTarget = src.relatedTarget; + + // Event type + } else { + this.type = src; + } + + // Put explicitly provided properties onto the event object + if ( props ) { + jQuery.extend( this, props ); + } + + // Create a timestamp if incoming event doesn't have one + this.timeStamp = src && src.timeStamp || Date.now(); + + // Mark it as fixed + this[ jQuery.expando ] = true; +}; + +// jQuery.Event is based on DOM3 Events as specified by the ECMAScript Language Binding +// https://www.w3.org/TR/2003/WD-DOM-Level-3-Events-20030331/ecma-script-binding.html +jQuery.Event.prototype = { + constructor: jQuery.Event, + isDefaultPrevented: returnFalse, + isPropagationStopped: returnFalse, + isImmediatePropagationStopped: returnFalse, + isSimulated: false, + + preventDefault: function() { + var e = this.originalEvent; + + this.isDefaultPrevented = returnTrue; + + if ( e && !this.isSimulated ) { + e.preventDefault(); + } + }, + stopPropagation: function() { + var e = this.originalEvent; + + this.isPropagationStopped = returnTrue; + + if ( e && !this.isSimulated ) { + e.stopPropagation(); + } + }, + stopImmediatePropagation: function() { + var e = this.originalEvent; + + this.isImmediatePropagationStopped = returnTrue; + + if ( e && !this.isSimulated ) { + e.stopImmediatePropagation(); + } + + this.stopPropagation(); + } +}; + +// Includes all common event props including KeyEvent and MouseEvent specific props +jQuery.each( { + altKey: true, + bubbles: true, + cancelable: true, + changedTouches: true, + ctrlKey: true, + detail: true, + eventPhase: true, + metaKey: true, + pageX: true, + pageY: true, + shiftKey: true, + view: true, + "char": true, + code: true, + charCode: true, + key: true, + keyCode: true, + button: true, + buttons: true, + clientX: true, + clientY: true, + offsetX: true, + offsetY: true, + pointerId: true, + pointerType: true, + screenX: true, + screenY: true, + targetTouches: true, + toElement: true, + touches: true, + + which: function( event ) { + var button = event.button; + + // Add which for key events + if ( event.which == null && rkeyEvent.test( event.type ) ) { + return event.charCode != null ? event.charCode : event.keyCode; + } + + // Add which for click: 1 === left; 2 === middle; 3 === right + if ( !event.which && button !== undefined && rmouseEvent.test( event.type ) ) { + if ( button & 1 ) { + return 1; + } + + if ( button & 2 ) { + return 3; + } + + if ( button & 4 ) { + return 2; + } + + return 0; + } + + return event.which; + } +}, jQuery.event.addProp ); + +jQuery.each( { focus: "focusin", blur: "focusout" }, function( type, delegateType ) { + jQuery.event.special[ type ] = { + + // Utilize native event if possible so blur/focus sequence is correct + setup: function() { + + // Claim the first handler + // dataPriv.set( this, "focus", ... ) + // dataPriv.set( this, "blur", ... ) + leverageNative( this, type, expectSync ); + + // Return false to allow normal processing in the caller + return false; + }, + trigger: function() { + + // Force setup before trigger + leverageNative( this, type ); + + // Return non-false to allow normal event-path propagation + return true; + }, + + delegateType: delegateType + }; +} ); + +// Create mouseenter/leave events using mouseover/out and event-time checks +// so that event delegation works in jQuery. +// Do the same for pointerenter/pointerleave and pointerover/pointerout +// +// Support: Safari 7 only +// Safari sends mouseenter too often; see: +// https://bugs.chromium.org/p/chromium/issues/detail?id=470258 +// for the description of the bug (it existed in older Chrome versions as well). +jQuery.each( { + mouseenter: "mouseover", + mouseleave: "mouseout", + pointerenter: "pointerover", + pointerleave: "pointerout" +}, function( orig, fix ) { + jQuery.event.special[ orig ] = { + delegateType: fix, + bindType: fix, + + handle: function( event ) { + var ret, + target = this, + related = event.relatedTarget, + handleObj = event.handleObj; + + // For mouseenter/leave call the handler if related is outside the target. + // NB: No relatedTarget if the mouse left/entered the browser window + if ( !related || ( related !== target && !jQuery.contains( target, related ) ) ) { + event.type = handleObj.origType; + ret = handleObj.handler.apply( this, arguments ); + event.type = fix; + } + return ret; + } + }; +} ); + +jQuery.fn.extend( { + + on: function( types, selector, data, fn ) { + return on( this, types, selector, data, fn ); + }, + one: function( types, selector, data, fn ) { + return on( this, types, selector, data, fn, 1 ); + }, + off: function( types, selector, fn ) { + var handleObj, type; + if ( types && types.preventDefault && types.handleObj ) { + + // ( event ) dispatched jQuery.Event + handleObj = types.handleObj; + jQuery( types.delegateTarget ).off( + handleObj.namespace ? + handleObj.origType + "." + handleObj.namespace : + handleObj.origType, + handleObj.selector, + handleObj.handler + ); + return this; + } + if ( typeof types === "object" ) { + + // ( types-object [, selector] ) + for ( type in types ) { + this.off( type, selector, types[ type ] ); + } + return this; + } + if ( selector === false || typeof selector === "function" ) { + + // ( types [, fn] ) + fn = selector; + selector = undefined; + } + if ( fn === false ) { + fn = returnFalse; + } + return this.each( function() { + jQuery.event.remove( this, types, fn, selector ); + } ); + } +} ); + + +var + + // Support: IE <=10 - 11, Edge 12 - 13 only + // In IE/Edge using regex groups here causes severe slowdowns. + // See https://connect.microsoft.com/IE/feedback/details/1736512/ + rnoInnerhtml = /\s*$/g; + +// Prefer a tbody over its parent table for containing new rows +function manipulationTarget( elem, content ) { + if ( nodeName( elem, "table" ) && + nodeName( content.nodeType !== 11 ? content : content.firstChild, "tr" ) ) { + + return jQuery( elem ).children( "tbody" )[ 0 ] || elem; + } + + return elem; +} + +// Replace/restore the type attribute of script elements for safe DOM manipulation +function disableScript( elem ) { + elem.type = ( elem.getAttribute( "type" ) !== null ) + "/" + elem.type; + return elem; +} +function restoreScript( elem ) { + if ( ( elem.type || "" ).slice( 0, 5 ) === "true/" ) { + elem.type = elem.type.slice( 5 ); + } else { + elem.removeAttribute( "type" ); + } + + return elem; +} + +function cloneCopyEvent( src, dest ) { + var i, l, type, pdataOld, udataOld, udataCur, events; + + if ( dest.nodeType !== 1 ) { + return; + } + + // 1. Copy private data: events, handlers, etc. + if ( dataPriv.hasData( src ) ) { + pdataOld = dataPriv.get( src ); + events = pdataOld.events; + + if ( events ) { + dataPriv.remove( dest, "handle events" ); + + for ( type in events ) { + for ( i = 0, l = events[ type ].length; i < l; i++ ) { + jQuery.event.add( dest, type, events[ type ][ i ] ); + } + } + } + } + + // 2. Copy user data + if ( dataUser.hasData( src ) ) { + udataOld = dataUser.access( src ); + udataCur = jQuery.extend( {}, udataOld ); + + dataUser.set( dest, udataCur ); + } +} + +// Fix IE bugs, see support tests +function fixInput( src, dest ) { + var nodeName = dest.nodeName.toLowerCase(); + + // Fails to persist the checked state of a cloned checkbox or radio button. + if ( nodeName === "input" && rcheckableType.test( src.type ) ) { + dest.checked = src.checked; + + // Fails to return the selected option to the default selected state when cloning options + } else if ( nodeName === "input" || nodeName === "textarea" ) { + dest.defaultValue = src.defaultValue; + } +} + +function domManip( collection, args, callback, ignored ) { + + // Flatten any nested arrays + args = flat( args ); + + var fragment, first, scripts, hasScripts, node, doc, + i = 0, + l = collection.length, + iNoClone = l - 1, + value = args[ 0 ], + valueIsFunction = isFunction( value ); + + // We can't cloneNode fragments that contain checked, in WebKit + if ( valueIsFunction || + ( l > 1 && typeof value === "string" && + !support.checkClone && rchecked.test( value ) ) ) { + return collection.each( function( index ) { + var self = collection.eq( index ); + if ( valueIsFunction ) { + args[ 0 ] = value.call( this, index, self.html() ); + } + domManip( self, args, callback, ignored ); + } ); + } + + if ( l ) { + fragment = buildFragment( args, collection[ 0 ].ownerDocument, false, collection, ignored ); + first = fragment.firstChild; + + if ( fragment.childNodes.length === 1 ) { + fragment = first; + } + + // Require either new content or an interest in ignored elements to invoke the callback + if ( first || ignored ) { + scripts = jQuery.map( getAll( fragment, "script" ), disableScript ); + hasScripts = scripts.length; + + // Use the original fragment for the last item + // instead of the first because it can end up + // being emptied incorrectly in certain situations (#8070). + for ( ; i < l; i++ ) { + node = fragment; + + if ( i !== iNoClone ) { + node = jQuery.clone( node, true, true ); + + // Keep references to cloned scripts for later restoration + if ( hasScripts ) { + + // Support: Android <=4.0 only, PhantomJS 1 only + // push.apply(_, arraylike) throws on ancient WebKit + jQuery.merge( scripts, getAll( node, "script" ) ); + } + } + + callback.call( collection[ i ], node, i ); + } + + if ( hasScripts ) { + doc = scripts[ scripts.length - 1 ].ownerDocument; + + // Reenable scripts + jQuery.map( scripts, restoreScript ); + + // Evaluate executable scripts on first document insertion + for ( i = 0; i < hasScripts; i++ ) { + node = scripts[ i ]; + if ( rscriptType.test( node.type || "" ) && + !dataPriv.access( node, "globalEval" ) && + jQuery.contains( doc, node ) ) { + + if ( node.src && ( node.type || "" ).toLowerCase() !== "module" ) { + + // Optional AJAX dependency, but won't run scripts if not present + if ( jQuery._evalUrl && !node.noModule ) { + jQuery._evalUrl( node.src, { + nonce: node.nonce || node.getAttribute( "nonce" ) + }, doc ); + } + } else { + DOMEval( node.textContent.replace( rcleanScript, "" ), node, doc ); + } + } + } + } + } + } + + return collection; +} + +function remove( elem, selector, keepData ) { + var node, + nodes = selector ? jQuery.filter( selector, elem ) : elem, + i = 0; + + for ( ; ( node = nodes[ i ] ) != null; i++ ) { + if ( !keepData && node.nodeType === 1 ) { + jQuery.cleanData( getAll( node ) ); + } + + if ( node.parentNode ) { + if ( keepData && isAttached( node ) ) { + setGlobalEval( getAll( node, "script" ) ); + } + node.parentNode.removeChild( node ); + } + } + + return elem; +} + +jQuery.extend( { + htmlPrefilter: function( html ) { + return html; + }, + + clone: function( elem, dataAndEvents, deepDataAndEvents ) { + var i, l, srcElements, destElements, + clone = elem.cloneNode( true ), + inPage = isAttached( elem ); + + // Fix IE cloning issues + if ( !support.noCloneChecked && ( elem.nodeType === 1 || elem.nodeType === 11 ) && + !jQuery.isXMLDoc( elem ) ) { + + // We eschew Sizzle here for performance reasons: https://jsperf.com/getall-vs-sizzle/2 + destElements = getAll( clone ); + srcElements = getAll( elem ); + + for ( i = 0, l = srcElements.length; i < l; i++ ) { + fixInput( srcElements[ i ], destElements[ i ] ); + } + } + + // Copy the events from the original to the clone + if ( dataAndEvents ) { + if ( deepDataAndEvents ) { + srcElements = srcElements || getAll( elem ); + destElements = destElements || getAll( clone ); + + for ( i = 0, l = srcElements.length; i < l; i++ ) { + cloneCopyEvent( srcElements[ i ], destElements[ i ] ); + } + } else { + cloneCopyEvent( elem, clone ); + } + } + + // Preserve script evaluation history + destElements = getAll( clone, "script" ); + if ( destElements.length > 0 ) { + setGlobalEval( destElements, !inPage && getAll( elem, "script" ) ); + } + + // Return the cloned set + return clone; + }, + + cleanData: function( elems ) { + var data, elem, type, + special = jQuery.event.special, + i = 0; + + for ( ; ( elem = elems[ i ] ) !== undefined; i++ ) { + if ( acceptData( elem ) ) { + if ( ( data = elem[ dataPriv.expando ] ) ) { + if ( data.events ) { + for ( type in data.events ) { + if ( special[ type ] ) { + jQuery.event.remove( elem, type ); + + // This is a shortcut to avoid jQuery.event.remove's overhead + } else { + jQuery.removeEvent( elem, type, data.handle ); + } + } + } + + // Support: Chrome <=35 - 45+ + // Assign undefined instead of using delete, see Data#remove + elem[ dataPriv.expando ] = undefined; + } + if ( elem[ dataUser.expando ] ) { + + // Support: Chrome <=35 - 45+ + // Assign undefined instead of using delete, see Data#remove + elem[ dataUser.expando ] = undefined; + } + } + } + } +} ); + +jQuery.fn.extend( { + detach: function( selector ) { + return remove( this, selector, true ); + }, + + remove: function( selector ) { + return remove( this, selector ); + }, + + text: function( value ) { + return access( this, function( value ) { + return value === undefined ? + jQuery.text( this ) : + this.empty().each( function() { + if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { + this.textContent = value; + } + } ); + }, null, value, arguments.length ); + }, + + append: function() { + return domManip( this, arguments, function( elem ) { + if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { + var target = manipulationTarget( this, elem ); + target.appendChild( elem ); + } + } ); + }, + + prepend: function() { + return domManip( this, arguments, function( elem ) { + if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { + var target = manipulationTarget( this, elem ); + target.insertBefore( elem, target.firstChild ); + } + } ); + }, + + before: function() { + return domManip( this, arguments, function( elem ) { + if ( this.parentNode ) { + this.parentNode.insertBefore( elem, this ); + } + } ); + }, + + after: function() { + return domManip( this, arguments, function( elem ) { + if ( this.parentNode ) { + this.parentNode.insertBefore( elem, this.nextSibling ); + } + } ); + }, + + empty: function() { + var elem, + i = 0; + + for ( ; ( elem = this[ i ] ) != null; i++ ) { + if ( elem.nodeType === 1 ) { + + // Prevent memory leaks + jQuery.cleanData( getAll( elem, false ) ); + + // Remove any remaining nodes + elem.textContent = ""; + } + } + + return this; + }, + + clone: function( dataAndEvents, deepDataAndEvents ) { + dataAndEvents = dataAndEvents == null ? false : dataAndEvents; + deepDataAndEvents = deepDataAndEvents == null ? dataAndEvents : deepDataAndEvents; + + return this.map( function() { + return jQuery.clone( this, dataAndEvents, deepDataAndEvents ); + } ); + }, + + html: function( value ) { + return access( this, function( value ) { + var elem = this[ 0 ] || {}, + i = 0, + l = this.length; + + if ( value === undefined && elem.nodeType === 1 ) { + return elem.innerHTML; + } + + // See if we can take a shortcut and just use innerHTML + if ( typeof value === "string" && !rnoInnerhtml.test( value ) && + !wrapMap[ ( rtagName.exec( value ) || [ "", "" ] )[ 1 ].toLowerCase() ] ) { + + value = jQuery.htmlPrefilter( value ); + + try { + for ( ; i < l; i++ ) { + elem = this[ i ] || {}; + + // Remove element nodes and prevent memory leaks + if ( elem.nodeType === 1 ) { + jQuery.cleanData( getAll( elem, false ) ); + elem.innerHTML = value; + } + } + + elem = 0; + + // If using innerHTML throws an exception, use the fallback method + } catch ( e ) {} + } + + if ( elem ) { + this.empty().append( value ); + } + }, null, value, arguments.length ); + }, + + replaceWith: function() { + var ignored = []; + + // Make the changes, replacing each non-ignored context element with the new content + return domManip( this, arguments, function( elem ) { + var parent = this.parentNode; + + if ( jQuery.inArray( this, ignored ) < 0 ) { + jQuery.cleanData( getAll( this ) ); + if ( parent ) { + parent.replaceChild( elem, this ); + } + } + + // Force callback invocation + }, ignored ); + } +} ); + +jQuery.each( { + appendTo: "append", + prependTo: "prepend", + insertBefore: "before", + insertAfter: "after", + replaceAll: "replaceWith" +}, function( name, original ) { + jQuery.fn[ name ] = function( selector ) { + var elems, + ret = [], + insert = jQuery( selector ), + last = insert.length - 1, + i = 0; + + for ( ; i <= last; i++ ) { + elems = i === last ? this : this.clone( true ); + jQuery( insert[ i ] )[ original ]( elems ); + + // Support: Android <=4.0 only, PhantomJS 1 only + // .get() because push.apply(_, arraylike) throws on ancient WebKit + push.apply( ret, elems.get() ); + } + + return this.pushStack( ret ); + }; +} ); +var rnumnonpx = new RegExp( "^(" + pnum + ")(?!px)[a-z%]+$", "i" ); + +var getStyles = function( elem ) { + + // Support: IE <=11 only, Firefox <=30 (#15098, #14150) + // IE throws on elements created in popups + // FF meanwhile throws on frame elements through "defaultView.getComputedStyle" + var view = elem.ownerDocument.defaultView; + + if ( !view || !view.opener ) { + view = window; + } + + return view.getComputedStyle( elem ); + }; + +var swap = function( elem, options, callback ) { + var ret, name, + old = {}; + + // Remember the old values, and insert the new ones + for ( name in options ) { + old[ name ] = elem.style[ name ]; + elem.style[ name ] = options[ name ]; + } + + ret = callback.call( elem ); + + // Revert the old values + for ( name in options ) { + elem.style[ name ] = old[ name ]; + } + + return ret; +}; + + +var rboxStyle = new RegExp( cssExpand.join( "|" ), "i" ); + + + +( function() { + + // Executing both pixelPosition & boxSizingReliable tests require only one layout + // so they're executed at the same time to save the second computation. + function computeStyleTests() { + + // This is a singleton, we need to execute it only once + if ( !div ) { + return; + } + + container.style.cssText = "position:absolute;left:-11111px;width:60px;" + + "margin-top:1px;padding:0;border:0"; + div.style.cssText = + "position:relative;display:block;box-sizing:border-box;overflow:scroll;" + + "margin:auto;border:1px;padding:1px;" + + "width:60%;top:1%"; + documentElement.appendChild( container ).appendChild( div ); + + var divStyle = window.getComputedStyle( div ); + pixelPositionVal = divStyle.top !== "1%"; + + // Support: Android 4.0 - 4.3 only, Firefox <=3 - 44 + reliableMarginLeftVal = roundPixelMeasures( divStyle.marginLeft ) === 12; + + // Support: Android 4.0 - 4.3 only, Safari <=9.1 - 10.1, iOS <=7.0 - 9.3 + // Some styles come back with percentage values, even though they shouldn't + div.style.right = "60%"; + pixelBoxStylesVal = roundPixelMeasures( divStyle.right ) === 36; + + // Support: IE 9 - 11 only + // Detect misreporting of content dimensions for box-sizing:border-box elements + boxSizingReliableVal = roundPixelMeasures( divStyle.width ) === 36; + + // Support: IE 9 only + // Detect overflow:scroll screwiness (gh-3699) + // Support: Chrome <=64 + // Don't get tricked when zoom affects offsetWidth (gh-4029) + div.style.position = "absolute"; + scrollboxSizeVal = roundPixelMeasures( div.offsetWidth / 3 ) === 12; + + documentElement.removeChild( container ); + + // Nullify the div so it wouldn't be stored in the memory and + // it will also be a sign that checks already performed + div = null; + } + + function roundPixelMeasures( measure ) { + return Math.round( parseFloat( measure ) ); + } + + var pixelPositionVal, boxSizingReliableVal, scrollboxSizeVal, pixelBoxStylesVal, + reliableTrDimensionsVal, reliableMarginLeftVal, + container = document.createElement( "div" ), + div = document.createElement( "div" ); + + // Finish early in limited (non-browser) environments + if ( !div.style ) { + return; + } + + // Support: IE <=9 - 11 only + // Style of cloned element affects source element cloned (#8908) + div.style.backgroundClip = "content-box"; + div.cloneNode( true ).style.backgroundClip = ""; + support.clearCloneStyle = div.style.backgroundClip === "content-box"; + + jQuery.extend( support, { + boxSizingReliable: function() { + computeStyleTests(); + return boxSizingReliableVal; + }, + pixelBoxStyles: function() { + computeStyleTests(); + return pixelBoxStylesVal; + }, + pixelPosition: function() { + computeStyleTests(); + return pixelPositionVal; + }, + reliableMarginLeft: function() { + computeStyleTests(); + return reliableMarginLeftVal; + }, + scrollboxSize: function() { + computeStyleTests(); + return scrollboxSizeVal; + }, + + // Support: IE 9 - 11+, Edge 15 - 18+ + // IE/Edge misreport `getComputedStyle` of table rows with width/height + // set in CSS while `offset*` properties report correct values. + // Behavior in IE 9 is more subtle than in newer versions & it passes + // some versions of this test; make sure not to make it pass there! + reliableTrDimensions: function() { + var table, tr, trChild, trStyle; + if ( reliableTrDimensionsVal == null ) { + table = document.createElement( "table" ); + tr = document.createElement( "tr" ); + trChild = document.createElement( "div" ); + + table.style.cssText = "position:absolute;left:-11111px"; + tr.style.height = "1px"; + trChild.style.height = "9px"; + + documentElement + .appendChild( table ) + .appendChild( tr ) + .appendChild( trChild ); + + trStyle = window.getComputedStyle( tr ); + reliableTrDimensionsVal = parseInt( trStyle.height ) > 3; + + documentElement.removeChild( table ); + } + return reliableTrDimensionsVal; + } + } ); +} )(); + + +function curCSS( elem, name, computed ) { + var width, minWidth, maxWidth, ret, + + // Support: Firefox 51+ + // Retrieving style before computed somehow + // fixes an issue with getting wrong values + // on detached elements + style = elem.style; + + computed = computed || getStyles( elem ); + + // getPropertyValue is needed for: + // .css('filter') (IE 9 only, #12537) + // .css('--customProperty) (#3144) + if ( computed ) { + ret = computed.getPropertyValue( name ) || computed[ name ]; + + if ( ret === "" && !isAttached( elem ) ) { + ret = jQuery.style( elem, name ); + } + + // A tribute to the "awesome hack by Dean Edwards" + // Android Browser returns percentage for some values, + // but width seems to be reliably pixels. + // This is against the CSSOM draft spec: + // https://drafts.csswg.org/cssom/#resolved-values + if ( !support.pixelBoxStyles() && rnumnonpx.test( ret ) && rboxStyle.test( name ) ) { + + // Remember the original values + width = style.width; + minWidth = style.minWidth; + maxWidth = style.maxWidth; + + // Put in the new values to get a computed value out + style.minWidth = style.maxWidth = style.width = ret; + ret = computed.width; + + // Revert the changed values + style.width = width; + style.minWidth = minWidth; + style.maxWidth = maxWidth; + } + } + + return ret !== undefined ? + + // Support: IE <=9 - 11 only + // IE returns zIndex value as an integer. + ret + "" : + ret; +} + + +function addGetHookIf( conditionFn, hookFn ) { + + // Define the hook, we'll check on the first run if it's really needed. + return { + get: function() { + if ( conditionFn() ) { + + // Hook not needed (or it's not possible to use it due + // to missing dependency), remove it. + delete this.get; + return; + } + + // Hook needed; redefine it so that the support test is not executed again. + return ( this.get = hookFn ).apply( this, arguments ); + } + }; +} + + +var cssPrefixes = [ "Webkit", "Moz", "ms" ], + emptyStyle = document.createElement( "div" ).style, + vendorProps = {}; + +// Return a vendor-prefixed property or undefined +function vendorPropName( name ) { + + // Check for vendor prefixed names + var capName = name[ 0 ].toUpperCase() + name.slice( 1 ), + i = cssPrefixes.length; + + while ( i-- ) { + name = cssPrefixes[ i ] + capName; + if ( name in emptyStyle ) { + return name; + } + } +} + +// Return a potentially-mapped jQuery.cssProps or vendor prefixed property +function finalPropName( name ) { + var final = jQuery.cssProps[ name ] || vendorProps[ name ]; + + if ( final ) { + return final; + } + if ( name in emptyStyle ) { + return name; + } + return vendorProps[ name ] = vendorPropName( name ) || name; +} + + +var + + // Swappable if display is none or starts with table + // except "table", "table-cell", or "table-caption" + // See here for display values: https://developer.mozilla.org/en-US/docs/CSS/display + rdisplayswap = /^(none|table(?!-c[ea]).+)/, + rcustomProp = /^--/, + cssShow = { position: "absolute", visibility: "hidden", display: "block" }, + cssNormalTransform = { + letterSpacing: "0", + fontWeight: "400" + }; + +function setPositiveNumber( _elem, value, subtract ) { + + // Any relative (+/-) values have already been + // normalized at this point + var matches = rcssNum.exec( value ); + return matches ? + + // Guard against undefined "subtract", e.g., when used as in cssHooks + Math.max( 0, matches[ 2 ] - ( subtract || 0 ) ) + ( matches[ 3 ] || "px" ) : + value; +} + +function boxModelAdjustment( elem, dimension, box, isBorderBox, styles, computedVal ) { + var i = dimension === "width" ? 1 : 0, + extra = 0, + delta = 0; + + // Adjustment may not be necessary + if ( box === ( isBorderBox ? "border" : "content" ) ) { + return 0; + } + + for ( ; i < 4; i += 2 ) { + + // Both box models exclude margin + if ( box === "margin" ) { + delta += jQuery.css( elem, box + cssExpand[ i ], true, styles ); + } + + // If we get here with a content-box, we're seeking "padding" or "border" or "margin" + if ( !isBorderBox ) { + + // Add padding + delta += jQuery.css( elem, "padding" + cssExpand[ i ], true, styles ); + + // For "border" or "margin", add border + if ( box !== "padding" ) { + delta += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); + + // But still keep track of it otherwise + } else { + extra += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); + } + + // If we get here with a border-box (content + padding + border), we're seeking "content" or + // "padding" or "margin" + } else { + + // For "content", subtract padding + if ( box === "content" ) { + delta -= jQuery.css( elem, "padding" + cssExpand[ i ], true, styles ); + } + + // For "content" or "padding", subtract border + if ( box !== "margin" ) { + delta -= jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); + } + } + } + + // Account for positive content-box scroll gutter when requested by providing computedVal + if ( !isBorderBox && computedVal >= 0 ) { + + // offsetWidth/offsetHeight is a rounded sum of content, padding, scroll gutter, and border + // Assuming integer scroll gutter, subtract the rest and round down + delta += Math.max( 0, Math.ceil( + elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] - + computedVal - + delta - + extra - + 0.5 + + // If offsetWidth/offsetHeight is unknown, then we can't determine content-box scroll gutter + // Use an explicit zero to avoid NaN (gh-3964) + ) ) || 0; + } + + return delta; +} + +function getWidthOrHeight( elem, dimension, extra ) { + + // Start with computed style + var styles = getStyles( elem ), + + // To avoid forcing a reflow, only fetch boxSizing if we need it (gh-4322). + // Fake content-box until we know it's needed to know the true value. + boxSizingNeeded = !support.boxSizingReliable() || extra, + isBorderBox = boxSizingNeeded && + jQuery.css( elem, "boxSizing", false, styles ) === "border-box", + valueIsBorderBox = isBorderBox, + + val = curCSS( elem, dimension, styles ), + offsetProp = "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ); + + // Support: Firefox <=54 + // Return a confounding non-pixel value or feign ignorance, as appropriate. + if ( rnumnonpx.test( val ) ) { + if ( !extra ) { + return val; + } + val = "auto"; + } + + + // Support: IE 9 - 11 only + // Use offsetWidth/offsetHeight for when box sizing is unreliable. + // In those cases, the computed value can be trusted to be border-box. + if ( ( !support.boxSizingReliable() && isBorderBox || + + // Support: IE 10 - 11+, Edge 15 - 18+ + // IE/Edge misreport `getComputedStyle` of table rows with width/height + // set in CSS while `offset*` properties report correct values. + // Interestingly, in some cases IE 9 doesn't suffer from this issue. + !support.reliableTrDimensions() && nodeName( elem, "tr" ) || + + // Fall back to offsetWidth/offsetHeight when value is "auto" + // This happens for inline elements with no explicit setting (gh-3571) + val === "auto" || + + // Support: Android <=4.1 - 4.3 only + // Also use offsetWidth/offsetHeight for misreported inline dimensions (gh-3602) + !parseFloat( val ) && jQuery.css( elem, "display", false, styles ) === "inline" ) && + + // Make sure the element is visible & connected + elem.getClientRects().length ) { + + isBorderBox = jQuery.css( elem, "boxSizing", false, styles ) === "border-box"; + + // Where available, offsetWidth/offsetHeight approximate border box dimensions. + // Where not available (e.g., SVG), assume unreliable box-sizing and interpret the + // retrieved value as a content box dimension. + valueIsBorderBox = offsetProp in elem; + if ( valueIsBorderBox ) { + val = elem[ offsetProp ]; + } + } + + // Normalize "" and auto + val = parseFloat( val ) || 0; + + // Adjust for the element's box model + return ( val + + boxModelAdjustment( + elem, + dimension, + extra || ( isBorderBox ? "border" : "content" ), + valueIsBorderBox, + styles, + + // Provide the current computed size to request scroll gutter calculation (gh-3589) + val + ) + ) + "px"; +} + +jQuery.extend( { + + // Add in style property hooks for overriding the default + // behavior of getting and setting a style property + cssHooks: { + opacity: { + get: function( elem, computed ) { + if ( computed ) { + + // We should always get a number back from opacity + var ret = curCSS( elem, "opacity" ); + return ret === "" ? "1" : ret; + } + } + } + }, + + // Don't automatically add "px" to these possibly-unitless properties + cssNumber: { + "animationIterationCount": true, + "columnCount": true, + "fillOpacity": true, + "flexGrow": true, + "flexShrink": true, + "fontWeight": true, + "gridArea": true, + "gridColumn": true, + "gridColumnEnd": true, + "gridColumnStart": true, + "gridRow": true, + "gridRowEnd": true, + "gridRowStart": true, + "lineHeight": true, + "opacity": true, + "order": true, + "orphans": true, + "widows": true, + "zIndex": true, + "zoom": true + }, + + // Add in properties whose names you wish to fix before + // setting or getting the value + cssProps: {}, + + // Get and set the style property on a DOM Node + style: function( elem, name, value, extra ) { + + // Don't set styles on text and comment nodes + if ( !elem || elem.nodeType === 3 || elem.nodeType === 8 || !elem.style ) { + return; + } + + // Make sure that we're working with the right name + var ret, type, hooks, + origName = camelCase( name ), + isCustomProp = rcustomProp.test( name ), + style = elem.style; + + // Make sure that we're working with the right name. We don't + // want to query the value if it is a CSS custom property + // since they are user-defined. + if ( !isCustomProp ) { + name = finalPropName( origName ); + } + + // Gets hook for the prefixed version, then unprefixed version + hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ]; + + // Check if we're setting a value + if ( value !== undefined ) { + type = typeof value; + + // Convert "+=" or "-=" to relative numbers (#7345) + if ( type === "string" && ( ret = rcssNum.exec( value ) ) && ret[ 1 ] ) { + value = adjustCSS( elem, name, ret ); + + // Fixes bug #9237 + type = "number"; + } + + // Make sure that null and NaN values aren't set (#7116) + if ( value == null || value !== value ) { + return; + } + + // If a number was passed in, add the unit (except for certain CSS properties) + // The isCustomProp check can be removed in jQuery 4.0 when we only auto-append + // "px" to a few hardcoded values. + if ( type === "number" && !isCustomProp ) { + value += ret && ret[ 3 ] || ( jQuery.cssNumber[ origName ] ? "" : "px" ); + } + + // background-* props affect original clone's values + if ( !support.clearCloneStyle && value === "" && name.indexOf( "background" ) === 0 ) { + style[ name ] = "inherit"; + } + + // If a hook was provided, use that value, otherwise just set the specified value + if ( !hooks || !( "set" in hooks ) || + ( value = hooks.set( elem, value, extra ) ) !== undefined ) { + + if ( isCustomProp ) { + style.setProperty( name, value ); + } else { + style[ name ] = value; + } + } + + } else { + + // If a hook was provided get the non-computed value from there + if ( hooks && "get" in hooks && + ( ret = hooks.get( elem, false, extra ) ) !== undefined ) { + + return ret; + } + + // Otherwise just get the value from the style object + return style[ name ]; + } + }, + + css: function( elem, name, extra, styles ) { + var val, num, hooks, + origName = camelCase( name ), + isCustomProp = rcustomProp.test( name ); + + // Make sure that we're working with the right name. We don't + // want to modify the value if it is a CSS custom property + // since they are user-defined. + if ( !isCustomProp ) { + name = finalPropName( origName ); + } + + // Try prefixed name followed by the unprefixed name + hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ]; + + // If a hook was provided get the computed value from there + if ( hooks && "get" in hooks ) { + val = hooks.get( elem, true, extra ); + } + + // Otherwise, if a way to get the computed value exists, use that + if ( val === undefined ) { + val = curCSS( elem, name, styles ); + } + + // Convert "normal" to computed value + if ( val === "normal" && name in cssNormalTransform ) { + val = cssNormalTransform[ name ]; + } + + // Make numeric if forced or a qualifier was provided and val looks numeric + if ( extra === "" || extra ) { + num = parseFloat( val ); + return extra === true || isFinite( num ) ? num || 0 : val; + } + + return val; + } +} ); + +jQuery.each( [ "height", "width" ], function( _i, dimension ) { + jQuery.cssHooks[ dimension ] = { + get: function( elem, computed, extra ) { + if ( computed ) { + + // Certain elements can have dimension info if we invisibly show them + // but it must have a current display style that would benefit + return rdisplayswap.test( jQuery.css( elem, "display" ) ) && + + // Support: Safari 8+ + // Table columns in Safari have non-zero offsetWidth & zero + // getBoundingClientRect().width unless display is changed. + // Support: IE <=11 only + // Running getBoundingClientRect on a disconnected node + // in IE throws an error. + ( !elem.getClientRects().length || !elem.getBoundingClientRect().width ) ? + swap( elem, cssShow, function() { + return getWidthOrHeight( elem, dimension, extra ); + } ) : + getWidthOrHeight( elem, dimension, extra ); + } + }, + + set: function( elem, value, extra ) { + var matches, + styles = getStyles( elem ), + + // Only read styles.position if the test has a chance to fail + // to avoid forcing a reflow. + scrollboxSizeBuggy = !support.scrollboxSize() && + styles.position === "absolute", + + // To avoid forcing a reflow, only fetch boxSizing if we need it (gh-3991) + boxSizingNeeded = scrollboxSizeBuggy || extra, + isBorderBox = boxSizingNeeded && + jQuery.css( elem, "boxSizing", false, styles ) === "border-box", + subtract = extra ? + boxModelAdjustment( + elem, + dimension, + extra, + isBorderBox, + styles + ) : + 0; + + // Account for unreliable border-box dimensions by comparing offset* to computed and + // faking a content-box to get border and padding (gh-3699) + if ( isBorderBox && scrollboxSizeBuggy ) { + subtract -= Math.ceil( + elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] - + parseFloat( styles[ dimension ] ) - + boxModelAdjustment( elem, dimension, "border", false, styles ) - + 0.5 + ); + } + + // Convert to pixels if value adjustment is needed + if ( subtract && ( matches = rcssNum.exec( value ) ) && + ( matches[ 3 ] || "px" ) !== "px" ) { + + elem.style[ dimension ] = value; + value = jQuery.css( elem, dimension ); + } + + return setPositiveNumber( elem, value, subtract ); + } + }; +} ); + +jQuery.cssHooks.marginLeft = addGetHookIf( support.reliableMarginLeft, + function( elem, computed ) { + if ( computed ) { + return ( parseFloat( curCSS( elem, "marginLeft" ) ) || + elem.getBoundingClientRect().left - + swap( elem, { marginLeft: 0 }, function() { + return elem.getBoundingClientRect().left; + } ) + ) + "px"; + } + } +); + +// These hooks are used by animate to expand properties +jQuery.each( { + margin: "", + padding: "", + border: "Width" +}, function( prefix, suffix ) { + jQuery.cssHooks[ prefix + suffix ] = { + expand: function( value ) { + var i = 0, + expanded = {}, + + // Assumes a single number if not a string + parts = typeof value === "string" ? value.split( " " ) : [ value ]; + + for ( ; i < 4; i++ ) { + expanded[ prefix + cssExpand[ i ] + suffix ] = + parts[ i ] || parts[ i - 2 ] || parts[ 0 ]; + } + + return expanded; + } + }; + + if ( prefix !== "margin" ) { + jQuery.cssHooks[ prefix + suffix ].set = setPositiveNumber; + } +} ); + +jQuery.fn.extend( { + css: function( name, value ) { + return access( this, function( elem, name, value ) { + var styles, len, + map = {}, + i = 0; + + if ( Array.isArray( name ) ) { + styles = getStyles( elem ); + len = name.length; + + for ( ; i < len; i++ ) { + map[ name[ i ] ] = jQuery.css( elem, name[ i ], false, styles ); + } + + return map; + } + + return value !== undefined ? + jQuery.style( elem, name, value ) : + jQuery.css( elem, name ); + }, name, value, arguments.length > 1 ); + } +} ); + + +function Tween( elem, options, prop, end, easing ) { + return new Tween.prototype.init( elem, options, prop, end, easing ); +} +jQuery.Tween = Tween; + +Tween.prototype = { + constructor: Tween, + init: function( elem, options, prop, end, easing, unit ) { + this.elem = elem; + this.prop = prop; + this.easing = easing || jQuery.easing._default; + this.options = options; + this.start = this.now = this.cur(); + this.end = end; + this.unit = unit || ( jQuery.cssNumber[ prop ] ? "" : "px" ); + }, + cur: function() { + var hooks = Tween.propHooks[ this.prop ]; + + return hooks && hooks.get ? + hooks.get( this ) : + Tween.propHooks._default.get( this ); + }, + run: function( percent ) { + var eased, + hooks = Tween.propHooks[ this.prop ]; + + if ( this.options.duration ) { + this.pos = eased = jQuery.easing[ this.easing ]( + percent, this.options.duration * percent, 0, 1, this.options.duration + ); + } else { + this.pos = eased = percent; + } + this.now = ( this.end - this.start ) * eased + this.start; + + if ( this.options.step ) { + this.options.step.call( this.elem, this.now, this ); + } + + if ( hooks && hooks.set ) { + hooks.set( this ); + } else { + Tween.propHooks._default.set( this ); + } + return this; + } +}; + +Tween.prototype.init.prototype = Tween.prototype; + +Tween.propHooks = { + _default: { + get: function( tween ) { + var result; + + // Use a property on the element directly when it is not a DOM element, + // or when there is no matching style property that exists. + if ( tween.elem.nodeType !== 1 || + tween.elem[ tween.prop ] != null && tween.elem.style[ tween.prop ] == null ) { + return tween.elem[ tween.prop ]; + } + + // Passing an empty string as a 3rd parameter to .css will automatically + // attempt a parseFloat and fallback to a string if the parse fails. + // Simple values such as "10px" are parsed to Float; + // complex values such as "rotate(1rad)" are returned as-is. + result = jQuery.css( tween.elem, tween.prop, "" ); + + // Empty strings, null, undefined and "auto" are converted to 0. + return !result || result === "auto" ? 0 : result; + }, + set: function( tween ) { + + // Use step hook for back compat. + // Use cssHook if its there. + // Use .style if available and use plain properties where available. + if ( jQuery.fx.step[ tween.prop ] ) { + jQuery.fx.step[ tween.prop ]( tween ); + } else if ( tween.elem.nodeType === 1 && ( + jQuery.cssHooks[ tween.prop ] || + tween.elem.style[ finalPropName( tween.prop ) ] != null ) ) { + jQuery.style( tween.elem, tween.prop, tween.now + tween.unit ); + } else { + tween.elem[ tween.prop ] = tween.now; + } + } + } +}; + +// Support: IE <=9 only +// Panic based approach to setting things on disconnected nodes +Tween.propHooks.scrollTop = Tween.propHooks.scrollLeft = { + set: function( tween ) { + if ( tween.elem.nodeType && tween.elem.parentNode ) { + tween.elem[ tween.prop ] = tween.now; + } + } +}; + +jQuery.easing = { + linear: function( p ) { + return p; + }, + swing: function( p ) { + return 0.5 - Math.cos( p * Math.PI ) / 2; + }, + _default: "swing" +}; + +jQuery.fx = Tween.prototype.init; + +// Back compat <1.8 extension point +jQuery.fx.step = {}; + + + + +var + fxNow, inProgress, + rfxtypes = /^(?:toggle|show|hide)$/, + rrun = /queueHooks$/; + +function schedule() { + if ( inProgress ) { + if ( document.hidden === false && window.requestAnimationFrame ) { + window.requestAnimationFrame( schedule ); + } else { + window.setTimeout( schedule, jQuery.fx.interval ); + } + + jQuery.fx.tick(); + } +} + +// Animations created synchronously will run synchronously +function createFxNow() { + window.setTimeout( function() { + fxNow = undefined; + } ); + return ( fxNow = Date.now() ); +} + +// Generate parameters to create a standard animation +function genFx( type, includeWidth ) { + var which, + i = 0, + attrs = { height: type }; + + // If we include width, step value is 1 to do all cssExpand values, + // otherwise step value is 2 to skip over Left and Right + includeWidth = includeWidth ? 1 : 0; + for ( ; i < 4; i += 2 - includeWidth ) { + which = cssExpand[ i ]; + attrs[ "margin" + which ] = attrs[ "padding" + which ] = type; + } + + if ( includeWidth ) { + attrs.opacity = attrs.width = type; + } + + return attrs; +} + +function createTween( value, prop, animation ) { + var tween, + collection = ( Animation.tweeners[ prop ] || [] ).concat( Animation.tweeners[ "*" ] ), + index = 0, + length = collection.length; + for ( ; index < length; index++ ) { + if ( ( tween = collection[ index ].call( animation, prop, value ) ) ) { + + // We're done with this property + return tween; + } + } +} + +function defaultPrefilter( elem, props, opts ) { + var prop, value, toggle, hooks, oldfire, propTween, restoreDisplay, display, + isBox = "width" in props || "height" in props, + anim = this, + orig = {}, + style = elem.style, + hidden = elem.nodeType && isHiddenWithinTree( elem ), + dataShow = dataPriv.get( elem, "fxshow" ); + + // Queue-skipping animations hijack the fx hooks + if ( !opts.queue ) { + hooks = jQuery._queueHooks( elem, "fx" ); + if ( hooks.unqueued == null ) { + hooks.unqueued = 0; + oldfire = hooks.empty.fire; + hooks.empty.fire = function() { + if ( !hooks.unqueued ) { + oldfire(); + } + }; + } + hooks.unqueued++; + + anim.always( function() { + + // Ensure the complete handler is called before this completes + anim.always( function() { + hooks.unqueued--; + if ( !jQuery.queue( elem, "fx" ).length ) { + hooks.empty.fire(); + } + } ); + } ); + } + + // Detect show/hide animations + for ( prop in props ) { + value = props[ prop ]; + if ( rfxtypes.test( value ) ) { + delete props[ prop ]; + toggle = toggle || value === "toggle"; + if ( value === ( hidden ? "hide" : "show" ) ) { + + // Pretend to be hidden if this is a "show" and + // there is still data from a stopped show/hide + if ( value === "show" && dataShow && dataShow[ prop ] !== undefined ) { + hidden = true; + + // Ignore all other no-op show/hide data + } else { + continue; + } + } + orig[ prop ] = dataShow && dataShow[ prop ] || jQuery.style( elem, prop ); + } + } + + // Bail out if this is a no-op like .hide().hide() + propTween = !jQuery.isEmptyObject( props ); + if ( !propTween && jQuery.isEmptyObject( orig ) ) { + return; + } + + // Restrict "overflow" and "display" styles during box animations + if ( isBox && elem.nodeType === 1 ) { + + // Support: IE <=9 - 11, Edge 12 - 15 + // Record all 3 overflow attributes because IE does not infer the shorthand + // from identically-valued overflowX and overflowY and Edge just mirrors + // the overflowX value there. + opts.overflow = [ style.overflow, style.overflowX, style.overflowY ]; + + // Identify a display type, preferring old show/hide data over the CSS cascade + restoreDisplay = dataShow && dataShow.display; + if ( restoreDisplay == null ) { + restoreDisplay = dataPriv.get( elem, "display" ); + } + display = jQuery.css( elem, "display" ); + if ( display === "none" ) { + if ( restoreDisplay ) { + display = restoreDisplay; + } else { + + // Get nonempty value(s) by temporarily forcing visibility + showHide( [ elem ], true ); + restoreDisplay = elem.style.display || restoreDisplay; + display = jQuery.css( elem, "display" ); + showHide( [ elem ] ); + } + } + + // Animate inline elements as inline-block + if ( display === "inline" || display === "inline-block" && restoreDisplay != null ) { + if ( jQuery.css( elem, "float" ) === "none" ) { + + // Restore the original display value at the end of pure show/hide animations + if ( !propTween ) { + anim.done( function() { + style.display = restoreDisplay; + } ); + if ( restoreDisplay == null ) { + display = style.display; + restoreDisplay = display === "none" ? "" : display; + } + } + style.display = "inline-block"; + } + } + } + + if ( opts.overflow ) { + style.overflow = "hidden"; + anim.always( function() { + style.overflow = opts.overflow[ 0 ]; + style.overflowX = opts.overflow[ 1 ]; + style.overflowY = opts.overflow[ 2 ]; + } ); + } + + // Implement show/hide animations + propTween = false; + for ( prop in orig ) { + + // General show/hide setup for this element animation + if ( !propTween ) { + if ( dataShow ) { + if ( "hidden" in dataShow ) { + hidden = dataShow.hidden; + } + } else { + dataShow = dataPriv.access( elem, "fxshow", { display: restoreDisplay } ); + } + + // Store hidden/visible for toggle so `.stop().toggle()` "reverses" + if ( toggle ) { + dataShow.hidden = !hidden; + } + + // Show elements before animating them + if ( hidden ) { + showHide( [ elem ], true ); + } + + /* eslint-disable no-loop-func */ + + anim.done( function() { + + /* eslint-enable no-loop-func */ + + // The final step of a "hide" animation is actually hiding the element + if ( !hidden ) { + showHide( [ elem ] ); + } + dataPriv.remove( elem, "fxshow" ); + for ( prop in orig ) { + jQuery.style( elem, prop, orig[ prop ] ); + } + } ); + } + + // Per-property setup + propTween = createTween( hidden ? dataShow[ prop ] : 0, prop, anim ); + if ( !( prop in dataShow ) ) { + dataShow[ prop ] = propTween.start; + if ( hidden ) { + propTween.end = propTween.start; + propTween.start = 0; + } + } + } +} + +function propFilter( props, specialEasing ) { + var index, name, easing, value, hooks; + + // camelCase, specialEasing and expand cssHook pass + for ( index in props ) { + name = camelCase( index ); + easing = specialEasing[ name ]; + value = props[ index ]; + if ( Array.isArray( value ) ) { + easing = value[ 1 ]; + value = props[ index ] = value[ 0 ]; + } + + if ( index !== name ) { + props[ name ] = value; + delete props[ index ]; + } + + hooks = jQuery.cssHooks[ name ]; + if ( hooks && "expand" in hooks ) { + value = hooks.expand( value ); + delete props[ name ]; + + // Not quite $.extend, this won't overwrite existing keys. + // Reusing 'index' because we have the correct "name" + for ( index in value ) { + if ( !( index in props ) ) { + props[ index ] = value[ index ]; + specialEasing[ index ] = easing; + } + } + } else { + specialEasing[ name ] = easing; + } + } +} + +function Animation( elem, properties, options ) { + var result, + stopped, + index = 0, + length = Animation.prefilters.length, + deferred = jQuery.Deferred().always( function() { + + // Don't match elem in the :animated selector + delete tick.elem; + } ), + tick = function() { + if ( stopped ) { + return false; + } + var currentTime = fxNow || createFxNow(), + remaining = Math.max( 0, animation.startTime + animation.duration - currentTime ), + + // Support: Android 2.3 only + // Archaic crash bug won't allow us to use `1 - ( 0.5 || 0 )` (#12497) + temp = remaining / animation.duration || 0, + percent = 1 - temp, + index = 0, + length = animation.tweens.length; + + for ( ; index < length; index++ ) { + animation.tweens[ index ].run( percent ); + } + + deferred.notifyWith( elem, [ animation, percent, remaining ] ); + + // If there's more to do, yield + if ( percent < 1 && length ) { + return remaining; + } + + // If this was an empty animation, synthesize a final progress notification + if ( !length ) { + deferred.notifyWith( elem, [ animation, 1, 0 ] ); + } + + // Resolve the animation and report its conclusion + deferred.resolveWith( elem, [ animation ] ); + return false; + }, + animation = deferred.promise( { + elem: elem, + props: jQuery.extend( {}, properties ), + opts: jQuery.extend( true, { + specialEasing: {}, + easing: jQuery.easing._default + }, options ), + originalProperties: properties, + originalOptions: options, + startTime: fxNow || createFxNow(), + duration: options.duration, + tweens: [], + createTween: function( prop, end ) { + var tween = jQuery.Tween( elem, animation.opts, prop, end, + animation.opts.specialEasing[ prop ] || animation.opts.easing ); + animation.tweens.push( tween ); + return tween; + }, + stop: function( gotoEnd ) { + var index = 0, + + // If we are going to the end, we want to run all the tweens + // otherwise we skip this part + length = gotoEnd ? animation.tweens.length : 0; + if ( stopped ) { + return this; + } + stopped = true; + for ( ; index < length; index++ ) { + animation.tweens[ index ].run( 1 ); + } + + // Resolve when we played the last frame; otherwise, reject + if ( gotoEnd ) { + deferred.notifyWith( elem, [ animation, 1, 0 ] ); + deferred.resolveWith( elem, [ animation, gotoEnd ] ); + } else { + deferred.rejectWith( elem, [ animation, gotoEnd ] ); + } + return this; + } + } ), + props = animation.props; + + propFilter( props, animation.opts.specialEasing ); + + for ( ; index < length; index++ ) { + result = Animation.prefilters[ index ].call( animation, elem, props, animation.opts ); + if ( result ) { + if ( isFunction( result.stop ) ) { + jQuery._queueHooks( animation.elem, animation.opts.queue ).stop = + result.stop.bind( result ); + } + return result; + } + } + + jQuery.map( props, createTween, animation ); + + if ( isFunction( animation.opts.start ) ) { + animation.opts.start.call( elem, animation ); + } + + // Attach callbacks from options + animation + .progress( animation.opts.progress ) + .done( animation.opts.done, animation.opts.complete ) + .fail( animation.opts.fail ) + .always( animation.opts.always ); + + jQuery.fx.timer( + jQuery.extend( tick, { + elem: elem, + anim: animation, + queue: animation.opts.queue + } ) + ); + + return animation; +} + +jQuery.Animation = jQuery.extend( Animation, { + + tweeners: { + "*": [ function( prop, value ) { + var tween = this.createTween( prop, value ); + adjustCSS( tween.elem, prop, rcssNum.exec( value ), tween ); + return tween; + } ] + }, + + tweener: function( props, callback ) { + if ( isFunction( props ) ) { + callback = props; + props = [ "*" ]; + } else { + props = props.match( rnothtmlwhite ); + } + + var prop, + index = 0, + length = props.length; + + for ( ; index < length; index++ ) { + prop = props[ index ]; + Animation.tweeners[ prop ] = Animation.tweeners[ prop ] || []; + Animation.tweeners[ prop ].unshift( callback ); + } + }, + + prefilters: [ defaultPrefilter ], + + prefilter: function( callback, prepend ) { + if ( prepend ) { + Animation.prefilters.unshift( callback ); + } else { + Animation.prefilters.push( callback ); + } + } +} ); + +jQuery.speed = function( speed, easing, fn ) { + var opt = speed && typeof speed === "object" ? jQuery.extend( {}, speed ) : { + complete: fn || !fn && easing || + isFunction( speed ) && speed, + duration: speed, + easing: fn && easing || easing && !isFunction( easing ) && easing + }; + + // Go to the end state if fx are off + if ( jQuery.fx.off ) { + opt.duration = 0; + + } else { + if ( typeof opt.duration !== "number" ) { + if ( opt.duration in jQuery.fx.speeds ) { + opt.duration = jQuery.fx.speeds[ opt.duration ]; + + } else { + opt.duration = jQuery.fx.speeds._default; + } + } + } + + // Normalize opt.queue - true/undefined/null -> "fx" + if ( opt.queue == null || opt.queue === true ) { + opt.queue = "fx"; + } + + // Queueing + opt.old = opt.complete; + + opt.complete = function() { + if ( isFunction( opt.old ) ) { + opt.old.call( this ); + } + + if ( opt.queue ) { + jQuery.dequeue( this, opt.queue ); + } + }; + + return opt; +}; + +jQuery.fn.extend( { + fadeTo: function( speed, to, easing, callback ) { + + // Show any hidden elements after setting opacity to 0 + return this.filter( isHiddenWithinTree ).css( "opacity", 0 ).show() + + // Animate to the value specified + .end().animate( { opacity: to }, speed, easing, callback ); + }, + animate: function( prop, speed, easing, callback ) { + var empty = jQuery.isEmptyObject( prop ), + optall = jQuery.speed( speed, easing, callback ), + doAnimation = function() { + + // Operate on a copy of prop so per-property easing won't be lost + var anim = Animation( this, jQuery.extend( {}, prop ), optall ); + + // Empty animations, or finishing resolves immediately + if ( empty || dataPriv.get( this, "finish" ) ) { + anim.stop( true ); + } + }; + doAnimation.finish = doAnimation; + + return empty || optall.queue === false ? + this.each( doAnimation ) : + this.queue( optall.queue, doAnimation ); + }, + stop: function( type, clearQueue, gotoEnd ) { + var stopQueue = function( hooks ) { + var stop = hooks.stop; + delete hooks.stop; + stop( gotoEnd ); + }; + + if ( typeof type !== "string" ) { + gotoEnd = clearQueue; + clearQueue = type; + type = undefined; + } + if ( clearQueue ) { + this.queue( type || "fx", [] ); + } + + return this.each( function() { + var dequeue = true, + index = type != null && type + "queueHooks", + timers = jQuery.timers, + data = dataPriv.get( this ); + + if ( index ) { + if ( data[ index ] && data[ index ].stop ) { + stopQueue( data[ index ] ); + } + } else { + for ( index in data ) { + if ( data[ index ] && data[ index ].stop && rrun.test( index ) ) { + stopQueue( data[ index ] ); + } + } + } + + for ( index = timers.length; index--; ) { + if ( timers[ index ].elem === this && + ( type == null || timers[ index ].queue === type ) ) { + + timers[ index ].anim.stop( gotoEnd ); + dequeue = false; + timers.splice( index, 1 ); + } + } + + // Start the next in the queue if the last step wasn't forced. + // Timers currently will call their complete callbacks, which + // will dequeue but only if they were gotoEnd. + if ( dequeue || !gotoEnd ) { + jQuery.dequeue( this, type ); + } + } ); + }, + finish: function( type ) { + if ( type !== false ) { + type = type || "fx"; + } + return this.each( function() { + var index, + data = dataPriv.get( this ), + queue = data[ type + "queue" ], + hooks = data[ type + "queueHooks" ], + timers = jQuery.timers, + length = queue ? queue.length : 0; + + // Enable finishing flag on private data + data.finish = true; + + // Empty the queue first + jQuery.queue( this, type, [] ); + + if ( hooks && hooks.stop ) { + hooks.stop.call( this, true ); + } + + // Look for any active animations, and finish them + for ( index = timers.length; index--; ) { + if ( timers[ index ].elem === this && timers[ index ].queue === type ) { + timers[ index ].anim.stop( true ); + timers.splice( index, 1 ); + } + } + + // Look for any animations in the old queue and finish them + for ( index = 0; index < length; index++ ) { + if ( queue[ index ] && queue[ index ].finish ) { + queue[ index ].finish.call( this ); + } + } + + // Turn off finishing flag + delete data.finish; + } ); + } +} ); + +jQuery.each( [ "toggle", "show", "hide" ], function( _i, name ) { + var cssFn = jQuery.fn[ name ]; + jQuery.fn[ name ] = function( speed, easing, callback ) { + return speed == null || typeof speed === "boolean" ? + cssFn.apply( this, arguments ) : + this.animate( genFx( name, true ), speed, easing, callback ); + }; +} ); + +// Generate shortcuts for custom animations +jQuery.each( { + slideDown: genFx( "show" ), + slideUp: genFx( "hide" ), + slideToggle: genFx( "toggle" ), + fadeIn: { opacity: "show" }, + fadeOut: { opacity: "hide" }, + fadeToggle: { opacity: "toggle" } +}, function( name, props ) { + jQuery.fn[ name ] = function( speed, easing, callback ) { + return this.animate( props, speed, easing, callback ); + }; +} ); + +jQuery.timers = []; +jQuery.fx.tick = function() { + var timer, + i = 0, + timers = jQuery.timers; + + fxNow = Date.now(); + + for ( ; i < timers.length; i++ ) { + timer = timers[ i ]; + + // Run the timer and safely remove it when done (allowing for external removal) + if ( !timer() && timers[ i ] === timer ) { + timers.splice( i--, 1 ); + } + } + + if ( !timers.length ) { + jQuery.fx.stop(); + } + fxNow = undefined; +}; + +jQuery.fx.timer = function( timer ) { + jQuery.timers.push( timer ); + jQuery.fx.start(); +}; + +jQuery.fx.interval = 13; +jQuery.fx.start = function() { + if ( inProgress ) { + return; + } + + inProgress = true; + schedule(); +}; + +jQuery.fx.stop = function() { + inProgress = null; +}; + +jQuery.fx.speeds = { + slow: 600, + fast: 200, + + // Default speed + _default: 400 +}; + + +// Based off of the plugin by Clint Helfers, with permission. +// https://web.archive.org/web/20100324014747/http://blindsignals.com/index.php/2009/07/jquery-delay/ +jQuery.fn.delay = function( time, type ) { + time = jQuery.fx ? jQuery.fx.speeds[ time ] || time : time; + type = type || "fx"; + + return this.queue( type, function( next, hooks ) { + var timeout = window.setTimeout( next, time ); + hooks.stop = function() { + window.clearTimeout( timeout ); + }; + } ); +}; + + +( function() { + var input = document.createElement( "input" ), + select = document.createElement( "select" ), + opt = select.appendChild( document.createElement( "option" ) ); + + input.type = "checkbox"; + + // Support: Android <=4.3 only + // Default value for a checkbox should be "on" + support.checkOn = input.value !== ""; + + // Support: IE <=11 only + // Must access selectedIndex to make default options select + support.optSelected = opt.selected; + + // Support: IE <=11 only + // An input loses its value after becoming a radio + input = document.createElement( "input" ); + input.value = "t"; + input.type = "radio"; + support.radioValue = input.value === "t"; +} )(); + + +var boolHook, + attrHandle = jQuery.expr.attrHandle; + +jQuery.fn.extend( { + attr: function( name, value ) { + return access( this, jQuery.attr, name, value, arguments.length > 1 ); + }, + + removeAttr: function( name ) { + return this.each( function() { + jQuery.removeAttr( this, name ); + } ); + } +} ); + +jQuery.extend( { + attr: function( elem, name, value ) { + var ret, hooks, + nType = elem.nodeType; + + // Don't get/set attributes on text, comment and attribute nodes + if ( nType === 3 || nType === 8 || nType === 2 ) { + return; + } + + // Fallback to prop when attributes are not supported + if ( typeof elem.getAttribute === "undefined" ) { + return jQuery.prop( elem, name, value ); + } + + // Attribute hooks are determined by the lowercase version + // Grab necessary hook if one is defined + if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) { + hooks = jQuery.attrHooks[ name.toLowerCase() ] || + ( jQuery.expr.match.bool.test( name ) ? boolHook : undefined ); + } + + if ( value !== undefined ) { + if ( value === null ) { + jQuery.removeAttr( elem, name ); + return; + } + + if ( hooks && "set" in hooks && + ( ret = hooks.set( elem, value, name ) ) !== undefined ) { + return ret; + } + + elem.setAttribute( name, value + "" ); + return value; + } + + if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) { + return ret; + } + + ret = jQuery.find.attr( elem, name ); + + // Non-existent attributes return null, we normalize to undefined + return ret == null ? undefined : ret; + }, + + attrHooks: { + type: { + set: function( elem, value ) { + if ( !support.radioValue && value === "radio" && + nodeName( elem, "input" ) ) { + var val = elem.value; + elem.setAttribute( "type", value ); + if ( val ) { + elem.value = val; + } + return value; + } + } + } + }, + + removeAttr: function( elem, value ) { + var name, + i = 0, + + // Attribute names can contain non-HTML whitespace characters + // https://html.spec.whatwg.org/multipage/syntax.html#attributes-2 + attrNames = value && value.match( rnothtmlwhite ); + + if ( attrNames && elem.nodeType === 1 ) { + while ( ( name = attrNames[ i++ ] ) ) { + elem.removeAttribute( name ); + } + } + } +} ); + +// Hooks for boolean attributes +boolHook = { + set: function( elem, value, name ) { + if ( value === false ) { + + // Remove boolean attributes when set to false + jQuery.removeAttr( elem, name ); + } else { + elem.setAttribute( name, name ); + } + return name; + } +}; + +jQuery.each( jQuery.expr.match.bool.source.match( /\w+/g ), function( _i, name ) { + var getter = attrHandle[ name ] || jQuery.find.attr; + + attrHandle[ name ] = function( elem, name, isXML ) { + var ret, handle, + lowercaseName = name.toLowerCase(); + + if ( !isXML ) { + + // Avoid an infinite loop by temporarily removing this function from the getter + handle = attrHandle[ lowercaseName ]; + attrHandle[ lowercaseName ] = ret; + ret = getter( elem, name, isXML ) != null ? + lowercaseName : + null; + attrHandle[ lowercaseName ] = handle; + } + return ret; + }; +} ); + + + + +var rfocusable = /^(?:input|select|textarea|button)$/i, + rclickable = /^(?:a|area)$/i; + +jQuery.fn.extend( { + prop: function( name, value ) { + return access( this, jQuery.prop, name, value, arguments.length > 1 ); + }, + + removeProp: function( name ) { + return this.each( function() { + delete this[ jQuery.propFix[ name ] || name ]; + } ); + } +} ); + +jQuery.extend( { + prop: function( elem, name, value ) { + var ret, hooks, + nType = elem.nodeType; + + // Don't get/set properties on text, comment and attribute nodes + if ( nType === 3 || nType === 8 || nType === 2 ) { + return; + } + + if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) { + + // Fix name and attach hooks + name = jQuery.propFix[ name ] || name; + hooks = jQuery.propHooks[ name ]; + } + + if ( value !== undefined ) { + if ( hooks && "set" in hooks && + ( ret = hooks.set( elem, value, name ) ) !== undefined ) { + return ret; + } + + return ( elem[ name ] = value ); + } + + if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) { + return ret; + } + + return elem[ name ]; + }, + + propHooks: { + tabIndex: { + get: function( elem ) { + + // Support: IE <=9 - 11 only + // elem.tabIndex doesn't always return the + // correct value when it hasn't been explicitly set + // https://web.archive.org/web/20141116233347/http://fluidproject.org/blog/2008/01/09/getting-setting-and-removing-tabindex-values-with-javascript/ + // Use proper attribute retrieval(#12072) + var tabindex = jQuery.find.attr( elem, "tabindex" ); + + if ( tabindex ) { + return parseInt( tabindex, 10 ); + } + + if ( + rfocusable.test( elem.nodeName ) || + rclickable.test( elem.nodeName ) && + elem.href + ) { + return 0; + } + + return -1; + } + } + }, + + propFix: { + "for": "htmlFor", + "class": "className" + } +} ); + +// Support: IE <=11 only +// Accessing the selectedIndex property +// forces the browser to respect setting selected +// on the option +// The getter ensures a default option is selected +// when in an optgroup +// eslint rule "no-unused-expressions" is disabled for this code +// since it considers such accessions noop +if ( !support.optSelected ) { + jQuery.propHooks.selected = { + get: function( elem ) { + + /* eslint no-unused-expressions: "off" */ + + var parent = elem.parentNode; + if ( parent && parent.parentNode ) { + parent.parentNode.selectedIndex; + } + return null; + }, + set: function( elem ) { + + /* eslint no-unused-expressions: "off" */ + + var parent = elem.parentNode; + if ( parent ) { + parent.selectedIndex; + + if ( parent.parentNode ) { + parent.parentNode.selectedIndex; + } + } + } + }; +} + +jQuery.each( [ + "tabIndex", + "readOnly", + "maxLength", + "cellSpacing", + "cellPadding", + "rowSpan", + "colSpan", + "useMap", + "frameBorder", + "contentEditable" +], function() { + jQuery.propFix[ this.toLowerCase() ] = this; +} ); + + + + + // Strip and collapse whitespace according to HTML spec + // https://infra.spec.whatwg.org/#strip-and-collapse-ascii-whitespace + function stripAndCollapse( value ) { + var tokens = value.match( rnothtmlwhite ) || []; + return tokens.join( " " ); + } + + +function getClass( elem ) { + return elem.getAttribute && elem.getAttribute( "class" ) || ""; +} + +function classesToArray( value ) { + if ( Array.isArray( value ) ) { + return value; + } + if ( typeof value === "string" ) { + return value.match( rnothtmlwhite ) || []; + } + return []; +} + +jQuery.fn.extend( { + addClass: function( value ) { + var classes, elem, cur, curValue, clazz, j, finalValue, + i = 0; + + if ( isFunction( value ) ) { + return this.each( function( j ) { + jQuery( this ).addClass( value.call( this, j, getClass( this ) ) ); + } ); + } + + classes = classesToArray( value ); + + if ( classes.length ) { + while ( ( elem = this[ i++ ] ) ) { + curValue = getClass( elem ); + cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " ); + + if ( cur ) { + j = 0; + while ( ( clazz = classes[ j++ ] ) ) { + if ( cur.indexOf( " " + clazz + " " ) < 0 ) { + cur += clazz + " "; + } + } + + // Only assign if different to avoid unneeded rendering. + finalValue = stripAndCollapse( cur ); + if ( curValue !== finalValue ) { + elem.setAttribute( "class", finalValue ); + } + } + } + } + + return this; + }, + + removeClass: function( value ) { + var classes, elem, cur, curValue, clazz, j, finalValue, + i = 0; + + if ( isFunction( value ) ) { + return this.each( function( j ) { + jQuery( this ).removeClass( value.call( this, j, getClass( this ) ) ); + } ); + } + + if ( !arguments.length ) { + return this.attr( "class", "" ); + } + + classes = classesToArray( value ); + + if ( classes.length ) { + while ( ( elem = this[ i++ ] ) ) { + curValue = getClass( elem ); + + // This expression is here for better compressibility (see addClass) + cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " ); + + if ( cur ) { + j = 0; + while ( ( clazz = classes[ j++ ] ) ) { + + // Remove *all* instances + while ( cur.indexOf( " " + clazz + " " ) > -1 ) { + cur = cur.replace( " " + clazz + " ", " " ); + } + } + + // Only assign if different to avoid unneeded rendering. + finalValue = stripAndCollapse( cur ); + if ( curValue !== finalValue ) { + elem.setAttribute( "class", finalValue ); + } + } + } + } + + return this; + }, + + toggleClass: function( value, stateVal ) { + var type = typeof value, + isValidValue = type === "string" || Array.isArray( value ); + + if ( typeof stateVal === "boolean" && isValidValue ) { + return stateVal ? this.addClass( value ) : this.removeClass( value ); + } + + if ( isFunction( value ) ) { + return this.each( function( i ) { + jQuery( this ).toggleClass( + value.call( this, i, getClass( this ), stateVal ), + stateVal + ); + } ); + } + + return this.each( function() { + var className, i, self, classNames; + + if ( isValidValue ) { + + // Toggle individual class names + i = 0; + self = jQuery( this ); + classNames = classesToArray( value ); + + while ( ( className = classNames[ i++ ] ) ) { + + // Check each className given, space separated list + if ( self.hasClass( className ) ) { + self.removeClass( className ); + } else { + self.addClass( className ); + } + } + + // Toggle whole class name + } else if ( value === undefined || type === "boolean" ) { + className = getClass( this ); + if ( className ) { + + // Store className if set + dataPriv.set( this, "__className__", className ); + } + + // If the element has a class name or if we're passed `false`, + // then remove the whole classname (if there was one, the above saved it). + // Otherwise bring back whatever was previously saved (if anything), + // falling back to the empty string if nothing was stored. + if ( this.setAttribute ) { + this.setAttribute( "class", + className || value === false ? + "" : + dataPriv.get( this, "__className__" ) || "" + ); + } + } + } ); + }, + + hasClass: function( selector ) { + var className, elem, + i = 0; + + className = " " + selector + " "; + while ( ( elem = this[ i++ ] ) ) { + if ( elem.nodeType === 1 && + ( " " + stripAndCollapse( getClass( elem ) ) + " " ).indexOf( className ) > -1 ) { + return true; + } + } + + return false; + } +} ); + + + + +var rreturn = /\r/g; + +jQuery.fn.extend( { + val: function( value ) { + var hooks, ret, valueIsFunction, + elem = this[ 0 ]; + + if ( !arguments.length ) { + if ( elem ) { + hooks = jQuery.valHooks[ elem.type ] || + jQuery.valHooks[ elem.nodeName.toLowerCase() ]; + + if ( hooks && + "get" in hooks && + ( ret = hooks.get( elem, "value" ) ) !== undefined + ) { + return ret; + } + + ret = elem.value; + + // Handle most common string cases + if ( typeof ret === "string" ) { + return ret.replace( rreturn, "" ); + } + + // Handle cases where value is null/undef or number + return ret == null ? "" : ret; + } + + return; + } + + valueIsFunction = isFunction( value ); + + return this.each( function( i ) { + var val; + + if ( this.nodeType !== 1 ) { + return; + } + + if ( valueIsFunction ) { + val = value.call( this, i, jQuery( this ).val() ); + } else { + val = value; + } + + // Treat null/undefined as ""; convert numbers to string + if ( val == null ) { + val = ""; + + } else if ( typeof val === "number" ) { + val += ""; + + } else if ( Array.isArray( val ) ) { + val = jQuery.map( val, function( value ) { + return value == null ? "" : value + ""; + } ); + } + + hooks = jQuery.valHooks[ this.type ] || jQuery.valHooks[ this.nodeName.toLowerCase() ]; + + // If set returns undefined, fall back to normal setting + if ( !hooks || !( "set" in hooks ) || hooks.set( this, val, "value" ) === undefined ) { + this.value = val; + } + } ); + } +} ); + +jQuery.extend( { + valHooks: { + option: { + get: function( elem ) { + + var val = jQuery.find.attr( elem, "value" ); + return val != null ? + val : + + // Support: IE <=10 - 11 only + // option.text throws exceptions (#14686, #14858) + // Strip and collapse whitespace + // https://html.spec.whatwg.org/#strip-and-collapse-whitespace + stripAndCollapse( jQuery.text( elem ) ); + } + }, + select: { + get: function( elem ) { + var value, option, i, + options = elem.options, + index = elem.selectedIndex, + one = elem.type === "select-one", + values = one ? null : [], + max = one ? index + 1 : options.length; + + if ( index < 0 ) { + i = max; + + } else { + i = one ? index : 0; + } + + // Loop through all the selected options + for ( ; i < max; i++ ) { + option = options[ i ]; + + // Support: IE <=9 only + // IE8-9 doesn't update selected after form reset (#2551) + if ( ( option.selected || i === index ) && + + // Don't return options that are disabled or in a disabled optgroup + !option.disabled && + ( !option.parentNode.disabled || + !nodeName( option.parentNode, "optgroup" ) ) ) { + + // Get the specific value for the option + value = jQuery( option ).val(); + + // We don't need an array for one selects + if ( one ) { + return value; + } + + // Multi-Selects return an array + values.push( value ); + } + } + + return values; + }, + + set: function( elem, value ) { + var optionSet, option, + options = elem.options, + values = jQuery.makeArray( value ), + i = options.length; + + while ( i-- ) { + option = options[ i ]; + + /* eslint-disable no-cond-assign */ + + if ( option.selected = + jQuery.inArray( jQuery.valHooks.option.get( option ), values ) > -1 + ) { + optionSet = true; + } + + /* eslint-enable no-cond-assign */ + } + + // Force browsers to behave consistently when non-matching value is set + if ( !optionSet ) { + elem.selectedIndex = -1; + } + return values; + } + } + } +} ); + +// Radios and checkboxes getter/setter +jQuery.each( [ "radio", "checkbox" ], function() { + jQuery.valHooks[ this ] = { + set: function( elem, value ) { + if ( Array.isArray( value ) ) { + return ( elem.checked = jQuery.inArray( jQuery( elem ).val(), value ) > -1 ); + } + } + }; + if ( !support.checkOn ) { + jQuery.valHooks[ this ].get = function( elem ) { + return elem.getAttribute( "value" ) === null ? "on" : elem.value; + }; + } +} ); + + + + +// Return jQuery for attributes-only inclusion + + +support.focusin = "onfocusin" in window; + + +var rfocusMorph = /^(?:focusinfocus|focusoutblur)$/, + stopPropagationCallback = function( e ) { + e.stopPropagation(); + }; + +jQuery.extend( jQuery.event, { + + trigger: function( event, data, elem, onlyHandlers ) { + + var i, cur, tmp, bubbleType, ontype, handle, special, lastElement, + eventPath = [ elem || document ], + type = hasOwn.call( event, "type" ) ? event.type : event, + namespaces = hasOwn.call( event, "namespace" ) ? event.namespace.split( "." ) : []; + + cur = lastElement = tmp = elem = elem || document; + + // Don't do events on text and comment nodes + if ( elem.nodeType === 3 || elem.nodeType === 8 ) { + return; + } + + // focus/blur morphs to focusin/out; ensure we're not firing them right now + if ( rfocusMorph.test( type + jQuery.event.triggered ) ) { + return; + } + + if ( type.indexOf( "." ) > -1 ) { + + // Namespaced trigger; create a regexp to match event type in handle() + namespaces = type.split( "." ); + type = namespaces.shift(); + namespaces.sort(); + } + ontype = type.indexOf( ":" ) < 0 && "on" + type; + + // Caller can pass in a jQuery.Event object, Object, or just an event type string + event = event[ jQuery.expando ] ? + event : + new jQuery.Event( type, typeof event === "object" && event ); + + // Trigger bitmask: & 1 for native handlers; & 2 for jQuery (always true) + event.isTrigger = onlyHandlers ? 2 : 3; + event.namespace = namespaces.join( "." ); + event.rnamespace = event.namespace ? + new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ) : + null; + + // Clean up the event in case it is being reused + event.result = undefined; + if ( !event.target ) { + event.target = elem; + } + + // Clone any incoming data and prepend the event, creating the handler arg list + data = data == null ? + [ event ] : + jQuery.makeArray( data, [ event ] ); + + // Allow special events to draw outside the lines + special = jQuery.event.special[ type ] || {}; + if ( !onlyHandlers && special.trigger && special.trigger.apply( elem, data ) === false ) { + return; + } + + // Determine event propagation path in advance, per W3C events spec (#9951) + // Bubble up to document, then to window; watch for a global ownerDocument var (#9724) + if ( !onlyHandlers && !special.noBubble && !isWindow( elem ) ) { + + bubbleType = special.delegateType || type; + if ( !rfocusMorph.test( bubbleType + type ) ) { + cur = cur.parentNode; + } + for ( ; cur; cur = cur.parentNode ) { + eventPath.push( cur ); + tmp = cur; + } + + // Only add window if we got to document (e.g., not plain obj or detached DOM) + if ( tmp === ( elem.ownerDocument || document ) ) { + eventPath.push( tmp.defaultView || tmp.parentWindow || window ); + } + } + + // Fire handlers on the event path + i = 0; + while ( ( cur = eventPath[ i++ ] ) && !event.isPropagationStopped() ) { + lastElement = cur; + event.type = i > 1 ? + bubbleType : + special.bindType || type; + + // jQuery handler + handle = ( + dataPriv.get( cur, "events" ) || Object.create( null ) + )[ event.type ] && + dataPriv.get( cur, "handle" ); + if ( handle ) { + handle.apply( cur, data ); + } + + // Native handler + handle = ontype && cur[ ontype ]; + if ( handle && handle.apply && acceptData( cur ) ) { + event.result = handle.apply( cur, data ); + if ( event.result === false ) { + event.preventDefault(); + } + } + } + event.type = type; + + // If nobody prevented the default action, do it now + if ( !onlyHandlers && !event.isDefaultPrevented() ) { + + if ( ( !special._default || + special._default.apply( eventPath.pop(), data ) === false ) && + acceptData( elem ) ) { + + // Call a native DOM method on the target with the same name as the event. + // Don't do default actions on window, that's where global variables be (#6170) + if ( ontype && isFunction( elem[ type ] ) && !isWindow( elem ) ) { + + // Don't re-trigger an onFOO event when we call its FOO() method + tmp = elem[ ontype ]; + + if ( tmp ) { + elem[ ontype ] = null; + } + + // Prevent re-triggering of the same event, since we already bubbled it above + jQuery.event.triggered = type; + + if ( event.isPropagationStopped() ) { + lastElement.addEventListener( type, stopPropagationCallback ); + } + + elem[ type ](); + + if ( event.isPropagationStopped() ) { + lastElement.removeEventListener( type, stopPropagationCallback ); + } + + jQuery.event.triggered = undefined; + + if ( tmp ) { + elem[ ontype ] = tmp; + } + } + } + } + + return event.result; + }, + + // Piggyback on a donor event to simulate a different one + // Used only for `focus(in | out)` events + simulate: function( type, elem, event ) { + var e = jQuery.extend( + new jQuery.Event(), + event, + { + type: type, + isSimulated: true + } + ); + + jQuery.event.trigger( e, null, elem ); + } + +} ); + +jQuery.fn.extend( { + + trigger: function( type, data ) { + return this.each( function() { + jQuery.event.trigger( type, data, this ); + } ); + }, + triggerHandler: function( type, data ) { + var elem = this[ 0 ]; + if ( elem ) { + return jQuery.event.trigger( type, data, elem, true ); + } + } +} ); + + +// Support: Firefox <=44 +// Firefox doesn't have focus(in | out) events +// Related ticket - https://bugzilla.mozilla.org/show_bug.cgi?id=687787 +// +// Support: Chrome <=48 - 49, Safari <=9.0 - 9.1 +// focus(in | out) events fire after focus & blur events, +// which is spec violation - http://www.w3.org/TR/DOM-Level-3-Events/#events-focusevent-event-order +// Related ticket - https://bugs.chromium.org/p/chromium/issues/detail?id=449857 +if ( !support.focusin ) { + jQuery.each( { focus: "focusin", blur: "focusout" }, function( orig, fix ) { + + // Attach a single capturing handler on the document while someone wants focusin/focusout + var handler = function( event ) { + jQuery.event.simulate( fix, event.target, jQuery.event.fix( event ) ); + }; + + jQuery.event.special[ fix ] = { + setup: function() { + + // Handle: regular nodes (via `this.ownerDocument`), window + // (via `this.document`) & document (via `this`). + var doc = this.ownerDocument || this.document || this, + attaches = dataPriv.access( doc, fix ); + + if ( !attaches ) { + doc.addEventListener( orig, handler, true ); + } + dataPriv.access( doc, fix, ( attaches || 0 ) + 1 ); + }, + teardown: function() { + var doc = this.ownerDocument || this.document || this, + attaches = dataPriv.access( doc, fix ) - 1; + + if ( !attaches ) { + doc.removeEventListener( orig, handler, true ); + dataPriv.remove( doc, fix ); + + } else { + dataPriv.access( doc, fix, attaches ); + } + } + }; + } ); +} +var location = window.location; + +var nonce = { guid: Date.now() }; + +var rquery = ( /\?/ ); + + + +// Cross-browser xml parsing +jQuery.parseXML = function( data ) { + var xml; + if ( !data || typeof data !== "string" ) { + return null; + } + + // Support: IE 9 - 11 only + // IE throws on parseFromString with invalid input. + try { + xml = ( new window.DOMParser() ).parseFromString( data, "text/xml" ); + } catch ( e ) { + xml = undefined; + } + + if ( !xml || xml.getElementsByTagName( "parsererror" ).length ) { + jQuery.error( "Invalid XML: " + data ); + } + return xml; +}; + + +var + rbracket = /\[\]$/, + rCRLF = /\r?\n/g, + rsubmitterTypes = /^(?:submit|button|image|reset|file)$/i, + rsubmittable = /^(?:input|select|textarea|keygen)/i; + +function buildParams( prefix, obj, traditional, add ) { + var name; + + if ( Array.isArray( obj ) ) { + + // Serialize array item. + jQuery.each( obj, function( i, v ) { + if ( traditional || rbracket.test( prefix ) ) { + + // Treat each array item as a scalar. + add( prefix, v ); + + } else { + + // Item is non-scalar (array or object), encode its numeric index. + buildParams( + prefix + "[" + ( typeof v === "object" && v != null ? i : "" ) + "]", + v, + traditional, + add + ); + } + } ); + + } else if ( !traditional && toType( obj ) === "object" ) { + + // Serialize object item. + for ( name in obj ) { + buildParams( prefix + "[" + name + "]", obj[ name ], traditional, add ); + } + + } else { + + // Serialize scalar item. + add( prefix, obj ); + } +} + +// Serialize an array of form elements or a set of +// key/values into a query string +jQuery.param = function( a, traditional ) { + var prefix, + s = [], + add = function( key, valueOrFunction ) { + + // If value is a function, invoke it and use its return value + var value = isFunction( valueOrFunction ) ? + valueOrFunction() : + valueOrFunction; + + s[ s.length ] = encodeURIComponent( key ) + "=" + + encodeURIComponent( value == null ? "" : value ); + }; + + if ( a == null ) { + return ""; + } + + // If an array was passed in, assume that it is an array of form elements. + if ( Array.isArray( a ) || ( a.jquery && !jQuery.isPlainObject( a ) ) ) { + + // Serialize the form elements + jQuery.each( a, function() { + add( this.name, this.value ); + } ); + + } else { + + // If traditional, encode the "old" way (the way 1.3.2 or older + // did it), otherwise encode params recursively. + for ( prefix in a ) { + buildParams( prefix, a[ prefix ], traditional, add ); + } + } + + // Return the resulting serialization + return s.join( "&" ); +}; + +jQuery.fn.extend( { + serialize: function() { + return jQuery.param( this.serializeArray() ); + }, + serializeArray: function() { + return this.map( function() { + + // Can add propHook for "elements" to filter or add form elements + var elements = jQuery.prop( this, "elements" ); + return elements ? jQuery.makeArray( elements ) : this; + } ) + .filter( function() { + var type = this.type; + + // Use .is( ":disabled" ) so that fieldset[disabled] works + return this.name && !jQuery( this ).is( ":disabled" ) && + rsubmittable.test( this.nodeName ) && !rsubmitterTypes.test( type ) && + ( this.checked || !rcheckableType.test( type ) ); + } ) + .map( function( _i, elem ) { + var val = jQuery( this ).val(); + + if ( val == null ) { + return null; + } + + if ( Array.isArray( val ) ) { + return jQuery.map( val, function( val ) { + return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) }; + } ); + } + + return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) }; + } ).get(); + } +} ); + + +var + r20 = /%20/g, + rhash = /#.*$/, + rantiCache = /([?&])_=[^&]*/, + rheaders = /^(.*?):[ \t]*([^\r\n]*)$/mg, + + // #7653, #8125, #8152: local protocol detection + rlocalProtocol = /^(?:about|app|app-storage|.+-extension|file|res|widget):$/, + rnoContent = /^(?:GET|HEAD)$/, + rprotocol = /^\/\//, + + /* Prefilters + * 1) They are useful to introduce custom dataTypes (see ajax/jsonp.js for an example) + * 2) These are called: + * - BEFORE asking for a transport + * - AFTER param serialization (s.data is a string if s.processData is true) + * 3) key is the dataType + * 4) the catchall symbol "*" can be used + * 5) execution will start with transport dataType and THEN continue down to "*" if needed + */ + prefilters = {}, + + /* Transports bindings + * 1) key is the dataType + * 2) the catchall symbol "*" can be used + * 3) selection will start with transport dataType and THEN go to "*" if needed + */ + transports = {}, + + // Avoid comment-prolog char sequence (#10098); must appease lint and evade compression + allTypes = "*/".concat( "*" ), + + // Anchor tag for parsing the document origin + originAnchor = document.createElement( "a" ); + originAnchor.href = location.href; + +// Base "constructor" for jQuery.ajaxPrefilter and jQuery.ajaxTransport +function addToPrefiltersOrTransports( structure ) { + + // dataTypeExpression is optional and defaults to "*" + return function( dataTypeExpression, func ) { + + if ( typeof dataTypeExpression !== "string" ) { + func = dataTypeExpression; + dataTypeExpression = "*"; + } + + var dataType, + i = 0, + dataTypes = dataTypeExpression.toLowerCase().match( rnothtmlwhite ) || []; + + if ( isFunction( func ) ) { + + // For each dataType in the dataTypeExpression + while ( ( dataType = dataTypes[ i++ ] ) ) { + + // Prepend if requested + if ( dataType[ 0 ] === "+" ) { + dataType = dataType.slice( 1 ) || "*"; + ( structure[ dataType ] = structure[ dataType ] || [] ).unshift( func ); + + // Otherwise append + } else { + ( structure[ dataType ] = structure[ dataType ] || [] ).push( func ); + } + } + } + }; +} + +// Base inspection function for prefilters and transports +function inspectPrefiltersOrTransports( structure, options, originalOptions, jqXHR ) { + + var inspected = {}, + seekingTransport = ( structure === transports ); + + function inspect( dataType ) { + var selected; + inspected[ dataType ] = true; + jQuery.each( structure[ dataType ] || [], function( _, prefilterOrFactory ) { + var dataTypeOrTransport = prefilterOrFactory( options, originalOptions, jqXHR ); + if ( typeof dataTypeOrTransport === "string" && + !seekingTransport && !inspected[ dataTypeOrTransport ] ) { + + options.dataTypes.unshift( dataTypeOrTransport ); + inspect( dataTypeOrTransport ); + return false; + } else if ( seekingTransport ) { + return !( selected = dataTypeOrTransport ); + } + } ); + return selected; + } + + return inspect( options.dataTypes[ 0 ] ) || !inspected[ "*" ] && inspect( "*" ); +} + +// A special extend for ajax options +// that takes "flat" options (not to be deep extended) +// Fixes #9887 +function ajaxExtend( target, src ) { + var key, deep, + flatOptions = jQuery.ajaxSettings.flatOptions || {}; + + for ( key in src ) { + if ( src[ key ] !== undefined ) { + ( flatOptions[ key ] ? target : ( deep || ( deep = {} ) ) )[ key ] = src[ key ]; + } + } + if ( deep ) { + jQuery.extend( true, target, deep ); + } + + return target; +} + +/* Handles responses to an ajax request: + * - finds the right dataType (mediates between content-type and expected dataType) + * - returns the corresponding response + */ +function ajaxHandleResponses( s, jqXHR, responses ) { + + var ct, type, finalDataType, firstDataType, + contents = s.contents, + dataTypes = s.dataTypes; + + // Remove auto dataType and get content-type in the process + while ( dataTypes[ 0 ] === "*" ) { + dataTypes.shift(); + if ( ct === undefined ) { + ct = s.mimeType || jqXHR.getResponseHeader( "Content-Type" ); + } + } + + // Check if we're dealing with a known content-type + if ( ct ) { + for ( type in contents ) { + if ( contents[ type ] && contents[ type ].test( ct ) ) { + dataTypes.unshift( type ); + break; + } + } + } + + // Check to see if we have a response for the expected dataType + if ( dataTypes[ 0 ] in responses ) { + finalDataType = dataTypes[ 0 ]; + } else { + + // Try convertible dataTypes + for ( type in responses ) { + if ( !dataTypes[ 0 ] || s.converters[ type + " " + dataTypes[ 0 ] ] ) { + finalDataType = type; + break; + } + if ( !firstDataType ) { + firstDataType = type; + } + } + + // Or just use first one + finalDataType = finalDataType || firstDataType; + } + + // If we found a dataType + // We add the dataType to the list if needed + // and return the corresponding response + if ( finalDataType ) { + if ( finalDataType !== dataTypes[ 0 ] ) { + dataTypes.unshift( finalDataType ); + } + return responses[ finalDataType ]; + } +} + +/* Chain conversions given the request and the original response + * Also sets the responseXXX fields on the jqXHR instance + */ +function ajaxConvert( s, response, jqXHR, isSuccess ) { + var conv2, current, conv, tmp, prev, + converters = {}, + + // Work with a copy of dataTypes in case we need to modify it for conversion + dataTypes = s.dataTypes.slice(); + + // Create converters map with lowercased keys + if ( dataTypes[ 1 ] ) { + for ( conv in s.converters ) { + converters[ conv.toLowerCase() ] = s.converters[ conv ]; + } + } + + current = dataTypes.shift(); + + // Convert to each sequential dataType + while ( current ) { + + if ( s.responseFields[ current ] ) { + jqXHR[ s.responseFields[ current ] ] = response; + } + + // Apply the dataFilter if provided + if ( !prev && isSuccess && s.dataFilter ) { + response = s.dataFilter( response, s.dataType ); + } + + prev = current; + current = dataTypes.shift(); + + if ( current ) { + + // There's only work to do if current dataType is non-auto + if ( current === "*" ) { + + current = prev; + + // Convert response if prev dataType is non-auto and differs from current + } else if ( prev !== "*" && prev !== current ) { + + // Seek a direct converter + conv = converters[ prev + " " + current ] || converters[ "* " + current ]; + + // If none found, seek a pair + if ( !conv ) { + for ( conv2 in converters ) { + + // If conv2 outputs current + tmp = conv2.split( " " ); + if ( tmp[ 1 ] === current ) { + + // If prev can be converted to accepted input + conv = converters[ prev + " " + tmp[ 0 ] ] || + converters[ "* " + tmp[ 0 ] ]; + if ( conv ) { + + // Condense equivalence converters + if ( conv === true ) { + conv = converters[ conv2 ]; + + // Otherwise, insert the intermediate dataType + } else if ( converters[ conv2 ] !== true ) { + current = tmp[ 0 ]; + dataTypes.unshift( tmp[ 1 ] ); + } + break; + } + } + } + } + + // Apply converter (if not an equivalence) + if ( conv !== true ) { + + // Unless errors are allowed to bubble, catch and return them + if ( conv && s.throws ) { + response = conv( response ); + } else { + try { + response = conv( response ); + } catch ( e ) { + return { + state: "parsererror", + error: conv ? e : "No conversion from " + prev + " to " + current + }; + } + } + } + } + } + } + + return { state: "success", data: response }; +} + +jQuery.extend( { + + // Counter for holding the number of active queries + active: 0, + + // Last-Modified header cache for next request + lastModified: {}, + etag: {}, + + ajaxSettings: { + url: location.href, + type: "GET", + isLocal: rlocalProtocol.test( location.protocol ), + global: true, + processData: true, + async: true, + contentType: "application/x-www-form-urlencoded; charset=UTF-8", + + /* + timeout: 0, + data: null, + dataType: null, + username: null, + password: null, + cache: null, + throws: false, + traditional: false, + headers: {}, + */ + + accepts: { + "*": allTypes, + text: "text/plain", + html: "text/html", + xml: "application/xml, text/xml", + json: "application/json, text/javascript" + }, + + contents: { + xml: /\bxml\b/, + html: /\bhtml/, + json: /\bjson\b/ + }, + + responseFields: { + xml: "responseXML", + text: "responseText", + json: "responseJSON" + }, + + // Data converters + // Keys separate source (or catchall "*") and destination types with a single space + converters: { + + // Convert anything to text + "* text": String, + + // Text to html (true = no transformation) + "text html": true, + + // Evaluate text as a json expression + "text json": JSON.parse, + + // Parse text as xml + "text xml": jQuery.parseXML + }, + + // For options that shouldn't be deep extended: + // you can add your own custom options here if + // and when you create one that shouldn't be + // deep extended (see ajaxExtend) + flatOptions: { + url: true, + context: true + } + }, + + // Creates a full fledged settings object into target + // with both ajaxSettings and settings fields. + // If target is omitted, writes into ajaxSettings. + ajaxSetup: function( target, settings ) { + return settings ? + + // Building a settings object + ajaxExtend( ajaxExtend( target, jQuery.ajaxSettings ), settings ) : + + // Extending ajaxSettings + ajaxExtend( jQuery.ajaxSettings, target ); + }, + + ajaxPrefilter: addToPrefiltersOrTransports( prefilters ), + ajaxTransport: addToPrefiltersOrTransports( transports ), + + // Main method + ajax: function( url, options ) { + + // If url is an object, simulate pre-1.5 signature + if ( typeof url === "object" ) { + options = url; + url = undefined; + } + + // Force options to be an object + options = options || {}; + + var transport, + + // URL without anti-cache param + cacheURL, + + // Response headers + responseHeadersString, + responseHeaders, + + // timeout handle + timeoutTimer, + + // Url cleanup var + urlAnchor, + + // Request state (becomes false upon send and true upon completion) + completed, + + // To know if global events are to be dispatched + fireGlobals, + + // Loop variable + i, + + // uncached part of the url + uncached, + + // Create the final options object + s = jQuery.ajaxSetup( {}, options ), + + // Callbacks context + callbackContext = s.context || s, + + // Context for global events is callbackContext if it is a DOM node or jQuery collection + globalEventContext = s.context && + ( callbackContext.nodeType || callbackContext.jquery ) ? + jQuery( callbackContext ) : + jQuery.event, + + // Deferreds + deferred = jQuery.Deferred(), + completeDeferred = jQuery.Callbacks( "once memory" ), + + // Status-dependent callbacks + statusCode = s.statusCode || {}, + + // Headers (they are sent all at once) + requestHeaders = {}, + requestHeadersNames = {}, + + // Default abort message + strAbort = "canceled", + + // Fake xhr + jqXHR = { + readyState: 0, + + // Builds headers hashtable if needed + getResponseHeader: function( key ) { + var match; + if ( completed ) { + if ( !responseHeaders ) { + responseHeaders = {}; + while ( ( match = rheaders.exec( responseHeadersString ) ) ) { + responseHeaders[ match[ 1 ].toLowerCase() + " " ] = + ( responseHeaders[ match[ 1 ].toLowerCase() + " " ] || [] ) + .concat( match[ 2 ] ); + } + } + match = responseHeaders[ key.toLowerCase() + " " ]; + } + return match == null ? null : match.join( ", " ); + }, + + // Raw string + getAllResponseHeaders: function() { + return completed ? responseHeadersString : null; + }, + + // Caches the header + setRequestHeader: function( name, value ) { + if ( completed == null ) { + name = requestHeadersNames[ name.toLowerCase() ] = + requestHeadersNames[ name.toLowerCase() ] || name; + requestHeaders[ name ] = value; + } + return this; + }, + + // Overrides response content-type header + overrideMimeType: function( type ) { + if ( completed == null ) { + s.mimeType = type; + } + return this; + }, + + // Status-dependent callbacks + statusCode: function( map ) { + var code; + if ( map ) { + if ( completed ) { + + // Execute the appropriate callbacks + jqXHR.always( map[ jqXHR.status ] ); + } else { + + // Lazy-add the new callbacks in a way that preserves old ones + for ( code in map ) { + statusCode[ code ] = [ statusCode[ code ], map[ code ] ]; + } + } + } + return this; + }, + + // Cancel the request + abort: function( statusText ) { + var finalText = statusText || strAbort; + if ( transport ) { + transport.abort( finalText ); + } + done( 0, finalText ); + return this; + } + }; + + // Attach deferreds + deferred.promise( jqXHR ); + + // Add protocol if not provided (prefilters might expect it) + // Handle falsy url in the settings object (#10093: consistency with old signature) + // We also use the url parameter if available + s.url = ( ( url || s.url || location.href ) + "" ) + .replace( rprotocol, location.protocol + "//" ); + + // Alias method option to type as per ticket #12004 + s.type = options.method || options.type || s.method || s.type; + + // Extract dataTypes list + s.dataTypes = ( s.dataType || "*" ).toLowerCase().match( rnothtmlwhite ) || [ "" ]; + + // A cross-domain request is in order when the origin doesn't match the current origin. + if ( s.crossDomain == null ) { + urlAnchor = document.createElement( "a" ); + + // Support: IE <=8 - 11, Edge 12 - 15 + // IE throws exception on accessing the href property if url is malformed, + // e.g. http://example.com:80x/ + try { + urlAnchor.href = s.url; + + // Support: IE <=8 - 11 only + // Anchor's host property isn't correctly set when s.url is relative + urlAnchor.href = urlAnchor.href; + s.crossDomain = originAnchor.protocol + "//" + originAnchor.host !== + urlAnchor.protocol + "//" + urlAnchor.host; + } catch ( e ) { + + // If there is an error parsing the URL, assume it is crossDomain, + // it can be rejected by the transport if it is invalid + s.crossDomain = true; + } + } + + // Convert data if not already a string + if ( s.data && s.processData && typeof s.data !== "string" ) { + s.data = jQuery.param( s.data, s.traditional ); + } + + // Apply prefilters + inspectPrefiltersOrTransports( prefilters, s, options, jqXHR ); + + // If request was aborted inside a prefilter, stop there + if ( completed ) { + return jqXHR; + } + + // We can fire global events as of now if asked to + // Don't fire events if jQuery.event is undefined in an AMD-usage scenario (#15118) + fireGlobals = jQuery.event && s.global; + + // Watch for a new set of requests + if ( fireGlobals && jQuery.active++ === 0 ) { + jQuery.event.trigger( "ajaxStart" ); + } + + // Uppercase the type + s.type = s.type.toUpperCase(); + + // Determine if request has content + s.hasContent = !rnoContent.test( s.type ); + + // Save the URL in case we're toying with the If-Modified-Since + // and/or If-None-Match header later on + // Remove hash to simplify url manipulation + cacheURL = s.url.replace( rhash, "" ); + + // More options handling for requests with no content + if ( !s.hasContent ) { + + // Remember the hash so we can put it back + uncached = s.url.slice( cacheURL.length ); + + // If data is available and should be processed, append data to url + if ( s.data && ( s.processData || typeof s.data === "string" ) ) { + cacheURL += ( rquery.test( cacheURL ) ? "&" : "?" ) + s.data; + + // #9682: remove data so that it's not used in an eventual retry + delete s.data; + } + + // Add or update anti-cache param if needed + if ( s.cache === false ) { + cacheURL = cacheURL.replace( rantiCache, "$1" ); + uncached = ( rquery.test( cacheURL ) ? "&" : "?" ) + "_=" + ( nonce.guid++ ) + + uncached; + } + + // Put hash and anti-cache on the URL that will be requested (gh-1732) + s.url = cacheURL + uncached; + + // Change '%20' to '+' if this is encoded form body content (gh-2658) + } else if ( s.data && s.processData && + ( s.contentType || "" ).indexOf( "application/x-www-form-urlencoded" ) === 0 ) { + s.data = s.data.replace( r20, "+" ); + } + + // Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode. + if ( s.ifModified ) { + if ( jQuery.lastModified[ cacheURL ] ) { + jqXHR.setRequestHeader( "If-Modified-Since", jQuery.lastModified[ cacheURL ] ); + } + if ( jQuery.etag[ cacheURL ] ) { + jqXHR.setRequestHeader( "If-None-Match", jQuery.etag[ cacheURL ] ); + } + } + + // Set the correct header, if data is being sent + if ( s.data && s.hasContent && s.contentType !== false || options.contentType ) { + jqXHR.setRequestHeader( "Content-Type", s.contentType ); + } + + // Set the Accepts header for the server, depending on the dataType + jqXHR.setRequestHeader( + "Accept", + s.dataTypes[ 0 ] && s.accepts[ s.dataTypes[ 0 ] ] ? + s.accepts[ s.dataTypes[ 0 ] ] + + ( s.dataTypes[ 0 ] !== "*" ? ", " + allTypes + "; q=0.01" : "" ) : + s.accepts[ "*" ] + ); + + // Check for headers option + for ( i in s.headers ) { + jqXHR.setRequestHeader( i, s.headers[ i ] ); + } + + // Allow custom headers/mimetypes and early abort + if ( s.beforeSend && + ( s.beforeSend.call( callbackContext, jqXHR, s ) === false || completed ) ) { + + // Abort if not done already and return + return jqXHR.abort(); + } + + // Aborting is no longer a cancellation + strAbort = "abort"; + + // Install callbacks on deferreds + completeDeferred.add( s.complete ); + jqXHR.done( s.success ); + jqXHR.fail( s.error ); + + // Get transport + transport = inspectPrefiltersOrTransports( transports, s, options, jqXHR ); + + // If no transport, we auto-abort + if ( !transport ) { + done( -1, "No Transport" ); + } else { + jqXHR.readyState = 1; + + // Send global event + if ( fireGlobals ) { + globalEventContext.trigger( "ajaxSend", [ jqXHR, s ] ); + } + + // If request was aborted inside ajaxSend, stop there + if ( completed ) { + return jqXHR; + } + + // Timeout + if ( s.async && s.timeout > 0 ) { + timeoutTimer = window.setTimeout( function() { + jqXHR.abort( "timeout" ); + }, s.timeout ); + } + + try { + completed = false; + transport.send( requestHeaders, done ); + } catch ( e ) { + + // Rethrow post-completion exceptions + if ( completed ) { + throw e; + } + + // Propagate others as results + done( -1, e ); + } + } + + // Callback for when everything is done + function done( status, nativeStatusText, responses, headers ) { + var isSuccess, success, error, response, modified, + statusText = nativeStatusText; + + // Ignore repeat invocations + if ( completed ) { + return; + } + + completed = true; + + // Clear timeout if it exists + if ( timeoutTimer ) { + window.clearTimeout( timeoutTimer ); + } + + // Dereference transport for early garbage collection + // (no matter how long the jqXHR object will be used) + transport = undefined; + + // Cache response headers + responseHeadersString = headers || ""; + + // Set readyState + jqXHR.readyState = status > 0 ? 4 : 0; + + // Determine if successful + isSuccess = status >= 200 && status < 300 || status === 304; + + // Get response data + if ( responses ) { + response = ajaxHandleResponses( s, jqXHR, responses ); + } + + // Use a noop converter for missing script + if ( !isSuccess && jQuery.inArray( "script", s.dataTypes ) > -1 ) { + s.converters[ "text script" ] = function() {}; + } + + // Convert no matter what (that way responseXXX fields are always set) + response = ajaxConvert( s, response, jqXHR, isSuccess ); + + // If successful, handle type chaining + if ( isSuccess ) { + + // Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode. + if ( s.ifModified ) { + modified = jqXHR.getResponseHeader( "Last-Modified" ); + if ( modified ) { + jQuery.lastModified[ cacheURL ] = modified; + } + modified = jqXHR.getResponseHeader( "etag" ); + if ( modified ) { + jQuery.etag[ cacheURL ] = modified; + } + } + + // if no content + if ( status === 204 || s.type === "HEAD" ) { + statusText = "nocontent"; + + // if not modified + } else if ( status === 304 ) { + statusText = "notmodified"; + + // If we have data, let's convert it + } else { + statusText = response.state; + success = response.data; + error = response.error; + isSuccess = !error; + } + } else { + + // Extract error from statusText and normalize for non-aborts + error = statusText; + if ( status || !statusText ) { + statusText = "error"; + if ( status < 0 ) { + status = 0; + } + } + } + + // Set data for the fake xhr object + jqXHR.status = status; + jqXHR.statusText = ( nativeStatusText || statusText ) + ""; + + // Success/Error + if ( isSuccess ) { + deferred.resolveWith( callbackContext, [ success, statusText, jqXHR ] ); + } else { + deferred.rejectWith( callbackContext, [ jqXHR, statusText, error ] ); + } + + // Status-dependent callbacks + jqXHR.statusCode( statusCode ); + statusCode = undefined; + + if ( fireGlobals ) { + globalEventContext.trigger( isSuccess ? "ajaxSuccess" : "ajaxError", + [ jqXHR, s, isSuccess ? success : error ] ); + } + + // Complete + completeDeferred.fireWith( callbackContext, [ jqXHR, statusText ] ); + + if ( fireGlobals ) { + globalEventContext.trigger( "ajaxComplete", [ jqXHR, s ] ); + + // Handle the global AJAX counter + if ( !( --jQuery.active ) ) { + jQuery.event.trigger( "ajaxStop" ); + } + } + } + + return jqXHR; + }, + + getJSON: function( url, data, callback ) { + return jQuery.get( url, data, callback, "json" ); + }, + + getScript: function( url, callback ) { + return jQuery.get( url, undefined, callback, "script" ); + } +} ); + +jQuery.each( [ "get", "post" ], function( _i, method ) { + jQuery[ method ] = function( url, data, callback, type ) { + + // Shift arguments if data argument was omitted + if ( isFunction( data ) ) { + type = type || callback; + callback = data; + data = undefined; + } + + // The url can be an options object (which then must have .url) + return jQuery.ajax( jQuery.extend( { + url: url, + type: method, + dataType: type, + data: data, + success: callback + }, jQuery.isPlainObject( url ) && url ) ); + }; +} ); + +jQuery.ajaxPrefilter( function( s ) { + var i; + for ( i in s.headers ) { + if ( i.toLowerCase() === "content-type" ) { + s.contentType = s.headers[ i ] || ""; + } + } +} ); + + +jQuery._evalUrl = function( url, options, doc ) { + return jQuery.ajax( { + url: url, + + // Make this explicit, since user can override this through ajaxSetup (#11264) + type: "GET", + dataType: "script", + cache: true, + async: false, + global: false, + + // Only evaluate the response if it is successful (gh-4126) + // dataFilter is not invoked for failure responses, so using it instead + // of the default converter is kludgy but it works. + converters: { + "text script": function() {} + }, + dataFilter: function( response ) { + jQuery.globalEval( response, options, doc ); + } + } ); +}; + + +jQuery.fn.extend( { + wrapAll: function( html ) { + var wrap; + + if ( this[ 0 ] ) { + if ( isFunction( html ) ) { + html = html.call( this[ 0 ] ); + } + + // The elements to wrap the target around + wrap = jQuery( html, this[ 0 ].ownerDocument ).eq( 0 ).clone( true ); + + if ( this[ 0 ].parentNode ) { + wrap.insertBefore( this[ 0 ] ); + } + + wrap.map( function() { + var elem = this; + + while ( elem.firstElementChild ) { + elem = elem.firstElementChild; + } + + return elem; + } ).append( this ); + } + + return this; + }, + + wrapInner: function( html ) { + if ( isFunction( html ) ) { + return this.each( function( i ) { + jQuery( this ).wrapInner( html.call( this, i ) ); + } ); + } + + return this.each( function() { + var self = jQuery( this ), + contents = self.contents(); + + if ( contents.length ) { + contents.wrapAll( html ); + + } else { + self.append( html ); + } + } ); + }, + + wrap: function( html ) { + var htmlIsFunction = isFunction( html ); + + return this.each( function( i ) { + jQuery( this ).wrapAll( htmlIsFunction ? html.call( this, i ) : html ); + } ); + }, + + unwrap: function( selector ) { + this.parent( selector ).not( "body" ).each( function() { + jQuery( this ).replaceWith( this.childNodes ); + } ); + return this; + } +} ); + + +jQuery.expr.pseudos.hidden = function( elem ) { + return !jQuery.expr.pseudos.visible( elem ); +}; +jQuery.expr.pseudos.visible = function( elem ) { + return !!( elem.offsetWidth || elem.offsetHeight || elem.getClientRects().length ); +}; + + + + +jQuery.ajaxSettings.xhr = function() { + try { + return new window.XMLHttpRequest(); + } catch ( e ) {} +}; + +var xhrSuccessStatus = { + + // File protocol always yields status code 0, assume 200 + 0: 200, + + // Support: IE <=9 only + // #1450: sometimes IE returns 1223 when it should be 204 + 1223: 204 + }, + xhrSupported = jQuery.ajaxSettings.xhr(); + +support.cors = !!xhrSupported && ( "withCredentials" in xhrSupported ); +support.ajax = xhrSupported = !!xhrSupported; + +jQuery.ajaxTransport( function( options ) { + var callback, errorCallback; + + // Cross domain only allowed if supported through XMLHttpRequest + if ( support.cors || xhrSupported && !options.crossDomain ) { + return { + send: function( headers, complete ) { + var i, + xhr = options.xhr(); + + xhr.open( + options.type, + options.url, + options.async, + options.username, + options.password + ); + + // Apply custom fields if provided + if ( options.xhrFields ) { + for ( i in options.xhrFields ) { + xhr[ i ] = options.xhrFields[ i ]; + } + } + + // Override mime type if needed + if ( options.mimeType && xhr.overrideMimeType ) { + xhr.overrideMimeType( options.mimeType ); + } + + // X-Requested-With header + // For cross-domain requests, seeing as conditions for a preflight are + // akin to a jigsaw puzzle, we simply never set it to be sure. + // (it can always be set on a per-request basis or even using ajaxSetup) + // For same-domain requests, won't change header if already provided. + if ( !options.crossDomain && !headers[ "X-Requested-With" ] ) { + headers[ "X-Requested-With" ] = "XMLHttpRequest"; + } + + // Set headers + for ( i in headers ) { + xhr.setRequestHeader( i, headers[ i ] ); + } + + // Callback + callback = function( type ) { + return function() { + if ( callback ) { + callback = errorCallback = xhr.onload = + xhr.onerror = xhr.onabort = xhr.ontimeout = + xhr.onreadystatechange = null; + + if ( type === "abort" ) { + xhr.abort(); + } else if ( type === "error" ) { + + // Support: IE <=9 only + // On a manual native abort, IE9 throws + // errors on any property access that is not readyState + if ( typeof xhr.status !== "number" ) { + complete( 0, "error" ); + } else { + complete( + + // File: protocol always yields status 0; see #8605, #14207 + xhr.status, + xhr.statusText + ); + } + } else { + complete( + xhrSuccessStatus[ xhr.status ] || xhr.status, + xhr.statusText, + + // Support: IE <=9 only + // IE9 has no XHR2 but throws on binary (trac-11426) + // For XHR2 non-text, let the caller handle it (gh-2498) + ( xhr.responseType || "text" ) !== "text" || + typeof xhr.responseText !== "string" ? + { binary: xhr.response } : + { text: xhr.responseText }, + xhr.getAllResponseHeaders() + ); + } + } + }; + }; + + // Listen to events + xhr.onload = callback(); + errorCallback = xhr.onerror = xhr.ontimeout = callback( "error" ); + + // Support: IE 9 only + // Use onreadystatechange to replace onabort + // to handle uncaught aborts + if ( xhr.onabort !== undefined ) { + xhr.onabort = errorCallback; + } else { + xhr.onreadystatechange = function() { + + // Check readyState before timeout as it changes + if ( xhr.readyState === 4 ) { + + // Allow onerror to be called first, + // but that will not handle a native abort + // Also, save errorCallback to a variable + // as xhr.onerror cannot be accessed + window.setTimeout( function() { + if ( callback ) { + errorCallback(); + } + } ); + } + }; + } + + // Create the abort callback + callback = callback( "abort" ); + + try { + + // Do send the request (this may raise an exception) + xhr.send( options.hasContent && options.data || null ); + } catch ( e ) { + + // #14683: Only rethrow if this hasn't been notified as an error yet + if ( callback ) { + throw e; + } + } + }, + + abort: function() { + if ( callback ) { + callback(); + } + } + }; + } +} ); + + + + +// Prevent auto-execution of scripts when no explicit dataType was provided (See gh-2432) +jQuery.ajaxPrefilter( function( s ) { + if ( s.crossDomain ) { + s.contents.script = false; + } +} ); + +// Install script dataType +jQuery.ajaxSetup( { + accepts: { + script: "text/javascript, application/javascript, " + + "application/ecmascript, application/x-ecmascript" + }, + contents: { + script: /\b(?:java|ecma)script\b/ + }, + converters: { + "text script": function( text ) { + jQuery.globalEval( text ); + return text; + } + } +} ); + +// Handle cache's special case and crossDomain +jQuery.ajaxPrefilter( "script", function( s ) { + if ( s.cache === undefined ) { + s.cache = false; + } + if ( s.crossDomain ) { + s.type = "GET"; + } +} ); + +// Bind script tag hack transport +jQuery.ajaxTransport( "script", function( s ) { + + // This transport only deals with cross domain or forced-by-attrs requests + if ( s.crossDomain || s.scriptAttrs ) { + var script, callback; + return { + send: function( _, complete ) { + script = jQuery( "\r\n"; + +// inject VBScript +document.write(IEBinaryToArray_ByteStr_Script); + +global.JSZipUtils._getBinaryFromXHR = function (xhr) { + var binary = xhr.responseBody; + var byteMapping = {}; + for ( var i = 0; i < 256; i++ ) { + for ( var j = 0; j < 256; j++ ) { + byteMapping[ String.fromCharCode( i + (j << 8) ) ] = + String.fromCharCode(i) + String.fromCharCode(j); + } + } + var rawBytes = IEBinaryToArray_ByteStr(binary); + var lastChr = IEBinaryToArray_ByteStr_Last(binary); + return rawBytes.replace(/[\s\S]/g, function( match ) { + return byteMapping[match]; + }) + lastChr; +}; + +// enforcing Stuk's coding style +// vim: set shiftwidth=4 softtabstop=4: + +},{}]},{},[1]) +; diff --git a/api/jquery/jszip-utils/dist/jszip-utils-ie.min.js b/api/jquery/jszip-utils/dist/jszip-utils-ie.min.js new file mode 100644 index 0000000000..93d8bc8ef2 --- /dev/null +++ b/api/jquery/jszip-utils/dist/jszip-utils-ie.min.js @@ -0,0 +1,10 @@ +/*! + +JSZipUtils - A collection of cross-browser utilities to go along with JSZip. + + +(c) 2014 Stuart Knightley, David Duponchel +Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip-utils/master/LICENSE.markdown. + +*/ +!function a(b,c,d){function e(g,h){if(!c[g]){if(!b[g]){var i="function"==typeof require&&require;if(!h&&i)return i(g,!0);if(f)return f(g,!0);throw new Error("Cannot find module '"+g+"'")}var j=c[g]={exports:{}};b[g][0].call(j.exports,function(a){var c=b[g][1][a];return e(c?c:a)},j,j.exports,a,b,c,d)}return c[g].exports}for(var f="function"==typeof require&&require,g=0;g\r\n";document.write(b),a.JSZipUtils._getBinaryFromXHR=function(a){for(var b=a.responseBody,c={},d=0;256>d;d++)for(var e=0;256>e;e++)c[String.fromCharCode(d+(e<<8))]=String.fromCharCode(d)+String.fromCharCode(e);var f=IEBinaryToArray_ByteStr(b),g=IEBinaryToArray_ByteStr_Last(b);return f.replace(/[\s\S]/g,function(a){return c[a]})+g}},{}]},{},[1]); diff --git a/api/jquery/jszip-utils/dist/jszip-utils.js b/api/jquery/jszip-utils/dist/jszip-utils.js new file mode 100644 index 0000000000..775895ec92 --- /dev/null +++ b/api/jquery/jszip-utils/dist/jszip-utils.js @@ -0,0 +1,118 @@ +/*! + +JSZipUtils - A collection of cross-browser utilities to go along with JSZip. + + +(c) 2014 Stuart Knightley, David Duponchel +Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip-utils/master/LICENSE.markdown. + +*/ +!function(e){"object"==typeof exports?module.exports=e():"function"==typeof define&&define.amd?define(e):"undefined"!=typeof window?window.JSZipUtils=e():"undefined"!=typeof global?global.JSZipUtils=e():"undefined"!=typeof self&&(self.JSZipUtils=e())}(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);throw new Error("Cannot find module '"+o+"'")}var f=n[o]={exports:{}};t[o][0].call(f.exports,function(e){var n=t[o][1][e];return s(n?n:e)},f,f.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o + +(c) 2014 Stuart Knightley, David Duponchel +Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip-utils/master/LICENSE.markdown. + +*/ +!function(a){"object"==typeof exports?module.exports=a():"function"==typeof define&&define.amd?define(a):"undefined"!=typeof window?window.JSZipUtils=a():"undefined"!=typeof global?global.JSZipUtils=a():"undefined"!=typeof self&&(self.JSZipUtils=a())}(function(){return function a(b,c,d){function e(g,h){if(!c[g]){if(!b[g]){var i="function"==typeof require&&require;if(!h&&i)return i(g,!0);if(f)return f(g,!0);throw new Error("Cannot find module '"+g+"'")}var j=c[g]={exports:{}};b[g][0].call(j.exports,function(a){var c=b[g][1][a];return e(c?c:a)},j,j.exports,a,b,c,d)}return c[g].exports}for(var f="function"==typeof require&&require,g=0;g + +(c) 2009-2016 Stuart Knightley +Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip/master/LICENSE.markdown. + +JSZip uses the library pako released under the MIT license : +https://github.com/nodeca/pako/blob/master/LICENSE +*/ + +(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.JSZip = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o> 2; + enc2 = ((chr1 & 3) << 4) | (chr2 >> 4); + enc3 = remainingBytes > 1 ? (((chr2 & 15) << 2) | (chr3 >> 6)) : 64; + enc4 = remainingBytes > 2 ? (chr3 & 63) : 64; + + output.push(_keyStr.charAt(enc1) + _keyStr.charAt(enc2) + _keyStr.charAt(enc3) + _keyStr.charAt(enc4)); + + } + + return output.join(""); +}; + +// public method for decoding +exports.decode = function(input) { + var chr1, chr2, chr3; + var enc1, enc2, enc3, enc4; + var i = 0, resultIndex = 0; + + var dataUrlPrefix = "data:"; + + if (input.substr(0, dataUrlPrefix.length) === dataUrlPrefix) { + // This is a common error: people give a data url + // (data:image/png;base64,iVBOR...) with a {base64: true} and + // wonders why things don't work. + // We can detect that the string input looks like a data url but we + // *can't* be sure it is one: removing everything up to the comma would + // be too dangerous. + throw new Error("Invalid base64 input, it looks like a data url."); + } + + input = input.replace(/[^A-Za-z0-9\+\/\=]/g, ""); + + var totalLength = input.length * 3 / 4; + if(input.charAt(input.length - 1) === _keyStr.charAt(64)) { + totalLength--; + } + if(input.charAt(input.length - 2) === _keyStr.charAt(64)) { + totalLength--; + } + if (totalLength % 1 !== 0) { + // totalLength is not an integer, the length does not match a valid + // base64 content. That can happen if: + // - the input is not a base64 content + // - the input is *almost* a base64 content, with a extra chars at the + // beginning or at the end + // - the input uses a base64 variant (base64url for example) + throw new Error("Invalid base64 input, bad content length."); + } + var output; + if (support.uint8array) { + output = new Uint8Array(totalLength|0); + } else { + output = new Array(totalLength|0); + } + + while (i < input.length) { + + enc1 = _keyStr.indexOf(input.charAt(i++)); + enc2 = _keyStr.indexOf(input.charAt(i++)); + enc3 = _keyStr.indexOf(input.charAt(i++)); + enc4 = _keyStr.indexOf(input.charAt(i++)); + + chr1 = (enc1 << 2) | (enc2 >> 4); + chr2 = ((enc2 & 15) << 4) | (enc3 >> 2); + chr3 = ((enc3 & 3) << 6) | enc4; + + output[resultIndex++] = chr1; + + if (enc3 !== 64) { + output[resultIndex++] = chr2; + } + if (enc4 !== 64) { + output[resultIndex++] = chr3; + } + + } + + return output; +}; + +},{"./support":30,"./utils":32}],2:[function(require,module,exports){ +'use strict'; + +var external = require("./external"); +var DataWorker = require('./stream/DataWorker'); +var Crc32Probe = require('./stream/Crc32Probe'); +var DataLengthProbe = require('./stream/DataLengthProbe'); + +/** + * Represent a compressed object, with everything needed to decompress it. + * @constructor + * @param {number} compressedSize the size of the data compressed. + * @param {number} uncompressedSize the size of the data after decompression. + * @param {number} crc32 the crc32 of the decompressed file. + * @param {object} compression the type of compression, see lib/compressions.js. + * @param {String|ArrayBuffer|Uint8Array|Buffer} data the compressed data. + */ +function CompressedObject(compressedSize, uncompressedSize, crc32, compression, data) { + this.compressedSize = compressedSize; + this.uncompressedSize = uncompressedSize; + this.crc32 = crc32; + this.compression = compression; + this.compressedContent = data; +} + +CompressedObject.prototype = { + /** + * Create a worker to get the uncompressed content. + * @return {GenericWorker} the worker. + */ + getContentWorker: function () { + var worker = new DataWorker(external.Promise.resolve(this.compressedContent)) + .pipe(this.compression.uncompressWorker()) + .pipe(new DataLengthProbe("data_length")); + + var that = this; + worker.on("end", function () { + if (this.streamInfo['data_length'] !== that.uncompressedSize) { + throw new Error("Bug : uncompressed data size mismatch"); + } + }); + return worker; + }, + /** + * Create a worker to get the compressed content. + * @return {GenericWorker} the worker. + */ + getCompressedWorker: function () { + return new DataWorker(external.Promise.resolve(this.compressedContent)) + .withStreamInfo("compressedSize", this.compressedSize) + .withStreamInfo("uncompressedSize", this.uncompressedSize) + .withStreamInfo("crc32", this.crc32) + .withStreamInfo("compression", this.compression) + ; + } +}; + +/** + * Chain the given worker with other workers to compress the content with the + * given compression. + * @param {GenericWorker} uncompressedWorker the worker to pipe. + * @param {Object} compression the compression object. + * @param {Object} compressionOptions the options to use when compressing. + * @return {GenericWorker} the new worker compressing the content. + */ +CompressedObject.createWorkerFrom = function (uncompressedWorker, compression, compressionOptions) { + return uncompressedWorker + .pipe(new Crc32Probe()) + .pipe(new DataLengthProbe("uncompressedSize")) + .pipe(compression.compressWorker(compressionOptions)) + .pipe(new DataLengthProbe("compressedSize")) + .withStreamInfo("compression", compression); +}; + +module.exports = CompressedObject; + +},{"./external":6,"./stream/Crc32Probe":25,"./stream/DataLengthProbe":26,"./stream/DataWorker":27}],3:[function(require,module,exports){ +'use strict'; + +var GenericWorker = require("./stream/GenericWorker"); + +exports.STORE = { + magic: "\x00\x00", + compressWorker : function (compressionOptions) { + return new GenericWorker("STORE compression"); + }, + uncompressWorker : function () { + return new GenericWorker("STORE decompression"); + } +}; +exports.DEFLATE = require('./flate'); + +},{"./flate":7,"./stream/GenericWorker":28}],4:[function(require,module,exports){ +'use strict'; + +var utils = require('./utils'); + +/** + * The following functions come from pako, from pako/lib/zlib/crc32.js + * released under the MIT license, see pako https://github.com/nodeca/pako/ + */ + +// Use ordinary array, since untyped makes no boost here +function makeTable() { + var c, table = []; + + for(var n =0; n < 256; n++){ + c = n; + for(var k =0; k < 8; k++){ + c = ((c&1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1)); + } + table[n] = c; + } + + return table; +} + +// Create table on load. Just 255 signed longs. Not a problem. +var crcTable = makeTable(); + + +function crc32(crc, buf, len, pos) { + var t = crcTable, end = pos + len; + + crc = crc ^ (-1); + + for (var i = pos; i < end; i++ ) { + crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF]; + } + + return (crc ^ (-1)); // >>> 0; +} + +// That's all for the pako functions. + +/** + * Compute the crc32 of a string. + * This is almost the same as the function crc32, but for strings. Using the + * same function for the two use cases leads to horrible performances. + * @param {Number} crc the starting value of the crc. + * @param {String} str the string to use. + * @param {Number} len the length of the string. + * @param {Number} pos the starting position for the crc32 computation. + * @return {Number} the computed crc32. + */ +function crc32str(crc, str, len, pos) { + var t = crcTable, end = pos + len; + + crc = crc ^ (-1); + + for (var i = pos; i < end; i++ ) { + crc = (crc >>> 8) ^ t[(crc ^ str.charCodeAt(i)) & 0xFF]; + } + + return (crc ^ (-1)); // >>> 0; +} + +module.exports = function crc32wrapper(input, crc) { + if (typeof input === "undefined" || !input.length) { + return 0; + } + + var isArray = utils.getTypeOf(input) !== "string"; + + if(isArray) { + return crc32(crc|0, input, input.length, 0); + } else { + return crc32str(crc|0, input, input.length, 0); + } +}; + +},{"./utils":32}],5:[function(require,module,exports){ +'use strict'; +exports.base64 = false; +exports.binary = false; +exports.dir = false; +exports.createFolders = true; +exports.date = null; +exports.compression = null; +exports.compressionOptions = null; +exports.comment = null; +exports.unixPermissions = null; +exports.dosPermissions = null; + +},{}],6:[function(require,module,exports){ +/* global Promise */ +'use strict'; + +// load the global object first: +// - it should be better integrated in the system (unhandledRejection in node) +// - the environment may have a custom Promise implementation (see zone.js) +var ES6Promise = null; +if (typeof Promise !== "undefined") { + ES6Promise = Promise; +} else { + ES6Promise = require("lie"); +} + +/** + * Let the user use/change some implementations. + */ +module.exports = { + Promise: ES6Promise +}; + +},{"lie":37}],7:[function(require,module,exports){ +'use strict'; +var USE_TYPEDARRAY = (typeof Uint8Array !== 'undefined') && (typeof Uint16Array !== 'undefined') && (typeof Uint32Array !== 'undefined'); + +var pako = require("pako"); +var utils = require("./utils"); +var GenericWorker = require("./stream/GenericWorker"); + +var ARRAY_TYPE = USE_TYPEDARRAY ? "uint8array" : "array"; + +exports.magic = "\x08\x00"; + +/** + * Create a worker that uses pako to inflate/deflate. + * @constructor + * @param {String} action the name of the pako function to call : either "Deflate" or "Inflate". + * @param {Object} options the options to use when (de)compressing. + */ +function FlateWorker(action, options) { + GenericWorker.call(this, "FlateWorker/" + action); + + this._pako = null; + this._pakoAction = action; + this._pakoOptions = options; + // the `meta` object from the last chunk received + // this allow this worker to pass around metadata + this.meta = {}; +} + +utils.inherits(FlateWorker, GenericWorker); + +/** + * @see GenericWorker.processChunk + */ +FlateWorker.prototype.processChunk = function (chunk) { + this.meta = chunk.meta; + if (this._pako === null) { + this._createPako(); + } + this._pako.push(utils.transformTo(ARRAY_TYPE, chunk.data), false); +}; + +/** + * @see GenericWorker.flush + */ +FlateWorker.prototype.flush = function () { + GenericWorker.prototype.flush.call(this); + if (this._pako === null) { + this._createPako(); + } + this._pako.push([], true); +}; +/** + * @see GenericWorker.cleanUp + */ +FlateWorker.prototype.cleanUp = function () { + GenericWorker.prototype.cleanUp.call(this); + this._pako = null; +}; + +/** + * Create the _pako object. + * TODO: lazy-loading this object isn't the best solution but it's the + * quickest. The best solution is to lazy-load the worker list. See also the + * issue #446. + */ +FlateWorker.prototype._createPako = function () { + this._pako = new pako[this._pakoAction]({ + raw: true, + level: this._pakoOptions.level || -1 // default compression + }); + var self = this; + this._pako.onData = function(data) { + self.push({ + data : data, + meta : self.meta + }); + }; +}; + +exports.compressWorker = function (compressionOptions) { + return new FlateWorker("Deflate", compressionOptions); +}; +exports.uncompressWorker = function () { + return new FlateWorker("Inflate", {}); +}; + +},{"./stream/GenericWorker":28,"./utils":32,"pako":38}],8:[function(require,module,exports){ +'use strict'; + +var utils = require('../utils'); +var GenericWorker = require('../stream/GenericWorker'); +var utf8 = require('../utf8'); +var crc32 = require('../crc32'); +var signature = require('../signature'); + +/** + * Transform an integer into a string in hexadecimal. + * @private + * @param {number} dec the number to convert. + * @param {number} bytes the number of bytes to generate. + * @returns {string} the result. + */ +var decToHex = function(dec, bytes) { + var hex = "", i; + for (i = 0; i < bytes; i++) { + hex += String.fromCharCode(dec & 0xff); + dec = dec >>> 8; + } + return hex; +}; + +/** + * Generate the UNIX part of the external file attributes. + * @param {Object} unixPermissions the unix permissions or null. + * @param {Boolean} isDir true if the entry is a directory, false otherwise. + * @return {Number} a 32 bit integer. + * + * adapted from http://unix.stackexchange.com/questions/14705/the-zip-formats-external-file-attribute : + * + * TTTTsstrwxrwxrwx0000000000ADVSHR + * ^^^^____________________________ file type, see zipinfo.c (UNX_*) + * ^^^_________________________ setuid, setgid, sticky + * ^^^^^^^^^________________ permissions + * ^^^^^^^^^^______ not used ? + * ^^^^^^ DOS attribute bits : Archive, Directory, Volume label, System file, Hidden, Read only + */ +var generateUnixExternalFileAttr = function (unixPermissions, isDir) { + + var result = unixPermissions; + if (!unixPermissions) { + // I can't use octal values in strict mode, hence the hexa. + // 040775 => 0x41fd + // 0100664 => 0x81b4 + result = isDir ? 0x41fd : 0x81b4; + } + return (result & 0xFFFF) << 16; +}; + +/** + * Generate the DOS part of the external file attributes. + * @param {Object} dosPermissions the dos permissions or null. + * @param {Boolean} isDir true if the entry is a directory, false otherwise. + * @return {Number} a 32 bit integer. + * + * Bit 0 Read-Only + * Bit 1 Hidden + * Bit 2 System + * Bit 3 Volume Label + * Bit 4 Directory + * Bit 5 Archive + */ +var generateDosExternalFileAttr = function (dosPermissions, isDir) { + + // the dir flag is already set for compatibility + return (dosPermissions || 0) & 0x3F; +}; + +/** + * Generate the various parts used in the construction of the final zip file. + * @param {Object} streamInfo the hash with information about the compressed file. + * @param {Boolean} streamedContent is the content streamed ? + * @param {Boolean} streamingEnded is the stream finished ? + * @param {number} offset the current offset from the start of the zip file. + * @param {String} platform let's pretend we are this platform (change platform dependents fields) + * @param {Function} encodeFileName the function to encode the file name / comment. + * @return {Object} the zip parts. + */ +var generateZipParts = function(streamInfo, streamedContent, streamingEnded, offset, platform, encodeFileName) { + var file = streamInfo['file'], + compression = streamInfo['compression'], + useCustomEncoding = encodeFileName !== utf8.utf8encode, + encodedFileName = utils.transformTo("string", encodeFileName(file.name)), + utfEncodedFileName = utils.transformTo("string", utf8.utf8encode(file.name)), + comment = file.comment, + encodedComment = utils.transformTo("string", encodeFileName(comment)), + utfEncodedComment = utils.transformTo("string", utf8.utf8encode(comment)), + useUTF8ForFileName = utfEncodedFileName.length !== file.name.length, + useUTF8ForComment = utfEncodedComment.length !== comment.length, + dosTime, + dosDate, + extraFields = "", + unicodePathExtraField = "", + unicodeCommentExtraField = "", + dir = file.dir, + date = file.date; + + + var dataInfo = { + crc32 : 0, + compressedSize : 0, + uncompressedSize : 0 + }; + + // if the content is streamed, the sizes/crc32 are only available AFTER + // the end of the stream. + if (!streamedContent || streamingEnded) { + dataInfo.crc32 = streamInfo['crc32']; + dataInfo.compressedSize = streamInfo['compressedSize']; + dataInfo.uncompressedSize = streamInfo['uncompressedSize']; + } + + var bitflag = 0; + if (streamedContent) { + // Bit 3: the sizes/crc32 are set to zero in the local header. + // The correct values are put in the data descriptor immediately + // following the compressed data. + bitflag |= 0x0008; + } + if (!useCustomEncoding && (useUTF8ForFileName || useUTF8ForComment)) { + // Bit 11: Language encoding flag (EFS). + bitflag |= 0x0800; + } + + + var extFileAttr = 0; + var versionMadeBy = 0; + if (dir) { + // dos or unix, we set the dos dir flag + extFileAttr |= 0x00010; + } + if(platform === "UNIX") { + versionMadeBy = 0x031E; // UNIX, version 3.0 + extFileAttr |= generateUnixExternalFileAttr(file.unixPermissions, dir); + } else { // DOS or other, fallback to DOS + versionMadeBy = 0x0014; // DOS, version 2.0 + extFileAttr |= generateDosExternalFileAttr(file.dosPermissions, dir); + } + + // date + // @see http://www.delorie.com/djgpp/doc/rbinter/it/52/13.html + // @see http://www.delorie.com/djgpp/doc/rbinter/it/65/16.html + // @see http://www.delorie.com/djgpp/doc/rbinter/it/66/16.html + + dosTime = date.getUTCHours(); + dosTime = dosTime << 6; + dosTime = dosTime | date.getUTCMinutes(); + dosTime = dosTime << 5; + dosTime = dosTime | date.getUTCSeconds() / 2; + + dosDate = date.getUTCFullYear() - 1980; + dosDate = dosDate << 4; + dosDate = dosDate | (date.getUTCMonth() + 1); + dosDate = dosDate << 5; + dosDate = dosDate | date.getUTCDate(); + + if (useUTF8ForFileName) { + // set the unicode path extra field. unzip needs at least one extra + // field to correctly handle unicode path, so using the path is as good + // as any other information. This could improve the situation with + // other archive managers too. + // This field is usually used without the utf8 flag, with a non + // unicode path in the header (winrar, winzip). This helps (a bit) + // with the messy Windows' default compressed folders feature but + // breaks on p7zip which doesn't seek the unicode path extra field. + // So for now, UTF-8 everywhere ! + unicodePathExtraField = + // Version + decToHex(1, 1) + + // NameCRC32 + decToHex(crc32(encodedFileName), 4) + + // UnicodeName + utfEncodedFileName; + + extraFields += + // Info-ZIP Unicode Path Extra Field + "\x75\x70" + + // size + decToHex(unicodePathExtraField.length, 2) + + // content + unicodePathExtraField; + } + + if(useUTF8ForComment) { + + unicodeCommentExtraField = + // Version + decToHex(1, 1) + + // CommentCRC32 + decToHex(crc32(encodedComment), 4) + + // UnicodeName + utfEncodedComment; + + extraFields += + // Info-ZIP Unicode Path Extra Field + "\x75\x63" + + // size + decToHex(unicodeCommentExtraField.length, 2) + + // content + unicodeCommentExtraField; + } + + var header = ""; + + // version needed to extract + header += "\x0A\x00"; + // general purpose bit flag + header += decToHex(bitflag, 2); + // compression method + header += compression.magic; + // last mod file time + header += decToHex(dosTime, 2); + // last mod file date + header += decToHex(dosDate, 2); + // crc-32 + header += decToHex(dataInfo.crc32, 4); + // compressed size + header += decToHex(dataInfo.compressedSize, 4); + // uncompressed size + header += decToHex(dataInfo.uncompressedSize, 4); + // file name length + header += decToHex(encodedFileName.length, 2); + // extra field length + header += decToHex(extraFields.length, 2); + + + var fileRecord = signature.LOCAL_FILE_HEADER + header + encodedFileName + extraFields; + + var dirRecord = signature.CENTRAL_FILE_HEADER + + // version made by (00: DOS) + decToHex(versionMadeBy, 2) + + // file header (common to file and central directory) + header + + // file comment length + decToHex(encodedComment.length, 2) + + // disk number start + "\x00\x00" + + // internal file attributes TODO + "\x00\x00" + + // external file attributes + decToHex(extFileAttr, 4) + + // relative offset of local header + decToHex(offset, 4) + + // file name + encodedFileName + + // extra field + extraFields + + // file comment + encodedComment; + + return { + fileRecord: fileRecord, + dirRecord: dirRecord + }; +}; + +/** + * Generate the EOCD record. + * @param {Number} entriesCount the number of entries in the zip file. + * @param {Number} centralDirLength the length (in bytes) of the central dir. + * @param {Number} localDirLength the length (in bytes) of the local dir. + * @param {String} comment the zip file comment as a binary string. + * @param {Function} encodeFileName the function to encode the comment. + * @return {String} the EOCD record. + */ +var generateCentralDirectoryEnd = function (entriesCount, centralDirLength, localDirLength, comment, encodeFileName) { + var dirEnd = ""; + var encodedComment = utils.transformTo("string", encodeFileName(comment)); + + // end of central dir signature + dirEnd = signature.CENTRAL_DIRECTORY_END + + // number of this disk + "\x00\x00" + + // number of the disk with the start of the central directory + "\x00\x00" + + // total number of entries in the central directory on this disk + decToHex(entriesCount, 2) + + // total number of entries in the central directory + decToHex(entriesCount, 2) + + // size of the central directory 4 bytes + decToHex(centralDirLength, 4) + + // offset of start of central directory with respect to the starting disk number + decToHex(localDirLength, 4) + + // .ZIP file comment length + decToHex(encodedComment.length, 2) + + // .ZIP file comment + encodedComment; + + return dirEnd; +}; + +/** + * Generate data descriptors for a file entry. + * @param {Object} streamInfo the hash generated by a worker, containing information + * on the file entry. + * @return {String} the data descriptors. + */ +var generateDataDescriptors = function (streamInfo) { + var descriptor = ""; + descriptor = signature.DATA_DESCRIPTOR + + // crc-32 4 bytes + decToHex(streamInfo['crc32'], 4) + + // compressed size 4 bytes + decToHex(streamInfo['compressedSize'], 4) + + // uncompressed size 4 bytes + decToHex(streamInfo['uncompressedSize'], 4); + + return descriptor; +}; + + +/** + * A worker to concatenate other workers to create a zip file. + * @param {Boolean} streamFiles `true` to stream the content of the files, + * `false` to accumulate it. + * @param {String} comment the comment to use. + * @param {String} platform the platform to use, "UNIX" or "DOS". + * @param {Function} encodeFileName the function to encode file names and comments. + */ +function ZipFileWorker(streamFiles, comment, platform, encodeFileName) { + GenericWorker.call(this, "ZipFileWorker"); + // The number of bytes written so far. This doesn't count accumulated chunks. + this.bytesWritten = 0; + // The comment of the zip file + this.zipComment = comment; + // The platform "generating" the zip file. + this.zipPlatform = platform; + // the function to encode file names and comments. + this.encodeFileName = encodeFileName; + // Should we stream the content of the files ? + this.streamFiles = streamFiles; + // If `streamFiles` is false, we will need to accumulate the content of the + // files to calculate sizes / crc32 (and write them *before* the content). + // This boolean indicates if we are accumulating chunks (it will change a lot + // during the lifetime of this worker). + this.accumulate = false; + // The buffer receiving chunks when accumulating content. + this.contentBuffer = []; + // The list of generated directory records. + this.dirRecords = []; + // The offset (in bytes) from the beginning of the zip file for the current source. + this.currentSourceOffset = 0; + // The total number of entries in this zip file. + this.entriesCount = 0; + // the name of the file currently being added, null when handling the end of the zip file. + // Used for the emitted metadata. + this.currentFile = null; + + + + this._sources = []; +} +utils.inherits(ZipFileWorker, GenericWorker); + +/** + * @see GenericWorker.push + */ +ZipFileWorker.prototype.push = function (chunk) { + + var currentFilePercent = chunk.meta.percent || 0; + var entriesCount = this.entriesCount; + var remainingFiles = this._sources.length; + + if(this.accumulate) { + this.contentBuffer.push(chunk); + } else { + this.bytesWritten += chunk.data.length; + + GenericWorker.prototype.push.call(this, { + data : chunk.data, + meta : { + currentFile : this.currentFile, + percent : entriesCount ? (currentFilePercent + 100 * (entriesCount - remainingFiles - 1)) / entriesCount : 100 + } + }); + } +}; + +/** + * The worker started a new source (an other worker). + * @param {Object} streamInfo the streamInfo object from the new source. + */ +ZipFileWorker.prototype.openedSource = function (streamInfo) { + this.currentSourceOffset = this.bytesWritten; + this.currentFile = streamInfo['file'].name; + + var streamedContent = this.streamFiles && !streamInfo['file'].dir; + + // don't stream folders (because they don't have any content) + if(streamedContent) { + var record = generateZipParts(streamInfo, streamedContent, false, this.currentSourceOffset, this.zipPlatform, this.encodeFileName); + this.push({ + data : record.fileRecord, + meta : {percent:0} + }); + } else { + // we need to wait for the whole file before pushing anything + this.accumulate = true; + } +}; + +/** + * The worker finished a source (an other worker). + * @param {Object} streamInfo the streamInfo object from the finished source. + */ +ZipFileWorker.prototype.closedSource = function (streamInfo) { + this.accumulate = false; + var streamedContent = this.streamFiles && !streamInfo['file'].dir; + var record = generateZipParts(streamInfo, streamedContent, true, this.currentSourceOffset, this.zipPlatform, this.encodeFileName); + + this.dirRecords.push(record.dirRecord); + if(streamedContent) { + // after the streamed file, we put data descriptors + this.push({ + data : generateDataDescriptors(streamInfo), + meta : {percent:100} + }); + } else { + // the content wasn't streamed, we need to push everything now + // first the file record, then the content + this.push({ + data : record.fileRecord, + meta : {percent:0} + }); + while(this.contentBuffer.length) { + this.push(this.contentBuffer.shift()); + } + } + this.currentFile = null; +}; + +/** + * @see GenericWorker.flush + */ +ZipFileWorker.prototype.flush = function () { + + var localDirLength = this.bytesWritten; + for(var i = 0; i < this.dirRecords.length; i++) { + this.push({ + data : this.dirRecords[i], + meta : {percent:100} + }); + } + var centralDirLength = this.bytesWritten - localDirLength; + + var dirEnd = generateCentralDirectoryEnd(this.dirRecords.length, centralDirLength, localDirLength, this.zipComment, this.encodeFileName); + + this.push({ + data : dirEnd, + meta : {percent:100} + }); +}; + +/** + * Prepare the next source to be read. + */ +ZipFileWorker.prototype.prepareNextSource = function () { + this.previous = this._sources.shift(); + this.openedSource(this.previous.streamInfo); + if (this.isPaused) { + this.previous.pause(); + } else { + this.previous.resume(); + } +}; + +/** + * @see GenericWorker.registerPrevious + */ +ZipFileWorker.prototype.registerPrevious = function (previous) { + this._sources.push(previous); + var self = this; + + previous.on('data', function (chunk) { + self.processChunk(chunk); + }); + previous.on('end', function () { + self.closedSource(self.previous.streamInfo); + if(self._sources.length) { + self.prepareNextSource(); + } else { + self.end(); + } + }); + previous.on('error', function (e) { + self.error(e); + }); + return this; +}; + +/** + * @see GenericWorker.resume + */ +ZipFileWorker.prototype.resume = function () { + if(!GenericWorker.prototype.resume.call(this)) { + return false; + } + + if (!this.previous && this._sources.length) { + this.prepareNextSource(); + return true; + } + if (!this.previous && !this._sources.length && !this.generatedError) { + this.end(); + return true; + } +}; + +/** + * @see GenericWorker.error + */ +ZipFileWorker.prototype.error = function (e) { + var sources = this._sources; + if(!GenericWorker.prototype.error.call(this, e)) { + return false; + } + for(var i = 0; i < sources.length; i++) { + try { + sources[i].error(e); + } catch(e) { + // the `error` exploded, nothing to do + } + } + return true; +}; + +/** + * @see GenericWorker.lock + */ +ZipFileWorker.prototype.lock = function () { + GenericWorker.prototype.lock.call(this); + var sources = this._sources; + for(var i = 0; i < sources.length; i++) { + sources[i].lock(); + } +}; + +module.exports = ZipFileWorker; + +},{"../crc32":4,"../signature":23,"../stream/GenericWorker":28,"../utf8":31,"../utils":32}],9:[function(require,module,exports){ +'use strict'; + +var compressions = require('../compressions'); +var ZipFileWorker = require('./ZipFileWorker'); + +/** + * Find the compression to use. + * @param {String} fileCompression the compression defined at the file level, if any. + * @param {String} zipCompression the compression defined at the load() level. + * @return {Object} the compression object to use. + */ +var getCompression = function (fileCompression, zipCompression) { + + var compressionName = fileCompression || zipCompression; + var compression = compressions[compressionName]; + if (!compression) { + throw new Error(compressionName + " is not a valid compression method !"); + } + return compression; +}; + +/** + * Create a worker to generate a zip file. + * @param {JSZip} zip the JSZip instance at the right root level. + * @param {Object} options to generate the zip file. + * @param {String} comment the comment to use. + */ +exports.generateWorker = function (zip, options, comment) { + + var zipFileWorker = new ZipFileWorker(options.streamFiles, comment, options.platform, options.encodeFileName); + var entriesCount = 0; + try { + + zip.forEach(function (relativePath, file) { + entriesCount++; + var compression = getCompression(file.options.compression, options.compression); + var compressionOptions = file.options.compressionOptions || options.compressionOptions || {}; + var dir = file.dir, date = file.date; + + file._compressWorker(compression, compressionOptions) + .withStreamInfo("file", { + name : relativePath, + dir : dir, + date : date, + comment : file.comment || "", + unixPermissions : file.unixPermissions, + dosPermissions : file.dosPermissions + }) + .pipe(zipFileWorker); + }); + zipFileWorker.entriesCount = entriesCount; + } catch (e) { + zipFileWorker.error(e); + } + + return zipFileWorker; +}; + +},{"../compressions":3,"./ZipFileWorker":8}],10:[function(require,module,exports){ +'use strict'; + +/** + * Representation a of zip file in js + * @constructor + */ +function JSZip() { + // if this constructor is used without `new`, it adds `new` before itself: + if(!(this instanceof JSZip)) { + return new JSZip(); + } + + if(arguments.length) { + throw new Error("The constructor with parameters has been removed in JSZip 3.0, please check the upgrade guide."); + } + + // object containing the files : + // { + // "folder/" : {...}, + // "folder/data.txt" : {...} + // } + // NOTE: we use a null prototype because we do not + // want filenames like "toString" coming from a zip file + // to overwrite methods and attributes in a normal Object. + this.files = Object.create(null); + + this.comment = null; + + // Where we are in the hierarchy + this.root = ""; + this.clone = function() { + var newObj = new JSZip(); + for (var i in this) { + if (typeof this[i] !== "function") { + newObj[i] = this[i]; + } + } + return newObj; + }; +} +JSZip.prototype = require('./object'); +JSZip.prototype.loadAsync = require('./load'); +JSZip.support = require('./support'); +JSZip.defaults = require('./defaults'); + +// TODO find a better way to handle this version, +// a require('package.json').version doesn't work with webpack, see #327 +JSZip.version = "3.7.1"; + +JSZip.loadAsync = function (content, options) { + return new JSZip().loadAsync(content, options); +}; + +JSZip.external = require("./external"); +module.exports = JSZip; + +},{"./defaults":5,"./external":6,"./load":11,"./object":15,"./support":30}],11:[function(require,module,exports){ +'use strict'; +var utils = require('./utils'); +var external = require("./external"); +var utf8 = require('./utf8'); +var ZipEntries = require('./zipEntries'); +var Crc32Probe = require('./stream/Crc32Probe'); +var nodejsUtils = require("./nodejsUtils"); + +/** + * Check the CRC32 of an entry. + * @param {ZipEntry} zipEntry the zip entry to check. + * @return {Promise} the result. + */ +function checkEntryCRC32(zipEntry) { + return new external.Promise(function (resolve, reject) { + var worker = zipEntry.decompressed.getContentWorker().pipe(new Crc32Probe()); + worker.on("error", function (e) { + reject(e); + }) + .on("end", function () { + if (worker.streamInfo.crc32 !== zipEntry.decompressed.crc32) { + reject(new Error("Corrupted zip : CRC32 mismatch")); + } else { + resolve(); + } + }) + .resume(); + }); +} + +module.exports = function (data, options) { + var zip = this; + options = utils.extend(options || {}, { + base64: false, + checkCRC32: false, + optimizedBinaryString: false, + createFolders: false, + decodeFileName: utf8.utf8decode + }); + + if (nodejsUtils.isNode && nodejsUtils.isStream(data)) { + return external.Promise.reject(new Error("JSZip can't accept a stream when loading a zip file.")); + } + + return utils.prepareContent("the loaded zip file", data, true, options.optimizedBinaryString, options.base64) + .then(function (data) { + var zipEntries = new ZipEntries(options); + zipEntries.load(data); + return zipEntries; + }).then(function checkCRC32(zipEntries) { + var promises = [external.Promise.resolve(zipEntries)]; + var files = zipEntries.files; + if (options.checkCRC32) { + for (var i = 0; i < files.length; i++) { + promises.push(checkEntryCRC32(files[i])); + } + } + return external.Promise.all(promises); + }).then(function addFiles(results) { + var zipEntries = results.shift(); + var files = zipEntries.files; + for (var i = 0; i < files.length; i++) { + var input = files[i]; + zip.file(input.fileNameStr, input.decompressed, { + binary: true, + optimizedBinaryString: true, + date: input.date, + dir: input.dir, + comment: input.fileCommentStr.length ? input.fileCommentStr : null, + unixPermissions: input.unixPermissions, + dosPermissions: input.dosPermissions, + createFolders: options.createFolders + }); + } + if (zipEntries.zipComment.length) { + zip.comment = zipEntries.zipComment; + } + + return zip; + }); +}; + +},{"./external":6,"./nodejsUtils":14,"./stream/Crc32Probe":25,"./utf8":31,"./utils":32,"./zipEntries":33}],12:[function(require,module,exports){ +"use strict"; + +var utils = require('../utils'); +var GenericWorker = require('../stream/GenericWorker'); + +/** + * A worker that use a nodejs stream as source. + * @constructor + * @param {String} filename the name of the file entry for this stream. + * @param {Readable} stream the nodejs stream. + */ +function NodejsStreamInputAdapter(filename, stream) { + GenericWorker.call(this, "Nodejs stream input adapter for " + filename); + this._upstreamEnded = false; + this._bindStream(stream); +} + +utils.inherits(NodejsStreamInputAdapter, GenericWorker); + +/** + * Prepare the stream and bind the callbacks on it. + * Do this ASAP on node 0.10 ! A lazy binding doesn't always work. + * @param {Stream} stream the nodejs stream to use. + */ +NodejsStreamInputAdapter.prototype._bindStream = function (stream) { + var self = this; + this._stream = stream; + stream.pause(); + stream + .on("data", function (chunk) { + self.push({ + data: chunk, + meta : { + percent : 0 + } + }); + }) + .on("error", function (e) { + if(self.isPaused) { + this.generatedError = e; + } else { + self.error(e); + } + }) + .on("end", function () { + if(self.isPaused) { + self._upstreamEnded = true; + } else { + self.end(); + } + }); +}; +NodejsStreamInputAdapter.prototype.pause = function () { + if(!GenericWorker.prototype.pause.call(this)) { + return false; + } + this._stream.pause(); + return true; +}; +NodejsStreamInputAdapter.prototype.resume = function () { + if(!GenericWorker.prototype.resume.call(this)) { + return false; + } + + if(this._upstreamEnded) { + this.end(); + } else { + this._stream.resume(); + } + + return true; +}; + +module.exports = NodejsStreamInputAdapter; + +},{"../stream/GenericWorker":28,"../utils":32}],13:[function(require,module,exports){ +'use strict'; + +var Readable = require('readable-stream').Readable; + +var utils = require('../utils'); +utils.inherits(NodejsStreamOutputAdapter, Readable); + +/** +* A nodejs stream using a worker as source. +* @see the SourceWrapper in http://nodejs.org/api/stream.html +* @constructor +* @param {StreamHelper} helper the helper wrapping the worker +* @param {Object} options the nodejs stream options +* @param {Function} updateCb the update callback. +*/ +function NodejsStreamOutputAdapter(helper, options, updateCb) { + Readable.call(this, options); + this._helper = helper; + + var self = this; + helper.on("data", function (data, meta) { + if (!self.push(data)) { + self._helper.pause(); + } + if(updateCb) { + updateCb(meta); + } + }) + .on("error", function(e) { + self.emit('error', e); + }) + .on("end", function () { + self.push(null); + }); +} + + +NodejsStreamOutputAdapter.prototype._read = function() { + this._helper.resume(); +}; + +module.exports = NodejsStreamOutputAdapter; + +},{"../utils":32,"readable-stream":16}],14:[function(require,module,exports){ +'use strict'; + +module.exports = { + /** + * True if this is running in Nodejs, will be undefined in a browser. + * In a browser, browserify won't include this file and the whole module + * will be resolved an empty object. + */ + isNode : typeof Buffer !== "undefined", + /** + * Create a new nodejs Buffer from an existing content. + * @param {Object} data the data to pass to the constructor. + * @param {String} encoding the encoding to use. + * @return {Buffer} a new Buffer. + */ + newBufferFrom: function(data, encoding) { + if (Buffer.from && Buffer.from !== Uint8Array.from) { + return Buffer.from(data, encoding); + } else { + if (typeof data === "number") { + // Safeguard for old Node.js versions. On newer versions, + // Buffer.from(number) / Buffer(number, encoding) already throw. + throw new Error("The \"data\" argument must not be a number"); + } + return new Buffer(data, encoding); + } + }, + /** + * Create a new nodejs Buffer with the specified size. + * @param {Integer} size the size of the buffer. + * @return {Buffer} a new Buffer. + */ + allocBuffer: function (size) { + if (Buffer.alloc) { + return Buffer.alloc(size); + } else { + var buf = new Buffer(size); + buf.fill(0); + return buf; + } + }, + /** + * Find out if an object is a Buffer. + * @param {Object} b the object to test. + * @return {Boolean} true if the object is a Buffer, false otherwise. + */ + isBuffer : function(b){ + return Buffer.isBuffer(b); + }, + + isStream : function (obj) { + return obj && + typeof obj.on === "function" && + typeof obj.pause === "function" && + typeof obj.resume === "function"; + } +}; + +},{}],15:[function(require,module,exports){ +'use strict'; +var utf8 = require('./utf8'); +var utils = require('./utils'); +var GenericWorker = require('./stream/GenericWorker'); +var StreamHelper = require('./stream/StreamHelper'); +var defaults = require('./defaults'); +var CompressedObject = require('./compressedObject'); +var ZipObject = require('./zipObject'); +var generate = require("./generate"); +var nodejsUtils = require("./nodejsUtils"); +var NodejsStreamInputAdapter = require("./nodejs/NodejsStreamInputAdapter"); + + +/** + * Add a file in the current folder. + * @private + * @param {string} name the name of the file + * @param {String|ArrayBuffer|Uint8Array|Buffer} data the data of the file + * @param {Object} originalOptions the options of the file + * @return {Object} the new file. + */ +var fileAdd = function(name, data, originalOptions) { + // be sure sub folders exist + var dataType = utils.getTypeOf(data), + parent; + + + /* + * Correct options. + */ + + var o = utils.extend(originalOptions || {}, defaults); + o.date = o.date || new Date(); + if (o.compression !== null) { + o.compression = o.compression.toUpperCase(); + } + + if (typeof o.unixPermissions === "string") { + o.unixPermissions = parseInt(o.unixPermissions, 8); + } + + // UNX_IFDIR 0040000 see zipinfo.c + if (o.unixPermissions && (o.unixPermissions & 0x4000)) { + o.dir = true; + } + // Bit 4 Directory + if (o.dosPermissions && (o.dosPermissions & 0x0010)) { + o.dir = true; + } + + if (o.dir) { + name = forceTrailingSlash(name); + } + if (o.createFolders && (parent = parentFolder(name))) { + folderAdd.call(this, parent, true); + } + + var isUnicodeString = dataType === "string" && o.binary === false && o.base64 === false; + if (!originalOptions || typeof originalOptions.binary === "undefined") { + o.binary = !isUnicodeString; + } + + + var isCompressedEmpty = (data instanceof CompressedObject) && data.uncompressedSize === 0; + + if (isCompressedEmpty || o.dir || !data || data.length === 0) { + o.base64 = false; + o.binary = true; + data = ""; + o.compression = "STORE"; + dataType = "string"; + } + + /* + * Convert content to fit. + */ + + var zipObjectContent = null; + if (data instanceof CompressedObject || data instanceof GenericWorker) { + zipObjectContent = data; + } else if (nodejsUtils.isNode && nodejsUtils.isStream(data)) { + zipObjectContent = new NodejsStreamInputAdapter(name, data); + } else { + zipObjectContent = utils.prepareContent(name, data, o.binary, o.optimizedBinaryString, o.base64); + } + + var object = new ZipObject(name, zipObjectContent, o); + this.files[name] = object; + /* + TODO: we can't throw an exception because we have async promises + (we can have a promise of a Date() for example) but returning a + promise is useless because file(name, data) returns the JSZip + object for chaining. Should we break that to allow the user + to catch the error ? + + return external.Promise.resolve(zipObjectContent) + .then(function () { + return object; + }); + */ +}; + +/** + * Find the parent folder of the path. + * @private + * @param {string} path the path to use + * @return {string} the parent folder, or "" + */ +var parentFolder = function (path) { + if (path.slice(-1) === '/') { + path = path.substring(0, path.length - 1); + } + var lastSlash = path.lastIndexOf('/'); + return (lastSlash > 0) ? path.substring(0, lastSlash) : ""; +}; + +/** + * Returns the path with a slash at the end. + * @private + * @param {String} path the path to check. + * @return {String} the path with a trailing slash. + */ +var forceTrailingSlash = function(path) { + // Check the name ends with a / + if (path.slice(-1) !== "/") { + path += "/"; // IE doesn't like substr(-1) + } + return path; +}; + +/** + * Add a (sub) folder in the current folder. + * @private + * @param {string} name the folder's name + * @param {boolean=} [createFolders] If true, automatically create sub + * folders. Defaults to false. + * @return {Object} the new folder. + */ +var folderAdd = function(name, createFolders) { + createFolders = (typeof createFolders !== 'undefined') ? createFolders : defaults.createFolders; + + name = forceTrailingSlash(name); + + // Does this folder already exist? + if (!this.files[name]) { + fileAdd.call(this, name, null, { + dir: true, + createFolders: createFolders + }); + } + return this.files[name]; +}; + +/** +* Cross-window, cross-Node-context regular expression detection +* @param {Object} object Anything +* @return {Boolean} true if the object is a regular expression, +* false otherwise +*/ +function isRegExp(object) { + return Object.prototype.toString.call(object) === "[object RegExp]"; +} + +// return the actual prototype of JSZip +var out = { + /** + * @see loadAsync + */ + load: function() { + throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide."); + }, + + + /** + * Call a callback function for each entry at this folder level. + * @param {Function} cb the callback function: + * function (relativePath, file) {...} + * It takes 2 arguments : the relative path and the file. + */ + forEach: function(cb) { + var filename, relativePath, file; + /* jshint ignore:start */ + // ignore warning about unwanted properties because this.files is a null prototype object + for (filename in this.files) { + file = this.files[filename]; + relativePath = filename.slice(this.root.length, filename.length); + if (relativePath && filename.slice(0, this.root.length) === this.root) { // the file is in the current root + cb(relativePath, file); // TODO reverse the parameters ? need to be clean AND consistent with the filter search fn... + } + } + /* jshint ignore:end */ + }, + + /** + * Filter nested files/folders with the specified function. + * @param {Function} search the predicate to use : + * function (relativePath, file) {...} + * It takes 2 arguments : the relative path and the file. + * @return {Array} An array of matching elements. + */ + filter: function(search) { + var result = []; + this.forEach(function (relativePath, entry) { + if (search(relativePath, entry)) { // the file matches the function + result.push(entry); + } + + }); + return result; + }, + + /** + * Add a file to the zip file, or search a file. + * @param {string|RegExp} name The name of the file to add (if data is defined), + * the name of the file to find (if no data) or a regex to match files. + * @param {String|ArrayBuffer|Uint8Array|Buffer} data The file data, either raw or base64 encoded + * @param {Object} o File options + * @return {JSZip|Object|Array} this JSZip object (when adding a file), + * a file (when searching by string) or an array of files (when searching by regex). + */ + file: function(name, data, o) { + if (arguments.length === 1) { + if (isRegExp(name)) { + var regexp = name; + return this.filter(function(relativePath, file) { + return !file.dir && regexp.test(relativePath); + }); + } + else { // text + var obj = this.files[this.root + name]; + if (obj && !obj.dir) { + return obj; + } else { + return null; + } + } + } + else { // more than one argument : we have data ! + name = this.root + name; + fileAdd.call(this, name, data, o); + } + return this; + }, + + /** + * Add a directory to the zip file, or search. + * @param {String|RegExp} arg The name of the directory to add, or a regex to search folders. + * @return {JSZip} an object with the new directory as the root, or an array containing matching folders. + */ + folder: function(arg) { + if (!arg) { + return this; + } + + if (isRegExp(arg)) { + return this.filter(function(relativePath, file) { + return file.dir && arg.test(relativePath); + }); + } + + // else, name is a new folder + var name = this.root + arg; + var newFolder = folderAdd.call(this, name); + + // Allow chaining by returning a new object with this folder as the root + var ret = this.clone(); + ret.root = newFolder.name; + return ret; + }, + + /** + * Delete a file, or a directory and all sub-files, from the zip + * @param {string} name the name of the file to delete + * @return {JSZip} this JSZip object + */ + remove: function(name) { + name = this.root + name; + var file = this.files[name]; + if (!file) { + // Look for any folders + if (name.slice(-1) !== "/") { + name += "/"; + } + file = this.files[name]; + } + + if (file && !file.dir) { + // file + delete this.files[name]; + } else { + // maybe a folder, delete recursively + var kids = this.filter(function(relativePath, file) { + return file.name.slice(0, name.length) === name; + }); + for (var i = 0; i < kids.length; i++) { + delete this.files[kids[i].name]; + } + } + + return this; + }, + + /** + * Generate the complete zip file + * @param {Object} options the options to generate the zip file : + * - compression, "STORE" by default. + * - type, "base64" by default. Values are : string, base64, uint8array, arraybuffer, blob. + * @return {String|Uint8Array|ArrayBuffer|Buffer|Blob} the zip file + */ + generate: function(options) { + throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide."); + }, + + /** + * Generate the complete zip file as an internal stream. + * @param {Object} options the options to generate the zip file : + * - compression, "STORE" by default. + * - type, "base64" by default. Values are : string, base64, uint8array, arraybuffer, blob. + * @return {StreamHelper} the streamed zip file. + */ + generateInternalStream: function(options) { + var worker, opts = {}; + try { + opts = utils.extend(options || {}, { + streamFiles: false, + compression: "STORE", + compressionOptions : null, + type: "", + platform: "DOS", + comment: null, + mimeType: 'application/zip', + encodeFileName: utf8.utf8encode + }); + + opts.type = opts.type.toLowerCase(); + opts.compression = opts.compression.toUpperCase(); + + // "binarystring" is preferred but the internals use "string". + if(opts.type === "binarystring") { + opts.type = "string"; + } + + if (!opts.type) { + throw new Error("No output type specified."); + } + + utils.checkSupport(opts.type); + + // accept nodejs `process.platform` + if( + opts.platform === 'darwin' || + opts.platform === 'freebsd' || + opts.platform === 'linux' || + opts.platform === 'sunos' + ) { + opts.platform = "UNIX"; + } + if (opts.platform === 'win32') { + opts.platform = "DOS"; + } + + var comment = opts.comment || this.comment || ""; + worker = generate.generateWorker(this, opts, comment); + } catch (e) { + worker = new GenericWorker("error"); + worker.error(e); + } + return new StreamHelper(worker, opts.type || "string", opts.mimeType); + }, + /** + * Generate the complete zip file asynchronously. + * @see generateInternalStream + */ + generateAsync: function(options, onUpdate) { + return this.generateInternalStream(options).accumulate(onUpdate); + }, + /** + * Generate the complete zip file asynchronously. + * @see generateInternalStream + */ + generateNodeStream: function(options, onUpdate) { + options = options || {}; + if (!options.type) { + options.type = "nodebuffer"; + } + return this.generateInternalStream(options).toNodejsStream(onUpdate); + } +}; +module.exports = out; + +},{"./compressedObject":2,"./defaults":5,"./generate":9,"./nodejs/NodejsStreamInputAdapter":12,"./nodejsUtils":14,"./stream/GenericWorker":28,"./stream/StreamHelper":29,"./utf8":31,"./utils":32,"./zipObject":35}],16:[function(require,module,exports){ +/* + * This file is used by module bundlers (browserify/webpack/etc) when + * including a stream implementation. We use "readable-stream" to get a + * consistent behavior between nodejs versions but bundlers often have a shim + * for "stream". Using this shim greatly improve the compatibility and greatly + * reduce the final size of the bundle (only one stream implementation, not + * two). + */ +module.exports = require("stream"); + +},{"stream":undefined}],17:[function(require,module,exports){ +'use strict'; +var DataReader = require('./DataReader'); +var utils = require('../utils'); + +function ArrayReader(data) { + DataReader.call(this, data); + for(var i = 0; i < this.data.length; i++) { + data[i] = data[i] & 0xFF; + } +} +utils.inherits(ArrayReader, DataReader); +/** + * @see DataReader.byteAt + */ +ArrayReader.prototype.byteAt = function(i) { + return this.data[this.zero + i]; +}; +/** + * @see DataReader.lastIndexOfSignature + */ +ArrayReader.prototype.lastIndexOfSignature = function(sig) { + var sig0 = sig.charCodeAt(0), + sig1 = sig.charCodeAt(1), + sig2 = sig.charCodeAt(2), + sig3 = sig.charCodeAt(3); + for (var i = this.length - 4; i >= 0; --i) { + if (this.data[i] === sig0 && this.data[i + 1] === sig1 && this.data[i + 2] === sig2 && this.data[i + 3] === sig3) { + return i - this.zero; + } + } + + return -1; +}; +/** + * @see DataReader.readAndCheckSignature + */ +ArrayReader.prototype.readAndCheckSignature = function (sig) { + var sig0 = sig.charCodeAt(0), + sig1 = sig.charCodeAt(1), + sig2 = sig.charCodeAt(2), + sig3 = sig.charCodeAt(3), + data = this.readData(4); + return sig0 === data[0] && sig1 === data[1] && sig2 === data[2] && sig3 === data[3]; +}; +/** + * @see DataReader.readData + */ +ArrayReader.prototype.readData = function(size) { + this.checkOffset(size); + if(size === 0) { + return []; + } + var result = this.data.slice(this.zero + this.index, this.zero + this.index + size); + this.index += size; + return result; +}; +module.exports = ArrayReader; + +},{"../utils":32,"./DataReader":18}],18:[function(require,module,exports){ +'use strict'; +var utils = require('../utils'); + +function DataReader(data) { + this.data = data; // type : see implementation + this.length = data.length; + this.index = 0; + this.zero = 0; +} +DataReader.prototype = { + /** + * Check that the offset will not go too far. + * @param {string} offset the additional offset to check. + * @throws {Error} an Error if the offset is out of bounds. + */ + checkOffset: function(offset) { + this.checkIndex(this.index + offset); + }, + /** + * Check that the specified index will not be too far. + * @param {string} newIndex the index to check. + * @throws {Error} an Error if the index is out of bounds. + */ + checkIndex: function(newIndex) { + if (this.length < this.zero + newIndex || newIndex < 0) { + throw new Error("End of data reached (data length = " + this.length + ", asked index = " + (newIndex) + "). Corrupted zip ?"); + } + }, + /** + * Change the index. + * @param {number} newIndex The new index. + * @throws {Error} if the new index is out of the data. + */ + setIndex: function(newIndex) { + this.checkIndex(newIndex); + this.index = newIndex; + }, + /** + * Skip the next n bytes. + * @param {number} n the number of bytes to skip. + * @throws {Error} if the new index is out of the data. + */ + skip: function(n) { + this.setIndex(this.index + n); + }, + /** + * Get the byte at the specified index. + * @param {number} i the index to use. + * @return {number} a byte. + */ + byteAt: function(i) { + // see implementations + }, + /** + * Get the next number with a given byte size. + * @param {number} size the number of bytes to read. + * @return {number} the corresponding number. + */ + readInt: function(size) { + var result = 0, + i; + this.checkOffset(size); + for (i = this.index + size - 1; i >= this.index; i--) { + result = (result << 8) + this.byteAt(i); + } + this.index += size; + return result; + }, + /** + * Get the next string with a given byte size. + * @param {number} size the number of bytes to read. + * @return {string} the corresponding string. + */ + readString: function(size) { + return utils.transformTo("string", this.readData(size)); + }, + /** + * Get raw data without conversion, bytes. + * @param {number} size the number of bytes to read. + * @return {Object} the raw data, implementation specific. + */ + readData: function(size) { + // see implementations + }, + /** + * Find the last occurrence of a zip signature (4 bytes). + * @param {string} sig the signature to find. + * @return {number} the index of the last occurrence, -1 if not found. + */ + lastIndexOfSignature: function(sig) { + // see implementations + }, + /** + * Read the signature (4 bytes) at the current position and compare it with sig. + * @param {string} sig the expected signature + * @return {boolean} true if the signature matches, false otherwise. + */ + readAndCheckSignature: function(sig) { + // see implementations + }, + /** + * Get the next date. + * @return {Date} the date. + */ + readDate: function() { + var dostime = this.readInt(4); + return new Date(Date.UTC( + ((dostime >> 25) & 0x7f) + 1980, // year + ((dostime >> 21) & 0x0f) - 1, // month + (dostime >> 16) & 0x1f, // day + (dostime >> 11) & 0x1f, // hour + (dostime >> 5) & 0x3f, // minute + (dostime & 0x1f) << 1)); // second + } +}; +module.exports = DataReader; + +},{"../utils":32}],19:[function(require,module,exports){ +'use strict'; +var Uint8ArrayReader = require('./Uint8ArrayReader'); +var utils = require('../utils'); + +function NodeBufferReader(data) { + Uint8ArrayReader.call(this, data); +} +utils.inherits(NodeBufferReader, Uint8ArrayReader); + +/** + * @see DataReader.readData + */ +NodeBufferReader.prototype.readData = function(size) { + this.checkOffset(size); + var result = this.data.slice(this.zero + this.index, this.zero + this.index + size); + this.index += size; + return result; +}; +module.exports = NodeBufferReader; + +},{"../utils":32,"./Uint8ArrayReader":21}],20:[function(require,module,exports){ +'use strict'; +var DataReader = require('./DataReader'); +var utils = require('../utils'); + +function StringReader(data) { + DataReader.call(this, data); +} +utils.inherits(StringReader, DataReader); +/** + * @see DataReader.byteAt + */ +StringReader.prototype.byteAt = function(i) { + return this.data.charCodeAt(this.zero + i); +}; +/** + * @see DataReader.lastIndexOfSignature + */ +StringReader.prototype.lastIndexOfSignature = function(sig) { + return this.data.lastIndexOf(sig) - this.zero; +}; +/** + * @see DataReader.readAndCheckSignature + */ +StringReader.prototype.readAndCheckSignature = function (sig) { + var data = this.readData(4); + return sig === data; +}; +/** + * @see DataReader.readData + */ +StringReader.prototype.readData = function(size) { + this.checkOffset(size); + // this will work because the constructor applied the "& 0xff" mask. + var result = this.data.slice(this.zero + this.index, this.zero + this.index + size); + this.index += size; + return result; +}; +module.exports = StringReader; + +},{"../utils":32,"./DataReader":18}],21:[function(require,module,exports){ +'use strict'; +var ArrayReader = require('./ArrayReader'); +var utils = require('../utils'); + +function Uint8ArrayReader(data) { + ArrayReader.call(this, data); +} +utils.inherits(Uint8ArrayReader, ArrayReader); +/** + * @see DataReader.readData + */ +Uint8ArrayReader.prototype.readData = function(size) { + this.checkOffset(size); + if(size === 0) { + // in IE10, when using subarray(idx, idx), we get the array [0x00] instead of []. + return new Uint8Array(0); + } + var result = this.data.subarray(this.zero + this.index, this.zero + this.index + size); + this.index += size; + return result; +}; +module.exports = Uint8ArrayReader; + +},{"../utils":32,"./ArrayReader":17}],22:[function(require,module,exports){ +'use strict'; + +var utils = require('../utils'); +var support = require('../support'); +var ArrayReader = require('./ArrayReader'); +var StringReader = require('./StringReader'); +var NodeBufferReader = require('./NodeBufferReader'); +var Uint8ArrayReader = require('./Uint8ArrayReader'); + +/** + * Create a reader adapted to the data. + * @param {String|ArrayBuffer|Uint8Array|Buffer} data the data to read. + * @return {DataReader} the data reader. + */ +module.exports = function (data) { + var type = utils.getTypeOf(data); + utils.checkSupport(type); + if (type === "string" && !support.uint8array) { + return new StringReader(data); + } + if (type === "nodebuffer") { + return new NodeBufferReader(data); + } + if (support.uint8array) { + return new Uint8ArrayReader(utils.transformTo("uint8array", data)); + } + return new ArrayReader(utils.transformTo("array", data)); +}; + +},{"../support":30,"../utils":32,"./ArrayReader":17,"./NodeBufferReader":19,"./StringReader":20,"./Uint8ArrayReader":21}],23:[function(require,module,exports){ +'use strict'; +exports.LOCAL_FILE_HEADER = "PK\x03\x04"; +exports.CENTRAL_FILE_HEADER = "PK\x01\x02"; +exports.CENTRAL_DIRECTORY_END = "PK\x05\x06"; +exports.ZIP64_CENTRAL_DIRECTORY_LOCATOR = "PK\x06\x07"; +exports.ZIP64_CENTRAL_DIRECTORY_END = "PK\x06\x06"; +exports.DATA_DESCRIPTOR = "PK\x07\x08"; + +},{}],24:[function(require,module,exports){ +'use strict'; + +var GenericWorker = require('./GenericWorker'); +var utils = require('../utils'); + +/** + * A worker which convert chunks to a specified type. + * @constructor + * @param {String} destType the destination type. + */ +function ConvertWorker(destType) { + GenericWorker.call(this, "ConvertWorker to " + destType); + this.destType = destType; +} +utils.inherits(ConvertWorker, GenericWorker); + +/** + * @see GenericWorker.processChunk + */ +ConvertWorker.prototype.processChunk = function (chunk) { + this.push({ + data : utils.transformTo(this.destType, chunk.data), + meta : chunk.meta + }); +}; +module.exports = ConvertWorker; + +},{"../utils":32,"./GenericWorker":28}],25:[function(require,module,exports){ +'use strict'; + +var GenericWorker = require('./GenericWorker'); +var crc32 = require('../crc32'); +var utils = require('../utils'); + +/** + * A worker which calculate the crc32 of the data flowing through. + * @constructor + */ +function Crc32Probe() { + GenericWorker.call(this, "Crc32Probe"); + this.withStreamInfo("crc32", 0); +} +utils.inherits(Crc32Probe, GenericWorker); + +/** + * @see GenericWorker.processChunk + */ +Crc32Probe.prototype.processChunk = function (chunk) { + this.streamInfo.crc32 = crc32(chunk.data, this.streamInfo.crc32 || 0); + this.push(chunk); +}; +module.exports = Crc32Probe; + +},{"../crc32":4,"../utils":32,"./GenericWorker":28}],26:[function(require,module,exports){ +'use strict'; + +var utils = require('../utils'); +var GenericWorker = require('./GenericWorker'); + +/** + * A worker which calculate the total length of the data flowing through. + * @constructor + * @param {String} propName the name used to expose the length + */ +function DataLengthProbe(propName) { + GenericWorker.call(this, "DataLengthProbe for " + propName); + this.propName = propName; + this.withStreamInfo(propName, 0); +} +utils.inherits(DataLengthProbe, GenericWorker); + +/** + * @see GenericWorker.processChunk + */ +DataLengthProbe.prototype.processChunk = function (chunk) { + if(chunk) { + var length = this.streamInfo[this.propName] || 0; + this.streamInfo[this.propName] = length + chunk.data.length; + } + GenericWorker.prototype.processChunk.call(this, chunk); +}; +module.exports = DataLengthProbe; + + +},{"../utils":32,"./GenericWorker":28}],27:[function(require,module,exports){ +'use strict'; + +var utils = require('../utils'); +var GenericWorker = require('./GenericWorker'); + +// the size of the generated chunks +// TODO expose this as a public variable +var DEFAULT_BLOCK_SIZE = 16 * 1024; + +/** + * A worker that reads a content and emits chunks. + * @constructor + * @param {Promise} dataP the promise of the data to split + */ +function DataWorker(dataP) { + GenericWorker.call(this, "DataWorker"); + var self = this; + this.dataIsReady = false; + this.index = 0; + this.max = 0; + this.data = null; + this.type = ""; + + this._tickScheduled = false; + + dataP.then(function (data) { + self.dataIsReady = true; + self.data = data; + self.max = data && data.length || 0; + self.type = utils.getTypeOf(data); + if(!self.isPaused) { + self._tickAndRepeat(); + } + }, function (e) { + self.error(e); + }); +} + +utils.inherits(DataWorker, GenericWorker); + +/** + * @see GenericWorker.cleanUp + */ +DataWorker.prototype.cleanUp = function () { + GenericWorker.prototype.cleanUp.call(this); + this.data = null; +}; + +/** + * @see GenericWorker.resume + */ +DataWorker.prototype.resume = function () { + if(!GenericWorker.prototype.resume.call(this)) { + return false; + } + + if (!this._tickScheduled && this.dataIsReady) { + this._tickScheduled = true; + utils.delay(this._tickAndRepeat, [], this); + } + return true; +}; + +/** + * Trigger a tick a schedule an other call to this function. + */ +DataWorker.prototype._tickAndRepeat = function() { + this._tickScheduled = false; + if(this.isPaused || this.isFinished) { + return; + } + this._tick(); + if(!this.isFinished) { + utils.delay(this._tickAndRepeat, [], this); + this._tickScheduled = true; + } +}; + +/** + * Read and push a chunk. + */ +DataWorker.prototype._tick = function() { + + if(this.isPaused || this.isFinished) { + return false; + } + + var size = DEFAULT_BLOCK_SIZE; + var data = null, nextIndex = Math.min(this.max, this.index + size); + if (this.index >= this.max) { + // EOF + return this.end(); + } else { + switch(this.type) { + case "string": + data = this.data.substring(this.index, nextIndex); + break; + case "uint8array": + data = this.data.subarray(this.index, nextIndex); + break; + case "array": + case "nodebuffer": + data = this.data.slice(this.index, nextIndex); + break; + } + this.index = nextIndex; + return this.push({ + data : data, + meta : { + percent : this.max ? this.index / this.max * 100 : 0 + } + }); + } +}; + +module.exports = DataWorker; + +},{"../utils":32,"./GenericWorker":28}],28:[function(require,module,exports){ +'use strict'; + +/** + * A worker that does nothing but passing chunks to the next one. This is like + * a nodejs stream but with some differences. On the good side : + * - it works on IE 6-9 without any issue / polyfill + * - it weights less than the full dependencies bundled with browserify + * - it forwards errors (no need to declare an error handler EVERYWHERE) + * + * A chunk is an object with 2 attributes : `meta` and `data`. The former is an + * object containing anything (`percent` for example), see each worker for more + * details. The latter is the real data (String, Uint8Array, etc). + * + * @constructor + * @param {String} name the name of the stream (mainly used for debugging purposes) + */ +function GenericWorker(name) { + // the name of the worker + this.name = name || "default"; + // an object containing metadata about the workers chain + this.streamInfo = {}; + // an error which happened when the worker was paused + this.generatedError = null; + // an object containing metadata to be merged by this worker into the general metadata + this.extraStreamInfo = {}; + // true if the stream is paused (and should not do anything), false otherwise + this.isPaused = true; + // true if the stream is finished (and should not do anything), false otherwise + this.isFinished = false; + // true if the stream is locked to prevent further structure updates (pipe), false otherwise + this.isLocked = false; + // the event listeners + this._listeners = { + 'data':[], + 'end':[], + 'error':[] + }; + // the previous worker, if any + this.previous = null; +} + +GenericWorker.prototype = { + /** + * Push a chunk to the next workers. + * @param {Object} chunk the chunk to push + */ + push : function (chunk) { + this.emit("data", chunk); + }, + /** + * End the stream. + * @return {Boolean} true if this call ended the worker, false otherwise. + */ + end : function () { + if (this.isFinished) { + return false; + } + + this.flush(); + try { + this.emit("end"); + this.cleanUp(); + this.isFinished = true; + } catch (e) { + this.emit("error", e); + } + return true; + }, + /** + * End the stream with an error. + * @param {Error} e the error which caused the premature end. + * @return {Boolean} true if this call ended the worker with an error, false otherwise. + */ + error : function (e) { + if (this.isFinished) { + return false; + } + + if(this.isPaused) { + this.generatedError = e; + } else { + this.isFinished = true; + + this.emit("error", e); + + // in the workers chain exploded in the middle of the chain, + // the error event will go downward but we also need to notify + // workers upward that there has been an error. + if(this.previous) { + this.previous.error(e); + } + + this.cleanUp(); + } + return true; + }, + /** + * Add a callback on an event. + * @param {String} name the name of the event (data, end, error) + * @param {Function} listener the function to call when the event is triggered + * @return {GenericWorker} the current object for chainability + */ + on : function (name, listener) { + this._listeners[name].push(listener); + return this; + }, + /** + * Clean any references when a worker is ending. + */ + cleanUp : function () { + this.streamInfo = this.generatedError = this.extraStreamInfo = null; + this._listeners = []; + }, + /** + * Trigger an event. This will call registered callback with the provided arg. + * @param {String} name the name of the event (data, end, error) + * @param {Object} arg the argument to call the callback with. + */ + emit : function (name, arg) { + if (this._listeners[name]) { + for(var i = 0; i < this._listeners[name].length; i++) { + this._listeners[name][i].call(this, arg); + } + } + }, + /** + * Chain a worker with an other. + * @param {Worker} next the worker receiving events from the current one. + * @return {worker} the next worker for chainability + */ + pipe : function (next) { + return next.registerPrevious(this); + }, + /** + * Same as `pipe` in the other direction. + * Using an API with `pipe(next)` is very easy. + * Implementing the API with the point of view of the next one registering + * a source is easier, see the ZipFileWorker. + * @param {Worker} previous the previous worker, sending events to this one + * @return {Worker} the current worker for chainability + */ + registerPrevious : function (previous) { + if (this.isLocked) { + throw new Error("The stream '" + this + "' has already been used."); + } + + // sharing the streamInfo... + this.streamInfo = previous.streamInfo; + // ... and adding our own bits + this.mergeStreamInfo(); + this.previous = previous; + var self = this; + previous.on('data', function (chunk) { + self.processChunk(chunk); + }); + previous.on('end', function () { + self.end(); + }); + previous.on('error', function (e) { + self.error(e); + }); + return this; + }, + /** + * Pause the stream so it doesn't send events anymore. + * @return {Boolean} true if this call paused the worker, false otherwise. + */ + pause : function () { + if(this.isPaused || this.isFinished) { + return false; + } + this.isPaused = true; + + if(this.previous) { + this.previous.pause(); + } + return true; + }, + /** + * Resume a paused stream. + * @return {Boolean} true if this call resumed the worker, false otherwise. + */ + resume : function () { + if(!this.isPaused || this.isFinished) { + return false; + } + this.isPaused = false; + + // if true, the worker tried to resume but failed + var withError = false; + if(this.generatedError) { + this.error(this.generatedError); + withError = true; + } + if(this.previous) { + this.previous.resume(); + } + + return !withError; + }, + /** + * Flush any remaining bytes as the stream is ending. + */ + flush : function () {}, + /** + * Process a chunk. This is usually the method overridden. + * @param {Object} chunk the chunk to process. + */ + processChunk : function(chunk) { + this.push(chunk); + }, + /** + * Add a key/value to be added in the workers chain streamInfo once activated. + * @param {String} key the key to use + * @param {Object} value the associated value + * @return {Worker} the current worker for chainability + */ + withStreamInfo : function (key, value) { + this.extraStreamInfo[key] = value; + this.mergeStreamInfo(); + return this; + }, + /** + * Merge this worker's streamInfo into the chain's streamInfo. + */ + mergeStreamInfo : function () { + for(var key in this.extraStreamInfo) { + if (!this.extraStreamInfo.hasOwnProperty(key)) { + continue; + } + this.streamInfo[key] = this.extraStreamInfo[key]; + } + }, + + /** + * Lock the stream to prevent further updates on the workers chain. + * After calling this method, all calls to pipe will fail. + */ + lock: function () { + if (this.isLocked) { + throw new Error("The stream '" + this + "' has already been used."); + } + this.isLocked = true; + if (this.previous) { + this.previous.lock(); + } + }, + + /** + * + * Pretty print the workers chain. + */ + toString : function () { + var me = "Worker " + this.name; + if (this.previous) { + return this.previous + " -> " + me; + } else { + return me; + } + } +}; + +module.exports = GenericWorker; + +},{}],29:[function(require,module,exports){ +'use strict'; + +var utils = require('../utils'); +var ConvertWorker = require('./ConvertWorker'); +var GenericWorker = require('./GenericWorker'); +var base64 = require('../base64'); +var support = require("../support"); +var external = require("../external"); + +var NodejsStreamOutputAdapter = null; +if (support.nodestream) { + try { + NodejsStreamOutputAdapter = require('../nodejs/NodejsStreamOutputAdapter'); + } catch(e) {} +} + +/** + * Apply the final transformation of the data. If the user wants a Blob for + * example, it's easier to work with an U8intArray and finally do the + * ArrayBuffer/Blob conversion. + * @param {String} type the name of the final type + * @param {String|Uint8Array|Buffer} content the content to transform + * @param {String} mimeType the mime type of the content, if applicable. + * @return {String|Uint8Array|ArrayBuffer|Buffer|Blob} the content in the right format. + */ +function transformZipOutput(type, content, mimeType) { + switch(type) { + case "blob" : + return utils.newBlob(utils.transformTo("arraybuffer", content), mimeType); + case "base64" : + return base64.encode(content); + default : + return utils.transformTo(type, content); + } +} + +/** + * Concatenate an array of data of the given type. + * @param {String} type the type of the data in the given array. + * @param {Array} dataArray the array containing the data chunks to concatenate + * @return {String|Uint8Array|Buffer} the concatenated data + * @throws Error if the asked type is unsupported + */ +function concat (type, dataArray) { + var i, index = 0, res = null, totalLength = 0; + for(i = 0; i < dataArray.length; i++) { + totalLength += dataArray[i].length; + } + switch(type) { + case "string": + return dataArray.join(""); + case "array": + return Array.prototype.concat.apply([], dataArray); + case "uint8array": + res = new Uint8Array(totalLength); + for(i = 0; i < dataArray.length; i++) { + res.set(dataArray[i], index); + index += dataArray[i].length; + } + return res; + case "nodebuffer": + return Buffer.concat(dataArray); + default: + throw new Error("concat : unsupported type '" + type + "'"); + } +} + +/** + * Listen a StreamHelper, accumulate its content and concatenate it into a + * complete block. + * @param {StreamHelper} helper the helper to use. + * @param {Function} updateCallback a callback called on each update. Called + * with one arg : + * - the metadata linked to the update received. + * @return Promise the promise for the accumulation. + */ +function accumulate(helper, updateCallback) { + return new external.Promise(function (resolve, reject){ + var dataArray = []; + var chunkType = helper._internalType, + resultType = helper._outputType, + mimeType = helper._mimeType; + helper + .on('data', function (data, meta) { + dataArray.push(data); + if(updateCallback) { + updateCallback(meta); + } + }) + .on('error', function(err) { + dataArray = []; + reject(err); + }) + .on('end', function (){ + try { + var result = transformZipOutput(resultType, concat(chunkType, dataArray), mimeType); + resolve(result); + } catch (e) { + reject(e); + } + dataArray = []; + }) + .resume(); + }); +} + +/** + * An helper to easily use workers outside of JSZip. + * @constructor + * @param {Worker} worker the worker to wrap + * @param {String} outputType the type of data expected by the use + * @param {String} mimeType the mime type of the content, if applicable. + */ +function StreamHelper(worker, outputType, mimeType) { + var internalType = outputType; + switch(outputType) { + case "blob": + case "arraybuffer": + internalType = "uint8array"; + break; + case "base64": + internalType = "string"; + break; + } + + try { + // the type used internally + this._internalType = internalType; + // the type used to output results + this._outputType = outputType; + // the mime type + this._mimeType = mimeType; + utils.checkSupport(internalType); + this._worker = worker.pipe(new ConvertWorker(internalType)); + // the last workers can be rewired without issues but we need to + // prevent any updates on previous workers. + worker.lock(); + } catch(e) { + this._worker = new GenericWorker("error"); + this._worker.error(e); + } +} + +StreamHelper.prototype = { + /** + * Listen a StreamHelper, accumulate its content and concatenate it into a + * complete block. + * @param {Function} updateCb the update callback. + * @return Promise the promise for the accumulation. + */ + accumulate : function (updateCb) { + return accumulate(this, updateCb); + }, + /** + * Add a listener on an event triggered on a stream. + * @param {String} evt the name of the event + * @param {Function} fn the listener + * @return {StreamHelper} the current helper. + */ + on : function (evt, fn) { + var self = this; + + if(evt === "data") { + this._worker.on(evt, function (chunk) { + fn.call(self, chunk.data, chunk.meta); + }); + } else { + this._worker.on(evt, function () { + utils.delay(fn, arguments, self); + }); + } + return this; + }, + /** + * Resume the flow of chunks. + * @return {StreamHelper} the current helper. + */ + resume : function () { + utils.delay(this._worker.resume, [], this._worker); + return this; + }, + /** + * Pause the flow of chunks. + * @return {StreamHelper} the current helper. + */ + pause : function () { + this._worker.pause(); + return this; + }, + /** + * Return a nodejs stream for this helper. + * @param {Function} updateCb the update callback. + * @return {NodejsStreamOutputAdapter} the nodejs stream. + */ + toNodejsStream : function (updateCb) { + utils.checkSupport("nodestream"); + if (this._outputType !== "nodebuffer") { + // an object stream containing blob/arraybuffer/uint8array/string + // is strange and I don't know if it would be useful. + // I you find this comment and have a good usecase, please open a + // bug report ! + throw new Error(this._outputType + " is not supported by this method"); + } + + return new NodejsStreamOutputAdapter(this, { + objectMode : this._outputType !== "nodebuffer" + }, updateCb); + } +}; + + +module.exports = StreamHelper; + +},{"../base64":1,"../external":6,"../nodejs/NodejsStreamOutputAdapter":13,"../support":30,"../utils":32,"./ConvertWorker":24,"./GenericWorker":28}],30:[function(require,module,exports){ +'use strict'; + +exports.base64 = true; +exports.array = true; +exports.string = true; +exports.arraybuffer = typeof ArrayBuffer !== "undefined" && typeof Uint8Array !== "undefined"; +exports.nodebuffer = typeof Buffer !== "undefined"; +// contains true if JSZip can read/generate Uint8Array, false otherwise. +exports.uint8array = typeof Uint8Array !== "undefined"; + +if (typeof ArrayBuffer === "undefined") { + exports.blob = false; +} +else { + var buffer = new ArrayBuffer(0); + try { + exports.blob = new Blob([buffer], { + type: "application/zip" + }).size === 0; + } + catch (e) { + try { + var Builder = self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder; + var builder = new Builder(); + builder.append(buffer); + exports.blob = builder.getBlob('application/zip').size === 0; + } + catch (e) { + exports.blob = false; + } + } +} + +try { + exports.nodestream = !!require('readable-stream').Readable; +} catch(e) { + exports.nodestream = false; +} + +},{"readable-stream":16}],31:[function(require,module,exports){ +'use strict'; + +var utils = require('./utils'); +var support = require('./support'); +var nodejsUtils = require('./nodejsUtils'); +var GenericWorker = require('./stream/GenericWorker'); + +/** + * The following functions come from pako, from pako/lib/utils/strings + * released under the MIT license, see pako https://github.com/nodeca/pako/ + */ + +// Table with utf8 lengths (calculated by first byte of sequence) +// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS, +// because max possible codepoint is 0x10ffff +var _utf8len = new Array(256); +for (var i=0; i<256; i++) { + _utf8len[i] = (i >= 252 ? 6 : i >= 248 ? 5 : i >= 240 ? 4 : i >= 224 ? 3 : i >= 192 ? 2 : 1); +} +_utf8len[254]=_utf8len[254]=1; // Invalid sequence start + +// convert string to array (typed, when possible) +var string2buf = function (str) { + var buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0; + + // count binary size + for (m_pos = 0; m_pos < str_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && (m_pos+1 < str_len)) { + c2 = str.charCodeAt(m_pos+1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00); + m_pos++; + } + } + buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4; + } + + // allocate buffer + if (support.uint8array) { + buf = new Uint8Array(buf_len); + } else { + buf = new Array(buf_len); + } + + // convert + for (i=0, m_pos = 0; i < buf_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && (m_pos+1 < str_len)) { + c2 = str.charCodeAt(m_pos+1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00); + m_pos++; + } + } + if (c < 0x80) { + /* one byte */ + buf[i++] = c; + } else if (c < 0x800) { + /* two bytes */ + buf[i++] = 0xC0 | (c >>> 6); + buf[i++] = 0x80 | (c & 0x3f); + } else if (c < 0x10000) { + /* three bytes */ + buf[i++] = 0xE0 | (c >>> 12); + buf[i++] = 0x80 | (c >>> 6 & 0x3f); + buf[i++] = 0x80 | (c & 0x3f); + } else { + /* four bytes */ + buf[i++] = 0xf0 | (c >>> 18); + buf[i++] = 0x80 | (c >>> 12 & 0x3f); + buf[i++] = 0x80 | (c >>> 6 & 0x3f); + buf[i++] = 0x80 | (c & 0x3f); + } + } + + return buf; +}; + +// Calculate max possible position in utf8 buffer, +// that will not break sequence. If that's not possible +// - (very small limits) return max size as is. +// +// buf[] - utf8 bytes array +// max - length limit (mandatory); +var utf8border = function(buf, max) { + var pos; + + max = max || buf.length; + if (max > buf.length) { max = buf.length; } + + // go back from last position, until start of sequence found + pos = max-1; + while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; } + + // Fuckup - very small and broken sequence, + // return max, because we should return something anyway. + if (pos < 0) { return max; } + + // If we came to start of buffer - that means vuffer is too small, + // return max too. + if (pos === 0) { return max; } + + return (pos + _utf8len[buf[pos]] > max) ? pos : max; +}; + +// convert array to string +var buf2string = function (buf) { + var str, i, out, c, c_len; + var len = buf.length; + + // Reserve max possible length (2 words per char) + // NB: by unknown reasons, Array is significantly faster for + // String.fromCharCode.apply than Uint16Array. + var utf16buf = new Array(len*2); + + for (out=0, i=0; i 4) { utf16buf[out++] = 0xfffd; i += c_len-1; continue; } + + // apply mask on first byte + c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07; + // join the rest + while (c_len > 1 && i < len) { + c = (c << 6) | (buf[i++] & 0x3f); + c_len--; + } + + // terminated by end of string? + if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; } + + if (c < 0x10000) { + utf16buf[out++] = c; + } else { + c -= 0x10000; + utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff); + utf16buf[out++] = 0xdc00 | (c & 0x3ff); + } + } + + // shrinkBuf(utf16buf, out) + if (utf16buf.length !== out) { + if(utf16buf.subarray) { + utf16buf = utf16buf.subarray(0, out); + } else { + utf16buf.length = out; + } + } + + // return String.fromCharCode.apply(null, utf16buf); + return utils.applyFromCharCode(utf16buf); +}; + + +// That's all for the pako functions. + + +/** + * Transform a javascript string into an array (typed if possible) of bytes, + * UTF-8 encoded. + * @param {String} str the string to encode + * @return {Array|Uint8Array|Buffer} the UTF-8 encoded string. + */ +exports.utf8encode = function utf8encode(str) { + if (support.nodebuffer) { + return nodejsUtils.newBufferFrom(str, "utf-8"); + } + + return string2buf(str); +}; + + +/** + * Transform a bytes array (or a representation) representing an UTF-8 encoded + * string into a javascript string. + * @param {Array|Uint8Array|Buffer} buf the data de decode + * @return {String} the decoded string. + */ +exports.utf8decode = function utf8decode(buf) { + if (support.nodebuffer) { + return utils.transformTo("nodebuffer", buf).toString("utf-8"); + } + + buf = utils.transformTo(support.uint8array ? "uint8array" : "array", buf); + + return buf2string(buf); +}; + +/** + * A worker to decode utf8 encoded binary chunks into string chunks. + * @constructor + */ +function Utf8DecodeWorker() { + GenericWorker.call(this, "utf-8 decode"); + // the last bytes if a chunk didn't end with a complete codepoint. + this.leftOver = null; +} +utils.inherits(Utf8DecodeWorker, GenericWorker); + +/** + * @see GenericWorker.processChunk + */ +Utf8DecodeWorker.prototype.processChunk = function (chunk) { + + var data = utils.transformTo(support.uint8array ? "uint8array" : "array", chunk.data); + + // 1st step, re-use what's left of the previous chunk + if (this.leftOver && this.leftOver.length) { + if(support.uint8array) { + var previousData = data; + data = new Uint8Array(previousData.length + this.leftOver.length); + data.set(this.leftOver, 0); + data.set(previousData, this.leftOver.length); + } else { + data = this.leftOver.concat(data); + } + this.leftOver = null; + } + + var nextBoundary = utf8border(data); + var usableData = data; + if (nextBoundary !== data.length) { + if (support.uint8array) { + usableData = data.subarray(0, nextBoundary); + this.leftOver = data.subarray(nextBoundary, data.length); + } else { + usableData = data.slice(0, nextBoundary); + this.leftOver = data.slice(nextBoundary, data.length); + } + } + + this.push({ + data : exports.utf8decode(usableData), + meta : chunk.meta + }); +}; + +/** + * @see GenericWorker.flush + */ +Utf8DecodeWorker.prototype.flush = function () { + if(this.leftOver && this.leftOver.length) { + this.push({ + data : exports.utf8decode(this.leftOver), + meta : {} + }); + this.leftOver = null; + } +}; +exports.Utf8DecodeWorker = Utf8DecodeWorker; + +/** + * A worker to endcode string chunks into utf8 encoded binary chunks. + * @constructor + */ +function Utf8EncodeWorker() { + GenericWorker.call(this, "utf-8 encode"); +} +utils.inherits(Utf8EncodeWorker, GenericWorker); + +/** + * @see GenericWorker.processChunk + */ +Utf8EncodeWorker.prototype.processChunk = function (chunk) { + this.push({ + data : exports.utf8encode(chunk.data), + meta : chunk.meta + }); +}; +exports.Utf8EncodeWorker = Utf8EncodeWorker; + +},{"./nodejsUtils":14,"./stream/GenericWorker":28,"./support":30,"./utils":32}],32:[function(require,module,exports){ +'use strict'; + +var support = require('./support'); +var base64 = require('./base64'); +var nodejsUtils = require('./nodejsUtils'); +var setImmediate = require('set-immediate-shim'); +var external = require("./external"); + + +/** + * Convert a string that pass as a "binary string": it should represent a byte + * array but may have > 255 char codes. Be sure to take only the first byte + * and returns the byte array. + * @param {String} str the string to transform. + * @return {Array|Uint8Array} the string in a binary format. + */ +function string2binary(str) { + var result = null; + if (support.uint8array) { + result = new Uint8Array(str.length); + } else { + result = new Array(str.length); + } + return stringToArrayLike(str, result); +} + +/** + * Create a new blob with the given content and the given type. + * @param {String|ArrayBuffer} part the content to put in the blob. DO NOT use + * an Uint8Array because the stock browser of android 4 won't accept it (it + * will be silently converted to a string, "[object Uint8Array]"). + * + * Use only ONE part to build the blob to avoid a memory leak in IE11 / Edge: + * when a large amount of Array is used to create the Blob, the amount of + * memory consumed is nearly 100 times the original data amount. + * + * @param {String} type the mime type of the blob. + * @return {Blob} the created blob. + */ +exports.newBlob = function(part, type) { + exports.checkSupport("blob"); + + try { + // Blob constructor + return new Blob([part], { + type: type + }); + } + catch (e) { + + try { + // deprecated, browser only, old way + var Builder = self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder; + var builder = new Builder(); + builder.append(part); + return builder.getBlob(type); + } + catch (e) { + + // well, fuck ?! + throw new Error("Bug : can't construct the Blob."); + } + } + + +}; +/** + * The identity function. + * @param {Object} input the input. + * @return {Object} the same input. + */ +function identity(input) { + return input; +} + +/** + * Fill in an array with a string. + * @param {String} str the string to use. + * @param {Array|ArrayBuffer|Uint8Array|Buffer} array the array to fill in (will be mutated). + * @return {Array|ArrayBuffer|Uint8Array|Buffer} the updated array. + */ +function stringToArrayLike(str, array) { + for (var i = 0; i < str.length; ++i) { + array[i] = str.charCodeAt(i) & 0xFF; + } + return array; +} + +/** + * An helper for the function arrayLikeToString. + * This contains static information and functions that + * can be optimized by the browser JIT compiler. + */ +var arrayToStringHelper = { + /** + * Transform an array of int into a string, chunk by chunk. + * See the performances notes on arrayLikeToString. + * @param {Array|ArrayBuffer|Uint8Array|Buffer} array the array to transform. + * @param {String} type the type of the array. + * @param {Integer} chunk the chunk size. + * @return {String} the resulting string. + * @throws Error if the chunk is too big for the stack. + */ + stringifyByChunk: function(array, type, chunk) { + var result = [], k = 0, len = array.length; + // shortcut + if (len <= chunk) { + return String.fromCharCode.apply(null, array); + } + while (k < len) { + if (type === "array" || type === "nodebuffer") { + result.push(String.fromCharCode.apply(null, array.slice(k, Math.min(k + chunk, len)))); + } + else { + result.push(String.fromCharCode.apply(null, array.subarray(k, Math.min(k + chunk, len)))); + } + k += chunk; + } + return result.join(""); + }, + /** + * Call String.fromCharCode on every item in the array. + * This is the naive implementation, which generate A LOT of intermediate string. + * This should be used when everything else fail. + * @param {Array|ArrayBuffer|Uint8Array|Buffer} array the array to transform. + * @return {String} the result. + */ + stringifyByChar: function(array){ + var resultStr = ""; + for(var i = 0; i < array.length; i++) { + resultStr += String.fromCharCode(array[i]); + } + return resultStr; + }, + applyCanBeUsed : { + /** + * true if the browser accepts to use String.fromCharCode on Uint8Array + */ + uint8array : (function () { + try { + return support.uint8array && String.fromCharCode.apply(null, new Uint8Array(1)).length === 1; + } catch (e) { + return false; + } + })(), + /** + * true if the browser accepts to use String.fromCharCode on nodejs Buffer. + */ + nodebuffer : (function () { + try { + return support.nodebuffer && String.fromCharCode.apply(null, nodejsUtils.allocBuffer(1)).length === 1; + } catch (e) { + return false; + } + })() + } +}; + +/** + * Transform an array-like object to a string. + * @param {Array|ArrayBuffer|Uint8Array|Buffer} array the array to transform. + * @return {String} the result. + */ +function arrayLikeToString(array) { + // Performances notes : + // -------------------- + // String.fromCharCode.apply(null, array) is the fastest, see + // see http://jsperf.com/converting-a-uint8array-to-a-string/2 + // but the stack is limited (and we can get huge arrays !). + // + // result += String.fromCharCode(array[i]); generate too many strings ! + // + // This code is inspired by http://jsperf.com/arraybuffer-to-string-apply-performance/2 + // TODO : we now have workers that split the work. Do we still need that ? + var chunk = 65536, + type = exports.getTypeOf(array), + canUseApply = true; + if (type === "uint8array") { + canUseApply = arrayToStringHelper.applyCanBeUsed.uint8array; + } else if (type === "nodebuffer") { + canUseApply = arrayToStringHelper.applyCanBeUsed.nodebuffer; + } + + if (canUseApply) { + while (chunk > 1) { + try { + return arrayToStringHelper.stringifyByChunk(array, type, chunk); + } catch (e) { + chunk = Math.floor(chunk / 2); + } + } + } + + // no apply or chunk error : slow and painful algorithm + // default browser on android 4.* + return arrayToStringHelper.stringifyByChar(array); +} + +exports.applyFromCharCode = arrayLikeToString; + + +/** + * Copy the data from an array-like to an other array-like. + * @param {Array|ArrayBuffer|Uint8Array|Buffer} arrayFrom the origin array. + * @param {Array|ArrayBuffer|Uint8Array|Buffer} arrayTo the destination array which will be mutated. + * @return {Array|ArrayBuffer|Uint8Array|Buffer} the updated destination array. + */ +function arrayLikeToArrayLike(arrayFrom, arrayTo) { + for (var i = 0; i < arrayFrom.length; i++) { + arrayTo[i] = arrayFrom[i]; + } + return arrayTo; +} + +// a matrix containing functions to transform everything into everything. +var transform = {}; + +// string to ? +transform["string"] = { + "string": identity, + "array": function(input) { + return stringToArrayLike(input, new Array(input.length)); + }, + "arraybuffer": function(input) { + return transform["string"]["uint8array"](input).buffer; + }, + "uint8array": function(input) { + return stringToArrayLike(input, new Uint8Array(input.length)); + }, + "nodebuffer": function(input) { + return stringToArrayLike(input, nodejsUtils.allocBuffer(input.length)); + } +}; + +// array to ? +transform["array"] = { + "string": arrayLikeToString, + "array": identity, + "arraybuffer": function(input) { + return (new Uint8Array(input)).buffer; + }, + "uint8array": function(input) { + return new Uint8Array(input); + }, + "nodebuffer": function(input) { + return nodejsUtils.newBufferFrom(input); + } +}; + +// arraybuffer to ? +transform["arraybuffer"] = { + "string": function(input) { + return arrayLikeToString(new Uint8Array(input)); + }, + "array": function(input) { + return arrayLikeToArrayLike(new Uint8Array(input), new Array(input.byteLength)); + }, + "arraybuffer": identity, + "uint8array": function(input) { + return new Uint8Array(input); + }, + "nodebuffer": function(input) { + return nodejsUtils.newBufferFrom(new Uint8Array(input)); + } +}; + +// uint8array to ? +transform["uint8array"] = { + "string": arrayLikeToString, + "array": function(input) { + return arrayLikeToArrayLike(input, new Array(input.length)); + }, + "arraybuffer": function(input) { + return input.buffer; + }, + "uint8array": identity, + "nodebuffer": function(input) { + return nodejsUtils.newBufferFrom(input); + } +}; + +// nodebuffer to ? +transform["nodebuffer"] = { + "string": arrayLikeToString, + "array": function(input) { + return arrayLikeToArrayLike(input, new Array(input.length)); + }, + "arraybuffer": function(input) { + return transform["nodebuffer"]["uint8array"](input).buffer; + }, + "uint8array": function(input) { + return arrayLikeToArrayLike(input, new Uint8Array(input.length)); + }, + "nodebuffer": identity +}; + +/** + * Transform an input into any type. + * The supported output type are : string, array, uint8array, arraybuffer, nodebuffer. + * If no output type is specified, the unmodified input will be returned. + * @param {String} outputType the output type. + * @param {String|Array|ArrayBuffer|Uint8Array|Buffer} input the input to convert. + * @throws {Error} an Error if the browser doesn't support the requested output type. + */ +exports.transformTo = function(outputType, input) { + if (!input) { + // undefined, null, etc + // an empty string won't harm. + input = ""; + } + if (!outputType) { + return input; + } + exports.checkSupport(outputType); + var inputType = exports.getTypeOf(input); + var result = transform[inputType][outputType](input); + return result; +}; + +/** + * Return the type of the input. + * The type will be in a format valid for JSZip.utils.transformTo : string, array, uint8array, arraybuffer. + * @param {Object} input the input to identify. + * @return {String} the (lowercase) type of the input. + */ +exports.getTypeOf = function(input) { + if (typeof input === "string") { + return "string"; + } + if (Object.prototype.toString.call(input) === "[object Array]") { + return "array"; + } + if (support.nodebuffer && nodejsUtils.isBuffer(input)) { + return "nodebuffer"; + } + if (support.uint8array && input instanceof Uint8Array) { + return "uint8array"; + } + if (support.arraybuffer && input instanceof ArrayBuffer) { + return "arraybuffer"; + } +}; + +/** + * Throw an exception if the type is not supported. + * @param {String} type the type to check. + * @throws {Error} an Error if the browser doesn't support the requested type. + */ +exports.checkSupport = function(type) { + var supported = support[type.toLowerCase()]; + if (!supported) { + throw new Error(type + " is not supported by this platform"); + } +}; + +exports.MAX_VALUE_16BITS = 65535; +exports.MAX_VALUE_32BITS = -1; // well, "\xFF\xFF\xFF\xFF\xFF\xFF\xFF\xFF" is parsed as -1 + +/** + * Prettify a string read as binary. + * @param {string} str the string to prettify. + * @return {string} a pretty string. + */ +exports.pretty = function(str) { + var res = '', + code, i; + for (i = 0; i < (str || "").length; i++) { + code = str.charCodeAt(i); + res += '\\x' + (code < 16 ? "0" : "") + code.toString(16).toUpperCase(); + } + return res; +}; + +/** + * Defer the call of a function. + * @param {Function} callback the function to call asynchronously. + * @param {Array} args the arguments to give to the callback. + */ +exports.delay = function(callback, args, self) { + setImmediate(function () { + callback.apply(self || null, args || []); + }); +}; + +/** + * Extends a prototype with an other, without calling a constructor with + * side effects. Inspired by nodejs' `utils.inherits` + * @param {Function} ctor the constructor to augment + * @param {Function} superCtor the parent constructor to use + */ +exports.inherits = function (ctor, superCtor) { + var Obj = function() {}; + Obj.prototype = superCtor.prototype; + ctor.prototype = new Obj(); +}; + +/** + * Merge the objects passed as parameters into a new one. + * @private + * @param {...Object} var_args All objects to merge. + * @return {Object} a new object with the data of the others. + */ +exports.extend = function() { + var result = {}, i, attr; + for (i = 0; i < arguments.length; i++) { // arguments is not enumerable in some browsers + for (attr in arguments[i]) { + if (arguments[i].hasOwnProperty(attr) && typeof result[attr] === "undefined") { + result[attr] = arguments[i][attr]; + } + } + } + return result; +}; + +/** + * Transform arbitrary content into a Promise. + * @param {String} name a name for the content being processed. + * @param {Object} inputData the content to process. + * @param {Boolean} isBinary true if the content is not an unicode string + * @param {Boolean} isOptimizedBinaryString true if the string content only has one byte per character. + * @param {Boolean} isBase64 true if the string content is encoded with base64. + * @return {Promise} a promise in a format usable by JSZip. + */ +exports.prepareContent = function(name, inputData, isBinary, isOptimizedBinaryString, isBase64) { + + // if inputData is already a promise, this flatten it. + var promise = external.Promise.resolve(inputData).then(function(data) { + + + var isBlob = support.blob && (data instanceof Blob || ['[object File]', '[object Blob]'].indexOf(Object.prototype.toString.call(data)) !== -1); + + if (isBlob && typeof FileReader !== "undefined") { + return new external.Promise(function (resolve, reject) { + var reader = new FileReader(); + + reader.onload = function(e) { + resolve(e.target.result); + }; + reader.onerror = function(e) { + reject(e.target.error); + }; + reader.readAsArrayBuffer(data); + }); + } else { + return data; + } + }); + + return promise.then(function(data) { + var dataType = exports.getTypeOf(data); + + if (!dataType) { + return external.Promise.reject( + new Error("Can't read the data of '" + name + "'. Is it " + + "in a supported JavaScript type (String, Blob, ArrayBuffer, etc) ?") + ); + } + // special case : it's way easier to work with Uint8Array than with ArrayBuffer + if (dataType === "arraybuffer") { + data = exports.transformTo("uint8array", data); + } else if (dataType === "string") { + if (isBase64) { + data = base64.decode(data); + } + else if (isBinary) { + // optimizedBinaryString === true means that the file has already been filtered with a 0xFF mask + if (isOptimizedBinaryString !== true) { + // this is a string, not in a base64 format. + // Be sure that this is a correct "binary string" + data = string2binary(data); + } + } + } + return data; + }); +}; + +},{"./base64":1,"./external":6,"./nodejsUtils":14,"./support":30,"set-immediate-shim":54}],33:[function(require,module,exports){ +'use strict'; +var readerFor = require('./reader/readerFor'); +var utils = require('./utils'); +var sig = require('./signature'); +var ZipEntry = require('./zipEntry'); +var utf8 = require('./utf8'); +var support = require('./support'); +// class ZipEntries {{{ +/** + * All the entries in the zip file. + * @constructor + * @param {Object} loadOptions Options for loading the stream. + */ +function ZipEntries(loadOptions) { + this.files = []; + this.loadOptions = loadOptions; +} +ZipEntries.prototype = { + /** + * Check that the reader is on the specified signature. + * @param {string} expectedSignature the expected signature. + * @throws {Error} if it is an other signature. + */ + checkSignature: function(expectedSignature) { + if (!this.reader.readAndCheckSignature(expectedSignature)) { + this.reader.index -= 4; + var signature = this.reader.readString(4); + throw new Error("Corrupted zip or bug: unexpected signature " + "(" + utils.pretty(signature) + ", expected " + utils.pretty(expectedSignature) + ")"); + } + }, + /** + * Check if the given signature is at the given index. + * @param {number} askedIndex the index to check. + * @param {string} expectedSignature the signature to expect. + * @return {boolean} true if the signature is here, false otherwise. + */ + isSignature: function(askedIndex, expectedSignature) { + var currentIndex = this.reader.index; + this.reader.setIndex(askedIndex); + var signature = this.reader.readString(4); + var result = signature === expectedSignature; + this.reader.setIndex(currentIndex); + return result; + }, + /** + * Read the end of the central directory. + */ + readBlockEndOfCentral: function() { + this.diskNumber = this.reader.readInt(2); + this.diskWithCentralDirStart = this.reader.readInt(2); + this.centralDirRecordsOnThisDisk = this.reader.readInt(2); + this.centralDirRecords = this.reader.readInt(2); + this.centralDirSize = this.reader.readInt(4); + this.centralDirOffset = this.reader.readInt(4); + + this.zipCommentLength = this.reader.readInt(2); + // warning : the encoding depends of the system locale + // On a linux machine with LANG=en_US.utf8, this field is utf8 encoded. + // On a windows machine, this field is encoded with the localized windows code page. + var zipComment = this.reader.readData(this.zipCommentLength); + var decodeParamType = support.uint8array ? "uint8array" : "array"; + // To get consistent behavior with the generation part, we will assume that + // this is utf8 encoded unless specified otherwise. + var decodeContent = utils.transformTo(decodeParamType, zipComment); + this.zipComment = this.loadOptions.decodeFileName(decodeContent); + }, + /** + * Read the end of the Zip 64 central directory. + * Not merged with the method readEndOfCentral : + * The end of central can coexist with its Zip64 brother, + * I don't want to read the wrong number of bytes ! + */ + readBlockZip64EndOfCentral: function() { + this.zip64EndOfCentralSize = this.reader.readInt(8); + this.reader.skip(4); + // this.versionMadeBy = this.reader.readString(2); + // this.versionNeeded = this.reader.readInt(2); + this.diskNumber = this.reader.readInt(4); + this.diskWithCentralDirStart = this.reader.readInt(4); + this.centralDirRecordsOnThisDisk = this.reader.readInt(8); + this.centralDirRecords = this.reader.readInt(8); + this.centralDirSize = this.reader.readInt(8); + this.centralDirOffset = this.reader.readInt(8); + + this.zip64ExtensibleData = {}; + var extraDataSize = this.zip64EndOfCentralSize - 44, + index = 0, + extraFieldId, + extraFieldLength, + extraFieldValue; + while (index < extraDataSize) { + extraFieldId = this.reader.readInt(2); + extraFieldLength = this.reader.readInt(4); + extraFieldValue = this.reader.readData(extraFieldLength); + this.zip64ExtensibleData[extraFieldId] = { + id: extraFieldId, + length: extraFieldLength, + value: extraFieldValue + }; + } + }, + /** + * Read the end of the Zip 64 central directory locator. + */ + readBlockZip64EndOfCentralLocator: function() { + this.diskWithZip64CentralDirStart = this.reader.readInt(4); + this.relativeOffsetEndOfZip64CentralDir = this.reader.readInt(8); + this.disksCount = this.reader.readInt(4); + if (this.disksCount > 1) { + throw new Error("Multi-volumes zip are not supported"); + } + }, + /** + * Read the local files, based on the offset read in the central part. + */ + readLocalFiles: function() { + var i, file; + for (i = 0; i < this.files.length; i++) { + file = this.files[i]; + this.reader.setIndex(file.localHeaderOffset); + this.checkSignature(sig.LOCAL_FILE_HEADER); + file.readLocalPart(this.reader); + file.handleUTF8(); + file.processAttributes(); + } + }, + /** + * Read the central directory. + */ + readCentralDir: function() { + var file; + + this.reader.setIndex(this.centralDirOffset); + while (this.reader.readAndCheckSignature(sig.CENTRAL_FILE_HEADER)) { + file = new ZipEntry({ + zip64: this.zip64 + }, this.loadOptions); + file.readCentralPart(this.reader); + this.files.push(file); + } + + if (this.centralDirRecords !== this.files.length) { + if (this.centralDirRecords !== 0 && this.files.length === 0) { + // We expected some records but couldn't find ANY. + // This is really suspicious, as if something went wrong. + throw new Error("Corrupted zip or bug: expected " + this.centralDirRecords + " records in central dir, got " + this.files.length); + } else { + // We found some records but not all. + // Something is wrong but we got something for the user: no error here. + // console.warn("expected", this.centralDirRecords, "records in central dir, got", this.files.length); + } + } + }, + /** + * Read the end of central directory. + */ + readEndOfCentral: function() { + var offset = this.reader.lastIndexOfSignature(sig.CENTRAL_DIRECTORY_END); + if (offset < 0) { + // Check if the content is a truncated zip or complete garbage. + // A "LOCAL_FILE_HEADER" is not required at the beginning (auto + // extractible zip for example) but it can give a good hint. + // If an ajax request was used without responseType, we will also + // get unreadable data. + var isGarbage = !this.isSignature(0, sig.LOCAL_FILE_HEADER); + + if (isGarbage) { + throw new Error("Can't find end of central directory : is this a zip file ? " + + "If it is, see https://stuk.github.io/jszip/documentation/howto/read_zip.html"); + } else { + throw new Error("Corrupted zip: can't find end of central directory"); + } + + } + this.reader.setIndex(offset); + var endOfCentralDirOffset = offset; + this.checkSignature(sig.CENTRAL_DIRECTORY_END); + this.readBlockEndOfCentral(); + + + /* extract from the zip spec : + 4) If one of the fields in the end of central directory + record is too small to hold required data, the field + should be set to -1 (0xFFFF or 0xFFFFFFFF) and the + ZIP64 format record should be created. + 5) The end of central directory record and the + Zip64 end of central directory locator record must + reside on the same disk when splitting or spanning + an archive. + */ + if (this.diskNumber === utils.MAX_VALUE_16BITS || this.diskWithCentralDirStart === utils.MAX_VALUE_16BITS || this.centralDirRecordsOnThisDisk === utils.MAX_VALUE_16BITS || this.centralDirRecords === utils.MAX_VALUE_16BITS || this.centralDirSize === utils.MAX_VALUE_32BITS || this.centralDirOffset === utils.MAX_VALUE_32BITS) { + this.zip64 = true; + + /* + Warning : the zip64 extension is supported, but ONLY if the 64bits integer read from + the zip file can fit into a 32bits integer. This cannot be solved : JavaScript represents + all numbers as 64-bit double precision IEEE 754 floating point numbers. + So, we have 53bits for integers and bitwise operations treat everything as 32bits. + see https://developer.mozilla.org/en-US/docs/JavaScript/Reference/Operators/Bitwise_Operators + and http://www.ecma-international.org/publications/files/ECMA-ST/ECMA-262.pdf section 8.5 + */ + + // should look for a zip64 EOCD locator + offset = this.reader.lastIndexOfSignature(sig.ZIP64_CENTRAL_DIRECTORY_LOCATOR); + if (offset < 0) { + throw new Error("Corrupted zip: can't find the ZIP64 end of central directory locator"); + } + this.reader.setIndex(offset); + this.checkSignature(sig.ZIP64_CENTRAL_DIRECTORY_LOCATOR); + this.readBlockZip64EndOfCentralLocator(); + + // now the zip64 EOCD record + if (!this.isSignature(this.relativeOffsetEndOfZip64CentralDir, sig.ZIP64_CENTRAL_DIRECTORY_END)) { + // console.warn("ZIP64 end of central directory not where expected."); + this.relativeOffsetEndOfZip64CentralDir = this.reader.lastIndexOfSignature(sig.ZIP64_CENTRAL_DIRECTORY_END); + if (this.relativeOffsetEndOfZip64CentralDir < 0) { + throw new Error("Corrupted zip: can't find the ZIP64 end of central directory"); + } + } + this.reader.setIndex(this.relativeOffsetEndOfZip64CentralDir); + this.checkSignature(sig.ZIP64_CENTRAL_DIRECTORY_END); + this.readBlockZip64EndOfCentral(); + } + + var expectedEndOfCentralDirOffset = this.centralDirOffset + this.centralDirSize; + if (this.zip64) { + expectedEndOfCentralDirOffset += 20; // end of central dir 64 locator + expectedEndOfCentralDirOffset += 12 /* should not include the leading 12 bytes */ + this.zip64EndOfCentralSize; + } + + var extraBytes = endOfCentralDirOffset - expectedEndOfCentralDirOffset; + + if (extraBytes > 0) { + // console.warn(extraBytes, "extra bytes at beginning or within zipfile"); + if (this.isSignature(endOfCentralDirOffset, sig.CENTRAL_FILE_HEADER)) { + // The offsets seem wrong, but we have something at the specified offset. + // So… we keep it. + } else { + // the offset is wrong, update the "zero" of the reader + // this happens if data has been prepended (crx files for example) + this.reader.zero = extraBytes; + } + } else if (extraBytes < 0) { + throw new Error("Corrupted zip: missing " + Math.abs(extraBytes) + " bytes."); + } + }, + prepareReader: function(data) { + this.reader = readerFor(data); + }, + /** + * Read a zip file and create ZipEntries. + * @param {String|ArrayBuffer|Uint8Array|Buffer} data the binary string representing a zip file. + */ + load: function(data) { + this.prepareReader(data); + this.readEndOfCentral(); + this.readCentralDir(); + this.readLocalFiles(); + } +}; +// }}} end of ZipEntries +module.exports = ZipEntries; + +},{"./reader/readerFor":22,"./signature":23,"./support":30,"./utf8":31,"./utils":32,"./zipEntry":34}],34:[function(require,module,exports){ +'use strict'; +var readerFor = require('./reader/readerFor'); +var utils = require('./utils'); +var CompressedObject = require('./compressedObject'); +var crc32fn = require('./crc32'); +var utf8 = require('./utf8'); +var compressions = require('./compressions'); +var support = require('./support'); + +var MADE_BY_DOS = 0x00; +var MADE_BY_UNIX = 0x03; + +/** + * Find a compression registered in JSZip. + * @param {string} compressionMethod the method magic to find. + * @return {Object|null} the JSZip compression object, null if none found. + */ +var findCompression = function(compressionMethod) { + for (var method in compressions) { + if (!compressions.hasOwnProperty(method)) { + continue; + } + if (compressions[method].magic === compressionMethod) { + return compressions[method]; + } + } + return null; +}; + +// class ZipEntry {{{ +/** + * An entry in the zip file. + * @constructor + * @param {Object} options Options of the current file. + * @param {Object} loadOptions Options for loading the stream. + */ +function ZipEntry(options, loadOptions) { + this.options = options; + this.loadOptions = loadOptions; +} +ZipEntry.prototype = { + /** + * say if the file is encrypted. + * @return {boolean} true if the file is encrypted, false otherwise. + */ + isEncrypted: function() { + // bit 1 is set + return (this.bitFlag & 0x0001) === 0x0001; + }, + /** + * say if the file has utf-8 filename/comment. + * @return {boolean} true if the filename/comment is in utf-8, false otherwise. + */ + useUTF8: function() { + // bit 11 is set + return (this.bitFlag & 0x0800) === 0x0800; + }, + /** + * Read the local part of a zip file and add the info in this object. + * @param {DataReader} reader the reader to use. + */ + readLocalPart: function(reader) { + var compression, localExtraFieldsLength; + + // we already know everything from the central dir ! + // If the central dir data are false, we are doomed. + // On the bright side, the local part is scary : zip64, data descriptors, both, etc. + // The less data we get here, the more reliable this should be. + // Let's skip the whole header and dash to the data ! + reader.skip(22); + // in some zip created on windows, the filename stored in the central dir contains \ instead of /. + // Strangely, the filename here is OK. + // I would love to treat these zip files as corrupted (see http://www.info-zip.org/FAQ.html#backslashes + // or APPNOTE#4.4.17.1, "All slashes MUST be forward slashes '/'") but there are a lot of bad zip generators... + // Search "unzip mismatching "local" filename continuing with "central" filename version" on + // the internet. + // + // I think I see the logic here : the central directory is used to display + // content and the local directory is used to extract the files. Mixing / and \ + // may be used to display \ to windows users and use / when extracting the files. + // Unfortunately, this lead also to some issues : http://seclists.org/fulldisclosure/2009/Sep/394 + this.fileNameLength = reader.readInt(2); + localExtraFieldsLength = reader.readInt(2); // can't be sure this will be the same as the central dir + // the fileName is stored as binary data, the handleUTF8 method will take care of the encoding. + this.fileName = reader.readData(this.fileNameLength); + reader.skip(localExtraFieldsLength); + + if (this.compressedSize === -1 || this.uncompressedSize === -1) { + throw new Error("Bug or corrupted zip : didn't get enough information from the central directory " + "(compressedSize === -1 || uncompressedSize === -1)"); + } + + compression = findCompression(this.compressionMethod); + if (compression === null) { // no compression found + throw new Error("Corrupted zip : compression " + utils.pretty(this.compressionMethod) + " unknown (inner file : " + utils.transformTo("string", this.fileName) + ")"); + } + this.decompressed = new CompressedObject(this.compressedSize, this.uncompressedSize, this.crc32, compression, reader.readData(this.compressedSize)); + }, + + /** + * Read the central part of a zip file and add the info in this object. + * @param {DataReader} reader the reader to use. + */ + readCentralPart: function(reader) { + this.versionMadeBy = reader.readInt(2); + reader.skip(2); + // this.versionNeeded = reader.readInt(2); + this.bitFlag = reader.readInt(2); + this.compressionMethod = reader.readString(2); + this.date = reader.readDate(); + this.crc32 = reader.readInt(4); + this.compressedSize = reader.readInt(4); + this.uncompressedSize = reader.readInt(4); + var fileNameLength = reader.readInt(2); + this.extraFieldsLength = reader.readInt(2); + this.fileCommentLength = reader.readInt(2); + this.diskNumberStart = reader.readInt(2); + this.internalFileAttributes = reader.readInt(2); + this.externalFileAttributes = reader.readInt(4); + this.localHeaderOffset = reader.readInt(4); + + if (this.isEncrypted()) { + throw new Error("Encrypted zip are not supported"); + } + + // will be read in the local part, see the comments there + reader.skip(fileNameLength); + this.readExtraFields(reader); + this.parseZIP64ExtraField(reader); + this.fileComment = reader.readData(this.fileCommentLength); + }, + + /** + * Parse the external file attributes and get the unix/dos permissions. + */ + processAttributes: function () { + this.unixPermissions = null; + this.dosPermissions = null; + var madeBy = this.versionMadeBy >> 8; + + // Check if we have the DOS directory flag set. + // We look for it in the DOS and UNIX permissions + // but some unknown platform could set it as a compatibility flag. + this.dir = this.externalFileAttributes & 0x0010 ? true : false; + + if(madeBy === MADE_BY_DOS) { + // first 6 bits (0 to 5) + this.dosPermissions = this.externalFileAttributes & 0x3F; + } + + if(madeBy === MADE_BY_UNIX) { + this.unixPermissions = (this.externalFileAttributes >> 16) & 0xFFFF; + // the octal permissions are in (this.unixPermissions & 0x01FF).toString(8); + } + + // fail safe : if the name ends with a / it probably means a folder + if (!this.dir && this.fileNameStr.slice(-1) === '/') { + this.dir = true; + } + }, + + /** + * Parse the ZIP64 extra field and merge the info in the current ZipEntry. + * @param {DataReader} reader the reader to use. + */ + parseZIP64ExtraField: function(reader) { + + if (!this.extraFields[0x0001]) { + return; + } + + // should be something, preparing the extra reader + var extraReader = readerFor(this.extraFields[0x0001].value); + + // I really hope that these 64bits integer can fit in 32 bits integer, because js + // won't let us have more. + if (this.uncompressedSize === utils.MAX_VALUE_32BITS) { + this.uncompressedSize = extraReader.readInt(8); + } + if (this.compressedSize === utils.MAX_VALUE_32BITS) { + this.compressedSize = extraReader.readInt(8); + } + if (this.localHeaderOffset === utils.MAX_VALUE_32BITS) { + this.localHeaderOffset = extraReader.readInt(8); + } + if (this.diskNumberStart === utils.MAX_VALUE_32BITS) { + this.diskNumberStart = extraReader.readInt(4); + } + }, + /** + * Read the central part of a zip file and add the info in this object. + * @param {DataReader} reader the reader to use. + */ + readExtraFields: function(reader) { + var end = reader.index + this.extraFieldsLength, + extraFieldId, + extraFieldLength, + extraFieldValue; + + if (!this.extraFields) { + this.extraFields = {}; + } + + while (reader.index + 4 < end) { + extraFieldId = reader.readInt(2); + extraFieldLength = reader.readInt(2); + extraFieldValue = reader.readData(extraFieldLength); + + this.extraFields[extraFieldId] = { + id: extraFieldId, + length: extraFieldLength, + value: extraFieldValue + }; + } + + reader.setIndex(end); + }, + /** + * Apply an UTF8 transformation if needed. + */ + handleUTF8: function() { + var decodeParamType = support.uint8array ? "uint8array" : "array"; + if (this.useUTF8()) { + this.fileNameStr = utf8.utf8decode(this.fileName); + this.fileCommentStr = utf8.utf8decode(this.fileComment); + } else { + var upath = this.findExtraFieldUnicodePath(); + if (upath !== null) { + this.fileNameStr = upath; + } else { + // ASCII text or unsupported code page + var fileNameByteArray = utils.transformTo(decodeParamType, this.fileName); + this.fileNameStr = this.loadOptions.decodeFileName(fileNameByteArray); + } + + var ucomment = this.findExtraFieldUnicodeComment(); + if (ucomment !== null) { + this.fileCommentStr = ucomment; + } else { + // ASCII text or unsupported code page + var commentByteArray = utils.transformTo(decodeParamType, this.fileComment); + this.fileCommentStr = this.loadOptions.decodeFileName(commentByteArray); + } + } + }, + + /** + * Find the unicode path declared in the extra field, if any. + * @return {String} the unicode path, null otherwise. + */ + findExtraFieldUnicodePath: function() { + var upathField = this.extraFields[0x7075]; + if (upathField) { + var extraReader = readerFor(upathField.value); + + // wrong version + if (extraReader.readInt(1) !== 1) { + return null; + } + + // the crc of the filename changed, this field is out of date. + if (crc32fn(this.fileName) !== extraReader.readInt(4)) { + return null; + } + + return utf8.utf8decode(extraReader.readData(upathField.length - 5)); + } + return null; + }, + + /** + * Find the unicode comment declared in the extra field, if any. + * @return {String} the unicode comment, null otherwise. + */ + findExtraFieldUnicodeComment: function() { + var ucommentField = this.extraFields[0x6375]; + if (ucommentField) { + var extraReader = readerFor(ucommentField.value); + + // wrong version + if (extraReader.readInt(1) !== 1) { + return null; + } + + // the crc of the comment changed, this field is out of date. + if (crc32fn(this.fileComment) !== extraReader.readInt(4)) { + return null; + } + + return utf8.utf8decode(extraReader.readData(ucommentField.length - 5)); + } + return null; + } +}; +module.exports = ZipEntry; + +},{"./compressedObject":2,"./compressions":3,"./crc32":4,"./reader/readerFor":22,"./support":30,"./utf8":31,"./utils":32}],35:[function(require,module,exports){ +'use strict'; + +var StreamHelper = require('./stream/StreamHelper'); +var DataWorker = require('./stream/DataWorker'); +var utf8 = require('./utf8'); +var CompressedObject = require('./compressedObject'); +var GenericWorker = require('./stream/GenericWorker'); + +/** + * A simple object representing a file in the zip file. + * @constructor + * @param {string} name the name of the file + * @param {String|ArrayBuffer|Uint8Array|Buffer} data the data + * @param {Object} options the options of the file + */ +var ZipObject = function(name, data, options) { + this.name = name; + this.dir = options.dir; + this.date = options.date; + this.comment = options.comment; + this.unixPermissions = options.unixPermissions; + this.dosPermissions = options.dosPermissions; + + this._data = data; + this._dataBinary = options.binary; + // keep only the compression + this.options = { + compression : options.compression, + compressionOptions : options.compressionOptions + }; +}; + +ZipObject.prototype = { + /** + * Create an internal stream for the content of this object. + * @param {String} type the type of each chunk. + * @return StreamHelper the stream. + */ + internalStream: function (type) { + var result = null, outputType = "string"; + try { + if (!type) { + throw new Error("No output type specified."); + } + outputType = type.toLowerCase(); + var askUnicodeString = outputType === "string" || outputType === "text"; + if (outputType === "binarystring" || outputType === "text") { + outputType = "string"; + } + result = this._decompressWorker(); + + var isUnicodeString = !this._dataBinary; + + if (isUnicodeString && !askUnicodeString) { + result = result.pipe(new utf8.Utf8EncodeWorker()); + } + if (!isUnicodeString && askUnicodeString) { + result = result.pipe(new utf8.Utf8DecodeWorker()); + } + } catch (e) { + result = new GenericWorker("error"); + result.error(e); + } + + return new StreamHelper(result, outputType, ""); + }, + + /** + * Prepare the content in the asked type. + * @param {String} type the type of the result. + * @param {Function} onUpdate a function to call on each internal update. + * @return Promise the promise of the result. + */ + async: function (type, onUpdate) { + return this.internalStream(type).accumulate(onUpdate); + }, + + /** + * Prepare the content as a nodejs stream. + * @param {String} type the type of each chunk. + * @param {Function} onUpdate a function to call on each internal update. + * @return Stream the stream. + */ + nodeStream: function (type, onUpdate) { + return this.internalStream(type || "nodebuffer").toNodejsStream(onUpdate); + }, + + /** + * Return a worker for the compressed content. + * @private + * @param {Object} compression the compression object to use. + * @param {Object} compressionOptions the options to use when compressing. + * @return Worker the worker. + */ + _compressWorker: function (compression, compressionOptions) { + if ( + this._data instanceof CompressedObject && + this._data.compression.magic === compression.magic + ) { + return this._data.getCompressedWorker(); + } else { + var result = this._decompressWorker(); + if(!this._dataBinary) { + result = result.pipe(new utf8.Utf8EncodeWorker()); + } + return CompressedObject.createWorkerFrom(result, compression, compressionOptions); + } + }, + /** + * Return a worker for the decompressed content. + * @private + * @return Worker the worker. + */ + _decompressWorker : function () { + if (this._data instanceof CompressedObject) { + return this._data.getContentWorker(); + } else if (this._data instanceof GenericWorker) { + return this._data; + } else { + return new DataWorker(this._data); + } + } +}; + +var removedMethods = ["asText", "asBinary", "asNodeBuffer", "asUint8Array", "asArrayBuffer"]; +var removedFn = function () { + throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide."); +}; + +for(var i = 0; i < removedMethods.length; i++) { + ZipObject.prototype[removedMethods[i]] = removedFn; +} +module.exports = ZipObject; + +},{"./compressedObject":2,"./stream/DataWorker":27,"./stream/GenericWorker":28,"./stream/StreamHelper":29,"./utf8":31}],36:[function(require,module,exports){ +(function (global){ +'use strict'; +var Mutation = global.MutationObserver || global.WebKitMutationObserver; + +var scheduleDrain; + +{ + if (Mutation) { + var called = 0; + var observer = new Mutation(nextTick); + var element = global.document.createTextNode(''); + observer.observe(element, { + characterData: true + }); + scheduleDrain = function () { + element.data = (called = ++called % 2); + }; + } else if (!global.setImmediate && typeof global.MessageChannel !== 'undefined') { + var channel = new global.MessageChannel(); + channel.port1.onmessage = nextTick; + scheduleDrain = function () { + channel.port2.postMessage(0); + }; + } else if ('document' in global && 'onreadystatechange' in global.document.createElement('script')) { + scheduleDrain = function () { + + // Create a + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt
+

Enum SolverContextFactory.Solvers

+
+
+ +
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/SolverContextFactory.html b/api/org/sosy_lab/java_smt/SolverContextFactory.html new file mode 100644 index 0000000000..c24749f18d --- /dev/null +++ b/api/org/sosy_lab/java_smt/SolverContextFactory.html @@ -0,0 +1,543 @@ + + + + + +SolverContextFactory (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt
+

Class SolverContextFactory

+
+
+ +
+
    +
  • +
    +
    public class SolverContextFactory
+extends Object
    +
    Factory class for loading and generating solver contexts. Generates a SolverContext + corresponding to the chosen solver. + +

    Main entry point for JavaSMT.

    +
    • +
+
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/ArrayFormula.html b/api/org/sosy_lab/java_smt/api/ArrayFormula.html new file mode 100644 index 0000000000..3fc7c0bba7 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/ArrayFormula.html @@ -0,0 +1,224 @@ + + + + + +ArrayFormula (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface ArrayFormula<TI extends Formula,​TE extends Formula>

+
+
+
+
    +
  • +
    +
    Type Parameters:
    +
    TI - Index type.
    +
    TE - Element type.
    +
    +
    +
    All Superinterfaces:
    +
    Formula
    +
    +
    +
    @Immutable
+public interface ArrayFormula<TI extends Formula,​TE extends Formula>
+extends Formula
    +
    A formula of the array sort.
    +
    • +
+
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/ArrayFormulaManager.html b/api/org/sosy_lab/java_smt/api/ArrayFormulaManager.html new file mode 100644 index 0000000000..33652aa7b0 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/ArrayFormulaManager.html @@ -0,0 +1,460 @@ + + + + + +ArrayFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface ArrayFormulaManager

+
+
+
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Method Detail

      + + + + + +
        +
      • +

        select

        +
        <TI extends Formula,​TE extends Formula> TE select​(ArrayFormula<TI,​TE> pArray,
+                                                        TI pIndex)
        +
        Read a value that is stored in the array at the specified position.
        +
        +
        Parameters:
        +
        pArray - The array from which to read
        +
        pIndex - The position from which to read
        +
        Returns:
        +
        A formula that represents the result of the "read"
        +
        +
        • +
      + + + + + +
        +
      • +

        store

        +
        <TI extends Formula,​TE extends Formula> ArrayFormula<TI,​TE> store​(ArrayFormula<TI,​TE> pArray,
+                                                                              TI pIndex,
+                                                                              TE pValue)
        +
        Store a value into a cell of the specified array.
        +
        +
        Parameters:
        +
        pArray - The array to which to write
        +
        pIndex - The position to which to write
        +
        pValue - The value that should be written
        +
        Returns:
        +
        A formula that represents the "write"
        +
        +
        • +
      + + + + + +
        +
      • +

        makeArray

        +
        <TI extends Formula,​TE extends Formula,​FTI extends FormulaType<TI>,​FTE extends FormulaType<TE>> ArrayFormula<TI,​TE> makeArray​(String pName,
+                                                                                                                                                      FTI pIndexType,
+                                                                                                                                                      FTE pElementType)
        +
        Declare a new array with exactly the given name. + +

        Please make sure that the given name is valid in SMT-LIB2. Take a look at FormulaManager.isValidName(java.lang.String) for further information. + +

        This method does not quote or unquote the given name, but uses the plain name "AS IS". + Formula.toString() can return a different String than the given one.

        +
        +
        Parameters:
        +
        pIndexType - The type of the array index
        +
        pElementType - The type of the array elements
        +
        +
        • +
      + + + +
        +
      • +

        makeArray

        +
        default <TI extends Formula,​TE extends Formula> ArrayFormula<TI,​TE> makeArray​(String pName,
+                                                                                          FormulaType.ArrayFormulaType<TI,​TE> type)
        +
        Declare a new array with exactly the given name. + +

        Please make sure that the given name is valid in SMT-LIB2. Take a look at FormulaManager.isValidName(java.lang.String) for further information. + +

        This method does not quote or unquote the given name, but uses the plain name "AS IS". + Formula.toString() can return a different String than the given one.

        +
        +
        Parameters:
        +
        type - The type of the array, consisting of index type and element type
        +
        +
        • +
      + + + + + +
        +
      • +

        makeArray

        +
        <TI extends Formula,​TE extends Formula,​FTI extends FormulaType<TI>,​FTE extends FormulaType<TE>> ArrayFormula<TI,​TE> makeArray​(FTI pIndexType,
+                                                                                                                                                      FTE pElementType,
+                                                                                                                                                      TE defaultElement)
        +
        Create a new array constant with values initialized to defaultElement.
        +
        +
        Parameters:
        +
        defaultElement - The default value of all entries in the array.
        +
        +
        • +
      + + + + + +
        +
      • +

        makeArray

        +
        default <TI extends Formula,​TE extends Formula> ArrayFormula<TI,​TE> makeArray​(FormulaType.ArrayFormulaType<TI,​TE> type,
+                                                                                          TE defaultElement)
        +
        Create a new array constant with values initialized to defaultElement.
        +
        +
        Parameters:
        +
        defaultElement - The default value of all entries in the array.
        +
        +
        • +
      + + + + + + + + + + + + +
      • +
    +
    +
    • +
+
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/BasicProverEnvironment.AllSatCallback.html b/api/org/sosy_lab/java_smt/api/BasicProverEnvironment.AllSatCallback.html new file mode 100644 index 0000000000..45a9557c67 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/BasicProverEnvironment.AllSatCallback.html @@ -0,0 +1,288 @@ + + + + + +BasicProverEnvironment.AllSatCallback (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface BasicProverEnvironment.AllSatCallback<R>

+
+
+
+ +
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/BasicProverEnvironment.html b/api/org/sosy_lab/java_smt/api/BasicProverEnvironment.html new file mode 100644 index 0000000000..14ceaf5d19 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/BasicProverEnvironment.html @@ -0,0 +1,726 @@ + + + + + +BasicProverEnvironment (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface BasicProverEnvironment<T>

+
+
+
+ +
+
+ +
+
+
    +
  • + +
    + +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        push

        +
        @CanIgnoreReturnValue
+default @Nullable T push​(BooleanFormula f)
+                  throws InterruptedException
        +
        Push a backtracking point and add a formula to the current stack, asserting it. The return + value may be used to identify this formula later on in a query (this depends on the sub-type of + the environment).
        +
        +
        Throws:
        +
        InterruptedException
        +
        +
        • +
      + + + +
        +
      • +

        pop

        +
        void pop()
        +
        Remove one backtracking point/level from the current stack. This removes the latest level + including all of its formulas, i.e., all formulas that were added for this backtracking point.
        +
        • +
      + + + + + + + +
        +
      • +

        push

        +
        void push()
+   throws InterruptedException
        +
        Create a new backtracking point, i.e., a new level on the assertion stack. Each level can hold + several asserted formulas. + +

        If formulas are added before creating the first backtracking point, they can not be removed + via a POP-operation.

        +
        +
        Throws:
        +
        InterruptedException
        +
        +
        • +
      + + + +
        +
      • +

        size

        +
        int size()
        +
        Get the number of backtracking points/levels on the current stack. + +

        Caution: This is the number of PUSH-operations, and not necessarily equal to the number of + asserted formulas. On any level there can be an arbitrary number of asserted formulas. Even + with size of 0, formulas can already be asserted (at bottom level).

        +
        • +
      + + + + + + + + + + + +
        +
      • +

        getModel

        +
        Model getModel()
+        throws SolverException
        +
        Get a satisfying assignment. This method should be called only immediately after an isUnsat() call that returned false. The returned model is guaranteed to stay + constant and valid as long as the solver context is available, even if constraints are added + to, pushed or popped from the prover stack. + +

        A model might contain additional symbols with their evaluation, if a solver uses its own + temporary symbols. There should be at least a value-assignment for each free symbol.

        +
        +
        Throws:
        +
        SolverException
        +
        +
        • +
      + + + +
        +
      • +

        getEvaluator

        +
        default Evaluator getEvaluator()
+                        throws SolverException
        +
        Get a temporary view on the current satisfying assignment. This should be called only + immediately after an isUnsat() call that returned false. The evaluator + should no longer be used as soon as any constraints are added to, pushed, or popped from the + prover stack.
        +
        +
        Throws:
        +
        SolverException
        +
        +
        • +
      + + + +
        +
      • +

        getModelAssignments

        +
        default ImmutableList<Model.ValueAssignment> getModelAssignments()
+                                                          throws SolverException
        +
        Get a list of satisfying assignments. This is equivalent to + ImmutableList.copyOf(getModel()), but removes the need for calling Model.close(). + +

        Note that if you need to iterate multiple times over the model it may be more efficient to + use this method instead of getModel() (depending on the solver).

        +
        +
        Throws:
        +
        SolverException
        +
        +
        • +
      + + + +
        +
      • +

        getUnsatCore

        +
        List<BooleanFormula> getUnsatCore()
        +
        Get an unsat core. This should be called only immediately after an isUnsat() call that + returned false.
        +
        • +
      + + + + + + + +
        +
      • +

        getStatistics

        +
        default ImmutableMap<String,​String> getStatistics()
        +
        Get statistics for a concrete ProverEnvironment in a solver. The returned mapping is intended + to provide solver-internal statistics for only this instance. The keys can differ between + individual solvers. + +

        Calling the statistics several times for the same ProverEnvironments returns + accumulated number, i.e., we currently do not provide any possibility to reset the statistics. + Calling the statistics for different ProverEnvironments returns independent statistics. + +

        We do not guarantee any specific key to be present, as this depends on the used solver. We + might even return an empty mapping if the solver does not support calling this method or is in + an invalid state.

        +
        +
        See Also:
        +
        SolverContext.getStatistics()
        +
        +
        • +
      + + + +
        +
      • +

        close

        +
        void close()
        +
        Closes the prover environment. The object should be discarded, and should not be used after + closing. The first call of this method will close the prover instance, further calls are + ignored.
        +
        +
        Specified by:
        +
        close in interface AutoCloseable
        +
        +
        • +
      + + + + + + + +
        +
      • +

        registerUserPropagator

        +
        default boolean registerUserPropagator​(UserPropagator propagator)
        +
        Registers a UserPropagator for this prover environment. Only a single user propagator + can be registered at a time, and each user propagator shall only be registered once in its + lifetime (see also UserPropagator.initializeWithBackend(org.sosy_lab.java_smt.api.PropagatorBackend)).
        +
        +
        Parameters:
        +
        propagator - The (fresh) user propagator to register.
        +
        Returns:
        +
        true, if the user propagator was successfully registered. Most SMT solvers do + not support user propagators and hence return false.
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/BitvectorFormula.html b/api/org/sosy_lab/java_smt/api/BitvectorFormula.html new file mode 100644 index 0000000000..c5427ef153 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/BitvectorFormula.html @@ -0,0 +1,219 @@ + + + + + +BitvectorFormula (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface BitvectorFormula

+
+
+
+
    +
  • +
    +
    All Superinterfaces:
    +
    Formula
    +
    +
    +
    @Immutable
+public interface BitvectorFormula
+extends Formula
    +
    A formula of the bitvector sort.
    +
    • +
+
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/BitvectorFormulaManager.html b/api/org/sosy_lab/java_smt/api/BitvectorFormulaManager.html new file mode 100644 index 0000000000..d7f9fa3bae --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/BitvectorFormulaManager.html @@ -0,0 +1,1162 @@ + + + + + +BitvectorFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface BitvectorFormulaManager

+
+
+
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        makeBitvector

        +
        BitvectorFormula makeBitvector​(int length,
+                               long pI)
        +
        Convert a number into a bitvector with given size.
        +
        +
        Throws:
        +
        IllegalArgumentException - if the number is out of range for the given length.
        +
        +
        • +
      + + + + + + + +
        +
      • +

        makeBitvector

        +
        BitvectorFormula makeBitvector​(int length,
+                               NumeralFormula.IntegerFormula pI)
        +
        Convert/Cast/Interpret a numeral formula into a bitvector with given size. + +

        If the numeral formula is too large for the given length, we cut off the largest bits and + only use the lest significant bits.

        +
        • +
      + + + + + + + +
        +
      • +

        makeVariable

        +
        BitvectorFormula makeVariable​(int length,
+                              String pVar)
        +
        Creates a variable with exactly the given name and bitwidth. + +

        Please make sure that the given name is valid in SMT-LIB2. Take a look at FormulaManager.isValidName(java.lang.String) for further information. + +

        This method does not quote or unquote the given name, but uses the plain name "AS IS". + Formula.toString() can return a different String than the given one.

        +
        • +
      + + + + + + + +
        +
      • +

        getLength

        +
        int getLength​(BitvectorFormula number)
        +
        This method returns the length of a bitvector, also denoted as bit-size.
        +
        • +
      + + + +
        +
      • +

        negate

        +
        BitvectorFormula negate​(BitvectorFormula number)
        +
        This method returns the negated number, i.e., it is multiplied by "-1". The given number is + interpreted as signed bitvector and corresponds to "2^BITSIZE - number". The result has the + same length as the given number.
        +
        • +
      + + + +
        +
      • +

        add

        +
        BitvectorFormula add​(BitvectorFormula number1,
+                     BitvectorFormula number2)
        +
        This method returns the addition of the given bitvectors. The result has the same length as the + given parameters. There can be an overflow, i.e., as one would expect from bitvector logic. + There is no difference in signed and unsigned numbers.
        +
        +
        Parameters:
        +
        number1 - a Formula
        +
        number2 - a Formula
        +
        Returns:
        +
        number1 + number2
        +
        +
        • +
      + + + +
        +
      • +

        subtract

        +
        BitvectorFormula subtract​(BitvectorFormula number1,
+                          BitvectorFormula number2)
        +
        This method returns the subtraction of the given bitvectors. The result has the same length as + the given parameters. There can be an overflow, i.e., as one would expect from bitvector logic. + There is no difference in signed and unsigned numbers.
        +
        +
        Parameters:
        +
        number1 - a Formula
        +
        number2 - a Formula
        +
        Returns:
        +
        number1 - number2
        +
        +
        • +
      + + + +
        +
      • +

        divide

        +
        BitvectorFormula divide​(BitvectorFormula dividend,
+                        BitvectorFormula divisor,
+                        boolean signed)
        +
        This method returns the division for two bitvector formulas. + +

        For signed bitvectors, the result is rounded towards zero (also called "truncated integer + division", similar to the division in the C99 standard), e.g., a user can assume the following + equations: + +

          +
        • 10 / 5 = 2 +
        • 10 / 3 = 3 +
        • 10 / (-3) = -3 +
        • -10 / 5 = -2 +
        • -10 / 3 = -3 +
        • -10 / (-3) = 3 +
        + +

        If the divisor evaluates to zero (division-by-zero), either directly as value or indirectly + via an additional constraint, then the result of the division is defined as: + +

          +
        • "-1" interpreted as bitvector (i.e., all bits set to "1"), if the dividend is + non-negative, and +
        • "1" interpreted as bitvector (i.e., all bits set to "0", except the last bit), if the + dividend is negative. +
        + +

        We refer to the SMTLIB standard version 2.6 for the division and remainder operators in BV + theory.

        +
        +
        Parameters:
        +
        dividend - dividend of the operation.
        +
        divisor - divisor of the operation.
        +
        signed - whether to interpret all operands as signed or as unsigned numbers.
        +
        +
        • +
      + + + +
        +
      • +

        modulo

        +
        @Deprecated(forRemoval=true)
+default BitvectorFormula modulo​(BitvectorFormula dividend,
+                                BitvectorFormula divisor,
+                                boolean signed)
        +
        Deprecated, for removal: This API element is subject to removal in a future version.
        +
        Deprecated and unsupported operation. + +

        Returns the remainder of the given bitvectors and behaves equally to remainder(BitvectorFormula, BitvectorFormula, boolean). + +

        Deprecated in favor of remainder() and smodulo() due to confusing method naming and + inconsistent behavior (for signed modulo, the sign of the result follows the divisor, but for + signed remainder() it follows the dividend). Unsigned remainder() is equivalent to unsigned + modulo().

        +
        • +
      + + + +
        +
      • +

        smodulo

        +
        BitvectorFormula smodulo​(BitvectorFormula dividend,
+                         BitvectorFormula divisor)
        +
        This method returns the two complement signed remainder for the Euclidean division (modulo) of + two bitvector formulas. + +

        The sign of the result follows the sign of the divisor, i.e. the quotient calculated in the + modulo operation is rounded in such a way that the result of the smodulo operation follows the + sign of the divisor, e.g., a user can assume the following equations, with bitvectors + interpreted as signed decimal numbers and % representing signed modulo, to hold: + +

          +
        • 10 % 5 == 0 +
        • 10 % 3 == 1 +
        • 10 % (-3) == -2 +
        • -10 % 5 == 0 +
        • -10 % 3 == 2 +
        • -10 % (-3) == -1 +
        + +

        If the divisor evaluates to zero (modulo-by-zero), either directly as value or indirectly + via an additional constraint, then the result of the modulo operation is defined as the + dividend itself. We refer to the SMTLIB standard version 2.6 for the division and remainder + operators in BV theory. + +

        For unsigned modulo, we refer to the unsigned remainder method.

        +
        +
        Parameters:
        +
        dividend - dividend of the operation.
        +
        divisor - divisor of the operation.
        +
        +
        • +
      + + + +
        +
      • +

        remainder

        +
        BitvectorFormula remainder​(BitvectorFormula dividend,
+                           BitvectorFormula divisor,
+                           boolean signed)
        +
        This method returns the remainder for two bitvector formulas using the divide(BitvectorFormula, BitvectorFormula, boolean) operation. + +

        For unsigned bitvectors, this returns the remainder of unsigned bitvector division. + +

        For signed bitvectors, the sign of the result follows the sign of the dividend, i.e. the + quotient of the division is rounded in such a way that the sign of the result of the remainder + operation follows the sign of the dividend, e.g., a user can assume the following equations, + with bitvectors interpreted as signed decimal numbers and % representing signed remainder + (similar to the C programming language), to hold: + +

          +
        • 10 % 5 == 0 +
        • 10 % 3 == 1 +
        • 10 % (-3) == 1 +
        • -10 % 5 == 0 +
        • -10 % 3 == -1 +
        • -10 % (-3) == -1 +
        + +

        If the divisor evaluates to zero (modulo-by-zero), either directly as value or indirectly + via an additional constraint, then the result of the modulo operation is defined as the + dividend itself. We refer to the SMTLIB standard version 2.6 for the division and remainder + operators in BV theory.

        +
        +
        Parameters:
        +
        dividend - dividend of the operation. The sign bit is carried over from this bitvector for + signed operations.
        +
        divisor - divisor of the operation.
        +
        signed - whether to interpret all operands as signed or as unsigned numbers.
        +
        +
        • +
      + + + +
        +
      • +

        multiply

        +
        BitvectorFormula multiply​(BitvectorFormula number1,
+                          BitvectorFormula number2)
        +
        This method returns the multiplication of the given bitvectors. The result has the same length + as the given parameters. There can be an overflow, i.e., as one would expect from bitvector + logic. There is no difference in signed and unsigned numbers.
        +
        +
        Parameters:
        +
        number1 - a Formula
        +
        number2 - a Formula
        +
        Returns:
        +
        number1 - number2
        +
        +
        • +
      + + + +
        +
      • +

        equal

        +
        BooleanFormula equal​(BitvectorFormula number1,
+                     BitvectorFormula number2)
        +
        This method returns the bit-wise equality of the given bitvectors.
        +
        +
        Parameters:
        +
        number1 - a Formula
        +
        number2 - a Formula
        +
        Returns:
        +
        number1 == number2
        +
        +
        • +
      + + + +
        +
      • +

        greaterThan

        +
        BooleanFormula greaterThan​(BitvectorFormula number1,
+                           BitvectorFormula number2,
+                           boolean signed)
        +
        Compare the given bitvectors.
        +
        +
        Parameters:
        +
        number1 - a Formula
        +
        number2 - a Formula
        +
        signed - interpret the bitvectors as signed numbers instead of unsigned numbers
        +
        Returns:
        +
        number1 > number2
        +
        +
        • +
      + + + +
        +
      • +

        greaterOrEquals

        +
        BooleanFormula greaterOrEquals​(BitvectorFormula number1,
+                               BitvectorFormula number2,
+                               boolean signed)
        +
        Compare the given bitvectors.
        +
        +
        Parameters:
        +
        number1 - a Formula
        +
        number2 - a Formula
        +
        signed - interpret the bitvectors as signed numbers instead of unsigned numbers
        +
        Returns:
        +
        number1 >= number2
        +
        +
        • +
      + + + +
        +
      • +

        lessThan

        +
        BooleanFormula lessThan​(BitvectorFormula number1,
+                        BitvectorFormula number2,
+                        boolean signed)
        +
        Compare the given bitvectors.
        +
        +
        Parameters:
        +
        number1 - a Formula
        +
        number2 - a Formula
        +
        signed - interpret the bitvectors as signed numbers instead of unsigned numbers
        +
        Returns:
        +
        number1 < number2
        +
        +
        • +
      + + + +
        +
      • +

        lessOrEquals

        +
        BooleanFormula lessOrEquals​(BitvectorFormula number1,
+                            BitvectorFormula number2,
+                            boolean signed)
        +
        Compare the given bitvectors.
        +
        +
        Parameters:
        +
        number1 - a Formula
        +
        number2 - a Formula
        +
        signed - interpret the bitvectors as signed numbers instead of unsigned numbers
        +
        Returns:
        +
        number1 <= number2
        +
        +
        • +
      + + + +
        +
      • +

        not

        +
        BitvectorFormula not​(BitvectorFormula bits)
        +
        This method returns the bit-wise complement of the given bitvector.
        +
        +
        Parameters:
        +
        bits - Formula
        +
        Returns:
        +
        ~bits
        +
        +
        • +
      + + + + + + + + + + + + + + + +
        +
      • +

        shiftRight

        +
        BitvectorFormula shiftRight​(BitvectorFormula number,
+                            BitvectorFormula toShift,
+                            boolean signed)
        +
        This method returns a term representing the right shift (towards least-significant bit) of + number by toShift. The result has the same length as the given number. On the left side, we + fill up the most significant bits with ones (i.e., arithmetic shift), if the number is signed + and negative, else we fill up with zeroes. For "toShift >= bitsize", we return a bitvector + with value zero, if number was zero or positive, or all bits set to one, if negative.
        +
        • +
      + + + +
        +
      • +

        shiftLeft

        +
        BitvectorFormula shiftLeft​(BitvectorFormula number,
+                           BitvectorFormula toShift)
        +
        This method returns a term representing the left shift (towards most-significant bit) of number + by toShift. The result has the same length as the given number. On the right side, we fill up + the least significant bits with zeroes. For "toShift >= bitsize", we return a bitvector with + value zero.
        +
        • +
      + + + +
        +
      • +

        rotateLeft

        +
        BitvectorFormula rotateLeft​(BitvectorFormula number,
+                            int toRotate)
        +
        This method returns a term representing the left rotation (towards most-significant bit) of + number by toRotate. The result has the same length as the given number. For "toRotate % bitsize + == 0", we return the number itself.
        +
        +
        Parameters:
        +
        toRotate - the number of bits to be moved
        +
        +
        • +
      + + + +
        +
      • +

        rotateLeft

        +
        BitvectorFormula rotateLeft​(BitvectorFormula number,
+                            BitvectorFormula toRotate)
        +
        This method returns a term representing the left rotation (towards most-significant bit) of + number by toRotate. The result has the same length as the given number. For "toRotate % bitsize + == 0", we return the number itself.
        +
        +
        Parameters:
        +
        toRotate - unsigned bitvector, represents the number of bits to be moved
        +
        +
        • +
      + + + +
        +
      • +

        rotateRight

        +
        BitvectorFormula rotateRight​(BitvectorFormula number,
+                             int toRotate)
        +
        This method returns a term representing the right rotation (towards least-significant bit) of + number by toRotate. The result has the same length as the given number. For "toRotate % bitsize + == 0", we return the number itself.
        +
        +
        Parameters:
        +
        toRotate - the number of bits to be moved
        +
        +
        • +
      + + + +
        +
      • +

        rotateRight

        +
        BitvectorFormula rotateRight​(BitvectorFormula number,
+                             BitvectorFormula toRotate)
        +
        This method returns a term representing the right rotation (towards least-significant bit) of + number by toRotate. The result has the same length as the given number. For "toRotate % bitsize + == 0", we return the number itself.
        +
        +
        Parameters:
        +
        toRotate - unsigned bitvector, represents the number of bits to be moved
        +
        +
        • +
      + + + + + + + +
        +
      • +

        extract

        +
        BitvectorFormula extract​(BitvectorFormula number,
+                         int msb,
+                         int lsb)
        +
        Extract a range of bits from a bitvector. We require 0 <= lsb <= msb < bitsize. + +

        If msb equals lsb, then a single bit will be returned, i.e., the bit from the given + position. If lsb equals 0 and msb equals bitsize-1, then the complete bitvector will be + returned.

        +
        +
        Parameters:
        +
        number - from where the bits are extracted.
        +
        msb - Upper index for the most significant bit. Must be in interval from lsb to bitsize-1.
        +
        lsb - Lower index for the least significant bit. Must be in interval from 0 to msb.
        +
        +
        • +
      + + + +
        +
      • +

        extend

        +
        BitvectorFormula extend​(BitvectorFormula number,
+                        int extensionBits,
+                        boolean signed)
        +
        Extend a bitvector to the left (add most significant bits). If signed is set and the given + number is negative, then the bit "1" will be added several times, else "0".
        +
        +
        Parameters:
        +
        number - The bitvector to extend.
        +
        extensionBits - How many bits to add.
        +
        signed - Whether the extension should depend on the sign bit.
        +
        +
        • +
      + + + + +
      • +
    +
    +
    • +
+
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/BooleanFormula.html b/api/org/sosy_lab/java_smt/api/BooleanFormula.html new file mode 100644 index 0000000000..40a1bdc7e9 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/BooleanFormula.html @@ -0,0 +1,219 @@ + + + + + +BooleanFormula (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface BooleanFormula

+
+
+
+
    +
  • +
    +
    All Superinterfaces:
    +
    Formula
    +
    +
    +
    @Immutable
+public interface BooleanFormula
+extends Formula
    +
    A formula of the boolean sort.
    +
    • +
+
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/BooleanFormulaManager.html b/api/org/sosy_lab/java_smt/api/BooleanFormulaManager.html new file mode 100644 index 0000000000..49277fda9d --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/BooleanFormulaManager.html @@ -0,0 +1,769 @@ + + + + + +BooleanFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface BooleanFormulaManager

+
+
+
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        makeBoolean

        +
        default BooleanFormula makeBoolean​(boolean value)
        +
        Returns a BooleanFormula representing the given value.
        +
        +
        Parameters:
        +
        value - the boolean value the returned Formula should represent
        +
        Returns:
        +
        a Formula representing the given value
        +
        +
        • +
      + + + +
        +
      • +

        makeTrue

        +
        BooleanFormula makeTrue()
        +
        Shortcut for makeBoolean(true).
        +
        • +
      + + + +
        +
      • +

        makeFalse

        +
        BooleanFormula makeFalse()
        +
        Shortcut for makeBoolean(false).
        +
        • +
      + + + +
        +
      • +

        makeVariable

        +
        BooleanFormula makeVariable​(String pVar)
        +
        Creates a variable with exactly the given name. + +

        Please make sure that the given name is valid in SMT-LIB2. Take a look at FormulaManager.isValidName(java.lang.String) for further information. + +

        This method does not quote or unquote the given name, but uses the plain name "AS IS". + Formula.toString() can return a different String than the given one.

        +
        • +
      + + + +
        +
      • +

        equivalence

        +
        BooleanFormula equivalence​(BooleanFormula formula1,
+                           BooleanFormula formula2)
        +
        Creates a formula representing an equivalence of the two arguments.
        +
        +
        Parameters:
        +
        formula1 - a Formula
        +
        formula2 - a Formula
        +
        Returns:
        +
        formula1 <-> formula2
        +
        +
        • +
      + + + + + + + +
        +
      • +

        isTrue

        +
        boolean isTrue​(BooleanFormula formula)
        +
        Check, if the formula is the formula "TRUE". This does not include a satisfiability check, but + only a syntactical matching. However, depending on the SMT solver, there might be some + pre-processing of formulas such that trivial cases like "1==1" are recognized and rewritten as + "TRUE", and thus such formulas might also be matched.
        +
        • +
      + + + +
        +
      • +

        isFalse

        +
        boolean isFalse​(BooleanFormula formula)
        +
        Check, if the formula is the formula "FALSE". This does not include a satisfiability check, but + only a syntactical matching. However, depending on the SMT solver, there might be some + pre-processing of formulas such that trivial cases like "1==2" are recognized and rewritten as + "FALSE", and thus such formulas might also be matched.
        +
        • +
      + + + + + +
        +
      • +

        ifThenElse

        +
        <T extends Formula> T ifThenElse​(BooleanFormula cond,
+                                 T f1,
+                                 T f2)
        +
        Creates a formula representing IF cond THEN f1 ELSE f2.
        +
        +
        Parameters:
        +
        cond - a Formula
        +
        f1 - a Formula
        +
        f2 - a Formula
        +
        Returns:
        +
        (IF cond THEN f1 ELSE f2)
        +
        +
        • +
      + + + +
        +
      • +

        not

        +
        BooleanFormula not​(BooleanFormula bits)
        +
        Creates a formula representing a negation of the argument.
        +
        +
        Parameters:
        +
        bits - a Formula
        +
        Returns:
        +
        !bits
        +
        +
        • +
      + + + +
        +
      • +

        and

        +
        BooleanFormula and​(BooleanFormula bits1,
+                   BooleanFormula bits2)
        +
        Creates a formula representing an AND of the two arguments.
        +
        +
        Parameters:
        +
        bits1 - a Formula
        +
        bits2 - a Formula
        +
        Returns:
        +
        bits1 & bits2
        +
        +
        • +
      + + + + + + + + + + + + + + + +
        +
      • +

        or

        +
        BooleanFormula or​(BooleanFormula bits1,
+                  BooleanFormula bits2)
        +
        Creates a formula representing an OR of the two arguments.
        +
        +
        Parameters:
        +
        bits1 - a Formula
        +
        bits2 - a Formula
        +
        Returns:
        +
        bits1 | bits2
        +
        +
        • +
      + + + + + + + + + + + + + + + + + + + + + + + +
        +
      • +

        visitRecursively

        +
        void visitRecursively​(BooleanFormula f,
+                      BooleanFormulaVisitor<TraversalProcess> rFormulaVisitor)
        +
        Visit the formula recursively with a given BooleanFormulaVisitor. + +

        This method guarantees that the traversal is done iteratively, without using Java recursion, + and thus is not prone to StackOverflowErrors. + +

        Furthermore, this method also guarantees that every equal part of the formula is visited + only once. Thus, it can be used to traverse DAG-like formulas efficiently.

        +
        • +
      + + + +
        +
      • +

        transformRecursively

        +
        BooleanFormula transformRecursively​(BooleanFormula f,
+                                    BooleanFormulaTransformationVisitor pVisitor)
        +
        Visit the formula recursively with a given BooleanFormulaVisitor. The arguments each + visitor method receives are already transformed. + +

        This method guarantees that the traversal is done iteratively, without using Java recursion, + and thus is not prone to StackOverflowErrors. + +

        Furthermore, this method also guarantees that every equal part of the formula is visited + only once. Thus, it can be used to traverse DAG-like formulas efficiently.

        +
        • +
      + + + +
        +
      • +

        toConjunctionArgs

        +
        Set<BooleanFormula> toConjunctionArgs​(BooleanFormula f,
+                                      boolean flatten)
        +
        Return a set of formulas such that a conjunction over them is equivalent to the input formula. + +

        Example output: + +

          +
        • For conjunction A /\ B /\ C: A, B, C +
        • For "true": empty set. +
        • For anything else: singleton set consisting of the input formula. +
        +
        +
        Parameters:
        +
        flatten - If true, flatten recursively.
        +
        +
        • +
      + + + +
        +
      • +

        toDisjunctionArgs

        +
        Set<BooleanFormula> toDisjunctionArgs​(BooleanFormula f,
+                                      boolean flatten)
        +
        Return a set of formulas such that a disjunction over them is equivalent to the input formula. + +

        Example output: + +

          +
        • For conjunction A \/ B \/ C: A, B, C +
        • For "false": empty set. +
        • For anything else: singleton set consisting of the input formula. +
        +
        +
        Parameters:
        +
        flatten - If true, flatten recursively.
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/EnumerationFormula.html b/api/org/sosy_lab/java_smt/api/EnumerationFormula.html new file mode 100644 index 0000000000..d75c09f76f --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/EnumerationFormula.html @@ -0,0 +1,219 @@ + + + + + +EnumerationFormula (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface EnumerationFormula

+
+
+
+
    +
  • +
    +
    All Superinterfaces:
    +
    Formula
    +
    +
    +
    @Immutable
+public interface EnumerationFormula
+extends Formula
    +
    A formula of the enumeration sort.
    +
    • +
+
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/EnumerationFormulaManager.html b/api/org/sosy_lab/java_smt/api/EnumerationFormulaManager.html new file mode 100644 index 0000000000..11023023f1 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/EnumerationFormulaManager.html @@ -0,0 +1,352 @@ + + + + + +EnumerationFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface EnumerationFormulaManager

+
+
+
+ +
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/Evaluator.html b/api/org/sosy_lab/java_smt/api/Evaluator.html new file mode 100644 index 0000000000..592474ce79 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/Evaluator.html @@ -0,0 +1,483 @@ + + + + + +Evaluator (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface Evaluator

+
+
+
+
    +
  • +
    +
    All Superinterfaces:
    +
    AutoCloseable
    +
    +
    +
    All Known Subinterfaces:
    +
    Model
    +
    +
    +
    All Known Implementing Classes:
    +
    AbstractEvaluator, AbstractModel, CachingModel, DebuggingModel
    +
    +
    +
    public interface Evaluator
+extends AutoCloseable
    +
    This class provides methods to get concrete evaluations for formulas from the satisfiable solver + environment. + +

    This class can be (but does not need to be!) a cheaper and more light-weight version of a + Model and it misses several features compared to a full Model: + +

      +
    • no listing of model assignments, i.e., the user needs to query each formula on its own, +
    • no guaranteed availability after applying any operation on the original prover stack, i.e., + the evaluation is only available directly after querying the solver with a satisfiable + environment. +
    + +

    If any of these features is required, please use the complete Model.

    +
    • +
+
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Method Detail

      + + + + + +
        +
      • +

        eval

        +
        <T extends Formula> @Nullable T eval​(T formula)
        +
        Evaluate a given formula substituting the values from the model and return it as formula. + +

        If a value is not relevant to the satisfiability result, the solver can choose either to + insert an arbitrary value (e.g., the value 0 for the matching type) or just return + null. + +

        The formula does not need to be a variable, we also allow complex expression. The solver + will replace all symbols from the formula with their model values and then simplify the formula + into a simple formula, e.g., consisting only of a numeral expression.

        +
        +
        Parameters:
        +
        formula - Input formula to be evaluated.
        +
        Returns:
        +
        evaluation of the given formula or null if the solver does not provide a + better evaluation.
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        @Nullable Object evaluate​(Formula formula)
        +
        Evaluate a given formula substituting the values from the model. + +

        If a value is not relevant to the satisfiability result, the model can choose either an + arbitrary value (e.g., the value 0 for the matching type) or just return + null. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Parameters:
        +
        formula - Input formula
        +
        Returns:
        +
        Either of: - Number (Rational/Double/BigInteger/Long/Integer) - Boolean
        +
        Throws:
        +
        IllegalArgumentException - if a formula has unexpected type, e.g. Array.
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        @Nullable BigInteger evaluate​(NumeralFormula.IntegerFormula formula)
        +
        Type-safe evaluation for integer formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        @Nullable Rational evaluate​(NumeralFormula.RationalFormula formula)
        +
        Type-safe evaluation for rational formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        @Nullable Boolean evaluate​(BooleanFormula formula)
        +
        Type-safe evaluation for boolean formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        @Nullable BigInteger evaluate​(BitvectorFormula formula)
        +
        Type-safe evaluation for bitvector formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        @Nullable String evaluate​(StringFormula formula)
        +
        Type-safe evaluation for string formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        @Nullable String evaluate​(EnumerationFormula formula)
        +
        Type-safe evaluation for enumeration formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        @Nullable FloatingPointNumber evaluate​(FloatingPointFormula formula)
        +
        Type-safe evaluation for floating-point formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        • +
      + + + +
        +
      • +

        close

        +
        void close()
        +
        Free resources associated with this evaluator (existing Formula instances stay valid, + but evaluate(Formula) etc. must not be called again).
        +
        +
        Specified by:
        +
        close in interface AutoCloseable
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/FloatingPointFormula.html b/api/org/sosy_lab/java_smt/api/FloatingPointFormula.html new file mode 100644 index 0000000000..8a8f34f4fe --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/FloatingPointFormula.html @@ -0,0 +1,219 @@ + + + + + +FloatingPointFormula (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface FloatingPointFormula

+
+
+
+
    +
  • +
    +
    All Superinterfaces:
    +
    Formula
    +
    +
    +
    @Immutable
+public interface FloatingPointFormula
+extends Formula
    +
    Formula of the floating point sort.
    +
    • +
+
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/FloatingPointFormulaManager.html b/api/org/sosy_lab/java_smt/api/FloatingPointFormulaManager.html new file mode 100644 index 0000000000..53ce540b2d --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/FloatingPointFormulaManager.html @@ -0,0 +1,1173 @@ + + + + + +FloatingPointFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface FloatingPointFormulaManager

+
+
+
+
    +
  • +
    +
    All Known Implementing Classes:
    +
    AbstractFloatingPointFormulaManager, DebuggingFloatingPointFormulaManager
    +
    +
    +
    public interface FloatingPointFormulaManager
    +
    Floating point operations. + +

    Most operations are overloaded: there is an option of either using the default rounding mode + (set via the option solver.floatingPointRoundingMode), or providing the rounding mode + explicitly. + +

    If the result of an operation can not be exactly represented by the available floating-point + type, i.e., the given precision is insufficient, the result is rounded to the nearest possible + floating-point representation, depending on the given rounding mode. + +

    Example: If the input number is too large to be represented as a floating point with the given + type, it will be converted to positive infinity (+inf) or negative infinity (-inf). If the input + number is too small to be represented with the given type (closer to zero than the smallest + possible floating-point number), it will be converted to zero, with the sign preserved.

    +
    • +
+
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/FloatingPointNumber.html b/api/org/sosy_lab/java_smt/api/FloatingPointNumber.html new file mode 100644 index 0000000000..63f0208e84 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/FloatingPointNumber.html @@ -0,0 +1,570 @@ + + + + + +FloatingPointNumber (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Class FloatingPointNumber

+
+
+ +
+
    +
  • +
    +
    @Immutable
+public abstract class FloatingPointNumber
+extends Object
    +
    Represents a floating-point number with customizable precision, consisting of sign, exponent, and + mantissa components.
    +
    • +
+
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Field Detail

      + + + +
        +
      • +

        SINGLE_PRECISION_EXPONENT_SIZE

        +
        public static final int SINGLE_PRECISION_EXPONENT_SIZE
        +
        +
        See Also:
        +
        Constant Field Values
        +
        +
        • +
      + + + +
        +
      • +

        SINGLE_PRECISION_MANTISSA_SIZE

        +
        public static final int SINGLE_PRECISION_MANTISSA_SIZE
        +
        +
        See Also:
        +
        Constant Field Values
        +
        +
        • +
      + + + +
        +
      • +

        DOUBLE_PRECISION_EXPONENT_SIZE

        +
        public static final int DOUBLE_PRECISION_EXPONENT_SIZE
        +
        +
        See Also:
        +
        Constant Field Values
        +
        +
        • +
      + + + +
        +
      • +

        DOUBLE_PRECISION_MANTISSA_SIZE

        +
        public static final int DOUBLE_PRECISION_MANTISSA_SIZE
        +
        +
        See Also:
        +
        Constant Field Values
        +
        +
        • +
      +
      • +
    +
    + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        FloatingPointNumber

        +
        public FloatingPointNumber()
        +
        • +
      +
      • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        getSign

        +
        public abstract boolean getSign()
        +
        Whether the number is positive (TRUE) or negative (FALSE).
        +
        • +
      + + + +
        +
      • +

        getExponent

        +
        public abstract BigInteger getExponent()
        +
        The exponent of the floating-point number, given as numeric value.
        +
        • +
      + + + +
        +
      • +

        getMantissa

        +
        public abstract BigInteger getMantissa()
        +
        The mantissa (aka significand) of the floating-point number, given as numeric value.
        +
        • +
      + + + +
        +
      • +

        getExponentSize

        +
        public abstract int getExponentSize()
        +
        • +
      + + + +
        +
      • +

        getMantissaSize

        +
        public abstract int getMantissaSize()
        +
        • +
      + + + + + + + + + + + +
        +
      • +

        floatValue

        +
        public float floatValue()
        +
        compute a representation as Java-based float value, if possible.
        +
        • +
      + + + +
        +
      • +

        doubleValue

        +
        public double doubleValue()
        +
        compute a representation as Java-based double value, if possible.
        +
        • +
      + + + +
        +
      • +

        toString

        +
        public final String toString()
        +
        Return a bit-representation of sign-bit, exponent, and mantissa, i.e., a concatenation of their + bit-representations in this exact ordering.
        +
        +
        Overrides:
        +
        toString in class Object
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/FloatingPointRoundingMode.html b/api/org/sosy_lab/java_smt/api/FloatingPointRoundingMode.html new file mode 100644 index 0000000000..943c663bf5 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/FloatingPointRoundingMode.html @@ -0,0 +1,417 @@ + + + + + +FloatingPointRoundingMode (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Enum FloatingPointRoundingMode

+
+
+ +
+ +
+
+ +
+
+
    +
  • + +
    + +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        values

        +
        public static FloatingPointRoundingMode[] values()
        +
        Returns an array containing the constants of this enum type, in +the order they are declared. This method may be used to iterate +over the constants as follows: +
        +for (FloatingPointRoundingMode c : FloatingPointRoundingMode.values())
+    System.out.println(c);
+
        +
        +
        Returns:
        +
        an array containing the constants of this enum type, in the order they are declared
        +
        +
        • +
      + + + +
        +
      • +

        valueOf

        +
        public static FloatingPointRoundingMode valueOf​(String name)
        +
        Returns the enum constant of this type with the specified name. +The string must match exactly an identifier used to declare an +enum constant in this type. (Extraneous whitespace characters are +not permitted.)
        +
        +
        Parameters:
        +
        name - the name of the enum constant to be returned.
        +
        Returns:
        +
        the enum constant with the specified name
        +
        Throws:
        +
        IllegalArgumentException - if this enum type has no constant with the specified name
        +
        NullPointerException - if the argument is null
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/FloatingPointRoundingModeFormula.html b/api/org/sosy_lab/java_smt/api/FloatingPointRoundingModeFormula.html new file mode 100644 index 0000000000..3ab737f039 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/FloatingPointRoundingModeFormula.html @@ -0,0 +1,220 @@ + + + + + +FloatingPointRoundingModeFormula (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface FloatingPointRoundingModeFormula

+
+
+
+
    +
  • +
    +
    All Superinterfaces:
    +
    Formula
    +
    +
    +
    @Immutable
+public interface FloatingPointRoundingModeFormula
+extends Formula
    +
    Formula representing a rounding mode for floating-point operations. This is currently unused by + the API but necessary for traversal of formulas with such terms.
    +
    • +
+
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/Formula.html b/api/org/sosy_lab/java_smt/api/Formula.html new file mode 100644 index 0000000000..36228d5507 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/Formula.html @@ -0,0 +1,313 @@ + + + + + +Formula (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface Formula

+
+
+
+ +
+
+
    +
  • + +
    + +
    +
    • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        toString

        +
        String toString()
        +
        returns an arbitrary representation of the formula, might be human- or machine-readable. + +

        We do not guarantee that the returned String is in any way related to the formula. The + solver might apply escaping or even un-escaping. A user should not use the returned String for + further processing. For analyzing formulas, we recommend using a FormulaVisitor.

        +
        +
        Overrides:
        +
        toString in class Object
        +
        +
        • +
      + + + +
        +
      • +

        equals

        +
        boolean equals​(Object other)
        +
        checks whether the other object is a formula of the same structure. Does not apply an expensive + SAT-check to check equisatisfiability. + +

        Two formulas that are structured in the same way, are determined as "equal". Due to + transformations and simplifications, two equisatisfiable formulas with different structure + might not be determined as "equal".

        +
        +
        Overrides:
        +
        equals in class Object
        +
        +
        • +
      + + + + +
      • +
    +
    +
    • +
+
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/FormulaManager.html b/api/org/sosy_lab/java_smt/api/FormulaManager.html new file mode 100644 index 0000000000..32d368a1dd --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/FormulaManager.html @@ -0,0 +1,966 @@ + + + + + +FormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface FormulaManager

+
+
+
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        getIntegerFormulaManager

        +
        IntegerFormulaManager getIntegerFormulaManager()
        +
        Returns the Integer-Theory. Because most SAT-solvers support automatic casting between Integer- + and Rational-Theory, the Integer- and the RationalFormulaManager both return the same Formulas + for numeric operations like ADD, SUBTRACT, TIMES, LESSTHAN, EQUAL and others.
        +
        +
        Throws:
        +
        UnsupportedOperationException - If the theory is not supported by the solver.
        +
        +
        • +
      + + + +
        +
      • +

        getRationalFormulaManager

        +
        RationalFormulaManager getRationalFormulaManager()
        +
        Returns the Rational-Theory. Because most SAT-solvers support automatic casting between + Integer- and Rational-Theory, the Integer- and the RationalFormulaManager both return the same + Formulas for numeric operations like ADD, SUBTRACT, TIMES, LESSTHAN, EQUAL, etc.
        +
        +
        Throws:
        +
        UnsupportedOperationException - If the theory is not supported by the solver.
        +
        +
        • +
      + + + +
        +
      • +

        getBooleanFormulaManager

        +
        BooleanFormulaManager getBooleanFormulaManager()
        +
        Returns the Boolean-Theory.
        +
        • +
      + + + + + + + + + + + + + + + +
        +
      • +

        getUFManager

        +
        UFManager getUFManager()
        +
        Returns the function for dealing with uninterpreted functions (UFs).
        +
        • +
      + + + + + + + + + + + + + + + + + + + +
        +
      • +

        makeVariable

        +
        <T extends Formula> T makeVariable​(FormulaType<T> formulaType,
+                                   String name)
        +
        Create variable of the type equal to formulaType.
        +
        +
        Parameters:
        +
        formulaType - the type of the variable.
        +
        name - the name of the variable.
        +
        Returns:
        +
        the created variable.
        +
        +
        • +
      + + + +
        +
      • +

        makeApplication

        +
        <T extends Formula> T makeApplication​(FunctionDeclaration<T> declaration,
+                                      List<? extends Formula> args)
        +
        Create a function application to the given list of arguments.
        +
        +
        Parameters:
        +
        declaration - Function declaration
        +
        args - List of arguments
        +
        Returns:
        +
        Constructed formula
        +
        +
        • +
      + + + +
        +
      • +

        makeApplication

        +
        <T extends Formula> T makeApplication​(FunctionDeclaration<T> declaration,
+                                      Formula... args)
        +
        Create a function application to the given list of arguments.
        +
        +
        Parameters:
        +
        declaration - Function declaration
        +
        args - List of arguments
        +
        Returns:
        +
        Constructed formula
        +
        +
        • +
      + + + + + +
        +
      • +

        getFormulaType

        +
        <T extends Formula> FormulaType<T> getFormulaType​(T formula)
        +
        Returns the type of the given Formula.
        +
        • +
      + + + +
        +
      • +

        parse

        +
        BooleanFormula parse​(String s)
+              throws IllegalArgumentException
        +
        Parse a boolean formula given as a String in an SMTLIB file format. We expect exactly one + assertion to be contained in the query. + +

        Example: (declare-fun x () Int)(assert (= 0 x)) + +

        It depends on the used SMT solver whether the given query must be self-contained and include + declarations for all used symbols or not, and also whether the query is allowed to contain + symbols with equal name, but different type/sort than existing symbols. The safest way is to + always declare all used symbols and to avoid conflicting types for them. + +

        The behavior of the SMT solver is undefined if commands are provided in the SMTLIB-based + String that are different from declarations or an assertion, such as push/pop or + set-info. Most solvers just ignore those commands. + +

        Variables that are defined, but not used in the assertion, might be ignored by the SMT + solver and they might not be available for later usage.

        +
        +
        Returns:
        +
        A single formula from the assertion in the internal representation.
        +
        Throws:
        +
        IllegalArgumentException - If the string cannot be parsed.
        +
        +
        • +
      + + + +
        +
      • +

        dumpFormula

        +
        Appender dumpFormula​(BooleanFormula pT)
        +
        Serialize an input formula to an SMT-LIB format. Very useful when passing formulas between + different solvers. + +

        To get a String, simply call Object.toString() on the returned object. This method + is lazy and does not create an output string until the returned object is actually used.

        +
        +
        Returns:
        +
        SMT-LIB formula serialization.
        +
        +
        • +
      + + + + + + + + + +
        +
      • +

        simplify

        +
        <T extends Formula> T simplify​(T input)
+                        throws InterruptedException
        +
        Simplify an input formula, while ensuring equivalence. + +

        For solvers that do not provide a simplification API, an original formula is returned.

        +
        +
        Parameters:
        +
        input - The input formula
        +
        Returns:
        +
        Simplified version of the formula
        +
        Throws:
        +
        InterruptedException
        +
        +
        • +
      + + + +
        +
      • +

        visit

        +
        @CanIgnoreReturnValue
+<R> R visit​(Formula f,
+            FormulaVisitor<R> rFormulaVisitor)
        +
        Visit the formula with a given visitor. + +

        This method does not recursively visit sub-components of a formula its own, so the + given FormulaVisitor needs to call such visitation on its own. + +

        Please be aware that calling this method might cause extensive stack usage depending on the + nesting of the given formula and the given FormulaVisitor. Additionally, sub-formulas + that are used several times in the formula might be visited several times. For an efficient + formula traversing, we also provide visitRecursively(Formula, FormulaVisitor).

        +
        +
        Parameters:
        +
        f - formula to be visited
        +
        rFormulaVisitor - an implementation that provides steps for each kind of formula.
        +
        +
        • +
      + + + +
        +
      • +

        visitRecursively

        +
        void visitRecursively​(Formula f,
+                      FormulaVisitor<TraversalProcess> rFormulaVisitor)
        +
        Visit the formula recursively with a given FormulaVisitor. This method traverses + sub-components of a formula automatically, depending on the return value of the TraversalProcess in the given FormulaVisitor. + +

        This method guarantees that the traversal is done iteratively, without using Java recursion, + and thus is not prone to StackOverflowErrors. + +

        Furthermore, this method also guarantees that every equal part of the formula is visited + only once. Thus, it can be used to traverse DAG-like formulas efficiently. + +

        The traversal is done in PRE-ORDER manner with regard to caching identical subtrees, i.e., a + parent will be visited BEFORE its children. The unmodified child-formulas are passed as + argument to the parent's visitation.

        +
        • +
      + + + + + +
        +
      • +

        transformRecursively

        +
        <T extends Formula> T transformRecursively​(T f,
+                                           FormulaTransformationVisitor pFormulaVisitor)
        +
        Visit the formula recursively with a given FormulaVisitor. + +

        This method guarantees that the traversal is done iteratively, without using Java recursion, + and thus is not prone to StackOverflowErrors. + +

        Furthermore, this method also guarantees that every equal part of the formula is visited + only once. Thus, it can be used to traverse DAG-like formulas efficiently. + +

        The traversal is done in POST-ORDER manner with regard to caching identical subtrees, i.e., + a parent will be visited AFTER its children. The result of the child-visitation is passed as + argument to the parent's visitation.

        +
        +
        Parameters:
        +
        pFormulaVisitor - Transformation described by the user.
        +
        +
        • +
      + + + +
        +
      • +

        extractVariables

        +
        ImmutableMap<String,​Formula> extractVariables​(Formula f)
        +
        Extract the names of all free variables and UFs in a formula.
        +
        +
        Parameters:
        +
        f - The input formula
        +
        Returns:
        +
        Map from variable names to the corresponding formulas.
        +
        +
        • +
      + + + +
        +
      • +

        extractVariablesAndUFs

        +
        ImmutableMap<String,​Formula> extractVariablesAndUFs​(Formula f)
        +
        Extract the names of all free variables and UFs in a formula.
        +
        +
        Parameters:
        +
        f - The input formula
        +
        Returns:
        +
        Map from variable names to the corresponding formulas. If an UF occurs multiple times + in the input formula, an arbitrary instance of an application of this UF is in the map.
        +
        +
        • +
      + + + + + +
        +
      • +

        substitute

        +
        <T extends Formula> T substitute​(T f,
+                                 Map<? extends Formula,​? extends Formula> fromToMapping)
        +
        Substitute every occurrence of any item from changeFrom in formula f to the + corresponding occurrence from changeTo. + +

        E.g. if changeFrom contains a variable a and changeTo contains a + variable b all occurrences of a will be changed to b in the returned + formula.

        +
        +
        Parameters:
        +
        f - Formula to change.
        +
        fromToMapping - Mapping of old and new formula parts.
        +
        Returns:
        +
        Formula with parts replaced.
        +
        +
        • +
      + + + +
        +
      • +

        translateFrom

        +
        BooleanFormula translateFrom​(BooleanFormula formula,
+                             FormulaManager otherManager)
        +
        Translates the formula from another context into the context represented by this. + Default implementation relies on string serialization (dumpFormula(BooleanFormula) and + parse(String)), but each solver may implement more efficient translation between its + own contexts.
        +
        +
        Parameters:
        +
        formula - Formula belonging to otherContext.
        +
        otherManager - Formula manager belonging to the other context.
        +
        Returns:
        +
        Formula belonging to this context.
        +
        +
        • +
      + + + +
        +
      • +

        isValidName

        +
        boolean isValidName​(String variableName)
        +
        Check whether the given String can be used as symbol/name for variables or undefined functions. + +

        We explicitly state that with further development of SMT solvers and the SMTLib + specification, the list of forbidden variable names may change in the future. Users should if + possible not use logical or mathematical operators, or keywords strongly depending on SMTlib. + +

        If a variable name is rejected, a possibility is escaping, e.g. either substituting the + whole variable name or just every invalid character with an escaped form. We recommend using an + escape sequence based on the token "JAVASMT", because it might be unusual enough to appear when + encoding a user's problem in SMT. Please note that you might also have to handle escaping the + escape sequence. Examples: + +

          +
        • the invalid variable name "=" (logical operator for equality) can be + replaced with a string "JAVASMT_EQUALS". +
        • the invalid SMTlib-escaped variable name "|test|" (the solver SMTInterpol + does not allow the pipe symbol "|" in names) can be replaced with + "JAVASMT_PIPEtestJAVASMT_PIPE". +
        +
        • +
      + + + +
        +
      • +

        escape

        +
        String escape​(String variableName)
        +
        Get an escaped symbol/name for variables or undefined functions, if necessary. + +

        See isValidName(String) for further details.

        +
        • +
      + + + +
        +
      • +

        unescape

        +
        String unescape​(String variableName)
        +
        Unescape the symbol/name for variables or undefined functions, if necessary. + +

        The result is undefined for Strings that are not properly escaped. + +

        See isValidName(String) for further details.

        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/FormulaType.ArrayFormulaType.html b/api/org/sosy_lab/java_smt/api/FormulaType.ArrayFormulaType.html new file mode 100644 index 0000000000..aed65eda3b --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/FormulaType.ArrayFormulaType.html @@ -0,0 +1,423 @@ + + + + + +FormulaType.ArrayFormulaType (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Class FormulaType.ArrayFormulaType<TI extends Formula,​TE extends Formula>

+
+
+ +
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/FormulaType.BitvectorType.html b/api/org/sosy_lab/java_smt/api/FormulaType.BitvectorType.html new file mode 100644 index 0000000000..864aa54c87 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/FormulaType.BitvectorType.html @@ -0,0 +1,410 @@ + + + + + +FormulaType.BitvectorType (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Class FormulaType.BitvectorType

+
+
+ +
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/FormulaType.EnumerationFormulaType.html b/api/org/sosy_lab/java_smt/api/FormulaType.EnumerationFormulaType.html new file mode 100644 index 0000000000..0202ae50c3 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/FormulaType.EnumerationFormulaType.html @@ -0,0 +1,437 @@ + + + + + +FormulaType.EnumerationFormulaType (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Class FormulaType.EnumerationFormulaType

+
+
+ +
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/FormulaType.FloatingPointType.html b/api/org/sosy_lab/java_smt/api/FormulaType.FloatingPointType.html new file mode 100644 index 0000000000..f30601f5f0 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/FormulaType.FloatingPointType.html @@ -0,0 +1,441 @@ + + + + + +FormulaType.FloatingPointType (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Class FormulaType.FloatingPointType

+
+
+ +
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/FormulaType.NumeralType.html b/api/org/sosy_lab/java_smt/api/FormulaType.NumeralType.html new file mode 100644 index 0000000000..bacb9030ab --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/FormulaType.NumeralType.html @@ -0,0 +1,360 @@ + + + + + +FormulaType.NumeralType (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Class FormulaType.NumeralType<T extends NumeralFormula>

+
+
+ +
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        NumeralType

        +
        public NumeralType()
        +
        • +
      +
      • +
    +
    + +
    + +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/FormulaType.html b/api/org/sosy_lab/java_smt/api/FormulaType.html new file mode 100644 index 0000000000..8fe05875ae --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/FormulaType.html @@ -0,0 +1,726 @@ + + + + + +FormulaType (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Class FormulaType<T extends Formula>

+
+
+ +
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/FunctionDeclaration.html b/api/org/sosy_lab/java_smt/api/FunctionDeclaration.html new file mode 100644 index 0000000000..ac21e89578 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/FunctionDeclaration.html @@ -0,0 +1,315 @@ + + + + + +FunctionDeclaration (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface FunctionDeclaration<E extends Formula>

+
+
+
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Method Detail

      + + + + + + + +
        +
      • +

        getName

        +
        String getName()
        +
        +
        Returns:
        +
        Name of the function (UF name / "LT" / etc...).
        +
        +
        • +
      + + + +
        +
      • +

        getType

        +
        FormulaType<E> getType()
        +
        +
        Returns:
        +
        Sort of the function output.
        +
        +
        • +
      + + + + +
      • +
    +
    +
    • +
+
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/FunctionDeclarationKind.html b/api/org/sosy_lab/java_smt/api/FunctionDeclarationKind.html new file mode 100644 index 0000000000..7ebbffaa59 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/FunctionDeclarationKind.html @@ -0,0 +1,2093 @@ + + + + + +FunctionDeclarationKind (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Enum FunctionDeclarationKind

+
+
+ +
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Enum Constant Summary

      + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
      Enum Constants 
      Enum ConstantDescription
      ADD +
      Addition over integers and rationals.
      +
      AND 
      BV_ADD +
      Addition over bitvectors.
      +
      BV_AND +
      Bitwise AND over bitvectors.
      +
      BV_ASHR +
      Arithmetic right-shift over bitvectors (fill from left with value of first bit).
      +
      BV_CONCAT +
      Concatenation over bitvectors.
      +
      BV_EQ +
      Equality over bitvectors.
      +
      BV_EXTRACT +
      Extraction over bitvectors.
      +
      BV_LSHR +
      Logical right-shift over bitvectors (fill from left with zeroes).
      +
      BV_MUL +
      Multiplication over bitvectors.
      +
      BV_NEG +
      Negation of a bitvector.
      +
      BV_NOT +
      Bitwise negation of a bitvector.
      +
      BV_OR +
      Bitwise OR over bitvectors.
      +
      BV_SCASTTO_FP +
      Cast a signed bitvector to a floating-point number.
      +
      BV_SDIV +
      Signed division over bitvectors.
      +
      BV_SGE +
      Signed greater-than-or-equal over bitvectors.
      +
      BV_SGT +
      Unsigned greater-than over bitvectors.
      +
      BV_SHL +
      Logical left-shift over bitvectors (fill from right with zeroes).
      +
      BV_SIGN_EXTENSION +
      Extend bitvectors according to their sign.
      +
      BV_SLE +
      Signed greater-than-or-equal over bitvectors.
      +
      BV_SLT +
      Unsigned less-than over bitvectors.
      +
      BV_SMOD +
      Signed modulo over bitvectors.
      +
      BV_SREM +
      Signed remainder over bitvectors.
      +
      BV_SUB +
      Subtraction over bitvectors.
      +
      BV_UCASTTO_FP +
      Cast an unsigned bitvector to a floating-point number.
      +
      BV_UDIV +
      Unsigned division over bitvectors.
      +
      BV_UGE +
      Unsigned greater-than-or-equal over bitvectors.
      +
      BV_UGT +
      Signed greater-than over bitvectors.
      +
      BV_ULE +
      Unsigned less-than-or-equal over bitvectors.
      +
      BV_ULT +
      Signed less-than over bitvectors.
      +
      BV_UREM +
      Unsigned remainder over bitvectors.
      +
      BV_XOR +
      Bitwise XOR over bitvectors.
      +
      BV_ZERO_EXTENSION +
      Extend bitvectors with zeros.
      +
      CONST 
      DISTINCT +
      Distinct operator for a set of numeric formulas.
      +
      DIV +
      Division over rationals and integer division over integers.
      +
      EQ +
      Equality over integers and rationals.
      +
      EQ_ZERO +
      Unary comparison to zero.
      +
      FLOOR +
      Floor operation, converts from rationals to integers, also known as to_int.
      +
      FP_ABS +
      Absolute value of a floating point.
      +
      FP_ADD +
      Addition over floating points.
      +
      FP_AS_IEEEBV 
      FP_CASTTO_FP 
      FP_CASTTO_SBV 
      FP_CASTTO_UBV 
      FP_DIV +
      Division over floating points.
      +
      FP_EQ +
      Equal over floating points.
      +
      FP_FROM_IEEEBV 
      FP_GE +
      Greater-than-or-equal over floating points.
      +
      FP_GT +
      Greater-than over floating points.
      +
      FP_IS_INF 
      FP_IS_NAN +
      Further FP queries.
      +
      FP_IS_NEGATIVE 
      FP_IS_NORMAL 
      FP_IS_SUBNORMAL 
      FP_IS_ZERO 
      FP_LE +
      Less-than-or-equal over floating points.
      +
      FP_LT +
      Less-than over floating points.
      +
      FP_MAX +
      Maximum of two floating points.
      +
      FP_MIN +
      Minimum of two floating points.
      +
      FP_MUL +
      Multiplication over floating points.
      +
      FP_NEG +
      Negation of a floating point.
      +
      FP_ROUND_AWAY +
      Rounding over floating points.
      +
      FP_ROUND_EVEN +
      Rounding over floating points.
      +
      FP_ROUND_NEGATIVE +
      Rounding over floating points.
      +
      FP_ROUND_POSITIVE +
      Rounding over floating points.
      +
      FP_ROUND_TO_INTEGRAL +
      Rounding over floating points.
      +
      FP_ROUND_ZERO +
      Rounding over floating points.
      +
      FP_SQRT +
      Square root of a floating point.
      +
      FP_SUB +
      Subtraction over floating points.
      +
      GT +
      Greater-than over integers and rationals.
      +
      GTE +
      Greater-than-or-equal over integers and rationals.
      +
      GTE_ZERO +
      Unary comparison with zero.
      +
      IFF +
      If and only if.
      +
      IMPLIES +
      Implication between two boolean formulas.
      +
      INT_TO_STR 
      ITE +
      If-then-else operator.
      +
      LT +
      Less-than over integers and rationals.
      +
      LTE +
      Less-than-or-equal over integers and rationals.
      +
      MODULO +
      Modulo operator over integers.
      +
      MUL +
      Multiplication over integers and rationals.
      +
      NOT 
      OR 
      OTHER +
      Solvers support a lot of different built-in theories.
      +
      RE_COMPLEMENT 
      RE_CONCAT 
      RE_DIFFERENCE 
      RE_INTERSECT 
      RE_OPTIONAL 
      RE_PLUS 
      RE_RANGE 
      RE_STAR 
      RE_UNION 
      SELECT 
      STORE +
      Store and select on arrays, and constant initialization.
      +
      STR_CHAR_AT 
      STR_CONCAT 
      STR_CONTAINS 
      STR_IN_RE 
      STR_INDEX_OF 
      STR_LE 
      STR_LENGTH 
      STR_LT 
      STR_PREFIX 
      STR_REPLACE 
      STR_REPLACE_ALL 
      STR_SUBSTRING 
      STR_SUFFIX 
      STR_TO_INT 
      STR_TO_RE 
      SUB +
      Subtraction over integers and rationals.
      +
      TO_REAL +
      Identity operation, converts from integers to rationals, also known as to_real.
      +
      UF +
      Uninterpreted function.
      +
      UMINUS +
      Unary minus.
      +
      VAR +
      User-defined variable.
      +
      XOR +
      Exclusive OR over two formulas.
      +
      +
      • +
    +
    + +
    + +
    +
    • +
+
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/IntegerFormulaManager.html b/api/org/sosy_lab/java_smt/api/IntegerFormulaManager.html new file mode 100644 index 0000000000..048b5530c4 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/IntegerFormulaManager.html @@ -0,0 +1,355 @@ + + + + + +IntegerFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface IntegerFormulaManager

+
+
+
+ +
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/InterpolatingProverEnvironment.html b/api/org/sosy_lab/java_smt/api/InterpolatingProverEnvironment.html new file mode 100644 index 0000000000..4ef1617bfb --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/InterpolatingProverEnvironment.html @@ -0,0 +1,500 @@ + + + + + +InterpolatingProverEnvironment (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface InterpolatingProverEnvironment<T>

+
+
+
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        getInterpolant

        +
        BooleanFormula getInterpolant​(Collection<T> formulasOfA)
+                       throws SolverException,
+                              InterruptedException
        +
        Get an interpolant for two groups of formulas. This should be called only immediately after an + BasicProverEnvironment.isUnsat() call that returned true. + +

        There is no direct guarantee that the interpolants returned are part of an inductive + sequence', however this seems to work for most solvers as long as the same proof is used, i.e. + all interpolants are computed after the same SAT-check. If a solver does not use the same + internal proof for several interpolation queries (such as CVC5), then the returned interpolants + might not satisfy the sequence-criteria. We suggest the proper method getSeqInterpolants(java.util.List<? extends java.util.Collection<T>>) for that case.

        +
        +
        Parameters:
        +
        formulasOfA - A collection of values returned by BasicProverEnvironment.push(BooleanFormula). All the + corresponding formulas from group A, the remaining formulas form group B.
        +
        Returns:
        +
        An interpolant for A and B
        +
        Throws:
        +
        SolverException - if interpolant cannot be computed, for example because interpolation + procedure is incomplete
        +
        InterruptedException
        +
        +
        • +
      + + + +
        +
      • +

        getSeqInterpolants

        +
        default List<BooleanFormula> getSeqInterpolants​(List<? extends Collection<T>> partitionedFormulas)
+                                         throws SolverException,
+                                                InterruptedException
        +
        This method returns interpolants of an 'inductive sequence'. This property must be supported by + the interpolation-strategy of the underlying SMT-solver! Depending on the underlying SMT-solver + this method might be faster than N direct calls to getInterpolant(). + +

        The prover stack should contain the partitioned formulas, but any order is allowed. For an + input of N partitions we return N-1 interpolants. Any asserted formula that is on the prover + stack and not part of the partitioned list, will be used for background theory and its symbols + can appear in any interpolant.

        +
        +
        Returns:
        +
        a 'inductive sequence' of interpolants, such that the implication AND(I_i, P_i) + => I_(i+1) is satisfied for all i, where P_i is the conjunction of all formulas in + partition i.
        +
        Throws:
        +
        SolverException - if interpolant cannot be computed, for example because interpolation + procedure is incomplete
        +
        InterruptedException
        +
        +
        • +
      + + + + + + + +
        +
      • +

        getTreeInterpolants

        +
        List<BooleanFormula> getTreeInterpolants​(List<? extends Collection<T>> partitionedFormulas,
+                                         int[] startOfSubTree)
+                                  throws SolverException,
+                                         InterruptedException
        +
        Compute a sequence of interpolants. The nesting array describes the start of the subtree for + tree interpolants. For inductive sequences of interpolants use a nesting array completely + filled with 0. + +

        Example: + + 

        + A  D
+ |  |
+ B  E
+ | /
+ C
+ |
+ F  H
+ | /
+ G
+
+ arrayIndex     = [0,1,2,3,4,5,6,7]  // only for demonstration, not needed
+ partition      = [A,B,D,E,C,F,H,G]  // post-order of tree
+ startOfSubTree = [0,0,2,2,0,0,6,0]  // index of left-most leaf of the current element
+
        + +

        The prover stack should contain the partitioned formulas. For an input of N partitions + (nodes in the tree) we return N-1 interpolants (one interpolant for/below each node except the + root). Any asserted formula that is on the prover stack and not part of the partitioned list, + will be used for background theory and its symbols can appear in any interpolant.

        +
        +
        Parameters:
        +
        partitionedFormulas - of formulas
        +
        startOfSubTree - The start of the subtree containing the formula at this index as root.
        +
        Returns:
        +
        Tree interpolants respecting the nesting relation.
        +
        Throws:
        +
        SolverException - if interpolant cannot be computed, for example because interpolation + procedure is incomplete
        +
        InterruptedException
        +
        +
        • +
      + + + + + + + +
        +
      • +

        checkTreeStructure

        +
        static boolean checkTreeStructure​(int numOfPartitions,
+                                  int[] startOfSubTree)
        +
        Checks for a valid subtree-structure. This code is taken from SMTinterpol.
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/Model.ValueAssignment.html b/api/org/sosy_lab/java_smt/api/Model.ValueAssignment.html new file mode 100644 index 0000000000..21f6d0673e --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/Model.ValueAssignment.html @@ -0,0 +1,506 @@ + + + + + +Model.ValueAssignment (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Class Model.ValueAssignment

+
+
+ +
+
    +
  • +
    +
    Enclosing interface:
    +
    Model
    +
    +
    +
    public static final class Model.ValueAssignment
+extends Object
    +
    • +
+
+
+ +
+
+
    +
  • + +
    + +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        getKey

        +
        public Formula getKey()
        +
        The formula AST which is assigned a given value.
        +
        • +
      + + + +
        +
      • +

        getValueAsFormula

        +
        public Formula getValueAsFormula()
        +
        The formula AST which is assigned to a given key.
        +
        • +
      + + + +
        +
      • +

        getAssignmentAsFormula

        +
        public BooleanFormula getAssignmentAsFormula()
        +
        The formula AST representing the equality of key and value.
        +
        • +
      + + + +
        +
      • +

        getName

        +
        public String getName()
        +
        Variable name for variables, function name for UFs, and array name for arrays.
        +
        • +
      + + + + + + + +
        +
      • +

        getArgumentsInterpretation

        +
        public ImmutableList<Object> getArgumentsInterpretation()
        +
        Interpretation assigned for function arguments. Empty for variables.
        +
        • +
      + + + +
        +
      • +

        isFunction

        +
        public boolean isFunction()
        +
        • +
      + + + +
        +
      • +

        getArity

        +
        public int getArity()
        +
        • +
      + + + +
        +
      • +

        getArgInterpretation

        +
        public Object getArgInterpretation​(int i)
        +
        • +
      + + + + + + + +
        +
      • +

        equals

        +
        public boolean equals​(Object o)
        +
        +
        Overrides:
        +
        equals in class Object
        +
        +
        • +
      + + + +
        +
      • +

        hashCode

        +
        public int hashCode()
        +
        +
        Overrides:
        +
        hashCode in class Object
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/Model.html b/api/org/sosy_lab/java_smt/api/Model.html new file mode 100644 index 0000000000..b9553b7956 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/Model.html @@ -0,0 +1,398 @@ + + + + + +Model (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface Model

+
+
+
+
    +
  • +
    +
    All Superinterfaces:
    +
    AutoCloseable, Evaluator, Iterable<Model.ValueAssignment>
    +
    +
    +
    All Known Implementing Classes:
    +
    AbstractModel, CachingModel, DebuggingModel
    +
    +
    +
    public interface Model
+extends Evaluator, Iterable<Model.ValueAssignment>, AutoCloseable
    +
    This class provides a model with concrete evaluations for symbols and formulas from the + satisfiable solver environment. + +

    This class is an extensions of Evaluator and provides more features: + +

      +
    • a listing of model assignments, i.e., the user can iterate over all available symbols and + their assignments, +
    • a guaranteed availability even after applying any operation on the original prover stack, i + .e., the model instance stays constant and remains valid for one given satisfiable prover + environment. +
    +
    • +
+
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        iterator

        +
        default Iterator<Model.ValueAssignment> iterator()
        +
        Iterate over all values present in the model. Note that iterating multiple times may be + inefficient for some solvers, it is recommended to use BasicProverEnvironment.getModelAssignments() instead in this case. + +

        The iteration includes value assignments for... + +

          +
        • all relevant free variables of simple type. If a variable is irrelevant for + satisfiability, it can be null or missing in the iteration. +
        • (nested) arrays with all accesses. If an array access is applied within a quantified + context, some value assignments can be missing in the iteration. Please use a direct + evaluation query to get the evaluation in such a case. +
        • uninterpreted functions with all applications. If an uninterpreted function is applied + within a quantified context, some value assignments can be missing in the iteration. + Please use a direct evaluation query to get the evaluation in such a case. +
        +
        +
        Specified by:
        +
        iterator in interface Iterable<Model.ValueAssignment>
        +
        +
        • +
      + + + + + + + +
        +
      • +

        toString

        +
        String toString()
        +
        Pretty-printing of the model values. + +

        Please only use this method for debugging and not for retrieving relevant information about + the model. The returned model representation is not intended for further usage like parsing, + because we do not guarantee any specific format, e.g., for arrays and uninterpreted functions, + and we allow the SMT solver to include arbitrary additional information about the current + solver state, e.g., any available symbol in the solver, even from other provers, and temporary + internal symbols.

        +
        +
        Overrides:
        +
        toString in class Object
        +
        +
        • +
      + + + + +
      • +
    +
    +
    • +
+
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/NumeralFormula.IntegerFormula.html b/api/org/sosy_lab/java_smt/api/NumeralFormula.IntegerFormula.html new file mode 100644 index 0000000000..789015534c --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/NumeralFormula.IntegerFormula.html @@ -0,0 +1,239 @@ + + + + + +NumeralFormula.IntegerFormula (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface NumeralFormula.IntegerFormula

+
+
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/NumeralFormula.RationalFormula.html b/api/org/sosy_lab/java_smt/api/NumeralFormula.RationalFormula.html new file mode 100644 index 0000000000..63bdf1fd47 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/NumeralFormula.RationalFormula.html @@ -0,0 +1,239 @@ + + + + + +NumeralFormula.RationalFormula (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface NumeralFormula.RationalFormula

+
+
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/NumeralFormula.html b/api/org/sosy_lab/java_smt/api/NumeralFormula.html new file mode 100644 index 0000000000..9dbc8845ba --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/NumeralFormula.html @@ -0,0 +1,251 @@ + + + + + +NumeralFormula (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface NumeralFormula

+
+
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/NumeralFormulaManager.html b/api/org/sosy_lab/java_smt/api/NumeralFormulaManager.html new file mode 100644 index 0000000000..1284895acc --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/NumeralFormulaManager.html @@ -0,0 +1,622 @@ + + + + + +NumeralFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface NumeralFormulaManager<ParamFormulaType extends NumeralFormula,​ResultFormulaType extends NumeralFormula>

+
+
+
+ +
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/OptimizationProverEnvironment.OptStatus.html b/api/org/sosy_lab/java_smt/api/OptimizationProverEnvironment.OptStatus.html new file mode 100644 index 0000000000..77c65dbc98 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/OptimizationProverEnvironment.OptStatus.html @@ -0,0 +1,404 @@ + + + + + +OptimizationProverEnvironment.OptStatus (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Enum OptimizationProverEnvironment.OptStatus

+
+
+ +
+ +
+
+ +
+
+
    +
  • + +
    + +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        values

        +
        public static OptimizationProverEnvironment.OptStatus[] values()
        +
        Returns an array containing the constants of this enum type, in +the order they are declared. This method may be used to iterate +over the constants as follows: +
        +for (OptimizationProverEnvironment.OptStatus c : OptimizationProverEnvironment.OptStatus.values())
+    System.out.println(c);
+
        +
        +
        Returns:
        +
        an array containing the constants of this enum type, in the order they are declared
        +
        +
        • +
      + + + +
        +
      • +

        valueOf

        +
        public static OptimizationProverEnvironment.OptStatus valueOf​(String name)
        +
        Returns the enum constant of this type with the specified name. +The string must match exactly an identifier used to declare an +enum constant in this type. (Extraneous whitespace characters are +not permitted.)
        +
        +
        Parameters:
        +
        name - the name of the enum constant to be returned.
        +
        Returns:
        +
        the enum constant with the specified name
        +
        Throws:
        +
        IllegalArgumentException - if this enum type has no constant with the specified name
        +
        NullPointerException - if the argument is null
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/OptimizationProverEnvironment.html b/api/org/sosy_lab/java_smt/api/OptimizationProverEnvironment.html new file mode 100644 index 0000000000..7c4660146b --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/OptimizationProverEnvironment.html @@ -0,0 +1,459 @@ + + + + + +OptimizationProverEnvironment (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface OptimizationProverEnvironment

+
+
+
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        maximize

        +
        int maximize​(Formula objective)
        +
        Add the maximization objective. + +

        Note: push/pop may be used for switching objectives

        +
        +
        Returns:
        +
        Objective handle, to be used for retrieving the value.
        +
        +
        • +
      + + + +
        +
      • +

        minimize

        +
        int minimize​(Formula objective)
        +
        Add minimization objective. + +

        Note: push/pop may be used for switching objectives

        +
        +
        Returns:
        +
        Objective handle, to be used for retrieving the value.
        +
        +
        • +
      + + + + + + + +
        +
      • +

        upper

        +
        Optional<Rational> upper​(int handle,
+                         Rational epsilon)
        +
        +
        Parameters:
        +
        epsilon - Value to substitute for the epsilon.
        +
        Returns:
        +
        Upper approximation of the optimized value, or absent optional if the objective is + unbounded.
        +
        +
        • +
      + + + +
        +
      • +

        lower

        +
        Optional<Rational> lower​(int handle,
+                         Rational epsilon)
        +
        +
        Parameters:
        +
        epsilon - Value to substitute for the epsilon.
        +
        Returns:
        +
        Lower approximation of the optimized value, or absent optional if the objective is + unbounded.
        +
        +
        • +
      + + + +
        +
      • +

        getModel

        +
        Model getModel()
+        throws SolverException
        +
        Get a satisfying assignment. This method should be called only immediately after an BasicProverEnvironment.isUnsat() call that returned false. The returned model is guaranteed to stay + constant and valid as long as the solver context is available, even if constraints are added + to, pushed or popped from the prover stack. + +

        A model might contain additional symbols with their evaluation, if a solver uses its own + temporary symbols. There should be at least a value-assignment for each free symbol. + +

        Please note that the prover is allowed to use standard numbers for any real variable in the + model after a sat-query returned OptimizationProverEnvironment.OptStatus.OPT. For integer formulas, we expect the + optimal assignment. + +

        Example 1: For the constraint 'x<10' with a real x, the upper bound of x is '10-epsilon' + (epsilon can even be set to zero). The model can return the assignment x=9. To get an optimal + assignment, query the solver with an additional constraint 'x == 10-epsilon'. + +

        Example 2: For the constraint 'x<10' with an integer x, the upper bound of x is '9' + (epsilon is irrelevant here and can be zero). The model returns the optimal assignment x=9.

        +
        +
        Specified by:
        +
        getModel in interface BasicProverEnvironment<Void>
        +
        Throws:
        +
        SolverException
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/PropagatorBackend.html b/api/org/sosy_lab/java_smt/api/PropagatorBackend.html new file mode 100644 index 0000000000..14218fe736 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/PropagatorBackend.html @@ -0,0 +1,404 @@ + + + + + +PropagatorBackend (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface PropagatorBackend

+
+
+
+
    +
  • +
    +
    public interface PropagatorBackend
    +
    The PropagatorBackend class is used by UserPropagator to implement custom user + propagators. It contains functions to interact with the SAT/SMT core during solving, for example, + it provides the ability to propagate conflicts and to influence the decision-making.
    +
    • +
+
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/ProverEnvironment.html b/api/org/sosy_lab/java_smt/api/ProverEnvironment.html new file mode 100644 index 0000000000..9e301f50cd --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/ProverEnvironment.html @@ -0,0 +1,264 @@ + + + + + +ProverEnvironment (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface ProverEnvironment

+
+
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/QuantifiedFormulaManager.Quantifier.html b/api/org/sosy_lab/java_smt/api/QuantifiedFormulaManager.Quantifier.html new file mode 100644 index 0000000000..d7512d5398 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/QuantifiedFormulaManager.Quantifier.html @@ -0,0 +1,381 @@ + + + + + +QuantifiedFormulaManager.Quantifier (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Enum QuantifiedFormulaManager.Quantifier

+
+
+ +
+ +
+
+ +
+
+
    +
  • + +
    + +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        values

        +
        public static QuantifiedFormulaManager.Quantifier[] values()
        +
        Returns an array containing the constants of this enum type, in +the order they are declared. This method may be used to iterate +over the constants as follows: +
        +for (QuantifiedFormulaManager.Quantifier c : QuantifiedFormulaManager.Quantifier.values())
+    System.out.println(c);
+
        +
        +
        Returns:
        +
        an array containing the constants of this enum type, in the order they are declared
        +
        +
        • +
      + + + +
        +
      • +

        valueOf

        +
        public static QuantifiedFormulaManager.Quantifier valueOf​(String name)
        +
        Returns the enum constant of this type with the specified name. +The string must match exactly an identifier used to declare an +enum constant in this type. (Extraneous whitespace characters are +not permitted.)
        +
        +
        Parameters:
        +
        name - the name of the enum constant to be returned.
        +
        Returns:
        +
        the enum constant with the specified name
        +
        Throws:
        +
        IllegalArgumentException - if this enum type has no constant with the specified name
        +
        NullPointerException - if the argument is null
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/QuantifiedFormulaManager.html b/api/org/sosy_lab/java_smt/api/QuantifiedFormulaManager.html new file mode 100644 index 0000000000..513ada293c --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/QuantifiedFormulaManager.html @@ -0,0 +1,410 @@ + + + + + +QuantifiedFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface QuantifiedFormulaManager

+
+
+
+ +
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/RationalFormulaManager.html b/api/org/sosy_lab/java_smt/api/RationalFormulaManager.html new file mode 100644 index 0000000000..97e3cd0544 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/RationalFormulaManager.html @@ -0,0 +1,272 @@ + + + + + +RationalFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface RationalFormulaManager

+
+
+
+ +
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/RegexFormula.html b/api/org/sosy_lab/java_smt/api/RegexFormula.html new file mode 100644 index 0000000000..a3b5eccb79 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/RegexFormula.html @@ -0,0 +1,219 @@ + + + + + +RegexFormula (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface RegexFormula

+
+
+
+
    +
  • +
    +
    All Superinterfaces:
    +
    Formula
    +
    +
    +
    @Immutable
+public interface RegexFormula
+extends Formula
    +
    A formula of the string sort.
    +
    • +
+
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/SLFormulaManager.html b/api/org/sosy_lab/java_smt/api/SLFormulaManager.html new file mode 100644 index 0000000000..0cbd6f09b5 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/SLFormulaManager.html @@ -0,0 +1,329 @@ + + + + + +SLFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface SLFormulaManager

+
+
+
+ +
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/SolverContext.ProverOptions.html b/api/org/sosy_lab/java_smt/api/SolverContext.ProverOptions.html new file mode 100644 index 0000000000..f9f529dc55 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/SolverContext.ProverOptions.html @@ -0,0 +1,441 @@ + + + + + +SolverContext.ProverOptions (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Enum SolverContext.ProverOptions

+
+
+ +
+ +
+
+ +
+
+
    +
  • + +
    + +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        values

        +
        public static SolverContext.ProverOptions[] values()
        +
        Returns an array containing the constants of this enum type, in +the order they are declared. This method may be used to iterate +over the constants as follows: +
        +for (SolverContext.ProverOptions c : SolverContext.ProverOptions.values())
+    System.out.println(c);
+
        +
        +
        Returns:
        +
        an array containing the constants of this enum type, in the order they are declared
        +
        +
        • +
      + + + +
        +
      • +

        valueOf

        +
        public static SolverContext.ProverOptions valueOf​(String name)
        +
        Returns the enum constant of this type with the specified name. +The string must match exactly an identifier used to declare an +enum constant in this type. (Extraneous whitespace characters are +not permitted.)
        +
        +
        Parameters:
        +
        name - the name of the enum constant to be returned.
        +
        Returns:
        +
        the enum constant with the specified name
        +
        Throws:
        +
        IllegalArgumentException - if this enum type has no constant with the specified name
        +
        NullPointerException - if the argument is null
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/SolverContext.html b/api/org/sosy_lab/java_smt/api/SolverContext.html new file mode 100644 index 0000000000..87bcd956e1 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/SolverContext.html @@ -0,0 +1,460 @@ + + + + + +SolverContext (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface SolverContext

+
+
+
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        getFormulaManager

        +
        FormulaManager getFormulaManager()
        +
        Get the formula manager, which is used for formula manipulation.
        +
        • +
      + + + + + + + + + + + + + + + +
        +
      • +

        getVersion

        +
        String getVersion()
        +
        Get version information out of the solver. + +

        In most cases, the version contains the name of the solver followed by some numbers and + additional info about the version, e.g., "SMTInterpol 2.5-12-g3d15a15c".

        +
        • +
      + + + + + + + +
        +
      • +

        getStatistics

        +
        default ImmutableMap<String,​String> getStatistics()
        +
        Get statistics for a complete solver context. The returned mapping is intended to provide the + solver-internal statistics. The keys can differ between individual solvers. + +

        Calling the statistics several times for the same context returns accumulated number, i.e., + we currently do not provide any possibility to reset the statistics. + +

        We do not guarantee any specific key to be present, as this depends on the used solver. We + might even return an empty mapping if the solver does not support calling this method or is in + an invalid state.

        +
        +
        See Also:
        +
        BasicProverEnvironment.getStatistics()
        +
        +
        • +
      + + + +
        +
      • +

        close

        +
        void close()
        +
        Close the solver context. + +

        After calling this method, further access to any object that had been returned from this + context is not wanted, i.e., it depends on the solver. Java-based solvers might wait for the + next garbage collection with any cleanup operation. Native solvers might even reference invalid + memory and cause segmentation faults. + +

        Necessary for the solvers implemented in native code, frees the associated memory.

        +
        +
        Specified by:
        +
        close in interface AutoCloseable
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/SolverException.html b/api/org/sosy_lab/java_smt/api/SolverException.html new file mode 100644 index 0000000000..71d15ed3cb --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/SolverException.html @@ -0,0 +1,308 @@ + + + + + +SolverException (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Class SolverException

+
+
+ +
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    Serializable
    +
    +
    +
    public class SolverException
+extends Exception
    +
    Exception thrown if there is an error during SMT solving.
    +
    +
    See Also:
    +
    Serialized Form
    +
    +
    • +
+
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        SolverException

        +
        public SolverException​(@Nullable String msg)
        +
        • +
      + + + +
        +
      • +

        SolverException

        +
        public SolverException​(@Nullable String msg,
+                       @Nullable Throwable t)
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/StringFormula.html b/api/org/sosy_lab/java_smt/api/StringFormula.html new file mode 100644 index 0000000000..d95df3562a --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/StringFormula.html @@ -0,0 +1,219 @@ + + + + + +StringFormula (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface StringFormula

+
+
+
+
    +
  • +
    +
    All Superinterfaces:
    +
    Formula
    +
    +
    +
    @Immutable
+public interface StringFormula
+extends Formula
    +
    A formula of the string sort.
    +
    • +
+
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/StringFormulaManager.html b/api/org/sosy_lab/java_smt/api/StringFormulaManager.html new file mode 100644 index 0000000000..7fcbfa5e99 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/StringFormulaManager.html @@ -0,0 +1,953 @@ + + + + + +StringFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface StringFormulaManager

+
+
+
+ +
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/Tactic.html b/api/org/sosy_lab/java_smt/api/Tactic.html new file mode 100644 index 0000000000..e5e09bd371 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/Tactic.html @@ -0,0 +1,430 @@ + + + + + +Tactic (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Enum Tactic

+
+
+ +
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Enum Constant Summary

      + + + + + + + + + + + + + + + + + + + + + + +
      Enum Constants 
      Enum ConstantDescription
      ACKERMANNIZATION +
      Replaces all applications of UFs with fresh variables and adds constraints to enforce the + functional consistency.
      +
      NNF +
      Convert the formula to NNF (negated normal form).
      +
      QE_LIGHT +
      Perform "best-effort" quantifier elimination: when the bound variable can be "cheaply" + eliminated using a pattern-matching approach, eliminate it, and otherwise leave it as-is.
      +
      TSEITIN_CNF +
      Convert the formula to CNF (conjunctive normal form), using extra fresh variables to avoid the + size explosion.
      +
      +
      • +
    +
    + +
    + +
    +
    • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Enum Constant Detail

      + + + +
        +
      • +

        ACKERMANNIZATION

        +
        public static final Tactic ACKERMANNIZATION
        +
        Replaces all applications of UFs with fresh variables and adds constraints to enforce the + functional consistency. Quantified formulas are not supported.
        +
        • +
      + + + +
        +
      • +

        NNF

        +
        public static final Tactic NNF
        +
        Convert the formula to NNF (negated normal form).
        +
        • +
      + + + +
        +
      • +

        TSEITIN_CNF

        +
        public static final Tactic TSEITIN_CNF
        +
        Convert the formula to CNF (conjunctive normal form), using extra fresh variables to avoid the + size explosion. The resulting formula is not equivalent but only equisatisfiable + to the original one. + +

        NB: currently this tactic does not have a default implementation.

        +
        • +
      + + + +
        +
      • +

        QE_LIGHT

        +
        public static final Tactic QE_LIGHT
        +
        Perform "best-effort" quantifier elimination: when the bound variable can be "cheaply" + eliminated using a pattern-matching approach, eliminate it, and otherwise leave it as-is.
        +
        • +
      +
      • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        values

        +
        public static Tactic[] values()
        +
        Returns an array containing the constants of this enum type, in +the order they are declared. This method may be used to iterate +over the constants as follows: +
        +for (Tactic c : Tactic.values())
+    System.out.println(c);
+
        +
        +
        Returns:
        +
        an array containing the constants of this enum type, in the order they are declared
        +
        +
        • +
      + + + +
        +
      • +

        valueOf

        +
        public static Tactic valueOf​(String name)
        +
        Returns the enum constant of this type with the specified name. +The string must match exactly an identifier used to declare an +enum constant in this type. (Extraneous whitespace characters are +not permitted.)
        +
        +
        Parameters:
        +
        name - the name of the enum constant to be returned.
        +
        Returns:
        +
        the enum constant with the specified name
        +
        Throws:
        +
        IllegalArgumentException - if this enum type has no constant with the specified name
        +
        NullPointerException - if the argument is null
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/UFManager.html b/api/org/sosy_lab/java_smt/api/UFManager.html new file mode 100644 index 0000000000..657d5c934b --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/UFManager.html @@ -0,0 +1,378 @@ + + + + + +UFManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface UFManager

+
+
+
+ +
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/UserPropagator.html b/api/org/sosy_lab/java_smt/api/UserPropagator.html new file mode 100644 index 0000000000..946856b812 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/UserPropagator.html @@ -0,0 +1,421 @@ + + + + + +UserPropagator (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api
+

Interface UserPropagator

+
+
+
+
    +
  • +
    +
    All Known Implementing Classes:
    +
    AbstractUserPropagator, NQueensConstraintPropagator, NQueensEnumeratingPropagator
    +
    +
    +
    public interface UserPropagator
    +
    Allows user-defined propagators (~ theory solvers) to be implemented. It is advised to inherit + from AbstractUserPropagator rather than implementing this + interface directly. + +

    A user propagator provides various callbacks that are invoked by the solver during the solving + process. Within these callbacks, the user can react to and influence the solver by calling into + the PropagatorBackend. For example, he can raise conflicts whenever the solver makes + assignments inconsistent to the user-defined theory.

    +
    • +
+
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/package-summary.html b/api/org/sosy_lab/java_smt/api/package-summary.html new file mode 100644 index 0000000000..ec50dbefa7 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/package-summary.html @@ -0,0 +1,500 @@ + + + + + +org.sosy_lab.java_smt.api (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

@CheckReturnValue +@ParametersAreNonnullByDefault +@FieldsAreNonnullByDefault +@ReturnValuesAreNonnullByDefault +

+

Package org.sosy_lab.java_smt.api

+
+
+
+ + +
The core interfaces for abstracting from SMT solvers and providing a common API for all solvers.
+
+ +
+
+
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/package-tree.html b/api/org/sosy_lab/java_smt/api/package-tree.html new file mode 100644 index 0000000000..5ea9af05ae --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/package-tree.html @@ -0,0 +1,267 @@ + + + + + +org.sosy_lab.java_smt.api Class Hierarchy (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Hierarchy For Package org.sosy_lab.java_smt.api

+Package Hierarchies: + +
+
+
+

Class Hierarchy

+ +
+
+

Interface Hierarchy

+ +
+
+

Enum Hierarchy

+ +
+
+
+ + + diff --git a/api/org/sosy_lab/java_smt/api/visitors/BooleanFormulaTransformationVisitor.html b/api/org/sosy_lab/java_smt/api/visitors/BooleanFormulaTransformationVisitor.html new file mode 100644 index 0000000000..9ca081ca4a --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/visitors/BooleanFormulaTransformationVisitor.html @@ -0,0 +1,606 @@ + + + + + +BooleanFormulaTransformationVisitor (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api.visitors
+

Class BooleanFormulaTransformationVisitor

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.api.visitors.BooleanFormulaTransformationVisitor
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/visitors/BooleanFormulaVisitor.html b/api/org/sosy_lab/java_smt/api/visitors/BooleanFormulaVisitor.html new file mode 100644 index 0000000000..040851c68b --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/visitors/BooleanFormulaVisitor.html @@ -0,0 +1,506 @@ + + + + + +BooleanFormulaVisitor (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api.visitors
+

Interface BooleanFormulaVisitor<R>

+
+
+
+ +
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/visitors/DefaultBooleanFormulaVisitor.html b/api/org/sosy_lab/java_smt/api/visitors/DefaultBooleanFormulaVisitor.html new file mode 100644 index 0000000000..4b4b4064f4 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/visitors/DefaultBooleanFormulaVisitor.html @@ -0,0 +1,614 @@ + + + + + +DefaultBooleanFormulaVisitor (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api.visitors
+

Class DefaultBooleanFormulaVisitor<R>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.api.visitors.DefaultBooleanFormulaVisitor<R>
      • +
    +
    • +
+
+
    +
  • +
    +
    Type Parameters:
    +
    R - Return type for each traversal operation.
    +
    +
    +
    All Implemented Interfaces:
    +
    BooleanFormulaVisitor<R>
    +
    +
    +
    public abstract class DefaultBooleanFormulaVisitor<R>
+extends Object
+implements BooleanFormulaVisitor<R>
    +
    A formula visitor which allows for the default implementation.
    +
    • +
+
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/visitors/DefaultFormulaVisitor.html b/api/org/sosy_lab/java_smt/api/visitors/DefaultFormulaVisitor.html new file mode 100644 index 0000000000..efa0ec8f32 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/visitors/DefaultFormulaVisitor.html @@ -0,0 +1,479 @@ + + + + + +DefaultFormulaVisitor (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api.visitors
+

Class DefaultFormulaVisitor<R>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.api.visitors.DefaultFormulaVisitor<R>
      • +
    +
    • +
+
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        DefaultFormulaVisitor

        +
        public DefaultFormulaVisitor()
        +
        • +
      +
      • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        visitDefault

        +
        protected abstract R visitDefault​(Formula f)
        +
        Method for default case, is called by all methods from this class if they are not overridden.
        +
        +
        Parameters:
        +
        f - Formula for the currently visited node.
        +
        Returns:
        +
        An arbitrary value, will be passed through to the caller.
        +
        +
        • +
      + + + +
        +
      • +

        visitFreeVariable

        +
        public R visitFreeVariable​(Formula f,
+                           String name)
        +
        Description copied from interface: FormulaVisitor
        +
        Visit a free variable (such as "x", "y" or "z"), not bound by a quantifier. The variable can + have any sort (both boolean and non-boolean).
        +
        +
        Specified by:
        +
        visitFreeVariable in interface FormulaVisitor<R>
        +
        Parameters:
        +
        f - Formula representing the variable.
        +
        name - Variable name.
        +
        +
        • +
      + + + +
        +
      • +

        visitBoundVariable

        +
        public R visitBoundVariable​(Formula f,
+                            int deBruijnIdx)
        +
        Description copied from interface: FormulaVisitor
        +
        Visit a variable bound by a quantifier. The variable can have any sort (both boolean and + non-boolean).
        +
        +
        Specified by:
        +
        visitBoundVariable in interface FormulaVisitor<R>
        +
        Parameters:
        +
        f - Formula representing the variable.
        +
        deBruijnIdx - de-Bruijn index of the bound variable, which can be used to find the + matching quantifier.
        +
        +
        • +
      + + + +
        +
      • +

        visitConstant

        +
        public R visitConstant​(Formula f,
+                       Object value)
        +
        Description copied from interface: FormulaVisitor
        +
        Visit a constant, such as "true"/"false", a numeric constant like "1" or "1.0", a String + constant like 2hello world" or enumeration constant like "Blue".
        +
        +
        Specified by:
        +
        visitConstant in interface FormulaVisitor<R>
        +
        Parameters:
        +
        f - Formula representing the constant.
        +
        value - The value of the constant. It is either of type Boolean, of a subtype of + Number (mostly a BigInteger, a BigDecimal, or a Rational), + or String.
        +
        Returns:
        +
        An arbitrary return value that is passed to the caller.
        +
        +
        • +
      + + + + + + + +
        +
      • +

        visitQuantifier

        +
        public R visitQuantifier​(BooleanFormula f,
+                         QuantifiedFormulaManager.Quantifier q,
+                         List<Formula> boundVariables,
+                         BooleanFormula body)
        +
        Description copied from interface: FormulaVisitor
        +
        Visit a quantified node.
        +
        +
        Specified by:
        +
        visitQuantifier in interface FormulaVisitor<R>
        +
        Parameters:
        +
        f - Quantifier formula.
        +
        q - Quantifier type: either FORALL or EXISTS.
        +
        boundVariables - Variables bound by the quantifier. NOTE: not all solvers hold + metadata about bound variables. In case this is not available, this method will be called + with an empty list, yet #mkQuantifier will work fine with an empty list as well.
        +
        body - Body of the quantifier.
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/visitors/ExpectedFormulaVisitor.html b/api/org/sosy_lab/java_smt/api/visitors/ExpectedFormulaVisitor.html new file mode 100644 index 0000000000..8db5542a35 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/visitors/ExpectedFormulaVisitor.html @@ -0,0 +1,335 @@ + + + + + +ExpectedFormulaVisitor (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api.visitors
+

Class ExpectedFormulaVisitor<R>

+
+
+ +
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        ExpectedFormulaVisitor

        +
        public ExpectedFormulaVisitor()
        +
        • +
      +
      • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        visitDefault

        +
        protected final R visitDefault​(Formula f)
        +
        Description copied from class: DefaultFormulaVisitor
        +
        Method for default case, is called by all methods from this class if they are not overridden.
        +
        +
        Specified by:
        +
        visitDefault in class DefaultFormulaVisitor<R>
        +
        Parameters:
        +
        f - Formula for the currently visited node.
        +
        Returns:
        +
        An arbitrary value, will be passed through to the caller.
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/visitors/FormulaTransformationVisitor.html b/api/org/sosy_lab/java_smt/api/visitors/FormulaTransformationVisitor.html new file mode 100644 index 0000000000..b0cba48e87 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/visitors/FormulaTransformationVisitor.html @@ -0,0 +1,462 @@ + + + + + +FormulaTransformationVisitor (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api.visitors
+

Class FormulaTransformationVisitor

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.api.visitors.FormulaTransformationVisitor
      • +
    +
    • +
+
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        FormulaTransformationVisitor

        +
        protected FormulaTransformationVisitor​(FormulaManager fmgr)
        +
        • +
      +
      • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        visitFreeVariable

        +
        public Formula visitFreeVariable​(Formula f,
+                                 String name)
        +
        Description copied from interface: FormulaVisitor
        +
        Visit a free variable (such as "x", "y" or "z"), not bound by a quantifier. The variable can + have any sort (both boolean and non-boolean).
        +
        +
        Specified by:
        +
        visitFreeVariable in interface FormulaVisitor<Formula>
        +
        Parameters:
        +
        f - Formula representing the variable.
        +
        name - Variable name.
        +
        +
        • +
      + + + +
        +
      • +

        visitBoundVariable

        +
        public Formula visitBoundVariable​(Formula f,
+                                  int deBruijnIdx)
        +
        Description copied from interface: FormulaVisitor
        +
        Visit a variable bound by a quantifier. The variable can have any sort (both boolean and + non-boolean).
        +
        +
        Specified by:
        +
        visitBoundVariable in interface FormulaVisitor<Formula>
        +
        Parameters:
        +
        f - Formula representing the variable.
        +
        deBruijnIdx - de-Bruijn index of the bound variable, which can be used to find the + matching quantifier.
        +
        +
        • +
      + + + +
        +
      • +

        visitConstant

        +
        public Formula visitConstant​(Formula f,
+                             Object value)
        +
        Description copied from interface: FormulaVisitor
        +
        Visit a constant, such as "true"/"false", a numeric constant like "1" or "1.0", a String + constant like 2hello world" or enumeration constant like "Blue".
        +
        +
        Specified by:
        +
        visitConstant in interface FormulaVisitor<Formula>
        +
        Parameters:
        +
        f - Formula representing the constant.
        +
        value - The value of the constant. It is either of type Boolean, of a subtype of + Number (mostly a BigInteger, a BigDecimal, or a Rational), + or String.
        +
        Returns:
        +
        An arbitrary return value that is passed to the caller.
        +
        +
        • +
      + + + +
        +
      • +

        visitFunction

        +
        public Formula visitFunction​(Formula f,
+                             List<Formula> newArgs,
+                             FunctionDeclaration<?> functionDeclaration)
        +
        Description copied from interface: FormulaVisitor
        +
        Visit an arbitrary, potentially uninterpreted function. The function can have any sort.
        +
        +
        Specified by:
        +
        visitFunction in interface FormulaVisitor<Formula>
        +
        Parameters:
        +
        f - Input function.
        +
        newArgs - New arguments after the transformation
        +
        functionDeclaration - Function declaration
        +
        Returns:
        +
        Transformed function.
        +
        +
        • +
      + + + +
        +
      • +

        visitQuantifier

        +
        public BooleanFormula visitQuantifier​(BooleanFormula f,
+                                      QuantifiedFormulaManager.Quantifier quantifier,
+                                      List<Formula> boundVariables,
+                                      BooleanFormula transformedBody)
        +
        Description copied from interface: FormulaVisitor
        +
        Visit a quantified node.
        +
        +
        Specified by:
        +
        visitQuantifier in interface FormulaVisitor<Formula>
        +
        Parameters:
        +
        f - Quantifier formula.
        +
        quantifier - Quantifier type: either FORALL or EXISTS.
        +
        boundVariables - Variables bound by the quantifier. NOTE: not all solvers hold + metadata about bound variables. In case this is not available, this method will be called + with an empty list, yet #mkQuantifier will work fine with an empty list as well.
        +
        transformedBody - Quantifier body already transformed by the visitor.
        +
        Returns:
        +
        Transformed AST
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/visitors/FormulaVisitor.html b/api/org/sosy_lab/java_smt/api/visitors/FormulaVisitor.html new file mode 100644 index 0000000000..6681747b07 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/visitors/FormulaVisitor.html @@ -0,0 +1,385 @@ + + + + + +FormulaVisitor (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api.visitors
+

Interface FormulaVisitor<R>

+
+
+
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        visitFreeVariable

        +
        R visitFreeVariable​(Formula f,
+                    String name)
        +
        Visit a free variable (such as "x", "y" or "z"), not bound by a quantifier. The variable can + have any sort (both boolean and non-boolean).
        +
        +
        Parameters:
        +
        f - Formula representing the variable.
        +
        name - Variable name.
        +
        +
        • +
      + + + +
        +
      • +

        visitBoundVariable

        +
        R visitBoundVariable​(Formula f,
+                     int deBruijnIdx)
        +
        Visit a variable bound by a quantifier. The variable can have any sort (both boolean and + non-boolean).
        +
        +
        Parameters:
        +
        f - Formula representing the variable.
        +
        deBruijnIdx - de-Bruijn index of the bound variable, which can be used to find the + matching quantifier.
        +
        +
        • +
      + + + +
        +
      • +

        visitConstant

        +
        R visitConstant​(Formula f,
+                Object value)
        +
        Visit a constant, such as "true"/"false", a numeric constant like "1" or "1.0", a String + constant like 2hello world" or enumeration constant like "Blue".
        +
        +
        Parameters:
        +
        f - Formula representing the constant.
        +
        value - The value of the constant. It is either of type Boolean, of a subtype of + Number (mostly a BigInteger, a BigDecimal, or a Rational), + or String.
        +
        Returns:
        +
        An arbitrary return value that is passed to the caller.
        +
        +
        • +
      + + + + + + + +
        +
      • +

        visitQuantifier

        +
        R visitQuantifier​(BooleanFormula f,
+                  QuantifiedFormulaManager.Quantifier quantifier,
+                  List<Formula> boundVariables,
+                  BooleanFormula body)
        +
        Visit a quantified node.
        +
        +
        Parameters:
        +
        f - Quantifier formula.
        +
        quantifier - Quantifier type: either FORALL or EXISTS.
        +
        boundVariables - Variables bound by the quantifier. NOTE: not all solvers hold + metadata about bound variables. In case this is not available, this method will be called + with an empty list, yet #mkQuantifier will work fine with an empty list as well.
        +
        body - Body of the quantifier.
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/visitors/TraversalProcess.TraversalType.html b/api/org/sosy_lab/java_smt/api/visitors/TraversalProcess.TraversalType.html new file mode 100644 index 0000000000..5970833827 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/visitors/TraversalProcess.TraversalType.html @@ -0,0 +1,407 @@ + + + + + +TraversalProcess.TraversalType (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api.visitors
+

Enum TraversalProcess.TraversalType

+
+
+ +
+ +
+
+ +
+
+
    +
  • + +
    + +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        values

        +
        public static TraversalProcess.TraversalType[] values()
        +
        Returns an array containing the constants of this enum type, in +the order they are declared. This method may be used to iterate +over the constants as follows: +
        +for (TraversalProcess.TraversalType c : TraversalProcess.TraversalType.values())
+    System.out.println(c);
+
        +
        +
        Returns:
        +
        an array containing the constants of this enum type, in the order they are declared
        +
        +
        • +
      + + + +
        +
      • +

        valueOf

        +
        public static TraversalProcess.TraversalType valueOf​(String name)
        +
        Returns the enum constant of this type with the specified name. +The string must match exactly an identifier used to declare an +enum constant in this type. (Extraneous whitespace characters are +not permitted.)
        +
        +
        Parameters:
        +
        name - the name of the enum constant to be returned.
        +
        Returns:
        +
        the enum constant with the specified name
        +
        Throws:
        +
        IllegalArgumentException - if this enum type has no constant with the specified name
        +
        NullPointerException - if the argument is null
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/visitors/TraversalProcess.html b/api/org/sosy_lab/java_smt/api/visitors/TraversalProcess.html new file mode 100644 index 0000000000..85873e2459 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/visitors/TraversalProcess.html @@ -0,0 +1,421 @@ + + + + + +TraversalProcess (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.api.visitors
+

Class TraversalProcess

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.api.visitors.TraversalProcess
      • +
    +
    • +
+
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Field Detail

      + + + +
        +
      • +

        CONTINUE

        +
        public static final TraversalProcess CONTINUE
        +
        Continue traversal and recurse into current formula subtree.
        +
        • +
      + +
        +
      • +

        SKIP

        +
        public static final TraversalProcess SKIP
        +
        Continue traversal, but do not recurse into current formula subtree.
        +
        • +
      + + + +
        +
      • +

        ABORT

        +
        public static final TraversalProcess ABORT
        +
        Immediately abort traversal and return to caller.
        +
        • +
      +
      • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        custom

        +
        public static TraversalProcess custom​(Iterable<? extends Formula> pToTraverse)
        +
        Traverse only the given children. + +

        NOTE: given formulas which are not children of the given node will be ignored.

        +
        • +
      + + + +
        +
      • +

        custom

        +
        public static TraversalProcess custom​(Formula pToTraverse)
        +
        Traverse only the given child. + +

        NOTE: any given which is not child of the given node will be ignored.

        +
        • +
      + + + + + + + +
        +
      • +

        contains

        +
        public boolean contains​(Formula f)
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/api/visitors/package-summary.html b/api/org/sosy_lab/java_smt/api/visitors/package-summary.html new file mode 100644 index 0000000000..8ced8aa5a7 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/visitors/package-summary.html @@ -0,0 +1,241 @@ + + + + + +org.sosy_lab.java_smt.api.visitors (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Package org.sosy_lab.java_smt.api.visitors

+
+
+
+ + +
The visitors of this package allow for efficient traversal, manipulation and transformation of + formulas.
+
+ +
+
+
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/api/visitors/package-tree.html b/api/org/sosy_lab/java_smt/api/visitors/package-tree.html new file mode 100644 index 0000000000..c9c2e5c007 --- /dev/null +++ b/api/org/sosy_lab/java_smt/api/visitors/package-tree.html @@ -0,0 +1,191 @@ + + + + + +org.sosy_lab.java_smt.api.visitors Class Hierarchy (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Hierarchy For Package org.sosy_lab.java_smt.api.visitors

+Package Hierarchies: + +
+
+
+

Class Hierarchy

+ +
+
+

Interface Hierarchy

+ +
+
+

Enum Hierarchy

+ +
+
+
+ + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/AbstractArrayFormulaManager.html b/api/org/sosy_lab/java_smt/basicimpl/AbstractArrayFormulaManager.html new file mode 100644 index 0000000000..a4671d6781 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/AbstractArrayFormulaManager.html @@ -0,0 +1,672 @@ + + + + + +AbstractArrayFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class AbstractArrayFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.basicimpl.AbstractArrayFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl>
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/AbstractBitvectorFormulaManager.html b/api/org/sosy_lab/java_smt/basicimpl/AbstractBitvectorFormulaManager.html new file mode 100644 index 0000000000..2ac96a5c22 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/AbstractBitvectorFormulaManager.html @@ -0,0 +1,1970 @@ + + + + + +AbstractBitvectorFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class AbstractBitvectorFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.basicimpl.AbstractBitvectorFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl>
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/AbstractBooleanFormulaManager.html b/api/org/sosy_lab/java_smt/basicimpl/AbstractBooleanFormulaManager.html new file mode 100644 index 0000000000..95c6ea1923 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/AbstractBooleanFormulaManager.html @@ -0,0 +1,1212 @@ + + + + + +AbstractBooleanFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class AbstractBooleanFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.basicimpl.AbstractBooleanFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl>
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/AbstractEnumerationFormulaManager.EnumType.html b/api/org/sosy_lab/java_smt/basicimpl/AbstractEnumerationFormulaManager.EnumType.html new file mode 100644 index 0000000000..883a378f52 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/AbstractEnumerationFormulaManager.EnumType.html @@ -0,0 +1,330 @@ + + + + + +AbstractEnumerationFormulaManager.EnumType (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class AbstractEnumerationFormulaManager.EnumType

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.basicimpl.AbstractEnumerationFormulaManager.EnumType
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/AbstractEnumerationFormulaManager.html b/api/org/sosy_lab/java_smt/basicimpl/AbstractEnumerationFormulaManager.html new file mode 100644 index 0000000000..85ad885031 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/AbstractEnumerationFormulaManager.html @@ -0,0 +1,617 @@ + + + + + +AbstractEnumerationFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class AbstractEnumerationFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.basicimpl.AbstractEnumerationFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl>
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/AbstractEvaluator.html b/api/org/sosy_lab/java_smt/basicimpl/AbstractEvaluator.html new file mode 100644 index 0000000000..6d377b35ce --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/AbstractEvaluator.html @@ -0,0 +1,664 @@ + + + + + +AbstractEvaluator (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class AbstractEvaluator<TFormulaInfo,​TType,​TEnv>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.basicimpl.AbstractEvaluator<TFormulaInfo,​TType,​TEnv>
      • +
    +
    • +
+
+ +
+
+ +
+
+
    +
  • + +
    + +
    + +
    + +
    + +
    +
      +
    • + + +

      Method Detail

      + + + + + +
        +
      • +

        eval

        +
        public final <T extends Formula> @Nullable T eval​(T f)
        +
        Description copied from interface: Evaluator
        +
        Evaluate a given formula substituting the values from the model and return it as formula. + +

        If a value is not relevant to the satisfiability result, the solver can choose either to + insert an arbitrary value (e.g., the value 0 for the matching type) or just return + null. + +

        The formula does not need to be a variable, we also allow complex expression. The solver + will replace all symbols from the formula with their model values and then simplify the formula + into a simple formula, e.g., consisting only of a numeral expression.

        +
        +
        Specified by:
        +
        eval in interface Evaluator
        +
        Parameters:
        +
        f - Input formula to be evaluated.
        +
        Returns:
        +
        evaluation of the given formula or null if the solver does not provide a + better evaluation.
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public final @Nullable BigInteger evaluate​(NumeralFormula.IntegerFormula f)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for integer formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public @Nullable Rational evaluate​(NumeralFormula.RationalFormula f)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for rational formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public final @Nullable Boolean evaluate​(BooleanFormula f)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for boolean formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public final @Nullable String evaluate​(StringFormula f)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for string formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public final @Nullable String evaluate​(EnumerationFormula f)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for enumeration formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public final @Nullable FloatingPointNumber evaluate​(FloatingPointFormula f)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for floating-point formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public final @Nullable BigInteger evaluate​(BitvectorFormula f)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for bitvector formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public final @Nullable Object evaluate​(Formula f)
        +
        Description copied from interface: Evaluator
        +
        Evaluate a given formula substituting the values from the model. + +

        If a value is not relevant to the satisfiability result, the model can choose either an + arbitrary value (e.g., the value 0 for the matching type) or just return + null. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        Parameters:
        +
        f - Input formula
        +
        Returns:
        +
        Either of: - Number (Rational/Double/BigInteger/Long/Integer) - Boolean
        +
        +
        • +
      + + + + + +
        +
      • +

        evalImpl

        +
        protected abstract @Nullable TFormulaInfo evalImpl​(TFormulaInfo formula)
        +
        Simplify the given formula and replace all symbols with their model values. If a symbol is not + set in the model and evaluation aborts, return null.
        +
        • +
      + + + + + +
        +
      • +

        evaluateImpl

        +
        protected final @Nullable Object evaluateImpl​(TFormulaInfo f)
        +
        Simplify the given formula and replace all symbols with their model values. If a symbol is not + set in the model and evaluation aborts, return null. Afterwards convert the + formula into a Java object as far as possible, i.e., try to match a primitive or simple type.
        +
        • +
      + + + +
        +
      • +

        isClosed

        +
        protected boolean isClosed()
        +
        • +
      + + + + +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/AbstractFloatingPointFormulaManager.html b/api/org/sosy_lab/java_smt/basicimpl/AbstractFloatingPointFormulaManager.html new file mode 100644 index 0000000000..89557f2934 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/AbstractFloatingPointFormulaManager.html @@ -0,0 +1,2218 @@ + + + + + +AbstractFloatingPointFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class AbstractFloatingPointFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.basicimpl.AbstractFloatingPointFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl>
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/AbstractFormulaManager.html b/api/org/sosy_lab/java_smt/basicimpl/AbstractFormulaManager.html new file mode 100644 index 0000000000..957b06d5f7 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/AbstractFormulaManager.html @@ -0,0 +1,1369 @@ + + + + + +AbstractFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class AbstractFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.basicimpl.AbstractFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl>
      • +
    +
    • +
+
+
    +
  • +
    +
    Type Parameters:
    +
    TFormulaInfo - The solver specific type.
    +
    +
    +
    All Implemented Interfaces:
    +
    FormulaManager
    +
    +
    +
    public abstract class AbstractFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl>
+extends Object
+implements FormulaManager
    +
    Simplifies building a solver from the specific theories.
    +
    • +
+
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/AbstractModel.html b/api/org/sosy_lab/java_smt/basicimpl/AbstractModel.html new file mode 100644 index 0000000000..b4d2d66e8a --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/AbstractModel.html @@ -0,0 +1,398 @@ + + + + + +AbstractModel (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class AbstractModel<TFormulaInfo,​TType,​TEnv>

+
+
+ +
+ +
+
+ +
+
+
    +
  • + +
    + +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        toString

        +
        public String toString()
        +
        Description copied from interface: Model
        +
        Pretty-printing of the model values. + +

        Please only use this method for debugging and not for retrieving relevant information about + the model. The returned model representation is not intended for further usage like parsing, + because we do not guarantee any specific format, e.g., for arrays and uninterpreted functions, + and we allow the SMT solver to include arbitrary additional information about the current + solver state, e.g., any available symbol in the solver, even from other provers, and temporary + internal symbols.

        +
        +
        Specified by:
        +
        toString in interface Model
        +
        Overrides:
        +
        toString in class Object
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/AbstractNumeralFormulaManager.NonLinearArithmetic.html b/api/org/sosy_lab/java_smt/basicimpl/AbstractNumeralFormulaManager.NonLinearArithmetic.html new file mode 100644 index 0000000000..45fd6a3a45 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/AbstractNumeralFormulaManager.NonLinearArithmetic.html @@ -0,0 +1,394 @@ + + + + + +AbstractNumeralFormulaManager.NonLinearArithmetic (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Enum AbstractNumeralFormulaManager.NonLinearArithmetic

+
+
+ +
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/AbstractNumeralFormulaManager.html b/api/org/sosy_lab/java_smt/basicimpl/AbstractNumeralFormulaManager.html new file mode 100644 index 0000000000..70d273ef32 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/AbstractNumeralFormulaManager.html @@ -0,0 +1,1402 @@ + + + + + +AbstractNumeralFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class AbstractNumeralFormulaManager<TFormulaInfo,​TType,​TEnv,​ParamFormulaType extends NumeralFormula,​ResultFormulaType extends NumeralFormula,​TFuncDecl>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.basicimpl.AbstractNumeralFormulaManager<TFormulaInfo,​TType,​TEnv,​ParamFormulaType,​ResultFormulaType,​TFuncDecl>
      • +
    +
    • +
+
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    NumeralFormulaManager<ParamFormulaType,​ResultFormulaType>
    +
    +
    +
    public abstract class AbstractNumeralFormulaManager<TFormulaInfo,​TType,​TEnv,​ParamFormulaType extends NumeralFormula,​ResultFormulaType extends NumeralFormula,​TFuncDecl>
+extends Object
+implements NumeralFormulaManager<ParamFormulaType,​ResultFormulaType>
    +
    Similar to the other Abstract*FormulaManager classes in this package, this class serves as a + helper for implementing NumeralFormulaManager. It handles all the unwrapping and wrapping + from Formula instances to solver-specific formula representations, such that the concrete + class needs to handle only its own internal types.
    +
    +
    Implementation Requirements:
    +
    The method NumeralFormulaManager.getFormulaType() must be safe to be called from the constructor + (the default implementations of IntegerFormulaManager and + RationalFormulaManager satisfy this).
    +
    +
    • +
+
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/AbstractProver.html b/api/org/sosy_lab/java_smt/basicimpl/AbstractProver.html new file mode 100644 index 0000000000..0030407253 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/AbstractProver.html @@ -0,0 +1,732 @@ + + + + + +AbstractProver (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class AbstractProver<T>

+
+
+ +
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Field Detail

      + + + +
        +
      • +

        generateUnsatCores

        +
        protected final boolean generateUnsatCores
        +
        • +
      + + + +
        +
      • +

        enableSL

        +
        protected final boolean enableSL
        +
        • +
      + + + +
        +
      • +

        closed

        +
        protected boolean closed
        +
        • +
      +
      • +
    +
    + +
    + +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        checkGenerateModels

        +
        protected final void checkGenerateModels()
        +
        • +
      + + + +
        +
      • +

        checkGenerateAllSat

        +
        protected final void checkGenerateAllSat()
        +
        • +
      + + + +
        +
      • +

        checkGenerateUnsatCores

        +
        protected final void checkGenerateUnsatCores()
        +
        • +
      + + + +
        +
      • +

        checkGenerateUnsatCoresOverAssumptions

        +
        protected final void checkGenerateUnsatCoresOverAssumptions()
        +
        • +
      + + + +
        +
      • +

        checkEnableSeparationLogic

        +
        protected final void checkEnableSeparationLogic()
        +
        • +
      + + + +
        +
      • +

        size

        +
        public int size()
        +
        Description copied from interface: BasicProverEnvironment
        +
        Get the number of backtracking points/levels on the current stack. + +

        Caution: This is the number of PUSH-operations, and not necessarily equal to the number of + asserted formulas. On any level there can be an arbitrary number of asserted formulas. Even + with size of 0, formulas can already be asserted (at bottom level).

        +
        +
        Specified by:
        +
        size in interface BasicProverEnvironment<T>
        +
        +
        • +
      + + + +
        +
      • +

        push

        +
        public final void push()
+                throws InterruptedException
        +
        Description copied from interface: BasicProverEnvironment
        +
        Create a new backtracking point, i.e., a new level on the assertion stack. Each level can hold + several asserted formulas. + +

        If formulas are added before creating the first backtracking point, they can not be removed + via a POP-operation.

        +
        +
        Specified by:
        +
        push in interface BasicProverEnvironment<T>
        +
        Throws:
        +
        InterruptedException
        +
        +
        • +
      + + + + + + + +
        +
      • +

        pop

        +
        public final void pop()
        +
        Description copied from interface: BasicProverEnvironment
        +
        Remove one backtracking point/level from the current stack. This removes the latest level + including all of its formulas, i.e., all formulas that were added for this backtracking point.
        +
        +
        Specified by:
        +
        pop in interface BasicProverEnvironment<T>
        +
        +
        • +
      + + + +
        +
      • +

        popImpl

        +
        protected abstract void popImpl()
        +
        • +
      + + + + + + + + + + + + + + + +
        +
      • +

        getAssertedConstraintIds

        +
        protected ImmutableSet<T> getAssertedConstraintIds()
        +
        • +
      + + + + + +
        +
      • +

        registerEvaluator

        +
        protected <E extends Evaluator> E registerEvaluator​(E pEvaluator)
        +
        This method registers the Evaluator to be cleaned up before the next change on the prover + stack.
        +
        • +
      + + + +
        +
      • +

        unregisterEvaluator

        +
        protected void unregisterEvaluator​(Evaluator pEvaluator)
        +
        • +
      + + + +
        +
      • +

        closeAllEvaluators

        +
        protected void closeAllEvaluators()
        +
        • +
      + + + +
        +
      • +

        close

        +
        public void close()
        +
        Description copied from interface: BasicProverEnvironment
        +
        Closes the prover environment. The object should be discarded, and should not be used after + closing. The first call of this method will close the prover instance, further calls are + ignored.
        +
        +
        Specified by:
        +
        close in interface AutoCloseable
        +
        Specified by:
        +
        close in interface BasicProverEnvironment<T>
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/AbstractProverWithAllSat.html b/api/org/sosy_lab/java_smt/basicimpl/AbstractProverWithAllSat.html new file mode 100644 index 0000000000..b93e688564 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/AbstractProverWithAllSat.html @@ -0,0 +1,455 @@ + + + + + +AbstractProverWithAllSat (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class AbstractProverWithAllSat<T>

+
+
+ +
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    AutoCloseable, BasicProverEnvironment<T>
    +
    +
    +
    public abstract class AbstractProverWithAllSat<T>
+extends AbstractProver<T>
    +
    This class is a utility-class to avoid repeated implementation of the AllSAT computation. + +

    If a solver does not support direct AllSAT computation, please inherit from this class.

    +
    • +
+
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/AbstractQuantifiedFormulaManager.html b/api/org/sosy_lab/java_smt/basicimpl/AbstractQuantifiedFormulaManager.html new file mode 100644 index 0000000000..9439db9a37 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/AbstractQuantifiedFormulaManager.html @@ -0,0 +1,509 @@ + + + + + +AbstractQuantifiedFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class AbstractQuantifiedFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.basicimpl.AbstractQuantifiedFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl>
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/AbstractSLFormulaManager.html b/api/org/sosy_lab/java_smt/basicimpl/AbstractSLFormulaManager.html new file mode 100644 index 0000000000..cc960a6718 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/AbstractSLFormulaManager.html @@ -0,0 +1,572 @@ + + + + + +AbstractSLFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class AbstractSLFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.basicimpl.AbstractSLFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl>
      • +
    +
    • +
+
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    SLFormulaManager
    +
    +
    +
    public abstract class AbstractSLFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl>
+extends Object
+implements SLFormulaManager
    +
    • +
+
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/AbstractSolverContext.html b/api/org/sosy_lab/java_smt/basicimpl/AbstractSolverContext.html new file mode 100644 index 0000000000..4346ed19c7 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/AbstractSolverContext.html @@ -0,0 +1,538 @@ + + + + + +AbstractSolverContext (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class AbstractSolverContext

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.basicimpl.AbstractSolverContext
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/AbstractStringFormulaManager.html b/api/org/sosy_lab/java_smt/basicimpl/AbstractStringFormulaManager.html new file mode 100644 index 0000000000..4f104d7cd4 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/AbstractStringFormulaManager.html @@ -0,0 +1,1721 @@ + + + + + +AbstractStringFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class AbstractStringFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.basicimpl.AbstractStringFormulaManager<TFormulaInfo,​TType,​TEnv,​TFuncDecl>
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/AbstractUFManager.html b/api/org/sosy_lab/java_smt/basicimpl/AbstractUFManager.html new file mode 100644 index 0000000000..a45a3bbb37 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/AbstractUFManager.html @@ -0,0 +1,550 @@ + + + + + +AbstractUFManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class AbstractUFManager<TFormulaInfo,​TFunctionDecl,​TType,​TEnv>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.basicimpl.AbstractUFManager<TFormulaInfo,​TFunctionDecl,​TType,​TEnv>
      • +
    +
    • +
+
+
    +
  • +
    +
    Type Parameters:
    +
    TFormulaInfo - The solver specific type.
    +
    TFunctionDecl - The solver specific type of declarations of any function application
    +
    TType - The solver specific type of formula-types.
    +
    +
    +
    All Implemented Interfaces:
    +
    UFManager
    +
    +
    +
    public abstract class AbstractUFManager<TFormulaInfo,​TFunctionDecl,​TType,​TEnv>
+extends Object
+implements UFManager
    +
    This class simplifies the implementation of the FunctionFormulaManager by converting the types to + the solver specific type.
    +
    • +
+
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/AbstractUserPropagator.html b/api/org/sosy_lab/java_smt/basicimpl/AbstractUserPropagator.html new file mode 100644 index 0000000000..273fde8ab3 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/AbstractUserPropagator.html @@ -0,0 +1,515 @@ + + + + + +AbstractUserPropagator (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class AbstractUserPropagator

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.basicimpl.AbstractUserPropagator
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/CachingModel.html b/api/org/sosy_lab/java_smt/basicimpl/CachingModel.html new file mode 100644 index 0000000000..6915338b78 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/CachingModel.html @@ -0,0 +1,645 @@ + + + + + +CachingModel (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class CachingModel

+
+
+ +
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        CachingModel

        +
        public CachingModel​(Model pDelegate)
        +
        • +
      +
      • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + + + + + + + + + + + +
        +
      • +

        eval

        +
        public <T extends Formula> @Nullable T eval​(T formula)
        +
        Description copied from interface: Evaluator
        +
        Evaluate a given formula substituting the values from the model and return it as formula. + +

        If a value is not relevant to the satisfiability result, the solver can choose either to + insert an arbitrary value (e.g., the value 0 for the matching type) or just return + null. + +

        The formula does not need to be a variable, we also allow complex expression. The solver + will replace all symbols from the formula with their model values and then simplify the formula + into a simple formula, e.g., consisting only of a numeral expression.

        +
        +
        Specified by:
        +
        eval in interface Evaluator
        +
        Parameters:
        +
        formula - Input formula to be evaluated.
        +
        Returns:
        +
        evaluation of the given formula or null if the solver does not provide a + better evaluation.
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public @Nullable Object evaluate​(Formula formula)
        +
        Description copied from interface: Evaluator
        +
        Evaluate a given formula substituting the values from the model. + +

        If a value is not relevant to the satisfiability result, the model can choose either an + arbitrary value (e.g., the value 0 for the matching type) or just return + null. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        Parameters:
        +
        formula - Input formula
        +
        Returns:
        +
        Either of: - Number (Rational/Double/BigInteger/Long/Integer) - Boolean
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public @Nullable BigInteger evaluate​(NumeralFormula.IntegerFormula formula)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for integer formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public @Nullable Rational evaluate​(NumeralFormula.RationalFormula formula)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for rational formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public @Nullable Boolean evaluate​(BooleanFormula formula)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for boolean formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public @Nullable BigInteger evaluate​(BitvectorFormula formula)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for bitvector formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public @Nullable String evaluate​(StringFormula formula)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for string formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public @Nullable String evaluate​(EnumerationFormula formula)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for enumeration formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public @Nullable FloatingPointNumber evaluate​(FloatingPointFormula formula)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for floating-point formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + +
        +
      • +

        toString

        +
        public String toString()
        +
        Description copied from interface: Model
        +
        Pretty-printing of the model values. + +

        Please only use this method for debugging and not for retrieving relevant information about + the model. The returned model representation is not intended for further usage like parsing, + because we do not guarantee any specific format, e.g., for arrays and uninterpreted functions, + and we allow the SMT solver to include arbitrary additional information about the current + solver state, e.g., any available symbol in the solver, even from other provers, and temporary + internal symbols.

        +
        +
        Specified by:
        +
        toString in interface Model
        +
        Overrides:
        +
        toString in class Object
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/FormulaCreator.html b/api/org/sosy_lab/java_smt/basicimpl/FormulaCreator.html new file mode 100644 index 0000000000..4df3cbda5d --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/FormulaCreator.html @@ -0,0 +1,1121 @@ + + + + + +FormulaCreator (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class FormulaCreator<TFormulaInfo,​TType,​TEnv,​TFuncDecl>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.basicimpl.FormulaCreator<TFormulaInfo,​TType,​TEnv,​TFuncDecl>
      • +
    +
    • +
+
+
    +
  • +
    +
    Type Parameters:
    +
    TFormulaInfo - the solver specific type for formulas.
    +
    TType - the solver specific type for formula types.
    +
    TEnv - the solver specific type for the environment/context.
    +
    +
    +
    public abstract class FormulaCreator<TFormulaInfo,​TType,​TEnv,​TFuncDecl>
+extends Object
    +
    This is a helper class with several methods that are commonly used throughout the basicimpl + package and may have solver-specific implementations. Each solver package is expected to provide + an instance of this class, with the appropriate methods overwritten. Depending on the solver, + some or all non-final methods in this class may need to be overwritten.
    +
    • +
+
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/FunctionDeclarationImpl.html b/api/org/sosy_lab/java_smt/basicimpl/FunctionDeclarationImpl.html new file mode 100644 index 0000000000..27d01542c7 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/FunctionDeclarationImpl.html @@ -0,0 +1,365 @@ + + + + + +FunctionDeclarationImpl (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class FunctionDeclarationImpl<F extends Formula,​T>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.basicimpl.FunctionDeclarationImpl<F,​T>
      • +
    +
    • +
+
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        FunctionDeclarationImpl

        +
        public FunctionDeclarationImpl()
        +
        • +
      +
      • +
    +
    + +
    + +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/ShutdownHook.html b/api/org/sosy_lab/java_smt/basicimpl/ShutdownHook.html new file mode 100644 index 0000000000..031a8a45af --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/ShutdownHook.html @@ -0,0 +1,337 @@ + + + + + +ShutdownHook (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl
+

Class ShutdownHook

+
+
+ +
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/package-summary.html b/api/org/sosy_lab/java_smt/basicimpl/package-summary.html new file mode 100644 index 0000000000..4417e806ee --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/package-summary.html @@ -0,0 +1,290 @@ + + + + + +org.sosy_lab.java_smt.basicimpl (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

@CheckReturnValue +@ParametersAreNonnullByDefault +@FieldsAreNonnullByDefault +@ReturnValuesAreNonnullByDefault +

+

Package org.sosy_lab.java_smt.basicimpl

+
+
+
+ + +
Abstract base classes for easier implementation of a solver backend.
+
+ +
+
+
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/basicimpl/package-tree.html b/api/org/sosy_lab/java_smt/basicimpl/package-tree.html new file mode 100644 index 0000000000..15ad0b5245 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/package-tree.html @@ -0,0 +1,203 @@ + + + + + +org.sosy_lab.java_smt.basicimpl Class Hierarchy (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Hierarchy For Package org.sosy_lab.java_smt.basicimpl

+Package Hierarchies: + +
+
+
+

Class Hierarchy

+ +
+
+

Enum Hierarchy

+ +
+
+
+ + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/tactics/NNFVisitor.html b/api/org/sosy_lab/java_smt/basicimpl/tactics/NNFVisitor.html new file mode 100644 index 0000000000..1e9d175673 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/tactics/NNFVisitor.html @@ -0,0 +1,449 @@ + + + + + +NNFVisitor (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl.tactics
+

Class NNFVisitor

+
+
+ +
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/tactics/package-summary.html b/api/org/sosy_lab/java_smt/basicimpl/tactics/package-summary.html new file mode 100644 index 0000000000..22a22badcb --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/tactics/package-summary.html @@ -0,0 +1,170 @@ + + + + + +org.sosy_lab.java_smt.basicimpl.tactics (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Package org.sosy_lab.java_smt.basicimpl.tactics

+
+
+
+ + +
Default tactics implementations (formula-to-formula transformations).
+
+
    +
  • + + + + + + + + + + + + +
    Class Summary 
    ClassDescription
    NNFVisitor 
    +
    • +
+
+
+
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/basicimpl/tactics/package-tree.html b/api/org/sosy_lab/java_smt/basicimpl/tactics/package-tree.html new file mode 100644 index 0000000000..e74ad059a0 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/tactics/package-tree.html @@ -0,0 +1,166 @@ + + + + + +org.sosy_lab.java_smt.basicimpl.tactics Class Hierarchy (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Hierarchy For Package org.sosy_lab.java_smt.basicimpl.tactics

+Package Hierarchies: + +
+
+
+

Class Hierarchy

+ +
+
+
+ + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/withAssumptionsWrapper/BasicProverWithAssumptionsWrapper.html b/api/org/sosy_lab/java_smt/basicimpl/withAssumptionsWrapper/BasicProverWithAssumptionsWrapper.html new file mode 100644 index 0000000000..00a38f3d92 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/withAssumptionsWrapper/BasicProverWithAssumptionsWrapper.html @@ -0,0 +1,770 @@ + + + + + +BasicProverWithAssumptionsWrapper (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper
+

Class BasicProverWithAssumptionsWrapper<T,​P extends BasicProverEnvironment<T>>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper.BasicProverWithAssumptionsWrapper<T,​P>
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/withAssumptionsWrapper/InterpolatingProverWithAssumptionsWrapper.html b/api/org/sosy_lab/java_smt/basicimpl/withAssumptionsWrapper/InterpolatingProverWithAssumptionsWrapper.html new file mode 100644 index 0000000000..9524a7a90d --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/withAssumptionsWrapper/InterpolatingProverWithAssumptionsWrapper.html @@ -0,0 +1,546 @@ + + + + + +InterpolatingProverWithAssumptionsWrapper (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper
+

Class InterpolatingProverWithAssumptionsWrapper<T>

+
+
+ +
+ +
+
+ +
+
+
    +
  • + +
    + +
    + +
    +
      +
    • + + +

      Method Detail

      + + + + + + + +
        +
      • +

        getSeqInterpolants

        +
        public List<BooleanFormula> getSeqInterpolants​(List<? extends Collection<T>> pPartitionedFormulas)
+                                        throws SolverException,
+                                               InterruptedException
        +
        Description copied from interface: InterpolatingProverEnvironment
        +
        This method returns interpolants of an 'inductive sequence'. This property must be supported by + the interpolation-strategy of the underlying SMT-solver! Depending on the underlying SMT-solver + this method might be faster than N direct calls to getInterpolant(). + +

        The prover stack should contain the partitioned formulas, but any order is allowed. For an + input of N partitions we return N-1 interpolants. Any asserted formula that is on the prover + stack and not part of the partitioned list, will be used for background theory and its symbols + can appear in any interpolant.

        +
        +
        Specified by:
        +
        getSeqInterpolants in interface InterpolatingProverEnvironment<T>
        +
        Returns:
        +
        a 'inductive sequence' of interpolants, such that the implication AND(I_i, P_i) + => I_(i+1) is satisfied for all i, where P_i is the conjunction of all formulas in + partition i.
        +
        Throws:
        +
        SolverException - if interpolant cannot be computed, for example because interpolation + procedure is incomplete
        +
        InterruptedException
        +
        +
        • +
      + + + +
        +
      • +

        getTreeInterpolants

        +
        public List<BooleanFormula> getTreeInterpolants​(List<? extends Collection<T>> pPartitionedFormulas,
+                                                int[] pStartOfSubTree)
+                                         throws SolverException,
+                                                InterruptedException
        +
        Description copied from interface: InterpolatingProverEnvironment
        +
        Compute a sequence of interpolants. The nesting array describes the start of the subtree for + tree interpolants. For inductive sequences of interpolants use a nesting array completely + filled with 0. + +

        Example: + + 

        + A  D
+ |  |
+ B  E
+ | /
+ C
+ |
+ F  H
+ | /
+ G
+
+ arrayIndex     = [0,1,2,3,4,5,6,7]  // only for demonstration, not needed
+ partition      = [A,B,D,E,C,F,H,G]  // post-order of tree
+ startOfSubTree = [0,0,2,2,0,0,6,0]  // index of left-most leaf of the current element
+
        + +

        The prover stack should contain the partitioned formulas. For an input of N partitions + (nodes in the tree) we return N-1 interpolants (one interpolant for/below each node except the + root). Any asserted formula that is on the prover stack and not part of the partitioned list, + will be used for background theory and its symbols can appear in any interpolant.

        +
        +
        Specified by:
        +
        getTreeInterpolants in interface InterpolatingProverEnvironment<T>
        +
        Parameters:
        +
        pPartitionedFormulas - of formulas
        +
        pStartOfSubTree - The start of the subtree containing the formula at this index as root.
        +
        Returns:
        +
        Tree interpolants respecting the nesting relation.
        +
        Throws:
        +
        SolverException - if interpolant cannot be computed, for example because interpolation + procedure is incomplete
        +
        InterruptedException
        +
        +
        • +
      + + + + + + + + + + +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/withAssumptionsWrapper/ProverWithAssumptionsWrapper.html b/api/org/sosy_lab/java_smt/basicimpl/withAssumptionsWrapper/ProverWithAssumptionsWrapper.html new file mode 100644 index 0000000000..3e85cc9cbf --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/withAssumptionsWrapper/ProverWithAssumptionsWrapper.html @@ -0,0 +1,332 @@ + + + + + +ProverWithAssumptionsWrapper (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper
+

Class ProverWithAssumptionsWrapper

+
+
+ +
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        ProverWithAssumptionsWrapper

        +
        public ProverWithAssumptionsWrapper​(ProverEnvironment pDelegate)
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/basicimpl/withAssumptionsWrapper/package-summary.html b/api/org/sosy_lab/java_smt/basicimpl/withAssumptionsWrapper/package-summary.html new file mode 100644 index 0000000000..5e83dd5955 --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/withAssumptionsWrapper/package-summary.html @@ -0,0 +1,182 @@ + + + + + +org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Package org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper

+
+
+
+ + +
Wrapper-classes to guarantee identical behavior for all solvers. If a solver does not support + BasicProverEnvironment.isUnsatWithAssumptions(java.util.Collection<org.sosy_lab.java_smt.api.BooleanFormula>), we wrap it in a + (subclass of) BasicProverWithAssumptionsWrapper, whose task it is to keep the assumptions as long + on the solver's stack as no other operation accesses it. It allows computing interpolants and + unsat cores. without direct support from the solver.
+
+ +
+
+
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/basicimpl/withAssumptionsWrapper/package-tree.html b/api/org/sosy_lab/java_smt/basicimpl/withAssumptionsWrapper/package-tree.html new file mode 100644 index 0000000000..a387d0116c --- /dev/null +++ b/api/org/sosy_lab/java_smt/basicimpl/withAssumptionsWrapper/package-tree.html @@ -0,0 +1,167 @@ + + + + + +org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper Class Hierarchy (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Hierarchy For Package org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper

+Package Hierarchies: + +
+
+
+

Class Hierarchy

+ +
+
+
+ + + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingArrayFormulaManager.html b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingArrayFormulaManager.html new file mode 100644 index 0000000000..0cc74bc9ad --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingArrayFormulaManager.html @@ -0,0 +1,524 @@ + + + + + +DebuggingArrayFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.debugging
+

Class DebuggingArrayFormulaManager

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.debugging.DebuggingArrayFormulaManager
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingBitvectorFormulaManager.html b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingBitvectorFormulaManager.html new file mode 100644 index 0000000000..91ff089605 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingBitvectorFormulaManager.html @@ -0,0 +1,1305 @@ + + + + + +DebuggingBitvectorFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.debugging
+

Class DebuggingBitvectorFormulaManager

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.debugging.DebuggingBitvectorFormulaManager
      • +
    +
    • +
+
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        DebuggingBitvectorFormulaManager

        +
        public DebuggingBitvectorFormulaManager​(BitvectorFormulaManager pDelegate,
+                                        org.sosy_lab.java_smt.delegate.debugging.DebuggingAssertions pDebugging)
        +
        • +
      +
      • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
        +
      • +

        negate

        +
        public BitvectorFormula negate​(BitvectorFormula number)
        +
        Description copied from interface: BitvectorFormulaManager
        +
        This method returns the negated number, i.e., it is multiplied by "-1". The given number is + interpreted as signed bitvector and corresponds to "2^BITSIZE - number". The result has the + same length as the given number.
        +
        +
        Specified by:
        +
        negate in interface BitvectorFormulaManager
        +
        +
        • +
      + + + +
        +
      • +

        add

        +
        public BitvectorFormula add​(BitvectorFormula number1,
+                            BitvectorFormula number2)
        +
        Description copied from interface: BitvectorFormulaManager
        +
        This method returns the addition of the given bitvectors. The result has the same length as the + given parameters. There can be an overflow, i.e., as one would expect from bitvector logic. + There is no difference in signed and unsigned numbers.
        +
        +
        Specified by:
        +
        add in interface BitvectorFormulaManager
        +
        Parameters:
        +
        number1 - a Formula
        +
        number2 - a Formula
        +
        Returns:
        +
        number1 + number2
        +
        +
        • +
      + + + +
        +
      • +

        subtract

        +
        public BitvectorFormula subtract​(BitvectorFormula number1,
+                                 BitvectorFormula number2)
        +
        Description copied from interface: BitvectorFormulaManager
        +
        This method returns the subtraction of the given bitvectors. The result has the same length as + the given parameters. There can be an overflow, i.e., as one would expect from bitvector logic. + There is no difference in signed and unsigned numbers.
        +
        +
        Specified by:
        +
        subtract in interface BitvectorFormulaManager
        +
        Parameters:
        +
        number1 - a Formula
        +
        number2 - a Formula
        +
        Returns:
        +
        number1 - number2
        +
        +
        • +
      + + + +
        +
      • +

        divide

        +
        public BitvectorFormula divide​(BitvectorFormula numerator,
+                               BitvectorFormula denominator,
+                               boolean signed)
        +
        Description copied from interface: BitvectorFormulaManager
        +
        This method returns the division for two bitvector formulas. + +

        For signed bitvectors, the result is rounded towards zero (also called "truncated integer + division", similar to the division in the C99 standard), e.g., a user can assume the following + equations: + +

          +
        • 10 / 5 = 2 +
        • 10 / 3 = 3 +
        • 10 / (-3) = -3 +
        • -10 / 5 = -2 +
        • -10 / 3 = -3 +
        • -10 / (-3) = 3 +
        + +

        If the divisor evaluates to zero (division-by-zero), either directly as value or indirectly + via an additional constraint, then the result of the division is defined as: + +

          +
        • "-1" interpreted as bitvector (i.e., all bits set to "1"), if the dividend is + non-negative, and +
        • "1" interpreted as bitvector (i.e., all bits set to "0", except the last bit), if the + dividend is negative. +
        + +

        We refer to the SMTLIB standard version 2.6 for the division and remainder operators in BV + theory.

        +
        +
        Specified by:
        +
        divide in interface BitvectorFormulaManager
        +
        Parameters:
        +
        numerator - dividend of the operation.
        +
        denominator - divisor of the operation.
        +
        signed - whether to interpret all operands as signed or as unsigned numbers.
        +
        +
        • +
      + + + +
        +
      • +

        smodulo

        +
        public BitvectorFormula smodulo​(BitvectorFormula numerator,
+                                BitvectorFormula denominator)
        +
        Description copied from interface: BitvectorFormulaManager
        +
        This method returns the two complement signed remainder for the Euclidean division (modulo) of + two bitvector formulas. + +

        The sign of the result follows the sign of the divisor, i.e. the quotient calculated in the + modulo operation is rounded in such a way that the result of the smodulo operation follows the + sign of the divisor, e.g., a user can assume the following equations, with bitvectors + interpreted as signed decimal numbers and % representing signed modulo, to hold: + +

          +
        • 10 % 5 == 0 +
        • 10 % 3 == 1 +
        • 10 % (-3) == -2 +
        • -10 % 5 == 0 +
        • -10 % 3 == 2 +
        • -10 % (-3) == -1 +
        + +

        If the divisor evaluates to zero (modulo-by-zero), either directly as value or indirectly + via an additional constraint, then the result of the modulo operation is defined as the + dividend itself. We refer to the SMTLIB standard version 2.6 for the division and remainder + operators in BV theory. + +

        For unsigned modulo, we refer to the unsigned remainder method.

        +
        +
        Specified by:
        +
        smodulo in interface BitvectorFormulaManager
        +
        Parameters:
        +
        numerator - dividend of the operation.
        +
        denominator - divisor of the operation.
        +
        +
        • +
      + + + +
        +
      • +

        remainder

        +
        public BitvectorFormula remainder​(BitvectorFormula numerator,
+                                  BitvectorFormula denominator,
+                                  boolean signed)
        +
        Description copied from interface: BitvectorFormulaManager
        +
        This method returns the remainder for two bitvector formulas using the BitvectorFormulaManager.divide(BitvectorFormula, BitvectorFormula, boolean) operation. + +

        For unsigned bitvectors, this returns the remainder of unsigned bitvector division. + +

        For signed bitvectors, the sign of the result follows the sign of the dividend, i.e. the + quotient of the division is rounded in such a way that the sign of the result of the remainder + operation follows the sign of the dividend, e.g., a user can assume the following equations, + with bitvectors interpreted as signed decimal numbers and % representing signed remainder + (similar to the C programming language), to hold: + +

          +
        • 10 % 5 == 0 +
        • 10 % 3 == 1 +
        • 10 % (-3) == 1 +
        • -10 % 5 == 0 +
        • -10 % 3 == -1 +
        • -10 % (-3) == -1 +
        + +

        If the divisor evaluates to zero (modulo-by-zero), either directly as value or indirectly + via an additional constraint, then the result of the modulo operation is defined as the + dividend itself. We refer to the SMTLIB standard version 2.6 for the division and remainder + operators in BV theory.

        +
        +
        Specified by:
        +
        remainder in interface BitvectorFormulaManager
        +
        Parameters:
        +
        numerator - dividend of the operation. The sign bit is carried over from this bitvector for + signed operations.
        +
        denominator - divisor of the operation.
        +
        signed - whether to interpret all operands as signed or as unsigned numbers.
        +
        +
        • +
      + + + +
        +
      • +

        multiply

        +
        public BitvectorFormula multiply​(BitvectorFormula number1,
+                                 BitvectorFormula number2)
        +
        Description copied from interface: BitvectorFormulaManager
        +
        This method returns the multiplication of the given bitvectors. The result has the same length + as the given parameters. There can be an overflow, i.e., as one would expect from bitvector + logic. There is no difference in signed and unsigned numbers.
        +
        +
        Specified by:
        +
        multiply in interface BitvectorFormulaManager
        +
        Parameters:
        +
        number1 - a Formula
        +
        number2 - a Formula
        +
        Returns:
        +
        number1 - number2
        +
        +
        • +
      + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
        +
      • +

        shiftRight

        +
        public BitvectorFormula shiftRight​(BitvectorFormula number,
+                                   BitvectorFormula toShift,
+                                   boolean signed)
        +
        Description copied from interface: BitvectorFormulaManager
        +
        This method returns a term representing the right shift (towards least-significant bit) of + number by toShift. The result has the same length as the given number. On the left side, we + fill up the most significant bits with ones (i.e., arithmetic shift), if the number is signed + and negative, else we fill up with zeroes. For "toShift >= bitsize", we return a bitvector + with value zero, if number was zero or positive, or all bits set to one, if negative.
        +
        +
        Specified by:
        +
        shiftRight in interface BitvectorFormulaManager
        +
        +
        • +
      + + + +
        +
      • +

        shiftLeft

        +
        public BitvectorFormula shiftLeft​(BitvectorFormula number,
+                                  BitvectorFormula toShift)
        +
        Description copied from interface: BitvectorFormulaManager
        +
        This method returns a term representing the left shift (towards most-significant bit) of number + by toShift. The result has the same length as the given number. On the right side, we fill up + the least significant bits with zeroes. For "toShift >= bitsize", we return a bitvector with + value zero.
        +
        +
        Specified by:
        +
        shiftLeft in interface BitvectorFormulaManager
        +
        +
        • +
      + + + +
        +
      • +

        rotateLeft

        +
        public BitvectorFormula rotateLeft​(BitvectorFormula number,
+                                   int toRotate)
        +
        Description copied from interface: BitvectorFormulaManager
        +
        This method returns a term representing the left rotation (towards most-significant bit) of + number by toRotate. The result has the same length as the given number. For "toRotate % bitsize + == 0", we return the number itself.
        +
        +
        Specified by:
        +
        rotateLeft in interface BitvectorFormulaManager
        +
        toRotate - the number of bits to be moved
        +
        +
        • +
      + + + +
        +
      • +

        rotateLeft

        +
        public BitvectorFormula rotateLeft​(BitvectorFormula number,
+                                   BitvectorFormula toRotate)
        +
        Description copied from interface: BitvectorFormulaManager
        +
        This method returns a term representing the left rotation (towards most-significant bit) of + number by toRotate. The result has the same length as the given number. For "toRotate % bitsize + == 0", we return the number itself.
        +
        +
        Specified by:
        +
        rotateLeft in interface BitvectorFormulaManager
        +
        toRotate - unsigned bitvector, represents the number of bits to be moved
        +
        +
        • +
      + + + +
        +
      • +

        rotateRight

        +
        public BitvectorFormula rotateRight​(BitvectorFormula number,
+                                    int toRotate)
        +
        Description copied from interface: BitvectorFormulaManager
        +
        This method returns a term representing the right rotation (towards least-significant bit) of + number by toRotate. The result has the same length as the given number. For "toRotate % bitsize + == 0", we return the number itself.
        +
        +
        Specified by:
        +
        rotateRight in interface BitvectorFormulaManager
        +
        toRotate - the number of bits to be moved
        +
        +
        • +
      + + + +
        +
      • +

        rotateRight

        +
        public BitvectorFormula rotateRight​(BitvectorFormula number,
+                                    BitvectorFormula toRotate)
        +
        Description copied from interface: BitvectorFormulaManager
        +
        This method returns a term representing the right rotation (towards least-significant bit) of + number by toRotate. The result has the same length as the given number. For "toRotate % bitsize + == 0", we return the number itself.
        +
        +
        Specified by:
        +
        rotateRight in interface BitvectorFormulaManager
        +
        toRotate - unsigned bitvector, represents the number of bits to be moved
        +
        +
        • +
      + + + + + + + +
        +
      • +

        extract

        +
        public BitvectorFormula extract​(BitvectorFormula number,
+                                int msb,
+                                int lsb)
        +
        Description copied from interface: BitvectorFormulaManager
        +
        Extract a range of bits from a bitvector. We require 0 <= lsb <= msb < bitsize. + +

        If msb equals lsb, then a single bit will be returned, i.e., the bit from the given + position. If lsb equals 0 and msb equals bitsize-1, then the complete bitvector will be + returned.

        +
        +
        Specified by:
        +
        extract in interface BitvectorFormulaManager
        +
        Parameters:
        +
        number - from where the bits are extracted.
        +
        msb - Upper index for the most significant bit. Must be in interval from lsb to bitsize-1.
        +
        lsb - Lower index for the least significant bit. Must be in interval from 0 to msb.
        +
        +
        • +
      + + + +
        +
      • +

        extend

        +
        public BitvectorFormula extend​(BitvectorFormula number,
+                               int extensionBits,
+                               boolean signed)
        +
        Description copied from interface: BitvectorFormulaManager
        +
        Extend a bitvector to the left (add most significant bits). If signed is set and the given + number is negative, then the bit "1" will be added several times, else "0".
        +
        +
        Specified by:
        +
        extend in interface BitvectorFormulaManager
        +
        Parameters:
        +
        number - The bitvector to extend.
        +
        extensionBits - How many bits to add.
        +
        signed - Whether the extension should depend on the sign bit.
        +
        +
        • +
      + + + + +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingBooleanFormulaManager.html b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingBooleanFormulaManager.html new file mode 100644 index 0000000000..e663562b5e --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingBooleanFormulaManager.html @@ -0,0 +1,894 @@ + + + + + +DebuggingBooleanFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.debugging
+

Class DebuggingBooleanFormulaManager

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.debugging.DebuggingBooleanFormulaManager
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingEnumerationFormulaManager.html b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingEnumerationFormulaManager.html new file mode 100644 index 0000000000..935065d21f --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingEnumerationFormulaManager.html @@ -0,0 +1,414 @@ + + + + + +DebuggingEnumerationFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.debugging
+

Class DebuggingEnumerationFormulaManager

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.debugging.DebuggingEnumerationFormulaManager
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingFloatingPointFormulaManager.html b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingFloatingPointFormulaManager.html new file mode 100644 index 0000000000..a4d1e693dc --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingFloatingPointFormulaManager.html @@ -0,0 +1,1406 @@ + + + + + +DebuggingFloatingPointFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.debugging
+

Class DebuggingFloatingPointFormulaManager

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.debugging.DebuggingFloatingPointFormulaManager
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingFormulaManager.html b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingFormulaManager.html new file mode 100644 index 0000000000..6bc59e6930 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingFormulaManager.html @@ -0,0 +1,1105 @@ + + + + + +DebuggingFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.debugging
+

Class DebuggingFormulaManager

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.debugging.DebuggingFormulaManager
      • +
    +
    • +
+
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        DebuggingFormulaManager

        +
        public DebuggingFormulaManager​(FormulaManager pDelegate,
+                               org.sosy_lab.java_smt.delegate.debugging.DebuggingAssertions pDebugging)
        +
        • +
      +
      • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        getIntegerFormulaManager

        +
        public IntegerFormulaManager getIntegerFormulaManager()
        +
        Description copied from interface: FormulaManager
        +
        Returns the Integer-Theory. Because most SAT-solvers support automatic casting between Integer- + and Rational-Theory, the Integer- and the RationalFormulaManager both return the same Formulas + for numeric operations like ADD, SUBTRACT, TIMES, LESSTHAN, EQUAL and others.
        +
        +
        Specified by:
        +
        getIntegerFormulaManager in interface FormulaManager
        +
        +
        • +
      + + + +
        +
      • +

        getRationalFormulaManager

        +
        public RationalFormulaManager getRationalFormulaManager()
        +
        Description copied from interface: FormulaManager
        +
        Returns the Rational-Theory. Because most SAT-solvers support automatic casting between + Integer- and Rational-Theory, the Integer- and the RationalFormulaManager both return the same + Formulas for numeric operations like ADD, SUBTRACT, TIMES, LESSTHAN, EQUAL, etc.
        +
        +
        Specified by:
        +
        getRationalFormulaManager in interface FormulaManager
        +
        +
        • +
      + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
        +
      • +

        makeVariable

        +
        public <T extends Formula> T makeVariable​(FormulaType<T> formulaType,
+                                          String name)
        +
        Description copied from interface: FormulaManager
        +
        Create variable of the type equal to formulaType.
        +
        +
        Specified by:
        +
        makeVariable in interface FormulaManager
        +
        Parameters:
        +
        formulaType - the type of the variable.
        +
        name - the name of the variable.
        +
        Returns:
        +
        the created variable.
        +
        +
        • +
      + + + +
        +
      • +

        makeApplication

        +
        public <T extends Formula> T makeApplication​(FunctionDeclaration<T> declaration,
+                                             List<? extends Formula> args)
        +
        Description copied from interface: FormulaManager
        +
        Create a function application to the given list of arguments.
        +
        +
        Specified by:
        +
        makeApplication in interface FormulaManager
        +
        Parameters:
        +
        declaration - Function declaration
        +
        args - List of arguments
        +
        Returns:
        +
        Constructed formula
        +
        +
        • +
      + + + +
        +
      • +

        makeApplication

        +
        public <T extends Formula> T makeApplication​(FunctionDeclaration<T> declaration,
+                                             Formula... args)
        +
        Description copied from interface: FormulaManager
        +
        Create a function application to the given list of arguments.
        +
        +
        Specified by:
        +
        makeApplication in interface FormulaManager
        +
        Parameters:
        +
        declaration - Function declaration
        +
        args - List of arguments
        +
        Returns:
        +
        Constructed formula
        +
        +
        • +
      + + + + + + + + + +
        +
      • +

        parse

        +
        public BooleanFormula parse​(String s)
+                     throws IllegalArgumentException
        +
        Description copied from interface: FormulaManager
        +
        Parse a boolean formula given as a String in an SMTLIB file format. We expect exactly one + assertion to be contained in the query. + +

        Example: (declare-fun x () Int)(assert (= 0 x)) + +

        It depends on the used SMT solver whether the given query must be self-contained and include + declarations for all used symbols or not, and also whether the query is allowed to contain + symbols with equal name, but different type/sort than existing symbols. The safest way is to + always declare all used symbols and to avoid conflicting types for them. + +

        The behavior of the SMT solver is undefined if commands are provided in the SMTLIB-based + String that are different from declarations or an assertion, such as push/pop or + set-info. Most solvers just ignore those commands. + +

        Variables that are defined, but not used in the assertion, might be ignored by the SMT + solver and they might not be available for later usage.

        +
        +
        Specified by:
        +
        parse in interface FormulaManager
        +
        Returns:
        +
        A single formula from the assertion in the internal representation.
        +
        Throws:
        +
        IllegalArgumentException - If the string cannot be parsed.
        +
        +
        • +
      + + + +
        +
      • +

        dumpFormula

        +
        public Appender dumpFormula​(BooleanFormula pT)
        +
        Description copied from interface: FormulaManager
        +
        Serialize an input formula to an SMT-LIB format. Very useful when passing formulas between + different solvers. + +

        To get a String, simply call Object.toString() on the returned object. This method + is lazy and does not create an output string until the returned object is actually used.

        +
        +
        Specified by:
        +
        dumpFormula in interface FormulaManager
        +
        Returns:
        +
        SMT-LIB formula serialization.
        +
        +
        • +
      + + + + + + + + + +
        +
      • +

        simplify

        +
        public <T extends Formula> T simplify​(T input)
+                               throws InterruptedException
        +
        Description copied from interface: FormulaManager
        +
        Simplify an input formula, while ensuring equivalence. + +

        For solvers that do not provide a simplification API, an original formula is returned.

        +
        +
        Specified by:
        +
        simplify in interface FormulaManager
        +
        Parameters:
        +
        input - The input formula
        +
        Returns:
        +
        Simplified version of the formula
        +
        Throws:
        +
        InterruptedException
        +
        +
        • +
      + + + +
        +
      • +

        visit

        +
        public <R> R visit​(Formula f,
+                   FormulaVisitor<R> rFormulaVisitor)
        +
        Description copied from interface: FormulaManager
        +
        Visit the formula with a given visitor. + +

        This method does not recursively visit sub-components of a formula its own, so the + given FormulaVisitor needs to call such visitation on its own. + +

        Please be aware that calling this method might cause extensive stack usage depending on the + nesting of the given formula and the given FormulaVisitor. Additionally, sub-formulas + that are used several times in the formula might be visited several times. For an efficient + formula traversing, we also provide FormulaManager.visitRecursively(Formula, FormulaVisitor).

        +
        +
        Specified by:
        +
        visit in interface FormulaManager
        +
        Parameters:
        +
        f - formula to be visited
        +
        rFormulaVisitor - an implementation that provides steps for each kind of formula.
        +
        +
        • +
      + + + +
        +
      • +

        visitRecursively

        +
        public void visitRecursively​(Formula f,
+                             FormulaVisitor<TraversalProcess> rFormulaVisitor)
        +
        Description copied from interface: FormulaManager
        +
        Visit the formula recursively with a given FormulaVisitor. This method traverses + sub-components of a formula automatically, depending on the return value of the TraversalProcess in the given FormulaVisitor. + +

        This method guarantees that the traversal is done iteratively, without using Java recursion, + and thus is not prone to StackOverflowErrors. + +

        Furthermore, this method also guarantees that every equal part of the formula is visited + only once. Thus, it can be used to traverse DAG-like formulas efficiently. + +

        The traversal is done in PRE-ORDER manner with regard to caching identical subtrees, i.e., a + parent will be visited BEFORE its children. The unmodified child-formulas are passed as + argument to the parent's visitation.

        +
        +
        Specified by:
        +
        visitRecursively in interface FormulaManager
        +
        +
        • +
      + + + + + +
        +
      • +

        transformRecursively

        +
        public <T extends Formula> T transformRecursively​(T f,
+                                                  FormulaTransformationVisitor pFormulaVisitor)
        +
        Description copied from interface: FormulaManager
        +
        Visit the formula recursively with a given FormulaVisitor. + +

        This method guarantees that the traversal is done iteratively, without using Java recursion, + and thus is not prone to StackOverflowErrors. + +

        Furthermore, this method also guarantees that every equal part of the formula is visited + only once. Thus, it can be used to traverse DAG-like formulas efficiently. + +

        The traversal is done in POST-ORDER manner with regard to caching identical subtrees, i.e., + a parent will be visited AFTER its children. The result of the child-visitation is passed as + argument to the parent's visitation.

        +
        +
        Specified by:
        +
        transformRecursively in interface FormulaManager
        +
        pFormulaVisitor - Transformation described by the user.
        +
        +
        • +
      + + + +
        +
      • +

        extractVariables

        +
        public ImmutableMap<String,​Formula> extractVariables​(Formula f)
        +
        Description copied from interface: FormulaManager
        +
        Extract the names of all free variables and UFs in a formula.
        +
        +
        Specified by:
        +
        extractVariables in interface FormulaManager
        +
        Parameters:
        +
        f - The input formula
        +
        Returns:
        +
        Map from variable names to the corresponding formulas.
        +
        +
        • +
      + + + +
        +
      • +

        extractVariablesAndUFs

        +
        public ImmutableMap<String,​Formula> extractVariablesAndUFs​(Formula f)
        +
        Description copied from interface: FormulaManager
        +
        Extract the names of all free variables and UFs in a formula.
        +
        +
        Specified by:
        +
        extractVariablesAndUFs in interface FormulaManager
        +
        Parameters:
        +
        f - The input formula
        +
        Returns:
        +
        Map from variable names to the corresponding formulas. If an UF occurs multiple times + in the input formula, an arbitrary instance of an application of this UF is in the map.
        +
        +
        • +
      + + + + + +
        +
      • +

        substitute

        +
        public <T extends Formula> T substitute​(T f,
+                                        Map<? extends Formula,​? extends Formula> fromToMapping)
        +
        Description copied from interface: FormulaManager
        +
        Substitute every occurrence of any item from changeFrom in formula f to the + corresponding occurrence from changeTo. + +

        E.g. if changeFrom contains a variable a and changeTo contains a + variable b all occurrences of a will be changed to b in the returned + formula.

        +
        +
        Specified by:
        +
        substitute in interface FormulaManager
        +
        Parameters:
        +
        f - Formula to change.
        +
        fromToMapping - Mapping of old and new formula parts.
        +
        Returns:
        +
        Formula with parts replaced.
        +
        +
        • +
      + + + + + + + +
        +
      • +

        isValidName

        +
        public boolean isValidName​(String variableName)
        +
        Description copied from interface: FormulaManager
        +
        Check whether the given String can be used as symbol/name for variables or undefined functions. + +

        We explicitly state that with further development of SMT solvers and the SMTLib + specification, the list of forbidden variable names may change in the future. Users should if + possible not use logical or mathematical operators, or keywords strongly depending on SMTlib. + +

        If a variable name is rejected, a possibility is escaping, e.g. either substituting the + whole variable name or just every invalid character with an escaped form. We recommend using an + escape sequence based on the token "JAVASMT", because it might be unusual enough to appear when + encoding a user's problem in SMT. Please note that you might also have to handle escaping the + escape sequence. Examples: + +

          +
        • the invalid variable name "=" (logical operator for equality) can be + replaced with a string "JAVASMT_EQUALS". +
        • the invalid SMTlib-escaped variable name "|test|" (the solver SMTInterpol + does not allow the pipe symbol "|" in names) can be replaced with + "JAVASMT_PIPEtestJAVASMT_PIPE". +
        +
        +
        Specified by:
        +
        isValidName in interface FormulaManager
        +
        +
        • +
      + + + + + + + + +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingIntegerFormulaManager.html b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingIntegerFormulaManager.html new file mode 100644 index 0000000000..a763d48621 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingIntegerFormulaManager.html @@ -0,0 +1,422 @@ + + + + + +DebuggingIntegerFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.debugging
+

Class DebuggingIntegerFormulaManager

+
+
+ +
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingInterpolatingProverEnvironment.html b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingInterpolatingProverEnvironment.html new file mode 100644 index 0000000000..ef11f5a830 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingInterpolatingProverEnvironment.html @@ -0,0 +1,794 @@ + + + + + +DebuggingInterpolatingProverEnvironment (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.debugging
+

Class DebuggingInterpolatingProverEnvironment<T>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.debugging.DebuggingInterpolatingProverEnvironment<T>
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingModel.html b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingModel.html new file mode 100644 index 0000000000..9aa08a82d2 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingModel.html @@ -0,0 +1,616 @@ + + + + + +DebuggingModel (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.debugging
+

Class DebuggingModel

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.debugging.DebuggingModel
      • +
    +
    • +
+
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        DebuggingModel

        +
        public DebuggingModel​(Model pDelegate,
+                      org.sosy_lab.java_smt.delegate.debugging.DebuggingAssertions pDebugging)
        +
        • +
      +
      • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + + + +
        +
      • +

        eval

        +
        public <T extends Formula> @Nullable T eval​(T formula)
        +
        Description copied from interface: Evaluator
        +
        Evaluate a given formula substituting the values from the model and return it as formula. + +

        If a value is not relevant to the satisfiability result, the solver can choose either to + insert an arbitrary value (e.g., the value 0 for the matching type) or just return + null. + +

        The formula does not need to be a variable, we also allow complex expression. The solver + will replace all symbols from the formula with their model values and then simplify the formula + into a simple formula, e.g., consisting only of a numeral expression.

        +
        +
        Specified by:
        +
        eval in interface Evaluator
        +
        Parameters:
        +
        formula - Input formula to be evaluated.
        +
        Returns:
        +
        evaluation of the given formula or null if the solver does not provide a + better evaluation.
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public @Nullable Object evaluate​(Formula formula)
        +
        Description copied from interface: Evaluator
        +
        Evaluate a given formula substituting the values from the model. + +

        If a value is not relevant to the satisfiability result, the model can choose either an + arbitrary value (e.g., the value 0 for the matching type) or just return + null. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        Parameters:
        +
        formula - Input formula
        +
        Returns:
        +
        Either of: - Number (Rational/Double/BigInteger/Long/Integer) - Boolean
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public @Nullable BigInteger evaluate​(NumeralFormula.IntegerFormula formula)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for integer formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public @Nullable Rational evaluate​(NumeralFormula.RationalFormula formula)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for rational formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public @Nullable Boolean evaluate​(BooleanFormula formula)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for boolean formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public @Nullable BigInteger evaluate​(BitvectorFormula formula)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for bitvector formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public @Nullable String evaluate​(StringFormula formula)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for string formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public @Nullable String evaluate​(EnumerationFormula formula)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for enumeration formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + +
        +
      • +

        evaluate

        +
        public @Nullable FloatingPointNumber evaluate​(FloatingPointFormula formula)
        +
        Description copied from interface: Evaluator
        +
        Type-safe evaluation for floating-point formulas. + +

        The formula does not need to be a variable, we also allow complex expression.

        +
        +
        Specified by:
        +
        evaluate in interface Evaluator
        +
        +
        • +
      + + + + + + + + +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingNumeralFormulaManager.html b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingNumeralFormulaManager.html new file mode 100644 index 0000000000..2c8c151d23 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingNumeralFormulaManager.html @@ -0,0 +1,765 @@ + + + + + +DebuggingNumeralFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.debugging
+

Class DebuggingNumeralFormulaManager<ParamFormulaType extends NumeralFormula,​ResultFormulaType extends NumeralFormula>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.debugging.DebuggingNumeralFormulaManager<ParamFormulaType,​ResultFormulaType>
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingOptimizationProverEnvironment.html b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingOptimizationProverEnvironment.html new file mode 100644 index 0000000000..1caa873097 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingOptimizationProverEnvironment.html @@ -0,0 +1,791 @@ + + + + + +DebuggingOptimizationProverEnvironment (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.debugging
+

Class DebuggingOptimizationProverEnvironment

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.debugging.DebuggingOptimizationProverEnvironment
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingProverEnvironment.html b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingProverEnvironment.html new file mode 100644 index 0000000000..79d3fa55da --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingProverEnvironment.html @@ -0,0 +1,648 @@ + + + + + +DebuggingProverEnvironment (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.debugging
+

Class DebuggingProverEnvironment

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.debugging.DebuggingProverEnvironment
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingQuantifiedFormulaManager.html b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingQuantifiedFormulaManager.html new file mode 100644 index 0000000000..24bf6a5658 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingQuantifiedFormulaManager.html @@ -0,0 +1,382 @@ + + + + + +DebuggingQuantifiedFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.debugging
+

Class DebuggingQuantifiedFormulaManager

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.debugging.DebuggingQuantifiedFormulaManager
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingRationalFormulaManager.html b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingRationalFormulaManager.html new file mode 100644 index 0000000000..cb09821b72 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingRationalFormulaManager.html @@ -0,0 +1,300 @@ + + + + + +DebuggingRationalFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.debugging
+

Class DebuggingRationalFormulaManager

+
+
+ +
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        DebuggingRationalFormulaManager

        +
        public DebuggingRationalFormulaManager​(RationalFormulaManager pDelegate,
+                                       org.sosy_lab.java_smt.delegate.debugging.DebuggingAssertions pDebugging)
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingSLFormulaManager.html b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingSLFormulaManager.html new file mode 100644 index 0000000000..58d6493808 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingSLFormulaManager.html @@ -0,0 +1,402 @@ + + + + + +DebuggingSLFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.debugging
+

Class DebuggingSLFormulaManager

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.debugging.DebuggingSLFormulaManager
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingSolverContext.html b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingSolverContext.html new file mode 100644 index 0000000000..1236b254c0 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingSolverContext.html @@ -0,0 +1,538 @@ + + + + + +DebuggingSolverContext (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.debugging
+

Class DebuggingSolverContext

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.debugging.DebuggingSolverContext
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingSolverInformation.html b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingSolverInformation.html new file mode 100644 index 0000000000..09357f9f90 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingSolverInformation.html @@ -0,0 +1,324 @@ + + + + + +DebuggingSolverInformation (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.debugging
+

Class DebuggingSolverInformation

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.debugging.DebuggingSolverInformation
      • +
    +
    • +
+
+
    +
  • +
    +
    public class DebuggingSolverInformation
+extends Object
    +
    • +
+
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingStringFormulaManager.html b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingStringFormulaManager.html new file mode 100644 index 0000000000..83e6591570 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingStringFormulaManager.html @@ -0,0 +1,1081 @@ + + + + + +DebuggingStringFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.debugging
+

Class DebuggingStringFormulaManager

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.debugging.DebuggingStringFormulaManager
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingUFManager.html b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingUFManager.html new file mode 100644 index 0000000000..d7bc5378e8 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/DebuggingUFManager.html @@ -0,0 +1,458 @@ + + + + + +DebuggingUFManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.debugging
+

Class DebuggingUFManager

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.debugging.DebuggingUFManager
      • +
    +
    • +
+
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    UFManager
    +
    +
    +
    public class DebuggingUFManager
+extends Object
+implements UFManager
    +
    • +
+
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/package-summary.html b/api/org/sosy_lab/java_smt/delegate/debugging/package-summary.html new file mode 100644 index 0000000000..4e737e6617 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/package-summary.html @@ -0,0 +1,242 @@ + + + + + +org.sosy_lab.java_smt.delegate.debugging (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

@CheckReturnValue +@ParametersAreNonnullByDefault +@FieldsAreNonnullByDefault +@ReturnValuesAreNonnullByDefault +

+

Package org.sosy_lab.java_smt.delegate.debugging

+
+
+ +
+
+
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/delegate/debugging/package-tree.html b/api/org/sosy_lab/java_smt/delegate/debugging/package-tree.html new file mode 100644 index 0000000000..cdec8ade18 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/debugging/package-tree.html @@ -0,0 +1,183 @@ + + + + + +org.sosy_lab.java_smt.delegate.debugging Class Hierarchy (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Hierarchy For Package org.sosy_lab.java_smt.delegate.debugging

+Package Hierarchies: + +
+
+
+

Class Hierarchy

+ +
+
+
+ + + diff --git a/api/org/sosy_lab/java_smt/delegate/logging/LoggingSolverContext.html b/api/org/sosy_lab/java_smt/delegate/logging/LoggingSolverContext.html new file mode 100644 index 0000000000..a215f33b2c --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/logging/LoggingSolverContext.html @@ -0,0 +1,532 @@ + + + + + +LoggingSolverContext (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.logging
+

Class LoggingSolverContext

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.logging.LoggingSolverContext
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/logging/package-summary.html b/api/org/sosy_lab/java_smt/delegate/logging/package-summary.html new file mode 100644 index 0000000000..b0c13902e2 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/logging/package-summary.html @@ -0,0 +1,177 @@ + + + + + +org.sosy_lab.java_smt.delegate.logging (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

@CheckReturnValue +@ParametersAreNonnullByDefault +@FieldsAreNonnullByDefault +@ReturnValuesAreNonnullByDefault +

+

Package org.sosy_lab.java_smt.delegate.logging

+
+
+
+ + +
Wraps the proving environment with loggers.
+
+ +
+
+
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/delegate/logging/package-tree.html b/api/org/sosy_lab/java_smt/delegate/logging/package-tree.html new file mode 100644 index 0000000000..46227c7d68 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/logging/package-tree.html @@ -0,0 +1,162 @@ + + + + + +org.sosy_lab.java_smt.delegate.logging Class Hierarchy (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Hierarchy For Package org.sosy_lab.java_smt.delegate.logging

+Package Hierarchies: + +
+
+
+

Class Hierarchy

+ +
+
+
+ + + diff --git a/api/org/sosy_lab/java_smt/delegate/statistics/SolverStatistics.html b/api/org/sosy_lab/java_smt/delegate/statistics/SolverStatistics.html new file mode 100644 index 0000000000..30f6958e53 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/statistics/SolverStatistics.html @@ -0,0 +1,643 @@ + + + + + +SolverStatistics (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.statistics
+

Class SolverStatistics

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.statistics.SolverStatistics
      • +
    +
    • +
+
+
    +
  • +
    +
    public class SolverStatistics
+extends Object
    +
    • +
+
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        getNumberOfProverEnvironments

        +
        public int getNumberOfProverEnvironments()
        +
        • +
      + + + +
        +
      • +

        getNumberOfPopQueries

        +
        public int getNumberOfPopQueries()
        +
        • +
      + + + +
        +
      • +

        getNumberOfPushQueries

        +
        public int getNumberOfPushQueries()
        +
        • +
      + + + +
        +
      • +

        getNumberOfAddConstraintQueries

        +
        public int getNumberOfAddConstraintQueries()
        +
        • +
      + + + +
        +
      • +

        getNumberOfModelQueries

        +
        public int getNumberOfModelQueries()
        +
        • +
      + + + +
        +
      • +

        getNumberOfUnsatCoreQueries

        +
        public int getNumberOfUnsatCoreQueries()
        +
        • +
      + + + +
        +
      • +

        getNumberOfIsUnsatQueries

        +
        public int getNumberOfIsUnsatQueries()
        +
        • +
      + + + +
        +
      • +

        getSumTimeOfIsUnsatQueries

        +
        public TimeSpan getSumTimeOfIsUnsatQueries()
        +
        • +
      + + + +
        +
      • +

        getMaxTimeOfIsUnsatQueries

        +
        public TimeSpan getMaxTimeOfIsUnsatQueries()
        +
        • +
      + + + +
        +
      • +

        getNumberOfAllSatQueries

        +
        public int getNumberOfAllSatQueries()
        +
        • +
      + + + +
        +
      • +

        getSumTimeOfAllSatQueries

        +
        public TimeSpan getSumTimeOfAllSatQueries()
        +
        • +
      + + + +
        +
      • +

        getMaxTimeOfAllSatQueries

        +
        public TimeSpan getMaxTimeOfAllSatQueries()
        +
        • +
      + + + +
        +
      • +

        getNumberOfInterpolationQueries

        +
        public int getNumberOfInterpolationQueries()
        +
        • +
      + + + +
        +
      • +

        getSumTimeOfInterpolationQueries

        +
        public TimeSpan getSumTimeOfInterpolationQueries()
        +
        • +
      + + + +
        +
      • +

        getMaxTimeOfInterpolationQueries

        +
        public TimeSpan getMaxTimeOfInterpolationQueries()
        +
        • +
      + + + +
        +
      • +

        getNumberOfBooleanOperations

        +
        public int getNumberOfBooleanOperations()
        +
        • +
      + + + +
        +
      • +

        getNumberOfVisits

        +
        public int getNumberOfVisits()
        +
        • +
      + + + +
        +
      • +

        getNumberOfNumericOperations

        +
        public int getNumberOfNumericOperations()
        +
        • +
      + + + +
        +
      • +

        getNumberOfArrayOperations

        +
        public int getNumberOfArrayOperations()
        +
        • +
      + + + +
        +
      • +

        getNumberOfSLOperations

        +
        public int getNumberOfSLOperations()
        +
        • +
      + + + +
        +
      • +

        getNumberOfUFOperations

        +
        public int getNumberOfUFOperations()
        +
        • +
      + + + +
        +
      • +

        getNumberOfQuantifierOperations

        +
        public int getNumberOfQuantifierOperations()
        +
        • +
      + + + +
        +
      • +

        getNumberOfBVOperations

        +
        public int getNumberOfBVOperations()
        +
        • +
      + + + +
        +
      • +

        getNumberOfFPOperations

        +
        public int getNumberOfFPOperations()
        +
        • +
      + + + +
        +
      • +

        getNumberOfStringOperations

        +
        public int getNumberOfStringOperations()
        +
        • +
      + + + +
        +
      • +

        getNumberOfModelEvaluationQueries

        +
        public int getNumberOfModelEvaluationQueries()
        +
        • +
      + + + +
        +
      • +

        getNumberOfModelListings

        +
        public int getNumberOfModelListings()
        +
        • +
      + + + + +
      • +
    +
    +
    • +
+
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/delegate/statistics/StatisticsEnumerationFormulaManager.html b/api/org/sosy_lab/java_smt/delegate/statistics/StatisticsEnumerationFormulaManager.html new file mode 100644 index 0000000000..d92422ab08 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/statistics/StatisticsEnumerationFormulaManager.html @@ -0,0 +1,372 @@ + + + + + +StatisticsEnumerationFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.statistics
+

Class StatisticsEnumerationFormulaManager

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.statistics.StatisticsEnumerationFormulaManager
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/delegate/statistics/StatisticsSolverContext.html b/api/org/sosy_lab/java_smt/delegate/statistics/StatisticsSolverContext.html new file mode 100644 index 0000000000..200d6f9078 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/statistics/StatisticsSolverContext.html @@ -0,0 +1,546 @@ + + + + + +StatisticsSolverContext (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.statistics
+

Class StatisticsSolverContext

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.statistics.StatisticsSolverContext
      • +
    +
    • +
+
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        StatisticsSolverContext

        +
        public StatisticsSolverContext​(SolverContext pDelegate)
        +
        • +
      +
      • +
    +
    + +
    + +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/statistics/TimerPool.TimerWrapper.html b/api/org/sosy_lab/java_smt/delegate/statistics/TimerPool.TimerWrapper.html new file mode 100644 index 0000000000..90c5bd4e83 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/statistics/TimerPool.TimerWrapper.html @@ -0,0 +1,284 @@ + + + + + +TimerPool.TimerWrapper (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.statistics
+

Class TimerPool.TimerWrapper

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.statistics.TimerPool.TimerWrapper
      • +
    +
    • +
+
+
    +
  • +
    +
    Enclosing class:
    +
    TimerPool
    +
    +
    +
    public static class TimerPool.TimerWrapper
+extends Object
    +
    A minimal wrapper to keep a reference on the timer and provide a limited view.
    +
    • +
+
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        start

        +
        public void start()
        +
        • +
      + + + +
        +
      • +

        stop

        +
        public void stop()
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/delegate/statistics/TimerPool.html b/api/org/sosy_lab/java_smt/delegate/statistics/TimerPool.html new file mode 100644 index 0000000000..db2e396439 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/statistics/TimerPool.html @@ -0,0 +1,398 @@ + + + + + +TimerPool (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.statistics
+

Class TimerPool

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.statistics.TimerPool
      • +
    +
    • +
+
+
    +
  • +
    +
    public class TimerPool
+extends Object
    +
    • +
+
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        TimerPool

        +
        public TimerPool()
        +
        • +
      +
      • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + + + + + +
        +
      • +

        getSumTime

        +
        public TimeSpan getSumTime()
        +
        • +
      + + + +
        +
      • +

        getMaxTime

        +
        public TimeSpan getMaxTime()
        +
        Return the maximal time of all intervals. If timers are running, the current intervals are also + counted (up to the current time). If no timer was started, this method returns 0.
        +
        • +
      + + + +
        +
      • +

        getNumberOfIntervals

        +
        public int getNumberOfIntervals()
        +
        Return the number of intervals. If timers are running, the current intervals are also counted. + If no timer was started, this method returns 0.
        +
        • +
      + + + + +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/statistics/package-summary.html b/api/org/sosy_lab/java_smt/delegate/statistics/package-summary.html new file mode 100644 index 0000000000..e5cc24c020 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/statistics/package-summary.html @@ -0,0 +1,193 @@ + + + + + +org.sosy_lab.java_smt.delegate.statistics (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

@CheckReturnValue +@ParametersAreNonnullByDefault +@FieldsAreNonnullByDefault +@ReturnValuesAreNonnullByDefault +

+

Package org.sosy_lab.java_smt.delegate.statistics

+
+
+
+ + +
The classes of this package wrap the whole proving environment and measure all accesses to it.
+
+ +
+
+
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/delegate/statistics/package-tree.html b/api/org/sosy_lab/java_smt/delegate/statistics/package-tree.html new file mode 100644 index 0000000000..1e12031c88 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/statistics/package-tree.html @@ -0,0 +1,166 @@ + + + + + +org.sosy_lab.java_smt.delegate.statistics Class Hierarchy (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Hierarchy For Package org.sosy_lab.java_smt.delegate.statistics

+Package Hierarchies: + +
+
+
+

Class Hierarchy

+ +
+
+
+ + + diff --git a/api/org/sosy_lab/java_smt/delegate/synchronize/SynchronizedEnumerationFormulaManager.html b/api/org/sosy_lab/java_smt/delegate/synchronize/SynchronizedEnumerationFormulaManager.html new file mode 100644 index 0000000000..f91857a496 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/synchronize/SynchronizedEnumerationFormulaManager.html @@ -0,0 +1,372 @@ + + + + + +SynchronizedEnumerationFormulaManager (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.synchronize
+

Class SynchronizedEnumerationFormulaManager

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.synchronize.SynchronizedEnumerationFormulaManager
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/delegate/synchronize/SynchronizedSolverContext.html b/api/org/sosy_lab/java_smt/delegate/synchronize/SynchronizedSolverContext.html new file mode 100644 index 0000000000..e76c989179 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/synchronize/SynchronizedSolverContext.html @@ -0,0 +1,540 @@ + + + + + +SynchronizedSolverContext (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.delegate.synchronize
+

Class SynchronizedSolverContext

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.delegate.synchronize.SynchronizedSolverContext
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/delegate/synchronize/package-summary.html b/api/org/sosy_lab/java_smt/delegate/synchronize/package-summary.html new file mode 100644 index 0000000000..c729908ee9 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/synchronize/package-summary.html @@ -0,0 +1,184 @@ + + + + + +org.sosy_lab.java_smt.delegate.synchronize (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

@CheckReturnValue +@ParametersAreNonnullByDefault +@FieldsAreNonnullByDefault +@ReturnValuesAreNonnullByDefault +

+

Package org.sosy_lab.java_smt.delegate.synchronize

+
+
+
+ + +
The classes of this package wrap the whole solver context and all corresponding proving + environment and synchronize all accesses to it. + +

This allows us to use a plain sequential solver in a concurrent context, i.e., we can create + formulae and solve queries from multiple interleaving threads without any synchronization from + the user.

+
+ +
+
+
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/delegate/synchronize/package-tree.html b/api/org/sosy_lab/java_smt/delegate/synchronize/package-tree.html new file mode 100644 index 0000000000..39cd7b2dc4 --- /dev/null +++ b/api/org/sosy_lab/java_smt/delegate/synchronize/package-tree.html @@ -0,0 +1,163 @@ + + + + + +org.sosy_lab.java_smt.delegate.synchronize Class Hierarchy (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Hierarchy For Package org.sosy_lab.java_smt.delegate.synchronize

+Package Hierarchies: + +
+
+
+

Class Hierarchy

+ +
+
+
+ + + diff --git a/api/org/sosy_lab/java_smt/example/AllSatExample.html b/api/org/sosy_lab/java_smt/example/AllSatExample.html new file mode 100644 index 0000000000..6664471fc6 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/AllSatExample.html @@ -0,0 +1,317 @@ + + + + + +AllSatExample (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class AllSatExample

+
+
+ +
+
    +
  • +
    +
    public class AllSatExample
+extends Object
    +
    This example shows different ways to get all satisfiable models for a given set of constraints.
    +
    • +
+
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/example/Binoxxo.BinoxxoSolver.html b/api/org/sosy_lab/java_smt/example/Binoxxo.BinoxxoSolver.html new file mode 100644 index 0000000000..bc24e742f6 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/Binoxxo.BinoxxoSolver.html @@ -0,0 +1,285 @@ + + + + + +Binoxxo.BinoxxoSolver (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class Binoxxo.BinoxxoSolver<S>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.example.Binoxxo.BinoxxoSolver<S>
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/example/Binoxxo.BooleanBasedBinoxxoSolver.html b/api/org/sosy_lab/java_smt/example/Binoxxo.BooleanBasedBinoxxoSolver.html new file mode 100644 index 0000000000..7434f2a1a8 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/Binoxxo.BooleanBasedBinoxxoSolver.html @@ -0,0 +1,285 @@ + + + + + +Binoxxo.BooleanBasedBinoxxoSolver (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class Binoxxo.BooleanBasedBinoxxoSolver

+
+
+ +
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        BooleanBasedBinoxxoSolver

        +
        public BooleanBasedBinoxxoSolver​(SolverContext context)
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/example/Binoxxo.IntegerBasedBinoxxoSolver.html b/api/org/sosy_lab/java_smt/example/Binoxxo.IntegerBasedBinoxxoSolver.html new file mode 100644 index 0000000000..c2f40a73f1 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/Binoxxo.IntegerBasedBinoxxoSolver.html @@ -0,0 +1,283 @@ + + + + + +Binoxxo.IntegerBasedBinoxxoSolver (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class Binoxxo.IntegerBasedBinoxxoSolver

+
+
+ +
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        IntegerBasedBinoxxoSolver

        +
        public IntegerBasedBinoxxoSolver​(SolverContext context)
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/example/Binoxxo.html b/api/org/sosy_lab/java_smt/example/Binoxxo.html new file mode 100644 index 0000000000..cf45e69b74 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/Binoxxo.html @@ -0,0 +1,351 @@ + + + + + +Binoxxo (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class Binoxxo

+
+
+ +
+
    +
  • +
    +
    public class Binoxxo
+extends Object
    +
    This program parses a user-given Binoxxo and solves it with an SMT solver. Binoxxo is a + grid-based Sudoku-like puzzle with values 'O' and 'X' and follows the following rules: + +
      +
    • In each column or row there are as many 'X's as 'O's. +
    • Three aligned cells must not contains an identical value. +
    + +

    The Binoxxo is read from StdIn and should be formatted as the following example: + + 

    + X..O...XX.
+ .O.O....X.
+ OO..O..X..
+ ...O....X.
+ .O........
+ .O.....O.X
+ X...X.O...
+ .X..XO...X
+ X.....OO..
+ X..X..O..O
+
    + +

    A empty newline will terminate the input and start the solving process. + +

    The solution will then be printed on StdOut, just like the following solution: + + 

    + XXOOXOOXXO
+ OOXOOXXOXX
+ OOXXOOXXOX
+ XXOOXXOOXO
+ OOXXOOXXOX
+ OOXXOXXOOX
+ XXOOXXOOXO
+ OXOOXOXXOX
+ XOXXOXOOXO
+ XXOXXOOXOO
+
    +
    • +
+
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/example/FormulaClassifier.html b/api/org/sosy_lab/java_smt/example/FormulaClassifier.html new file mode 100644 index 0000000000..a606ad8804 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/FormulaClassifier.html @@ -0,0 +1,351 @@ + + + + + +FormulaClassifier (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class FormulaClassifier

+
+
+ +
+
    +
  • +
    +
    public class FormulaClassifier
+extends Object
    +
    This program parses user-given formulas and prints out the (minimal) matching theory for them. + +

    Warning: This is a prototype and not intended for larger usage.

    +
    • +
+
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/example/HoudiniApp.html b/api/org/sosy_lab/java_smt/example/HoudiniApp.html new file mode 100644 index 0000000000..234e492593 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/HoudiniApp.html @@ -0,0 +1,356 @@ + + + + + +HoudiniApp (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class HoudiniApp

+
+
+ +
+
    +
  • +
    +
    public class HoudiniApp
+extends Object
    +
    This application executes the inductive-invariant synthesis algorithm called "Houdini" taken from + the paper Flanagan and Leino: "Houdini, an Annotation Assistant for ESC/Java". + +

    It considers a program manipulating a set X of variables, defined by an initial condition I(X) + (given as lemmas) and a transition relation T(X, X'). Both I and T are quantifier-free + first-order formulas. + +

    A lemma F is called inductive with respect to T if it implies itself over the primed variables + after the transition: FORALL X, X' . IMPLIES( AND( F(X), T(X, X') ), F(X')) i.e. in other words, + the formula AND( F(X), T(X, X'), NOT(F(X')) ) is unsatisfiable. + +

    The Houdini algorithm finds and returns a maximal inductive subset L_I of a given set L of + candidate lemmas. It repeatedly checks the conjunction of L for inductiveness and updates L to + exclude the lemmas that give rise to counterexamples-to-induction.

    +
    • +
+
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/example/Interpolation.html b/api/org/sosy_lab/java_smt/example/Interpolation.html new file mode 100644 index 0000000000..9804e2fa73 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/Interpolation.html @@ -0,0 +1,275 @@ + + + + + +Interpolation (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class Interpolation

+
+
+ +
+
    +
  • +
    +
    public class Interpolation
+extends Object
    +
    Examples for Craig/sequential/tree interpolation.
    +
    • +
+
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/example/NQueens.html b/api/org/sosy_lab/java_smt/example/NQueens.html new file mode 100644 index 0000000000..ee7537a619 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/NQueens.html @@ -0,0 +1,284 @@ + + + + + +NQueens (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class NQueens

+
+
+ +
+
    +
  • +
    +
    public class NQueens
+extends Object
    +
    This example program solves a NQueens problem of given size and prints a possible solution. + +

    For example, the Queen can be placed in these ways for a field size of 4: + + 

    +   .Q..
+   ...Q
+   Q...
+   ..Q.
+
    +
    • +
+
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/example/OptimizationFormulaWeights.html b/api/org/sosy_lab/java_smt/example/OptimizationFormulaWeights.html new file mode 100644 index 0000000000..e2a3cab60b --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/OptimizationFormulaWeights.html @@ -0,0 +1,277 @@ + + + + + +OptimizationFormulaWeights (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class OptimizationFormulaWeights

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.example.OptimizationFormulaWeights
      • +
    +
    • +
+
+
    +
  • +
    +
    public class OptimizationFormulaWeights
+extends Object
    +
    Example for optimizing the weight of some constraints. For a given set of formulas, the weight of + the satisfied formulas should be maximal and the weight of unsatisfied formulas should be + minimal.
    +
    • +
+
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/example/OptimizationIntReal.html b/api/org/sosy_lab/java_smt/example/OptimizationIntReal.html new file mode 100644 index 0000000000..8a8d2ac4b1 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/OptimizationIntReal.html @@ -0,0 +1,276 @@ + + + + + +OptimizationIntReal (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class OptimizationIntReal

+
+
+ +
+
    +
  • +
    +
    public class OptimizationIntReal
+extends Object
    +
    Example for optimizing 'x' with the constraint '0 <= x < 10'. We show the difference + between optimizing in integer and rational logic.
    +
    • +
+
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/example/PrettyPrinter.html b/api/org/sosy_lab/java_smt/example/PrettyPrinter.html new file mode 100644 index 0000000000..af785f4e35 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/PrettyPrinter.html @@ -0,0 +1,277 @@ + + + + + +PrettyPrinter (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class PrettyPrinter

+
+
+ +
+
    +
  • +
    +
    public class PrettyPrinter
+extends Object
    +
    This program parses user-given formulas and prints them in a pretty format.
    +
    • +
+
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/example/SimpleUserPropagator.html b/api/org/sosy_lab/java_smt/example/SimpleUserPropagator.html new file mode 100644 index 0000000000..c63d57a7b6 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/SimpleUserPropagator.html @@ -0,0 +1,275 @@ + + + + + +SimpleUserPropagator (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class SimpleUserPropagator

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.example.SimpleUserPropagator
      • +
    +
    • +
+
+
    +
  • +
    +
    public class SimpleUserPropagator
+extends Object
    +
    Example of a simple user propagator that prohibits variables/expressions to be set to true.
    +
    • +
+
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/example/SolverOverviewTable.RowBuilder.html b/api/org/sosy_lab/java_smt/example/SolverOverviewTable.RowBuilder.html new file mode 100644 index 0000000000..9f89121d4c --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/SolverOverviewTable.RowBuilder.html @@ -0,0 +1,338 @@ + + + + + +SolverOverviewTable.RowBuilder (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class SolverOverviewTable.RowBuilder

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.example.SolverOverviewTable.RowBuilder
      • +
    +
    • +
+
+
    +
  • +
    +
    Enclosing class:
    +
    SolverOverviewTable
    +
    +
    +
    public static class SolverOverviewTable.RowBuilder
+extends Object
    +
    This class builds the table row-by-row.
    +
    • +
+
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        RowBuilder

        +
        public RowBuilder()
        +
        The constructor builds the header of the table.
        +
        • +
      +
      • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        addSolver

        +
        public void addSolver​(SolverOverviewTable.SolverInfo solverInfo)
        +
        Takes a SolverInfo object and splits it into multiple lines which are added to the row.
        +
        +
        Parameters:
        +
        solverInfo - the solver with information you want added.
        +
        +
        • +
      + + + + +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/example/SolverOverviewTable.SolverInfo.html b/api/org/sosy_lab/java_smt/example/SolverOverviewTable.SolverInfo.html new file mode 100644 index 0000000000..1a4644ccbd --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/SolverOverviewTable.SolverInfo.html @@ -0,0 +1,312 @@ + + + + + +SolverOverviewTable.SolverInfo (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class SolverOverviewTable.SolverInfo

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.example.SolverOverviewTable.SolverInfo
      • +
    +
    • +
+
+
    +
  • +
    +
    Enclosing class:
    +
    SolverOverviewTable
    +
    +
    +
    public static class SolverOverviewTable.SolverInfo
+extends Object
    +
    just a wrapper for some data.
    +
    • +
+
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        getName

        +
        public String getName()
        +
        • +
      + + + +
        +
      • +

        getVersion

        +
        public String getVersion()
        +
        • +
      + + + +
        +
      • +

        getTheories

        +
        public String getTheories()
        +
        • +
      + + + +
        +
      • +

        getFeatures

        +
        public String getFeatures()
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/example/SolverOverviewTable.html b/api/org/sosy_lab/java_smt/example/SolverOverviewTable.html new file mode 100644 index 0000000000..0ddeca53a9 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/SolverOverviewTable.html @@ -0,0 +1,374 @@ + + + + + +SolverOverviewTable (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class SolverOverviewTable

+
+
+ +
+
    +
  • +
    +
    public class SolverOverviewTable
+extends Object
    +
    This program takes all installed solvers and checks them for version, theories and features and + prints them to StdOut in a nice table.
    +
    • +
+
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/example/Sudoku.BooleanBasedSudokuSolver.html b/api/org/sosy_lab/java_smt/example/Sudoku.BooleanBasedSudokuSolver.html new file mode 100644 index 0000000000..9e479b5424 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/Sudoku.BooleanBasedSudokuSolver.html @@ -0,0 +1,283 @@ + + + + + +Sudoku.BooleanBasedSudokuSolver (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class Sudoku.BooleanBasedSudokuSolver

+
+
+ +
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        BooleanBasedSudokuSolver

        +
        public BooleanBasedSudokuSolver​(SolverContext context)
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/example/Sudoku.EnumerationBasedSudokuSolver.html b/api/org/sosy_lab/java_smt/example/Sudoku.EnumerationBasedSudokuSolver.html new file mode 100644 index 0000000000..ce4644e198 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/Sudoku.EnumerationBasedSudokuSolver.html @@ -0,0 +1,283 @@ + + + + + +Sudoku.EnumerationBasedSudokuSolver (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class Sudoku.EnumerationBasedSudokuSolver

+
+
+ +
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        EnumerationBasedSudokuSolver

        +
        public EnumerationBasedSudokuSolver​(SolverContext context)
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/example/Sudoku.IntegerBasedSudokuSolver.html b/api/org/sosy_lab/java_smt/example/Sudoku.IntegerBasedSudokuSolver.html new file mode 100644 index 0000000000..8db2bf843d --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/Sudoku.IntegerBasedSudokuSolver.html @@ -0,0 +1,283 @@ + + + + + +Sudoku.IntegerBasedSudokuSolver (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class Sudoku.IntegerBasedSudokuSolver

+
+
+ +
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        IntegerBasedSudokuSolver

        +
        public IntegerBasedSudokuSolver​(SolverContext context)
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/example/Sudoku.SudokuSolver.html b/api/org/sosy_lab/java_smt/example/Sudoku.SudokuSolver.html new file mode 100644 index 0000000000..716dee28c2 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/Sudoku.SudokuSolver.html @@ -0,0 +1,285 @@ + + + + + +Sudoku.SudokuSolver (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class Sudoku.SudokuSolver<S>

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.example.Sudoku.SudokuSolver<S>
      • +
    +
    • +
+
+ +
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/example/Sudoku.html b/api/org/sosy_lab/java_smt/example/Sudoku.html new file mode 100644 index 0000000000..21ea7e737c --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/Sudoku.html @@ -0,0 +1,408 @@ + + + + + +Sudoku (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example
+

Class Sudoku

+
+
+ +
+
    +
  • +
    +
    public class Sudoku
+extends Object
    +
    This program parses user-given Sudoku and solves it with an SMT solver. + +

    This program is just an example and provides several distinct strategies for encoding the + Sudoku problem as SMT. Clearly SMT is not the best solution for solving Sudoku. There might be + other algorithms out there that are specialized and better suited for solving Sudoku. + +

    Our strategies: + +

      +
    • Integer-based: We encode all values as integer formulas for a range from 1 to 9. Straight + forward, simple to understand, but slow. +
    • Enumeration-based: We encode all values as enumeration formulas for enumeration values from + ONE to NINE. Reasonable fast (up to 10x faster than integer-based strategy). +
    • Boolean-based: We use one more dimension to encode values for the 2D-grid and a + one-hot-encoding. Fastest SMT-based solution, because it is purely based on SAT, and no + additional SMT theory is applied. +
    + +

    The more numbers are available in a Sudoku, the easier it can be solved. A completely empty + Sudoku will cause the longest runtime in the solver, because it will guess a lot of values. + +

    The Sudoku is read from StdIn and should be formatted as the following example: + + 

    + 2..9.6..1
+ ..6.4...9
+ ...52.4..
+ 3.2..7.5.
+ ...2..1..
+ .9.3..7..
+ .87.5.31.
+ 6.3.1.8..
+ 4....9...
+
    + +

    The solution will then be printed on StdOut, just like the following solution: + + 

    + 248976531
+ 536148279
+ 179523468
+ 312487956
+ 764295183
+ 895361742
+ 987652314
+ 623714895
+ 451839627
+
    +
    • +
+
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/example/nqueens_user_propagator/NQueens.html b/api/org/sosy_lab/java_smt/example/nqueens_user_propagator/NQueens.html new file mode 100644 index 0000000000..b61bd02684 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/nqueens_user_propagator/NQueens.html @@ -0,0 +1,326 @@ + + + + + +NQueens (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example.nqueens_user_propagator
+

Class NQueens

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • org.sosy_lab.java_smt.example.nqueens_user_propagator.NQueens
      • +
    +
    • +
+
+
    +
  • +
    +
    public class NQueens
+extends Object
    +
    This example program solves a NQueens problem of given size and prints a possible solution. + +

    For example, the Queen can be placed in these ways for a field size of 4: + + 

    +   .Q..
+   ...Q
+   Q...
+   ..Q.
+
    +
    • +
+
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/example/nqueens_user_propagator/NQueensConstraintPropagator.html b/api/org/sosy_lab/java_smt/example/nqueens_user_propagator/NQueensConstraintPropagator.html new file mode 100644 index 0000000000..2027956205 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/nqueens_user_propagator/NQueensConstraintPropagator.html @@ -0,0 +1,375 @@ + + + + + +NQueensConstraintPropagator (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example.nqueens_user_propagator
+

Class NQueensConstraintPropagator

+
+
+ +
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/example/nqueens_user_propagator/NQueensEnumeratingPropagator.html b/api/org/sosy_lab/java_smt/example/nqueens_user_propagator/NQueensEnumeratingPropagator.html new file mode 100644 index 0000000000..d994ae1671 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/nqueens_user_propagator/NQueensEnumeratingPropagator.html @@ -0,0 +1,561 @@ + + + + + +NQueensEnumeratingPropagator (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.example.nqueens_user_propagator
+

Class NQueensEnumeratingPropagator

+
+
+ +
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    UserPropagator
    +
    +
    +
    Direct Known Subclasses:
    +
    NQueensConstraintPropagator
    +
    +
    +
    public class NQueensEnumeratingPropagator
+extends AbstractUserPropagator
    +
    This propagator enumerates the solutions of the NQueens problem by raising a conflict whenever + the solver finds a model.
    +
    • +
+
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/example/nqueens_user_propagator/package-summary.html b/api/org/sosy_lab/java_smt/example/nqueens_user_propagator/package-summary.html new file mode 100644 index 0000000000..3a9472a961 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/nqueens_user_propagator/package-summary.html @@ -0,0 +1,186 @@ + + + + + +org.sosy_lab.java_smt.example.nqueens_user_propagator (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Package org.sosy_lab.java_smt.example.nqueens_user_propagator

+
+
+
+ + +
Some basic examples for using Java-SMT.
+
+
    +
  • + + + + + + + + + + + + + + + + + + + + +
    Class Summary 
    ClassDescription
    NQueens +
    This example program solves a NQueens problem of given size and prints a possible solution.
    +
    NQueensConstraintPropagator +
    In addition to the enumeration done by NQueensEnumeratingPropagator, this propagator also + enforces the queen placement constraints without explicit encoding.
    +
    NQueensEnumeratingPropagator +
    This propagator enumerates the solutions of the NQueens problem by raising a conflict whenever + the solver finds a model.
    +
    +
    • +
+
+
+
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/example/nqueens_user_propagator/package-tree.html b/api/org/sosy_lab/java_smt/example/nqueens_user_propagator/package-tree.html new file mode 100644 index 0000000000..845b731758 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/nqueens_user_propagator/package-tree.html @@ -0,0 +1,171 @@ + + + + + +org.sosy_lab.java_smt.example.nqueens_user_propagator Class Hierarchy (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Hierarchy For Package org.sosy_lab.java_smt.example.nqueens_user_propagator

+Package Hierarchies: + +
+
+
+

Class Hierarchy

+ +
+
+
+ + + diff --git a/api/org/sosy_lab/java_smt/example/package-summary.html b/api/org/sosy_lab/java_smt/example/package-summary.html new file mode 100644 index 0000000000..03dd257f34 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/package-summary.html @@ -0,0 +1,283 @@ + + + + + +org.sosy_lab.java_smt.example (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Package org.sosy_lab.java_smt.example

+
+
+
+ + +
Some basic examples for using Java-SMT.
+
+ +
+
+
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/example/package-tree.html b/api/org/sosy_lab/java_smt/example/package-tree.html new file mode 100644 index 0000000000..e8ffd593d0 --- /dev/null +++ b/api/org/sosy_lab/java_smt/example/package-tree.html @@ -0,0 +1,188 @@ + + + + + +org.sosy_lab.java_smt.example Class Hierarchy (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Hierarchy For Package org.sosy_lab.java_smt.example

+Package Hierarchies: + +
+
+
+

Class Hierarchy

+ +
+
+
+ + + diff --git a/api/org/sosy_lab/java_smt/package-summary.html b/api/org/sosy_lab/java_smt/package-summary.html new file mode 100644 index 0000000000..5b724ebb2d --- /dev/null +++ b/api/org/sosy_lab/java_smt/package-summary.html @@ -0,0 +1,198 @@ + + + + + +org.sosy_lab.java_smt (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

@CheckReturnValue +@ParametersAreNonnullByDefault +@FieldsAreNonnullByDefault +@ReturnValuesAreNonnullByDefault +

+

Package org.sosy_lab.java_smt

+
+
+
+ + +
JavaSMT: a generic SMT solver API. + +

SolverContextFactory is a package entry point, which creates a + SolverContext object. All operations on formulas are performed + using managers, available through the context object. + +

All interfaces which form the public API are located in the API package.

+
+ +
+
+
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/package-tree.html b/api/org/sosy_lab/java_smt/package-tree.html new file mode 100644 index 0000000000..cbd635a368 --- /dev/null +++ b/api/org/sosy_lab/java_smt/package-tree.html @@ -0,0 +1,176 @@ + + + + + +org.sosy_lab.java_smt Class Hierarchy (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Hierarchy For Package org.sosy_lab.java_smt

+Package Hierarchies: + +
+
+
+

Class Hierarchy

+ +
+
+

Enum Hierarchy

+ +
+
+
+ + + diff --git a/api/org/sosy_lab/java_smt/test/BooleanFormulaSubject.html b/api/org/sosy_lab/java_smt/test/BooleanFormulaSubject.html new file mode 100644 index 0000000000..f25e56e1d8 --- /dev/null +++ b/api/org/sosy_lab/java_smt/test/BooleanFormulaSubject.html @@ -0,0 +1,470 @@ + + + + + +BooleanFormulaSubject (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.test
+

Class BooleanFormulaSubject

+
+
+ +
+ +
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/test/ProverEnvironmentSubject.html b/api/org/sosy_lab/java_smt/test/ProverEnvironmentSubject.html new file mode 100644 index 0000000000..8fca431853 --- /dev/null +++ b/api/org/sosy_lab/java_smt/test/ProverEnvironmentSubject.html @@ -0,0 +1,372 @@ + + + + + +ProverEnvironmentSubject (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.test
+

Class ProverEnvironmentSubject

+
+
+ +
+ +
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/test/SolverBasedTest0.ParameterizedSolverBasedTest0.html b/api/org/sosy_lab/java_smt/test/SolverBasedTest0.ParameterizedSolverBasedTest0.html new file mode 100644 index 0000000000..fc46c15a57 --- /dev/null +++ b/api/org/sosy_lab/java_smt/test/SolverBasedTest0.ParameterizedSolverBasedTest0.html @@ -0,0 +1,414 @@ + + + + + +SolverBasedTest0.ParameterizedSolverBasedTest0 (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.test
+

Class SolverBasedTest0.ParameterizedSolverBasedTest0

+
+
+ +
+ +
+
+ +
+
+
    +
  • + +
    + +
    + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        ParameterizedSolverBasedTest0

        +
        public ParameterizedSolverBasedTest0()
        +
        • +
      +
      • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        getAllSolvers

        +
        public static Object[] getAllSolvers()
        +
        • +
      + + + + +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/test/SolverBasedTest0.html b/api/org/sosy_lab/java_smt/test/SolverBasedTest0.html new file mode 100644 index 0000000000..2335914840 --- /dev/null +++ b/api/org/sosy_lab/java_smt/test/SolverBasedTest0.html @@ -0,0 +1,1065 @@ + + + + + +SolverBasedTest0 (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.test
+

Class SolverBasedTest0

+
+
+ +
+
    +
  • +
    +
    Direct Known Subclasses:
    +
    SolverBasedTest0.ParameterizedSolverBasedTest0
    +
    +
    +
    public abstract class SolverBasedTest0
+extends Object
    +
    Abstract base class with helpful utilities for writing tests that use an SMT solver. It + instantiates and closes the SMT solver before and after each test, and provides fields with + direct access to the most relevant instances. + +

    To run the tests using all available solvers, add the following code to your class: + + 

    + 
+  @Parameters(name="{0}")
+  public static List<Object[]> getAllSolvers() {
+    return allSolversAsParameters();
+  }
+
+  @Parameter(0)
+  public Solvers solver;
+
+  @Override
+  protected Solvers solverToUse() {
+    return solver;
+  }
+ 
+
    + + assertThatFormula(BooleanFormula) can be used to easily write assertions about formulas + using Truth. + +

    Test that rely on a theory that not all solvers support should call one of the require + methods at the beginning.

    +
    • +
+
+
+ +
+
+
    +
  • + +
    + +
    + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        SolverBasedTest0

        +
        public SolverBasedTest0()
        +
        • +
      +
      • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        shutdownNotifierToUse

        +
        protected ShutdownNotifier shutdownNotifierToUse()
        +
        • +
      + + + +
        +
      • +

        solverToUse

        +
        protected SolverContextFactory.Solvers solverToUse()
        +
        Return the solver to use in this test. The default is SMTInterpol because it's the only solver + guaranteed on all platforms. Overwrite to specify a different solver.
        +
        • +
      + + + +
        +
      • +

        logicToUse

        +
        protected org.sosy_lab.java_smt.solvers.opensmt.Logics logicToUse()
        +
        This method is only called, if OpenSMT is called. OpenSMT needs to know the logic upfront.
        +
        • +
      + + + + + + + + + + + +
        +
      • +

        closeSolver

        +
        public final void closeSolver()
        +
        • +
      + + + +
        +
      • +

        requireIntegers

        +
        protected final void requireIntegers()
        +
        Skip test if the solver does not support integers.
        +
        • +
      + + + +
        +
      • +

        requireRationals

        +
        protected final void requireRationals()
        +
        Skip test if the solver does not support rationals.
        +
        • +
      + + + +
        +
      • +

        requireRationalFloor

        +
        protected final void requireRationalFloor()
        +
        • +
      + + + +
        +
      • +

        requireBitvectors

        +
        protected final void requireBitvectors()
        +
        Skip test if the solver does not support bitvectors.
        +
        • +
      + + + +
        +
      • +

        requireBitvectorToInt

        +
        protected final void requireBitvectorToInt()
        +
        • +
      + + + +
        +
      • +

        requireQuantifiers

        +
        protected final void requireQuantifiers()
        +
        Skip test if the solver does not support quantifiers.
        +
        • +
      + + + +
        +
      • +

        requireArrays

        +
        protected void requireArrays()
        +
        Skip test if the solver does not support arrays.
        +
        • +
      + + + +
        +
      • +

        requireFloats

        +
        protected final void requireFloats()
        +
        • +
      + + + +
        +
      • +

        requireStrings

        +
        protected final void requireStrings()
        +
        Skip test if the solver does not support strings.
        +
        • +
      + + + +
        +
      • +

        requireEnumeration

        +
        protected final void requireEnumeration()
        +
        Skip test if the solver does not support enumeration theory.
        +
        • +
      + + + +
        +
      • +

        requireOptimization

        +
        protected final void requireOptimization()
        +
        Skip test if the solver does not support optimization.
        +
        • +
      + + + +
        +
      • +

        requireInterpolation

        +
        protected final void requireInterpolation()
        +
        • +
      + + + +
        +
      • +

        requireParser

        +
        protected void requireParser()
        +
        • +
      + + + +
        +
      • +

        requireArrayModel

        +
        protected void requireArrayModel()
        +
        • +
      + + + +
        +
      • +

        requireModel

        +
        protected void requireModel()
        +
        • +
      + + + +
        +
      • +

        requireVisitor

        +
        protected void requireVisitor()
        +
        • +
      + + + +
        +
      • +

        requireUnsatCore

        +
        protected void requireUnsatCore()
        +
        • +
      + + + +
        +
      • +

        requireUnsatCoreOverAssumptions

        +
        protected void requireUnsatCoreOverAssumptions()
        +
        • +
      + + + +
        +
      • +

        requireSubstitution

        +
        protected void requireSubstitution()
        +
        • +
      + + + +
        +
      • +

        requireUserPropagators

        +
        protected void requireUserPropagators()
        +
        • +
      + + + +
        +
      • +

        assertThatFormula

        +
        protected final BooleanFormulaSubject assertThatFormula​(BooleanFormula formula)
        +
        Use this for checking assertions about BooleanFormulas with Truth: + assertThatFormula(formula).is...().
        +
        • +
      + + + + + + + + +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/test/SolverStackTest0.html b/api/org/sosy_lab/java_smt/test/SolverStackTest0.html new file mode 100644 index 0000000000..244bd89bcc --- /dev/null +++ b/api/org/sosy_lab/java_smt/test/SolverStackTest0.html @@ -0,0 +1,1003 @@ + + + + + +SolverStackTest0 (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.test
+

Class SolverStackTest0

+
+
+ +
+ +
+
+ +
+
+ +
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/test/package-summary.html b/api/org/sosy_lab/java_smt/test/package-summary.html new file mode 100644 index 0000000000..5ee98ed6e1 --- /dev/null +++ b/api/org/sosy_lab/java_smt/test/package-summary.html @@ -0,0 +1,198 @@ + + + + + +org.sosy_lab.java_smt.test (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

@CheckReturnValue +@ParametersAreNonnullByDefault +@ReturnValuesAreNonnullByDefault +

+

Package org.sosy_lab.java_smt.test

+
+
+
+ + +
Solver-independent tests and test utilities for the solver API.
+
+ +
+
+
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/test/package-tree.html b/api/org/sosy_lab/java_smt/test/package-tree.html new file mode 100644 index 0000000000..437bfa353d --- /dev/null +++ b/api/org/sosy_lab/java_smt/test/package-tree.html @@ -0,0 +1,176 @@ + + + + + +org.sosy_lab.java_smt.test Class Hierarchy (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Hierarchy For Package org.sosy_lab.java_smt.test

+Package Hierarchies: + +
+
+
+

Class Hierarchy

+ +
+
+
+ + + diff --git a/api/org/sosy_lab/java_smt/utils/PrettyPrinter.PrinterOption.html b/api/org/sosy_lab/java_smt/utils/PrettyPrinter.PrinterOption.html new file mode 100644 index 0000000000..debde0b4c6 --- /dev/null +++ b/api/org/sosy_lab/java_smt/utils/PrettyPrinter.PrinterOption.html @@ -0,0 +1,371 @@ + + + + + +PrettyPrinter.PrinterOption (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.utils
+

Enum PrettyPrinter.PrinterOption

+
+
+ +
+ +
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Enum Constant Detail

      + + + +
        +
      • +

        SPLIT_ONLY_BOOLEAN_OPERATIONS

        +
        public static final PrettyPrinter.PrinterOption SPLIT_ONLY_BOOLEAN_OPERATIONS
        +
        introduce newlines only for boolean operations, instead of for all operations.
        +
        • +
      +
      • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        values

        +
        public static PrettyPrinter.PrinterOption[] values()
        +
        Returns an array containing the constants of this enum type, in +the order they are declared. This method may be used to iterate +over the constants as follows: +
        +for (PrettyPrinter.PrinterOption c : PrettyPrinter.PrinterOption.values())
+    System.out.println(c);
+
        +
        +
        Returns:
        +
        an array containing the constants of this enum type, in the order they are declared
        +
        +
        • +
      + + + +
        +
      • +

        valueOf

        +
        public static PrettyPrinter.PrinterOption valueOf​(String name)
        +
        Returns the enum constant of this type with the specified name. +The string must match exactly an identifier used to declare an +enum constant in this type. (Extraneous whitespace characters are +not permitted.)
        +
        +
        Parameters:
        +
        name - the name of the enum constant to be returned.
        +
        Returns:
        +
        the enum constant with the specified name
        +
        Throws:
        +
        IllegalArgumentException - if this enum type has no constant with the specified name
        +
        NullPointerException - if the argument is null
        +
        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/utils/PrettyPrinter.html b/api/org/sosy_lab/java_smt/utils/PrettyPrinter.html new file mode 100644 index 0000000000..dc262934b3 --- /dev/null +++ b/api/org/sosy_lab/java_smt/utils/PrettyPrinter.html @@ -0,0 +1,366 @@ + + + + + +PrettyPrinter (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.utils
+

Class PrettyPrinter

+
+
+ +
+
    +
  • +
    +
    public class PrettyPrinter
+extends Object
    +
    • +
+
+
+ +
+
+
    +
  • + +
    + +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        formulaToString

        +
        public String formulaToString​(Formula f,
+                              PrettyPrinter.PrinterOption... options)
        +
        This method returns a multi-line String with pretty-formatted and indented subformulas. + +

        The String representation might contain solver-specific symbols that appear during a + visitation of the formula. The returned String is intended to be human-readable and should not + be used for further processing. The formatting of this string might change with future + development and thus is not considered as "stable". If a user wants to apply further + processing, we refer to FormulaManager.dumpFormula(org.sosy_lab.java_smt.api.BooleanFormula) that provides machine-readable + SMTLIB2.

        +
        • +
      + + + +
        +
      • +

        formulaToDot

        +
        public String formulaToDot​(Formula f,
+                           PrettyPrinter.PrinterOption... options)
        +
        This method returns a Graphviz/Dot representation of the given formula. + +

        The graph representation might contain solver-specific symbols that appear during a + visitation of the formula. The returned String is intended to be a human-readable graph for + Graphviz/Dot and should not be used for further processing. The formatting of this string might + change with future development and thus is not considered as "stable". If a user wants to apply + further processing, we refer to FormulaManager.dumpFormula(org.sosy_lab.java_smt.api.BooleanFormula) that provides + machine-readable SMTLIB2.

        +
        • +
      +
      • +
    +
    +
    • +
+
+
+
+ + + + diff --git a/api/org/sosy_lab/java_smt/utils/SolverUtils.html b/api/org/sosy_lab/java_smt/utils/SolverUtils.html new file mode 100644 index 0000000000..a44755472b --- /dev/null +++ b/api/org/sosy_lab/java_smt/utils/SolverUtils.html @@ -0,0 +1,298 @@ + + + + + +SolverUtils (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.utils
+

Class SolverUtils

+
+
+ +
+
    +
  • +
    +
    public final class SolverUtils
+extends Object
    +
    Central entry point for all utility classes.
    +
    • +
+
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/utils/UfElimination.Result.html b/api/org/sosy_lab/java_smt/utils/UfElimination.Result.html new file mode 100644 index 0000000000..8443548a72 --- /dev/null +++ b/api/org/sosy_lab/java_smt/utils/UfElimination.Result.html @@ -0,0 +1,323 @@ + + + + + +UfElimination.Result (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.utils
+

Class UfElimination.Result

+
+
+ +
+
    +
  • +
    +
    Enclosing class:
    +
    UfElimination
    +
    +
    +
    public static class UfElimination.Result
+extends Object
    +
    • +
+
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/utils/UfElimination.html b/api/org/sosy_lab/java_smt/utils/UfElimination.html new file mode 100644 index 0000000000..40484cf27a --- /dev/null +++ b/api/org/sosy_lab/java_smt/utils/UfElimination.html @@ -0,0 +1,326 @@ + + + + + +UfElimination (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+ +
+
+
Package org.sosy_lab.java_smt.utils
+

Class UfElimination

+
+
+ +
+
    +
  • +
    +
    public class UfElimination
+extends Object
    +
    UfElimination replaces UFs by fresh variables and adds constraints to enforce the functional + consistency.
    +
    • +
+
+
+ +
+
+ +
+
+
+ +
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/utils/package-summary.html b/api/org/sosy_lab/java_smt/utils/package-summary.html new file mode 100644 index 0000000000..0fb1d0b2f0 --- /dev/null +++ b/api/org/sosy_lab/java_smt/utils/package-summary.html @@ -0,0 +1,207 @@ + + + + + +org.sosy_lab.java_smt.utils (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

@CheckReturnValue +@ParametersAreNonnullByDefault +@FieldsAreNonnullByDefault +@ReturnValuesAreNonnullByDefault +

+

Package org.sosy_lab.java_smt.utils

+
+
+
+ + +
Utility classes implementing algorithms based on the API of JavaSMT.
+
+ +
+
+
+ +
+ + diff --git a/api/org/sosy_lab/java_smt/utils/package-tree.html b/api/org/sosy_lab/java_smt/utils/package-tree.html new file mode 100644 index 0000000000..cc4d103d9e --- /dev/null +++ b/api/org/sosy_lab/java_smt/utils/package-tree.html @@ -0,0 +1,179 @@ + + + + + +org.sosy_lab.java_smt.utils Class Hierarchy (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Hierarchy For Package org.sosy_lab.java_smt.utils

+Package Hierarchies: + +
+
+
+

Class Hierarchy

+ +
+
+

Enum Hierarchy

+ +
+
+
+ + + diff --git a/api/overview-summary.html b/api/overview-summary.html new file mode 100644 index 0000000000..6f5d3575e4 --- /dev/null +++ b/api/overview-summary.html @@ -0,0 +1,23 @@ + + + + + +JavaSMT Solver Library + + + + + + + +
+ +

index.html

+
+ + diff --git a/api/overview-tree.html b/api/overview-tree.html new file mode 100644 index 0000000000..141d207232 --- /dev/null +++ b/api/overview-tree.html @@ -0,0 +1,419 @@ + + + + + +Class Hierarchy (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
+ +
+
+
+

Hierarchy For All Packages

+Package Hierarchies: + +
+
+
+

Class Hierarchy

+ +
+
+

Interface Hierarchy

+ +
+
+

Enum Hierarchy

+ +
+
+
+
+ +
+ + diff --git a/api/package-search-index.js b/api/package-search-index.js new file mode 100644 index 0000000000..1bd1e7deb5 --- /dev/null +++ b/api/package-search-index.js @@ -0,0 +1 @@ +packageSearchIndex = [{"l":"All Packages","url":"allpackages-index.html"},{"l":"org.sosy_lab.java_smt"},{"l":"org.sosy_lab.java_smt.api"},{"l":"org.sosy_lab.java_smt.api.visitors"},{"l":"org.sosy_lab.java_smt.basicimpl"},{"l":"org.sosy_lab.java_smt.basicimpl.tactics"},{"l":"org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper"},{"l":"org.sosy_lab.java_smt.delegate.debugging"},{"l":"org.sosy_lab.java_smt.delegate.logging"},{"l":"org.sosy_lab.java_smt.delegate.statistics"},{"l":"org.sosy_lab.java_smt.delegate.synchronize"},{"l":"org.sosy_lab.java_smt.example"},{"l":"org.sosy_lab.java_smt.example.nqueens_user_propagator"},{"l":"org.sosy_lab.java_smt.test"},{"l":"org.sosy_lab.java_smt.utils"}] \ No newline at end of file diff --git a/api/package-search-index.zip b/api/package-search-index.zip new file mode 100644 index 0000000000000000000000000000000000000000..7f6aeddfbff469ada77e19a41b963ecca465ae5d GIT binary patch literal 359 zcmWIWW@Zs#;Nak3csWfck^u=w0@($L$=QkNsk+6fiABj7x|w+?sTF!z#rb(tCt33y zGT?Do-(=*>ci|7^YX`35b)Pk;#^05ELF~QekCjZv_ZI{POycCO z?aeNT?Q6`72>ihGm{BdrYz|k_gk>Dh)Sk{rkP**r51MkTUen7aZ+kUUfHynG*ZiAI shk^cF&cwhF;LXS+!hi@1WI0e+paPsB6X4Ct22#ohgzi9^ixI>F0H-p0CjbBd literal 0 HcmV?d00001 diff --git a/api/resources/glass.png b/api/resources/glass.png new file mode 100644 index 0000000000000000000000000000000000000000..a7f591f467a1c0c949bbc510156a0c1afb860a6e GIT binary patch literal 499 zcmVJoRsvExf%rEN>jUL}qZ_~k#FbE+Q;{`;0FZwVNX2n-^JoI; zP;4#$8DIy*Yk-P>VN(DUKmPse7mx+ExD4O|;?E5D0Z5($mjO3`*anwQU^s{ZDK#Lz zj>~{qyaIx5K!t%=G&2IJNzg!ChRpyLkO7}Ry!QaotAHAMpbB3AF(}|_f!G-oI|uK6 z`id_dumai5K%C3Y$;tKS_iqMPHg<*|-@e`liWLAggVM!zAP#@l;=c>S03;{#04Z~5 zN_+ss=Yg6*hTr59mzMwZ@+l~q!+?ft!fF66AXT#wWavHt30bZWFCK%!BNk}LN?0Hg z1VF_nfs`Lm^DjYZ1(1uD0u4CSIr)XAaqW6IT{!St5~1{i=i}zAy76p%_|w8rh@@c0Axr!ns=D-X+|*sY6!@wacG9%)Qn*O zl0sa739kT-&_?#oVxXF6tOnqTD)cZ}2vi$`ZU8RLAlo8=_z#*P3xI~i!lEh+Pdu-L zx{d*wgjtXbnGX_Yf@Tc7Q3YhLhPvc8noGJs2DA~1DySiA&6V{5JzFt ojAY1KXm~va;tU{v7C?Xj0BHw!K;2aXV*mgE07*qoM6N<$f;4TDA^-pY literal 0 HcmV?d00001 diff --git a/api/script.js b/api/script.js new file mode 100644 index 0000000000..7dc93c48e3 --- /dev/null +++ b/api/script.js @@ -0,0 +1,149 @@ +/* + * Copyright (c) 2013, 2018, Oracle and/or its affiliates. All rights reserved. + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. + * + * This code is free software; you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 2 only, as + * published by the Free Software Foundation. Oracle designates this + * particular file as subject to the "Classpath" exception as provided + * by Oracle in the LICENSE file that accompanied this code. + * + * This code is distributed in the hope that it will be useful, but WITHOUT + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License + * version 2 for more details (a copy is included in the LICENSE file that + * accompanied this code). + * + * You should have received a copy of the GNU General Public License version + * 2 along with this work; if not, write to the Free Software Foundation, + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. + * + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA + * or visit www.oracle.com if you need additional information or have any + * questions. + */ + +var moduleSearchIndex; +var packageSearchIndex; +var typeSearchIndex; +var memberSearchIndex; +var tagSearchIndex; +function loadScripts(doc, tag) { + createElem(doc, tag, 'jquery/jszip/dist/jszip.js'); + createElem(doc, tag, 'jquery/jszip-utils/dist/jszip-utils.js'); + if (window.navigator.userAgent.indexOf('MSIE ') > 0 || window.navigator.userAgent.indexOf('Trident/') > 0 || + window.navigator.userAgent.indexOf('Edge/') > 0) { + createElem(doc, tag, 'jquery/jszip-utils/dist/jszip-utils-ie.js'); + } + createElem(doc, tag, 'search.js'); + + $.get(pathtoroot + "module-search-index.zip") + .done(function() { + JSZipUtils.getBinaryContent(pathtoroot + "module-search-index.zip", function(e, data) { + JSZip.loadAsync(data).then(function(zip){ + zip.file("module-search-index.json").async("text").then(function(content){ + moduleSearchIndex = JSON.parse(content); + }); + }); + }); + }); + $.get(pathtoroot + "package-search-index.zip") + .done(function() { + JSZipUtils.getBinaryContent(pathtoroot + "package-search-index.zip", function(e, data) { + JSZip.loadAsync(data).then(function(zip){ + zip.file("package-search-index.json").async("text").then(function(content){ + packageSearchIndex = JSON.parse(content); + }); + }); + }); + }); + $.get(pathtoroot + "type-search-index.zip") + .done(function() { + JSZipUtils.getBinaryContent(pathtoroot + "type-search-index.zip", function(e, data) { + JSZip.loadAsync(data).then(function(zip){ + zip.file("type-search-index.json").async("text").then(function(content){ + typeSearchIndex = JSON.parse(content); + }); + }); + }); + }); + $.get(pathtoroot + "member-search-index.zip") + .done(function() { + JSZipUtils.getBinaryContent(pathtoroot + "member-search-index.zip", function(e, data) { + JSZip.loadAsync(data).then(function(zip){ + zip.file("member-search-index.json").async("text").then(function(content){ + memberSearchIndex = JSON.parse(content); + }); + }); + }); + }); + $.get(pathtoroot + "tag-search-index.zip") + .done(function() { + JSZipUtils.getBinaryContent(pathtoroot + "tag-search-index.zip", function(e, data) { + JSZip.loadAsync(data).then(function(zip){ + zip.file("tag-search-index.json").async("text").then(function(content){ + tagSearchIndex = JSON.parse(content); + }); + }); + }); + }); + if (!moduleSearchIndex) { + createElem(doc, tag, 'module-search-index.js'); + } + if (!packageSearchIndex) { + createElem(doc, tag, 'package-search-index.js'); + } + if (!typeSearchIndex) { + createElem(doc, tag, 'type-search-index.js'); + } + if (!memberSearchIndex) { + createElem(doc, tag, 'member-search-index.js'); + } + if (!tagSearchIndex) { + createElem(doc, tag, 'tag-search-index.js'); + } + $(window).resize(function() { + $('.navPadding').css('padding-top', $('.fixedNav').css("height")); + }); +} + +function createElem(doc, tag, path) { + var script = doc.createElement(tag); + var scriptElement = doc.getElementsByTagName(tag)[0]; + script.src = pathtoroot + path; + scriptElement.parentNode.insertBefore(script, scriptElement); +} + +function show(type) { + count = 0; + for (var key in data) { + var row = document.getElementById(key); + if ((data[key] & type) !== 0) { + row.style.display = ''; + row.className = (count++ % 2) ? rowColor : altColor; + } + else + row.style.display = 'none'; + } + updateTabs(type); +} + +function updateTabs(type) { + for (var value in tabs) { + var sNode = document.getElementById(tabs[value][0]); + var spanNode = sNode.firstChild; + if (value == type) { + sNode.className = activeTableTab; + spanNode.innerHTML = tabs[value][1]; + } + else { + sNode.className = tableTab; + spanNode.innerHTML = "" + tabs[value][1] + ""; + } + } +} + +function updateModuleFrame(pFrame, cFrame) { + top.packageFrame.location = pFrame; + top.classFrame.location = cFrame; +} diff --git a/api/search.js b/api/search.js new file mode 100644 index 0000000000..8492271e71 --- /dev/null +++ b/api/search.js @@ -0,0 +1,326 @@ +/* + * Copyright (c) 2015, 2018, Oracle and/or its affiliates. All rights reserved. + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. + * + * This code is free software; you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 2 only, as + * published by the Free Software Foundation. Oracle designates this + * particular file as subject to the "Classpath" exception as provided + * by Oracle in the LICENSE file that accompanied this code. + * + * This code is distributed in the hope that it will be useful, but WITHOUT + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License + * version 2 for more details (a copy is included in the LICENSE file that + * accompanied this code). + * + * You should have received a copy of the GNU General Public License version + * 2 along with this work; if not, write to the Free Software Foundation, + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. + * + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA + * or visit www.oracle.com if you need additional information or have any + * questions. + */ + +var noResult = {l: "No results found"}; +var catModules = "Modules"; +var catPackages = "Packages"; +var catTypes = "Types"; +var catMembers = "Members"; +var catSearchTags = "SearchTags"; +var highlight = "$&"; +var camelCaseRegexp = ""; +var secondaryMatcher = ""; +function getHighlightedText(item) { + var ccMatcher = new RegExp(camelCaseRegexp); + var label = item.replace(ccMatcher, highlight); + if (label === item) { + label = item.replace(secondaryMatcher, highlight); + } + return label; +} +function getURLPrefix(ui) { + var urlPrefix=""; + if (useModuleDirectories) { + var slash = "/"; + if (ui.item.category === catModules) { + return ui.item.l + slash; + } else if (ui.item.category === catPackages && ui.item.m) { + return ui.item.m + slash; + } else if ((ui.item.category === catTypes && ui.item.p) || ui.item.category === catMembers) { + $.each(packageSearchIndex, function(index, item) { + if (item.m && ui.item.p == item.l) { + urlPrefix = item.m + slash; + } + }); + return urlPrefix; + } else { + return urlPrefix; + } + } + return urlPrefix; +} +var watermark = 'Search'; +$(function() { + $("#search").val(''); + $("#search").prop("disabled", false); + $("#reset").prop("disabled", false); + $("#search").val(watermark).addClass('watermark'); + $("#search").blur(function() { + if ($(this).val().length == 0) { + $(this).val(watermark).addClass('watermark'); + } + }); + $("#search").on('click keydown', function() { + if ($(this).val() == watermark) { + $(this).val('').removeClass('watermark'); + } + }); + $("#reset").click(function() { + $("#search").val(''); + $("#search").focus(); + }); + $("#search").focus(); + $("#search")[0].setSelectionRange(0, 0); +}); +$.widget("custom.catcomplete", $.ui.autocomplete, { + _create: function() { + this._super(); + this.widget().menu("option", "items", "> :not(.ui-autocomplete-category)"); + }, + _renderMenu: function(ul, items) { + var rMenu = this, + currentCategory = ""; + rMenu.menu.bindings = $(); + $.each(items, function(index, item) { + var li; + if (item.l !== noResult.l && item.category !== currentCategory) { + ul.append("
  • " + item.category + "
    • "); + currentCategory = item.category; + } + li = rMenu._renderItemData(ul, item); + if (item.category) { + li.attr("aria-label", item.category + " : " + item.l); + li.attr("class", "resultItem"); + } else { + li.attr("aria-label", item.l); + li.attr("class", "resultItem"); + } + }); + }, + _renderItem: function(ul, item) { + var label = ""; + if (item.category === catModules) { + label = getHighlightedText(item.l); + } else if (item.category === catPackages) { + label = (item.m) + ? getHighlightedText(item.m + "/" + item.l) + : getHighlightedText(item.l); + } else if (item.category === catTypes) { + label = (item.p) + ? getHighlightedText(item.p + "." + item.l) + : getHighlightedText(item.l); + } else if (item.category === catMembers) { + label = getHighlightedText(item.p + "." + (item.c + "." + item.l)); + } else if (item.category === catSearchTags) { + label = getHighlightedText(item.l); + } else { + label = item.l; + } + var li = $("
  • ").appendTo(ul); + var div = $("
    ").appendTo(li); + if (item.category === catSearchTags) { + if (item.d) { + div.html(label + " (" + item.h + ")
    " + + item.d + "
    "); + } else { + div.html(label + " (" + item.h + ")"); + } + } else { + div.html(label); + } + return li; + } +}); +$(function() { + $("#search").catcomplete({ + minLength: 1, + delay: 100, + source: function(request, response) { + var result = new Array(); + var presult = new Array(); + var tresult = new Array(); + var mresult = new Array(); + var tgresult = new Array(); + var secondaryresult = new Array(); + var displayCount = 0; + var exactMatcher = new RegExp("^" + $.ui.autocomplete.escapeRegex(request.term) + "$", "i"); + camelCaseRegexp = ($.ui.autocomplete.escapeRegex(request.term)).split(/(?=[A-Z])/).join("([a-z0-9_$]*?)"); + var camelCaseMatcher = new RegExp("^" + camelCaseRegexp); + secondaryMatcher = new RegExp($.ui.autocomplete.escapeRegex(request.term), "i"); + + // Return the nested innermost name from the specified object + function nestedName(e) { + return e.l.substring(e.l.lastIndexOf(".") + 1); + } + + function concatResults(a1, a2) { + a1 = a1.concat(a2); + a2.length = 0; + return a1; + } + + if (moduleSearchIndex) { + var mdleCount = 0; + $.each(moduleSearchIndex, function(index, item) { + item.category = catModules; + if (exactMatcher.test(item.l)) { + result.push(item); + mdleCount++; + } else if (camelCaseMatcher.test(item.l)) { + result.push(item); + } else if (secondaryMatcher.test(item.l)) { + secondaryresult.push(item); + } + }); + displayCount = mdleCount; + result = concatResults(result, secondaryresult); + } + if (packageSearchIndex) { + var pCount = 0; + var pkg = ""; + $.each(packageSearchIndex, function(index, item) { + item.category = catPackages; + pkg = (item.m) + ? (item.m + "/" + item.l) + : item.l; + if (exactMatcher.test(item.l)) { + presult.push(item); + pCount++; + } else if (camelCaseMatcher.test(pkg)) { + presult.push(item); + } else if (secondaryMatcher.test(pkg)) { + secondaryresult.push(item); + } + }); + result = result.concat(concatResults(presult, secondaryresult)); + displayCount = (pCount > displayCount) ? pCount : displayCount; + } + if (typeSearchIndex) { + var tCount = 0; + $.each(typeSearchIndex, function(index, item) { + item.category = catTypes; + var s = nestedName(item); + if (exactMatcher.test(s)) { + tresult.push(item); + tCount++; + } else if (camelCaseMatcher.test(s)) { + tresult.push(item); + } else if (secondaryMatcher.test(item.p + "." + item.l)) { + secondaryresult.push(item); + } + }); + result = result.concat(concatResults(tresult, secondaryresult)); + displayCount = (tCount > displayCount) ? tCount : displayCount; + } + if (memberSearchIndex) { + var mCount = 0; + $.each(memberSearchIndex, function(index, item) { + item.category = catMembers; + var s = nestedName(item); + if (exactMatcher.test(s)) { + mresult.push(item); + mCount++; + } else if (camelCaseMatcher.test(s)) { + mresult.push(item); + } else if (secondaryMatcher.test(item.c + "." + item.l)) { + secondaryresult.push(item); + } + }); + result = result.concat(concatResults(mresult, secondaryresult)); + displayCount = (mCount > displayCount) ? mCount : displayCount; + } + if (tagSearchIndex) { + var tgCount = 0; + $.each(tagSearchIndex, function(index, item) { + item.category = catSearchTags; + if (exactMatcher.test(item.l)) { + tgresult.push(item); + tgCount++; + } else if (secondaryMatcher.test(item.l)) { + secondaryresult.push(item); + } + }); + result = result.concat(concatResults(tgresult, secondaryresult)); + displayCount = (tgCount > displayCount) ? tgCount : displayCount; + } + displayCount = (displayCount > 500) ? displayCount : 500; + var counter = function() { + var count = {Modules: 0, Packages: 0, Types: 0, Members: 0, SearchTags: 0}; + var f = function(item) { + count[item.category] += 1; + return (count[item.category] <= displayCount); + }; + return f; + }(); + response(result.filter(counter)); + }, + response: function(event, ui) { + if (!ui.content.length) { + ui.content.push(noResult); + } else { + $("#search").empty(); + } + }, + autoFocus: true, + position: { + collision: "flip" + }, + select: function(event, ui) { + if (ui.item.l !== noResult.l) { + var url = getURLPrefix(ui); + if (ui.item.category === catModules) { + if (useModuleDirectories) { + url += "module-summary.html"; + } else { + url = ui.item.l + "-summary.html"; + } + } else if (ui.item.category === catPackages) { + if (ui.item.url) { + url = ui.item.url; + } else { + url += ui.item.l.replace(/\./g, '/') + "/package-summary.html"; + } + } else if (ui.item.category === catTypes) { + if (ui.item.url) { + url = ui.item.url; + } else if (ui.item.p === "") { + url += ui.item.l + ".html"; + } else { + url += ui.item.p.replace(/\./g, '/') + "/" + ui.item.l + ".html"; + } + } else if (ui.item.category === catMembers) { + if (ui.item.p === "") { + url += ui.item.c + ".html" + "#"; + } else { + url += ui.item.p.replace(/\./g, '/') + "/" + ui.item.c + ".html" + "#"; + } + if (ui.item.url) { + url += ui.item.url; + } else { + url += ui.item.l; + } + } else if (ui.item.category === catSearchTags) { + url += ui.item.u; + } + if (top !== window) { + parent.classFrame.location = pathtoroot + url; + } else { + window.location.href = pathtoroot + url; + } + $("#search").focus(); + } + } + }); +}); diff --git a/api/serialized-form.html b/api/serialized-form.html new file mode 100644 index 0000000000..18d300b7a5 --- /dev/null +++ b/api/serialized-form.html @@ -0,0 +1,166 @@ + + + + + +Serialized Form (JavaSMT Solver Library) + + + + + + + + + + + + + + + +
    + +
    +
    +
    +

    Serialized Form

    +
    +
    + +
    +
    +
    + +
    + + diff --git a/api/stylesheet.css b/api/stylesheet.css new file mode 100644 index 0000000000..de945eda26 --- /dev/null +++ b/api/stylesheet.css @@ -0,0 +1,910 @@ +/* + * Javadoc style sheet + */ + +@import url('resources/fonts/dejavu.css'); + +/* + * Styles for individual HTML elements. + * + * These are styles that are specific to individual HTML elements. Changing them affects the style of a particular + * HTML element throughout the page. + */ + +body { + background-color:#ffffff; + color:#353833; + font-family:'DejaVu Sans', Arial, Helvetica, sans-serif; + font-size:14px; + margin:0; + padding:0; + height:100%; + width:100%; +} +iframe { + margin:0; + padding:0; + height:100%; + width:100%; + overflow-y:scroll; + border:none; +} +a:link, a:visited { + text-decoration:none; + color:#4A6782; +} +a[href]:hover, a[href]:focus { + text-decoration:none; + color:#bb7a2a; +} +a[name] { + color:#353833; +} +a[name]:before, a[name]:target, a[id]:before, a[id]:target { + content:""; + display:inline-block; + position:relative; + padding-top:129px; + margin-top:-129px; +} +pre { + font-family:'DejaVu Sans Mono', monospace; + font-size:14px; +} +h1 { + font-size:20px; +} +h2 { + font-size:18px; +} +h3 { + font-size:16px; + font-style:italic; +} +h4 { + font-size:13px; +} +h5 { + font-size:12px; +} +h6 { + font-size:11px; +} +ul { + list-style-type:disc; +} +code, tt { + font-family:'DejaVu Sans Mono', monospace; + font-size:14px; + padding-top:4px; + margin-top:8px; + line-height:1.4em; +} +dt code { + font-family:'DejaVu Sans Mono', monospace; + font-size:14px; + padding-top:4px; +} +table tr td dt code { + font-family:'DejaVu Sans Mono', monospace; + font-size:14px; + vertical-align:top; + padding-top:4px; +} +sup { + font-size:8px; +} + +/* + * Styles for HTML generated by javadoc. + * + * These are style classes that are used by the standard doclet to generate HTML documentation. + */ + +/* + * Styles for document title and copyright. + */ +.clear { + clear:both; + height:0px; + overflow:hidden; +} +.aboutLanguage { + float:right; + padding:0px 21px; + font-size:11px; + z-index:200; + margin-top:-9px; +} +.legalCopy { + margin-left:.5em; +} +.bar a, .bar a:link, .bar a:visited, .bar a:active { + color:#FFFFFF; + text-decoration:none; +} +.bar a:hover, .bar a:focus { + color:#bb7a2a; +} +.tab { + background-color:#0066FF; + color:#ffffff; + padding:8px; + width:5em; + font-weight:bold; +} +/* + * Styles for navigation bar. + */ +.bar { + background-color:#4D7A97; + color:#FFFFFF; + padding:.8em .5em .4em .8em; + height:auto;/*height:1.8em;*/ + font-size:11px; + margin:0; +} +.navPadding { + padding-top: 107px; +} +.fixedNav { + position:fixed; + width:100%; + z-index:999; + background-color:#ffffff; +} +.topNav { + background-color:#4D7A97; + color:#FFFFFF; + float:left; + padding:0; + width:100%; + clear:right; + height:2.8em; + padding-top:10px; + overflow:hidden; + font-size:12px; +} +.bottomNav { + margin-top:10px; + background-color:#4D7A97; + color:#FFFFFF; + float:left; + padding:0; + width:100%; + clear:right; + height:2.8em; + padding-top:10px; + overflow:hidden; + font-size:12px; +} +.subNav { + background-color:#dee3e9; + float:left; + width:100%; + overflow:hidden; + font-size:12px; +} +.subNav div { + clear:left; + float:left; + padding:0 0 5px 6px; + text-transform:uppercase; +} +ul.navList, ul.subNavList { + float:left; + margin:0 25px 0 0; + padding:0; +} +ul.navList li{ + list-style:none; + float:left; + padding: 5px 6px; + text-transform:uppercase; +} +ul.navListSearch { + float:right; + margin:0 0 0 0; + padding:0; +} +ul.navListSearch li { + list-style:none; + float:right; + padding: 5px 6px; + text-transform:uppercase; +} +ul.navListSearch li label { + position:relative; + right:-16px; +} +ul.subNavList li { + list-style:none; + float:left; +} +.topNav a:link, .topNav a:active, .topNav a:visited, .bottomNav a:link, .bottomNav a:active, .bottomNav a:visited { + color:#FFFFFF; + text-decoration:none; + text-transform:uppercase; +} +.topNav a:hover, .bottomNav a:hover { + text-decoration:none; + color:#bb7a2a; + text-transform:uppercase; +} +.navBarCell1Rev { + background-color:#F8981D; + color:#253441; + margin: auto 5px; +} +.skipNav { + position:absolute; + top:auto; + left:-9999px; + overflow:hidden; +} +/* + * Styles for page header and footer. + */ +.header, .footer { + clear:both; + margin:0 20px; + padding:5px 0 0 0; +} +.indexNav { + position:relative; + font-size:12px; + background-color:#dee3e9; +} +.indexNav ul { + margin-top:0; + padding:5px; +} +.indexNav ul li { + display:inline; + list-style-type:none; + padding-right:10px; + text-transform:uppercase; +} +.indexNav h1 { + font-size:13px; +} +.title { + color:#2c4557; + margin:10px 0; +} +.subTitle { + margin:5px 0 0 0; +} +.header ul { + margin:0 0 15px 0; + padding:0; +} +.footer ul { + margin:20px 0 5px 0; +} +.header ul li, .footer ul li { + list-style:none; + font-size:13px; +} +/* + * Styles for headings. + */ +div.details ul.blockList ul.blockList ul.blockList li.blockList h4, div.details ul.blockList ul.blockList ul.blockListLast li.blockList h4 { + background-color:#dee3e9; + border:1px solid #d0d9e0; + margin:0 0 6px -8px; + padding:7px 5px; +} +ul.blockList ul.blockList ul.blockList li.blockList h3 { + background-color:#dee3e9; + border:1px solid #d0d9e0; + margin:0 0 6px -8px; + padding:7px 5px; +} +ul.blockList ul.blockList li.blockList h3 { + padding:0; + margin:15px 0; +} +ul.blockList li.blockList h2 { + padding:0px 0 20px 0; +} +/* + * Styles for page layout containers. + */ +.contentContainer, .sourceContainer, .classUseContainer, .serializedFormContainer, .constantValuesContainer, +.allClassesContainer, .allPackagesContainer { + clear:both; + padding:10px 20px; + position:relative; +} +.indexContainer { + margin:10px; + position:relative; + font-size:12px; +} +.indexContainer h2 { + font-size:13px; + padding:0 0 3px 0; +} +.indexContainer ul { + margin:0; + padding:0; +} +.indexContainer ul li { + list-style:none; + padding-top:2px; +} +.contentContainer .description dl dt, .contentContainer .details dl dt, .serializedFormContainer dl dt { + font-size:12px; + font-weight:bold; + margin:10px 0 0 0; + color:#4E4E4E; +} +.contentContainer .description dl dd, .contentContainer .details dl dd, .serializedFormContainer dl dd { + margin:5px 0 10px 0px; + font-size:14px; + font-family:'DejaVu Serif', Georgia, "Times New Roman", Times, serif; +} +.serializedFormContainer dl.nameValue dt { + margin-left:1px; + font-size:1.1em; + display:inline; + font-weight:bold; +} +.serializedFormContainer dl.nameValue dd { + margin:0 0 0 1px; + font-size:1.1em; + display:inline; +} +/* + * Styles for lists. + */ +li.circle { + list-style:circle; +} +ul.horizontal li { + display:inline; + font-size:0.9em; +} +ul.inheritance { + margin:0; + padding:0; +} +ul.inheritance li { + display:inline; + list-style:none; +} +ul.inheritance li ul.inheritance { + margin-left:15px; + padding-left:15px; + padding-top:1px; +} +ul.blockList, ul.blockListLast { + margin:10px 0 10px 0; + padding:0; +} +ul.blockList li.blockList, ul.blockListLast li.blockList { + list-style:none; + margin-bottom:15px; + line-height:1.4; +} +ul.blockList ul.blockList li.blockList, ul.blockList ul.blockListLast li.blockList { + padding:0px 20px 5px 10px; + border:1px solid #ededed; + background-color:#f8f8f8; +} +ul.blockList ul.blockList ul.blockList li.blockList, ul.blockList ul.blockList ul.blockListLast li.blockList { + padding:0 0 5px 8px; + background-color:#ffffff; + border:none; +} +ul.blockList ul.blockList ul.blockList ul.blockList li.blockList { + margin-left:0; + padding-left:0; + padding-bottom:15px; + border:none; +} +ul.blockList ul.blockList ul.blockList ul.blockList li.blockListLast { + list-style:none; + border-bottom:none; + padding-bottom:0; +} +table tr td dl, table tr td dl dt, table tr td dl dd { + margin-top:0; + margin-bottom:1px; +} +/* + * Styles for tables. + */ +.overviewSummary, .memberSummary, .typeSummary, .useSummary, .constantsSummary, .deprecatedSummary, +.requiresSummary, .packagesSummary, .providesSummary, .usesSummary { + width:100%; + border-spacing:0; + border-left:1px solid #EEE; + border-right:1px solid #EEE; + border-bottom:1px solid #EEE; +} +.overviewSummary, .memberSummary, .requiresSummary, .packagesSummary, .providesSummary, .usesSummary { + padding:0px; +} +.overviewSummary caption, .memberSummary caption, .typeSummary caption, +.useSummary caption, .constantsSummary caption, .deprecatedSummary caption, +.requiresSummary caption, .packagesSummary caption, .providesSummary caption, .usesSummary caption { + position:relative; + text-align:left; + background-repeat:no-repeat; + color:#253441; + font-weight:bold; + clear:none; + overflow:hidden; + padding:0px; + padding-top:10px; + padding-left:1px; + margin:0px; + white-space:pre; +} +.constantsSummary caption a:link, .constantsSummary caption a:visited, +.useSummary caption a:link, .useSummary caption a:visited { + color:#1f389c; +} +.overviewSummary caption a:link, .memberSummary caption a:link, .typeSummary caption a:link, +.deprecatedSummary caption a:link, +.requiresSummary caption a:link, .packagesSummary caption a:link, .providesSummary caption a:link, +.usesSummary caption a:link, +.overviewSummary caption a:hover, .memberSummary caption a:hover, .typeSummary caption a:hover, +.useSummary caption a:hover, .constantsSummary caption a:hover, .deprecatedSummary caption a:hover, +.requiresSummary caption a:hover, .packagesSummary caption a:hover, .providesSummary caption a:hover, +.usesSummary caption a:hover, +.overviewSummary caption a:active, .memberSummary caption a:active, .typeSummary caption a:active, +.useSummary caption a:active, .constantsSummary caption a:active, .deprecatedSummary caption a:active, +.requiresSummary caption a:active, .packagesSummary caption a:active, .providesSummary caption a:active, +.usesSummary caption a:active, +.overviewSummary caption a:visited, .memberSummary caption a:visited, .typeSummary caption a:visited, +.deprecatedSummary caption a:visited, +.requiresSummary caption a:visited, .packagesSummary caption a:visited, .providesSummary caption a:visited, +.usesSummary caption a:visited { + color:#FFFFFF; +} +.overviewSummary caption span, .memberSummary caption span, .typeSummary caption span, +.useSummary caption span, .constantsSummary caption span, .deprecatedSummary caption span, +.requiresSummary caption span, .packagesSummary caption span, .providesSummary caption span, +.usesSummary caption span { + white-space:nowrap; + padding-top:5px; + padding-left:12px; + padding-right:12px; + padding-bottom:7px; + display:inline-block; + float:left; + background-color:#F8981D; + border: none; + height:16px; +} +.memberSummary caption span.activeTableTab span, .packagesSummary caption span.activeTableTab span, +.overviewSummary caption span.activeTableTab span, .typeSummary caption span.activeTableTab span { + white-space:nowrap; + padding-top:5px; + padding-left:12px; + padding-right:12px; + margin-right:3px; + display:inline-block; + float:left; + background-color:#F8981D; + height:16px; +} +.memberSummary caption span.tableTab span, .packagesSummary caption span.tableTab span, +.overviewSummary caption span.tableTab span, .typeSummary caption span.tableTab span { + white-space:nowrap; + padding-top:5px; + padding-left:12px; + padding-right:12px; + margin-right:3px; + display:inline-block; + float:left; + background-color:#4D7A97; + height:16px; +} +.memberSummary caption span.tableTab, .memberSummary caption span.activeTableTab, +.packagesSummary caption span.tableTab, .packagesSummary caption span.activeTableTab, +.overviewSummary caption span.tableTab, .overviewSummary caption span.activeTableTab, +.typeSummary caption span.tableTab, .typeSummary caption span.activeTableTab { + padding-top:0px; + padding-left:0px; + padding-right:0px; + background-image:none; + float:none; + display:inline; +} +.overviewSummary .tabEnd, .memberSummary .tabEnd, .typeSummary .tabEnd, +.useSummary .tabEnd, .constantsSummary .tabEnd, .deprecatedSummary .tabEnd, +.requiresSummary .tabEnd, .packagesSummary .tabEnd, .providesSummary .tabEnd, .usesSummary .tabEnd { + display:none; + width:5px; + position:relative; + float:left; + background-color:#F8981D; +} +.memberSummary .activeTableTab .tabEnd, .packagesSummary .activeTableTab .tabEnd, +.overviewSummary .activeTableTab .tabEnd, .typeSummary .activeTableTab .tabEnd { + display:none; + width:5px; + margin-right:3px; + position:relative; + float:left; + background-color:#F8981D; +} +.memberSummary .tableTab .tabEnd, .packagesSummary .tableTab .tabEnd, +.overviewSummary .tableTab .tabEnd, .typeSummary .tableTab .tabEnd { + display:none; + width:5px; + margin-right:3px; + position:relative; + background-color:#4D7A97; + float:left; +} +.rowColor th, .altColor th { + font-weight:normal; +} +.overviewSummary td, .memberSummary td, .typeSummary td, +.useSummary td, .constantsSummary td, .deprecatedSummary td, +.requiresSummary td, .packagesSummary td, .providesSummary td, .usesSummary td { + text-align:left; + padding:0px 0px 12px 10px; +} +th.colFirst, th.colSecond, th.colLast, th.colConstructorName, th.colDeprecatedItemName, .useSummary th, +.constantsSummary th, .packagesSummary th, td.colFirst, td.colSecond, td.colLast, .useSummary td, +.constantsSummary td { + vertical-align:top; + padding-right:0px; + padding-top:8px; + padding-bottom:3px; +} +th.colFirst, th.colSecond, th.colLast, th.colConstructorName, th.colDeprecatedItemName, .constantsSummary th, +.packagesSummary th { + background:#dee3e9; + text-align:left; + padding:8px 3px 3px 7px; +} +td.colFirst, th.colFirst { + font-size:13px; +} +td.colSecond, th.colSecond, td.colLast, th.colConstructorName, th.colDeprecatedItemName, th.colLast { + font-size:13px; +} +.constantsSummary th, .packagesSummary th { + font-size:13px; +} +.providesSummary th.colFirst, .providesSummary th.colLast, .providesSummary td.colFirst, +.providesSummary td.colLast { + white-space:normal; + font-size:13px; +} +.overviewSummary td.colFirst, .overviewSummary th.colFirst, +.requiresSummary td.colFirst, .requiresSummary th.colFirst, +.packagesSummary td.colFirst, .packagesSummary td.colSecond, .packagesSummary th.colFirst, .packagesSummary th, +.usesSummary td.colFirst, .usesSummary th.colFirst, +.providesSummary td.colFirst, .providesSummary th.colFirst, +.memberSummary td.colFirst, .memberSummary th.colFirst, +.memberSummary td.colSecond, .memberSummary th.colSecond, .memberSummary th.colConstructorName, +.typeSummary td.colFirst, .typeSummary th.colFirst { + vertical-align:top; +} +.packagesSummary th.colLast, .packagesSummary td.colLast { + white-space:normal; +} +td.colFirst a:link, td.colFirst a:visited, +td.colSecond a:link, td.colSecond a:visited, +th.colFirst a:link, th.colFirst a:visited, +th.colSecond a:link, th.colSecond a:visited, +th.colConstructorName a:link, th.colConstructorName a:visited, +th.colDeprecatedItemName a:link, th.colDeprecatedItemName a:visited, +.constantValuesContainer td a:link, .constantValuesContainer td a:visited, +.allClassesContainer td a:link, .allClassesContainer td a:visited, +.allPackagesContainer td a:link, .allPackagesContainer td a:visited { + font-weight:bold; +} +.tableSubHeadingColor { + background-color:#EEEEFF; +} +.altColor, .altColor th { + background-color:#FFFFFF; +} +.rowColor, .rowColor th { + background-color:#EEEEEF; +} +/* + * Styles for contents. + */ +.description pre { + margin-top:0; +} +.deprecatedContent { + margin:0; + padding:10px 0; +} +.docSummary { + padding:0; +} +ul.blockList ul.blockList ul.blockList li.blockList h3 { + font-style:normal; +} +div.block { + font-size:14px; + font-family:'DejaVu Serif', Georgia, "Times New Roman", Times, serif; +} +td.colLast div { + padding-top:0px; +} +td.colLast a { + padding-bottom:3px; +} +/* + * Styles for formatting effect. + */ +.sourceLineNo { + color:green; + padding:0 30px 0 0; +} +h1.hidden { + visibility:hidden; + overflow:hidden; + font-size:10px; +} +.block { + display:block; + margin:3px 10px 2px 0px; + color:#474747; +} +.deprecatedLabel, .descfrmTypeLabel, .implementationLabel, .memberNameLabel, .memberNameLink, +.moduleLabelInPackage, .moduleLabelInType, .overrideSpecifyLabel, .packageLabelInType, +.packageHierarchyLabel, .paramLabel, .returnLabel, .seeLabel, .simpleTagLabel, +.throwsLabel, .typeNameLabel, .typeNameLink, .searchTagLink { + font-weight:bold; +} +.deprecationComment, .emphasizedPhrase, .interfaceName { + font-style:italic; +} +.deprecationBlock { + font-size:14px; + font-family:'DejaVu Serif', Georgia, "Times New Roman", Times, serif; + border-style:solid; + border-width:thin; + border-radius:10px; + padding:10px; + margin-bottom:10px; + margin-right:10px; + display:inline-block; +} +div.block div.deprecationComment, div.block div.block span.emphasizedPhrase, +div.block div.block span.interfaceName { + font-style:normal; +} +div.contentContainer ul.blockList li.blockList h2 { + padding-bottom:0px; +} +/* + * Styles for IFRAME. + */ +.mainContainer { + margin:0 auto; + padding:0; + height:100%; + width:100%; + position:fixed; + top:0; + left:0; +} +.leftContainer { + height:100%; + position:fixed; + width:320px; +} +.leftTop { + position:relative; + float:left; + width:315px; + top:0; + left:0; + height:30%; + border-right:6px solid #ccc; + border-bottom:6px solid #ccc; +} +.leftBottom { + position:relative; + float:left; + width:315px; + bottom:0; + left:0; + height:70%; + border-right:6px solid #ccc; + border-top:1px solid #000; +} +.rightContainer { + position:absolute; + left:320px; + top:0; + bottom:0; + height:100%; + right:0; + border-left:1px solid #000; +} +.rightIframe { + margin:0; + padding:0; + height:100%; + right:30px; + width:100%; + overflow:visible; + margin-bottom:30px; +} +/* + * Styles specific to HTML5 elements. + */ +main, nav, header, footer, section { + display:block; +} +/* + * Styles for javadoc search. + */ +.ui-autocomplete-category { + font-weight:bold; + font-size:15px; + padding:7px 0 7px 3px; + background-color:#4D7A97; + color:#FFFFFF; +} +.resultItem { + font-size:13px; +} +.ui-autocomplete { + max-height:85%; + max-width:65%; + overflow-y:scroll; + overflow-x:scroll; + white-space:nowrap; + box-shadow: 0 3px 6px rgba(0,0,0,0.16), 0 3px 6px rgba(0,0,0,0.23); +} +ul.ui-autocomplete { + position:fixed; + z-index:999999; + background-color: #FFFFFF; +} +ul.ui-autocomplete li { + float:left; + clear:both; + width:100%; +} +.resultHighlight { + font-weight:bold; +} +.ui-autocomplete .result-item { + font-size: inherit; +} +#search { + background-image:url('resources/glass.png'); + background-size:13px; + background-repeat:no-repeat; + background-position:2px 3px; + padding-left:20px; + position:relative; + right:-18px; +} +#reset { + background-color: rgb(255,255,255); + background-image:url('resources/x.png'); + background-position:center; + background-repeat:no-repeat; + background-size:12px; + border:0 none; + width:16px; + height:17px; + position:relative; + left:-4px; + top:-4px; + font-size:0px; +} +.watermark { + color:#545454; +} +.searchTagDescResult { + font-style:italic; + font-size:11px; +} +.searchTagHolderResult { + font-style:italic; + font-size:12px; +} +.searchTagResult:before, .searchTagResult:target { + color:red; +} +.moduleGraph span { + display:none; + position:absolute; +} +.moduleGraph:hover span { + display:block; + margin: -100px 0 0 100px; + z-index: 1; +} +.methodSignature { + white-space:normal; +} + +/* + * Styles for user-provided tables. + * + * borderless: + * No borders, vertical margins, styled caption. + * This style is provided for use with existing doc comments. + * In general, borderless tables should not be used for layout purposes. + * + * plain: + * Plain borders around table and cells, vertical margins, styled caption. + * Best for small tables or for complex tables for tables with cells that span + * rows and columns, when the "striped" style does not work well. + * + * striped: + * Borders around the table and vertical borders between cells, striped rows, + * vertical margins, styled caption. + * Best for tables that have a header row, and a body containing a series of simple rows. + */ + +table.borderless, +table.plain, +table.striped { + margin-top: 10px; + margin-bottom: 10px; +} +table.borderless > caption, +table.plain > caption, +table.striped > caption { + font-weight: bold; + font-size: smaller; +} +table.borderless th, table.borderless td, +table.plain th, table.plain td, +table.striped th, table.striped td { + padding: 2px 5px; +} +table.borderless, +table.borderless > thead > tr > th, table.borderless > tbody > tr > th, table.borderless > tr > th, +table.borderless > thead > tr > td, table.borderless > tbody > tr > td, table.borderless > tr > td { + border: none; +} +table.borderless > thead > tr, table.borderless > tbody > tr, table.borderless > tr { + background-color: transparent; +} +table.plain { + border-collapse: collapse; + border: 1px solid black; +} +table.plain > thead > tr, table.plain > tbody tr, table.plain > tr { + background-color: transparent; +} +table.plain > thead > tr > th, table.plain > tbody > tr > th, table.plain > tr > th, +table.plain > thead > tr > td, table.plain > tbody > tr > td, table.plain > tr > td { + border: 1px solid black; +} +table.striped { + border-collapse: collapse; + border: 1px solid black; +} +table.striped > thead { + background-color: #E3E3E3; +} +table.striped > thead > tr > th, table.striped > thead > tr > td { + border: 1px solid black; +} +table.striped > tbody > tr:nth-child(even) { + background-color: #EEE +} +table.striped > tbody > tr:nth-child(odd) { + background-color: #FFF +} +table.striped > tbody > tr > th, table.striped > tbody > tr > td { + border-left: 1px solid black; + border-right: 1px solid black; +} +table.striped > tbody > tr > th { + font-weight: normal; +} diff --git a/api/type-search-index.js b/api/type-search-index.js new file mode 100644 index 0000000000..b28ba69f8c --- /dev/null +++ b/api/type-search-index.js @@ -0,0 +1 @@ +typeSearchIndex = [{"p":"org.sosy_lab.java_smt.basicimpl","l":"AbstractArrayFormulaManager"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"AbstractBitvectorFormulaManager"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"AbstractBooleanFormulaManager"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"AbstractEnumerationFormulaManager"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"AbstractEvaluator"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"AbstractFloatingPointFormulaManager"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"AbstractFormulaManager"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"AbstractModel"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"AbstractNumeralFormulaManager"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"AbstractProver"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"AbstractProverWithAllSat"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"AbstractQuantifiedFormulaManager"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"AbstractSLFormulaManager"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"AbstractSolverContext"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"AbstractStringFormulaManager"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"AbstractUFManager"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"AbstractUserPropagator"},{"l":"All Classes","url":"allclasses-index.html"},{"p":"org.sosy_lab.java_smt.api","l":"BasicProverEnvironment.AllSatCallback"},{"p":"org.sosy_lab.java_smt.example","l":"AllSatExample"},{"p":"org.sosy_lab.java_smt.api","l":"ArrayFormula"},{"p":"org.sosy_lab.java_smt.api","l":"ArrayFormulaManager"},{"p":"org.sosy_lab.java_smt.api","l":"FormulaType.ArrayFormulaType"},{"p":"org.sosy_lab.java_smt.api","l":"BasicProverEnvironment"},{"p":"org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper","l":"BasicProverWithAssumptionsWrapper"},{"p":"org.sosy_lab.java_smt.example","l":"Binoxxo"},{"p":"org.sosy_lab.java_smt.example","l":"Binoxxo.BinoxxoSolver"},{"p":"org.sosy_lab.java_smt.api","l":"BitvectorFormula"},{"p":"org.sosy_lab.java_smt.api","l":"BitvectorFormulaManager"},{"p":"org.sosy_lab.java_smt.api","l":"FormulaType.BitvectorType"},{"p":"org.sosy_lab.java_smt.example","l":"Binoxxo.BooleanBasedBinoxxoSolver"},{"p":"org.sosy_lab.java_smt.example","l":"Sudoku.BooleanBasedSudokuSolver"},{"p":"org.sosy_lab.java_smt.api","l":"BooleanFormula"},{"p":"org.sosy_lab.java_smt.api","l":"BooleanFormulaManager"},{"p":"org.sosy_lab.java_smt.test","l":"BooleanFormulaSubject"},{"p":"org.sosy_lab.java_smt.api.visitors","l":"BooleanFormulaTransformationVisitor"},{"p":"org.sosy_lab.java_smt.api.visitors","l":"BooleanFormulaVisitor"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"CachingModel"},{"p":"org.sosy_lab.java_smt.delegate.debugging","l":"DebuggingArrayFormulaManager"},{"p":"org.sosy_lab.java_smt.delegate.debugging","l":"DebuggingBitvectorFormulaManager"},{"p":"org.sosy_lab.java_smt.delegate.debugging","l":"DebuggingBooleanFormulaManager"},{"p":"org.sosy_lab.java_smt.delegate.debugging","l":"DebuggingEnumerationFormulaManager"},{"p":"org.sosy_lab.java_smt.delegate.debugging","l":"DebuggingFloatingPointFormulaManager"},{"p":"org.sosy_lab.java_smt.delegate.debugging","l":"DebuggingFormulaManager"},{"p":"org.sosy_lab.java_smt.delegate.debugging","l":"DebuggingIntegerFormulaManager"},{"p":"org.sosy_lab.java_smt.delegate.debugging","l":"DebuggingInterpolatingProverEnvironment"},{"p":"org.sosy_lab.java_smt.delegate.debugging","l":"DebuggingModel"},{"p":"org.sosy_lab.java_smt.delegate.debugging","l":"DebuggingNumeralFormulaManager"},{"p":"org.sosy_lab.java_smt.delegate.debugging","l":"DebuggingOptimizationProverEnvironment"},{"p":"org.sosy_lab.java_smt.delegate.debugging","l":"DebuggingProverEnvironment"},{"p":"org.sosy_lab.java_smt.delegate.debugging","l":"DebuggingQuantifiedFormulaManager"},{"p":"org.sosy_lab.java_smt.delegate.debugging","l":"DebuggingRationalFormulaManager"},{"p":"org.sosy_lab.java_smt.delegate.debugging","l":"DebuggingSLFormulaManager"},{"p":"org.sosy_lab.java_smt.delegate.debugging","l":"DebuggingSolverContext"},{"p":"org.sosy_lab.java_smt.delegate.debugging","l":"DebuggingSolverInformation"},{"p":"org.sosy_lab.java_smt.delegate.debugging","l":"DebuggingStringFormulaManager"},{"p":"org.sosy_lab.java_smt.delegate.debugging","l":"DebuggingUFManager"},{"p":"org.sosy_lab.java_smt.api.visitors","l":"DefaultBooleanFormulaVisitor"},{"p":"org.sosy_lab.java_smt.api.visitors","l":"DefaultFormulaVisitor"},{"p":"org.sosy_lab.java_smt.example","l":"Sudoku.EnumerationBasedSudokuSolver"},{"p":"org.sosy_lab.java_smt.api","l":"EnumerationFormula"},{"p":"org.sosy_lab.java_smt.api","l":"EnumerationFormulaManager"},{"p":"org.sosy_lab.java_smt.api","l":"FormulaType.EnumerationFormulaType"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"AbstractEnumerationFormulaManager.EnumType"},{"p":"org.sosy_lab.java_smt.api","l":"Evaluator"},{"p":"org.sosy_lab.java_smt.api.visitors","l":"ExpectedFormulaVisitor"},{"p":"org.sosy_lab.java_smt.api","l":"FloatingPointFormula"},{"p":"org.sosy_lab.java_smt.api","l":"FloatingPointFormulaManager"},{"p":"org.sosy_lab.java_smt.api","l":"FloatingPointNumber"},{"p":"org.sosy_lab.java_smt.api","l":"FloatingPointRoundingMode"},{"p":"org.sosy_lab.java_smt.api","l":"FloatingPointRoundingModeFormula"},{"p":"org.sosy_lab.java_smt.api","l":"FormulaType.FloatingPointType"},{"p":"org.sosy_lab.java_smt.api","l":"Formula"},{"p":"org.sosy_lab.java_smt.example","l":"FormulaClassifier"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"FormulaCreator"},{"p":"org.sosy_lab.java_smt.api","l":"FormulaManager"},{"p":"org.sosy_lab.java_smt.api.visitors","l":"FormulaTransformationVisitor"},{"p":"org.sosy_lab.java_smt.api","l":"FormulaType"},{"p":"org.sosy_lab.java_smt.api.visitors","l":"FormulaVisitor"},{"p":"org.sosy_lab.java_smt.api","l":"FunctionDeclaration"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"FunctionDeclarationImpl"},{"p":"org.sosy_lab.java_smt.api","l":"FunctionDeclarationKind"},{"p":"org.sosy_lab.java_smt.example","l":"HoudiniApp"},{"p":"org.sosy_lab.java_smt.example","l":"Binoxxo.IntegerBasedBinoxxoSolver"},{"p":"org.sosy_lab.java_smt.example","l":"Sudoku.IntegerBasedSudokuSolver"},{"p":"org.sosy_lab.java_smt.api","l":"NumeralFormula.IntegerFormula"},{"p":"org.sosy_lab.java_smt.api","l":"IntegerFormulaManager"},{"p":"org.sosy_lab.java_smt.api","l":"InterpolatingProverEnvironment"},{"p":"org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper","l":"InterpolatingProverWithAssumptionsWrapper"},{"p":"org.sosy_lab.java_smt.example","l":"Interpolation"},{"p":"org.sosy_lab.java_smt.delegate.logging","l":"LoggingSolverContext"},{"p":"org.sosy_lab.java_smt.api","l":"Model"},{"p":"org.sosy_lab.java_smt.basicimpl.tactics","l":"NNFVisitor"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"AbstractNumeralFormulaManager.NonLinearArithmetic"},{"p":"org.sosy_lab.java_smt.example","l":"NQueens"},{"p":"org.sosy_lab.java_smt.example.nqueens_user_propagator","l":"NQueens"},{"p":"org.sosy_lab.java_smt.example.nqueens_user_propagator","l":"NQueensConstraintPropagator"},{"p":"org.sosy_lab.java_smt.example.nqueens_user_propagator","l":"NQueensEnumeratingPropagator"},{"p":"org.sosy_lab.java_smt.api","l":"NumeralFormula"},{"p":"org.sosy_lab.java_smt.api","l":"NumeralFormulaManager"},{"p":"org.sosy_lab.java_smt.api","l":"FormulaType.NumeralType"},{"p":"org.sosy_lab.java_smt.example","l":"OptimizationFormulaWeights"},{"p":"org.sosy_lab.java_smt.example","l":"OptimizationIntReal"},{"p":"org.sosy_lab.java_smt.api","l":"OptimizationProverEnvironment"},{"p":"org.sosy_lab.java_smt.api","l":"OptimizationProverEnvironment.OptStatus"},{"p":"org.sosy_lab.java_smt.test","l":"SolverBasedTest0.ParameterizedSolverBasedTest0"},{"p":"org.sosy_lab.java_smt.example","l":"PrettyPrinter"},{"p":"org.sosy_lab.java_smt.utils","l":"PrettyPrinter"},{"p":"org.sosy_lab.java_smt.utils","l":"PrettyPrinter.PrinterOption"},{"p":"org.sosy_lab.java_smt.api","l":"PropagatorBackend"},{"p":"org.sosy_lab.java_smt.api","l":"ProverEnvironment"},{"p":"org.sosy_lab.java_smt.test","l":"ProverEnvironmentSubject"},{"p":"org.sosy_lab.java_smt.api","l":"SolverContext.ProverOptions"},{"p":"org.sosy_lab.java_smt.basicimpl.withAssumptionsWrapper","l":"ProverWithAssumptionsWrapper"},{"p":"org.sosy_lab.java_smt.api","l":"QuantifiedFormulaManager"},{"p":"org.sosy_lab.java_smt.api","l":"QuantifiedFormulaManager.Quantifier"},{"p":"org.sosy_lab.java_smt.api","l":"NumeralFormula.RationalFormula"},{"p":"org.sosy_lab.java_smt.api","l":"RationalFormulaManager"},{"p":"org.sosy_lab.java_smt.api","l":"RegexFormula"},{"p":"org.sosy_lab.java_smt.utils","l":"UfElimination.Result"},{"p":"org.sosy_lab.java_smt.example","l":"SolverOverviewTable.RowBuilder"},{"p":"org.sosy_lab.java_smt.basicimpl","l":"ShutdownHook"},{"p":"org.sosy_lab.java_smt.example","l":"SimpleUserPropagator"},{"p":"org.sosy_lab.java_smt.api","l":"SLFormulaManager"},{"p":"org.sosy_lab.java_smt.test","l":"SolverBasedTest0"},{"p":"org.sosy_lab.java_smt.api","l":"SolverContext"},{"p":"org.sosy_lab.java_smt","l":"SolverContextFactory"},{"p":"org.sosy_lab.java_smt.api","l":"SolverException"},{"p":"org.sosy_lab.java_smt.example","l":"SolverOverviewTable.SolverInfo"},{"p":"org.sosy_lab.java_smt.example","l":"SolverOverviewTable"},{"p":"org.sosy_lab.java_smt","l":"SolverContextFactory.Solvers"},{"p":"org.sosy_lab.java_smt.test","l":"SolverStackTest0"},{"p":"org.sosy_lab.java_smt.delegate.statistics","l":"SolverStatistics"},{"p":"org.sosy_lab.java_smt.utils","l":"SolverUtils"},{"p":"org.sosy_lab.java_smt.delegate.statistics","l":"StatisticsEnumerationFormulaManager"},{"p":"org.sosy_lab.java_smt.delegate.statistics","l":"StatisticsSolverContext"},{"p":"org.sosy_lab.java_smt.api","l":"StringFormula"},{"p":"org.sosy_lab.java_smt.api","l":"StringFormulaManager"},{"p":"org.sosy_lab.java_smt.example","l":"Sudoku"},{"p":"org.sosy_lab.java_smt.example","l":"Sudoku.SudokuSolver"},{"p":"org.sosy_lab.java_smt.delegate.synchronize","l":"SynchronizedEnumerationFormulaManager"},{"p":"org.sosy_lab.java_smt.delegate.synchronize","l":"SynchronizedSolverContext"},{"p":"org.sosy_lab.java_smt.api","l":"Tactic"},{"p":"org.sosy_lab.java_smt.delegate.statistics","l":"TimerPool"},{"p":"org.sosy_lab.java_smt.delegate.statistics","l":"TimerPool.TimerWrapper"},{"p":"org.sosy_lab.java_smt.api.visitors","l":"TraversalProcess"},{"p":"org.sosy_lab.java_smt.api.visitors","l":"TraversalProcess.TraversalType"},{"p":"org.sosy_lab.java_smt.utils","l":"UfElimination"},{"p":"org.sosy_lab.java_smt.api","l":"UFManager"},{"p":"org.sosy_lab.java_smt.api","l":"UserPropagator"},{"p":"org.sosy_lab.java_smt.api","l":"Model.ValueAssignment"}] \ No newline at end of file diff --git a/api/type-search-index.zip b/api/type-search-index.zip new file mode 100644 index 0000000000000000000000000000000000000000..d8754596e6f24897dc7b924f2d0741b2993c648d GIT binary patch literal 1406 zcmZvcc{~#g7{}+BqY1GPB}6iFm&_9F=>t$?VXTO zE%)BV+(#iP*W}2YA$eVS>#w)>^Lf9|AJ6aid7i(&2nQiyFhER948YHUUIF}o+_xMX z9~q<*6NHJr7NQdx5g0_!4U54=Jip=;^T9-VUmHaW_9RXysUs+P5||`MNfb&8qg|AC zuW?63AGJIAVxLsa;pHsB9LZVx1*I#Ed9JJWGbjJHP-+nNaMLoJ{weHDv6b|_F0og`xF*o%2qFCZooDn#{^14dz zdAmomI2yMJ8@e_kl`g}qgKOxFrmSEw=YGAa*BxIF+p0w8_=%&bDOyBmD-QpQVv7WT z=G@MZcD?W!PBj>%q>r<>5GR7c)ETse^08}m(>|R#l$@C((V}D8icK$=)#l_A%xO8p z`C5gRCnb5F5ZpQKN- z)G=ZmX^t#E=|A|Tvok|Ul65})tb@~|_~gk4JAW6j-)DpEVhV1ohCCznWR|Ue5=o}@ z@Y=g7-zGs!Rx%H^Tt+%)>uJ@u5BxjHOo*)r#73A}_ohSTI8 zI=F2g*FV9KH7+ee2X7RI4necA%1=&5M}t z&1f_;EtulR%Ea;6?+P{DHBQzAdPtoc!FT)H>QS88u(nbTCUsAfxclZ9-H+lvxkZg4 zr3{Q)-!NS?+-miMltAsHWPRbiB&IH;+J8Ml5xL3$PJ*Tv(``(vNFsf6G}naC`DiEG z8fij3bEuw$_Vh`O59pBDld(NeF=C)1D{|*9s(vgq->eySGzyn8s_l7)#KXJEd|A6Y zY!`7ge8CdY6nsjt>FMwQ+WO}9vk%FjGxZcyOhDH7PtH_aqmInI*-C30c%>n8ZNS;0 zOO*3+rUIW#7hl-+;HiXvsfCqiecdybyC)K840~WSeF?>+bv8i#3wVpmixKo znOW0nUz+JqqKPN>fISN4b0&}4_AZLw{i_x>n}6jUH6a;uo~0@iuUu{c2hCY z-VMnv`SnjcI7Gc+9=fpTvCXPNa5iMb;=~NS*v_GNTK{Y9?5mGhb;3?`(S}#9(ip~& zJsf%1dW!Wbwq2qw=cccX3liQDBD8rlus3VztPCFC<+P*EhCT&(MtVbG*ibrnr{(nx zk>B^N6KE`$Vg6SbF*ed4B1PnJbW+?Vr{ zw_jg95I{JHijm6@gFImXKuZe%KsX2pf&u?p^2ghEOa7PtcP7FCDDwSJ;M-jKw$*{( F+dn5*mdyYF literal 0 HcmV?d00001 diff --git a/index.html b/index.html new file mode 100644 index 0000000000..70db18ba30 --- /dev/null +++ b/index.html @@ -0,0 +1,21 @@ + + + + + + + +JavaSMT + + + +Javadoc API documentation +