From 669b32ad5621813ce63e91f8284f808aace7d110 Mon Sep 17 00:00:00 2001 From: Sungkeun Cho Date: Wed, 21 Aug 2024 06:06:41 -0700 Subject: [PATCH] [web] Update the webpage Summary: ^^ Reviewed By: hajduakos Differential Revision: D61542376 fbshipit-source-id: b3e3b430cc349d681a59674d542b3a60849c6eae --- website/checkers.json | 8 +- website/docs/all-categories.md | 4 + website/docs/all-checkers.md | 10 -- website/docs/all-issue-types.md | 30 +++--- website/docs/checker-fragment-retains-view.md | 2 - website/docs/checker-impurity.md | 2 +- website/docs/checker-lineage.md | 6 ++ website/docs/checker-printf-args.md | 25 ----- website/docs/checker-pulse.md | 2 + website/static/man/next/infer-analyze.1.html | 43 ++++----- website/static/man/next/infer-capture.1.html | 7 ++ website/static/man/next/infer-report.1.html | 37 ++++++-- website/static/man/next/infer.1.html | 95 ++++++++++++------- .../Clang_profiler_samples_j/index.html | 11 --- .../Clang_profiler_samples_t/index.html | 2 - .../Java_method_decl_j/index.html | 8 -- .../Java_method_decl_t/index.html | 2 - .../Java_profiler_samples_j/index.html | 20 ---- .../Java_profiler_samples_t/index.html | 2 - .../infer/ATDGenerated/Jsonbug_j/index.html | 2 +- .../infer/ATDGenerated/Jsonbug_t/index.html | 2 +- .../ATDGenerated/Pulse_config_j/index.html | 2 +- .../ATDGenerated/Pulse_config_t/index.html | 2 +- .../odoc/next/infer/ATDGenerated/index.html | 2 +- .../AbstractDomain/FiniteSet/index.html | 2 +- .../argument-1-PPSet/index.html | 2 +- .../FiniteSetOfPPSet/index.html | 2 +- .../AbstractDomain/InvertedSet/index.html | 2 +- .../module-type-FiniteSetS/index.html | 2 +- .../module-type-InvertedSetS/index.html | 2 +- .../argument-1-T/CFG/Node/IdSet/index.html | 2 +- .../argument-1-T/CFG/Node/IdSet/index.html | 2 +- .../argument-1-T/CFG/Node/IdSet/index.html | 2 +- .../CFG/Node/IdSet/index.html | 2 +- .../CFG/Node/IdSet/index.html | 2 +- .../CFG/Node/IdSet/index.html | 2 +- .../argument-1-T/CFG/Node/IdSet/index.html | 2 +- .../CFG/Node/IdSet/index.html | 2 +- .../CFG/Node/IdSet/index.html | 2 +- .../next/infer/Absint/CallSite/Set/index.html | 2 +- .../odoc/next/infer/Absint/Errlog/index.html | 2 +- .../MakeTraceElem/FiniteSet/index.html | 2 +- .../FiniteSet/index.html | 2 +- .../module-type-FiniteSet/index.html | 2 +- .../FiniteSet/index.html | 2 +- .../next/infer/Absint/IssueLog/index.html | 2 +- .../CFG/Node/IdSet/index.html | 2 +- .../CFG/Node/IdSet/index.html | 2 +- .../CFG/Node/IdSet/index.html | 2 +- .../CFG/Node/IdSet/index.html | 2 +- .../CFG/Node/IdSet/index.html | 2 +- .../CFG/Node/IdSet/index.html | 2 +- .../infer/Absint/Passthrough/Set/index.html | 2 +- .../next/infer/Absint/PatternMatch/index.html | 6 +- .../argument-1-Base/Node/IdSet/index.html | 2 +- .../ProcCfg/DefaultNode/IdSet/index.html | 2 +- .../Absint/ProcCfg/InstrNode/IdSet/index.html | 2 +- .../argument-1-Base/Node/IdSet/index.html | 2 +- .../Node/IdSet/index.html | 2 +- .../ProcCfg/module-type-Node/IdSet/index.html | 2 +- .../module-type-NodeCommonS/IdSet/index.html | 2 +- .../module-type-S/Node/IdSet/index.html | 2 +- .../argument-1-CFG/Node/IdSet/index.html | 2 +- .../module-type-S/CFG/Node/IdSet/index.html | 2 +- .../Absint/Sink/module-type-S/Set/index.html | 2 +- .../SinkTrace/Make/Sources/Known/index.html | 2 +- .../Make/Sources/Sanitizers/index.html | 2 +- .../argument-1-TaintTraceElem/Set/index.html | 2 +- .../Absint/SinkTrace/MakeSink/Set/index.html | 2 +- .../argument-1-TaintTraceElem/Set/index.html | 2 +- .../module-type-S/Sink/Set/index.html | 2 +- .../module-type-S/Source/Set/index.html | 2 +- .../module-type-S/Sources/Known/index.html | 2 +- .../Sources/Sanitizers/index.html | 2 +- .../infer/Absint/Source/Dummy/Set/index.html | 2 +- .../Source/module-type-S/Set/index.html | 2 +- .../TaintTrace/Make/Sources/Known/index.html | 2 +- .../Make/Sources/Sanitizers/index.html | 2 +- .../Make/argument-1-Spec/Sink/Set/index.html | 2 +- .../argument-1-Spec/Source/Set/index.html | 2 +- .../module-type-S/Sink/Set/index.html | 2 +- .../module-type-S/Source/Set/index.html | 2 +- .../module-type-S/Sources/Known/index.html | 2 +- .../Sources/Sanitizers/index.html | 2 +- .../module-type-Spec/Sink/Set/index.html | 2 +- .../module-type-Spec/Source/Set/index.html | 2 +- .../module-type-S/Set/index.html | 2 +- .../CFG/Node/IdSet/index.html | 2 +- .../module-type-HIL/CFG/Node/IdSet/index.html | 2 +- .../module-type-S/CFG/Node/IdSet/index.html | 2 +- .../module-type-SIL/CFG/Node/IdSet/index.html | 2 +- .../next/infer/BO/AbsLoc/LocSet/index.html | 2 +- .../ItvThresholds/index.html | 2 +- .../BO/BufferOverrunSemantics/index.html | 4 +- .../odoc/next/infer/BO/FuncPtr/Set/index.html | 2 +- .../next/infer/BO/Symb/SymbolSet/index.html | 2 +- .../infer/Backend/LineageTaint/index.html | 7 +- .../next/infer/CStubs/Fnv64Hash/index.html | 2 - .../static/odoc/next/infer/CStubs/index.html | 2 - .../CFG/Node/IdSet/index.html | 2 +- .../Checkers/AddressTaken/Domain/index.html | 2 +- .../argument-1-CFG/Node/IdSet/index.html | 2 +- .../CallSites/index.html | 2 +- .../Checkers/Control/GuardNodes/index.html | 2 +- .../infer/Checkers/ImpurityDomain/index.html | 2 +- .../infer/Checkers/Lineage/Edge/index.html | 2 +- .../infer/Checkers/Lineage/PPNode/index.html | 2 +- .../Checkers/Lineage/Unified/Dot/index.html | 2 +- .../Lineage/Unified/UVertex/index.html | 2 +- .../argument-1-CFG/Node/IdSet/index.html | 2 +- .../LoopInvariant/InvariantVars/index.html | 2 +- .../LoopInvariant/LoopNodes/index.html | 2 +- .../Checkers/LoopInvariant/VarSet/index.html | 2 +- .../LoopInvariant/VarsInLoop/index.html | 2 +- .../next/infer/Checkers/PrintfArgs/index.html | 2 - .../Checkers/ReachingDefs/Defs/index.html | 2 +- .../Checkers/SiofDomain/VarNames/index.html | 2 +- .../SiofTrace/GlobalVarSet/index.html | 2 +- .../Checkers/SiofTrace/Sink/Set/index.html | 2 +- .../Checkers/SiofTrace/Source/Set/index.html | 2 +- .../SiofTrace/Sources/Known/index.html | 2 +- .../SiofTrace/Sources/Sanitizers/index.html | 2 +- .../odoc/next/infer/Checkers/index.html | 2 +- .../ClangFrontend/AstToRangeMap/index.html | 6 -- .../infer/ClangFrontend/CAst_utils/index.html | 4 +- .../CContext/CXXTemporarySet/index.html | 2 +- .../infer/ClangFrontend/CLocation/index.html | 5 +- .../ClangFrontend/CMethod_trans/index.html | 7 +- .../ClangFrontend/CModule_type/index.html | 2 +- .../infer/ClangFrontend/CVar_decl/index.html | 4 +- .../infer/ClangFrontend/ProcessAST/index.html | 5 - .../odoc/next/infer/ClangFrontend/index.html | 2 +- .../RacerDDomain/AccessDomain/index.html | 2 +- .../AccessSnapshot/FiniteSet/index.html | 2 +- .../StarvationDomain/Acquisitions/index.html | 2 +- .../StarvationDomain/CriticalPairs/index.html | 2 +- .../LazilyInitialized/index.html | 2 +- .../StarvationDomain/NullLocs/index.html | 2 +- .../NullLocsCriticalPairs/index.html | 2 +- .../ScheduledWorkDomain/index.html | 2 +- .../LatentConfigs/index.html | 2 +- .../UncheckedCallees/index.html | 2 +- .../odoc/next/infer/Costlib/Cost/index.html | 3 +- .../Costlib/CostInstantiate/Call/index.html | 3 +- .../next/infer/IBase/Checker/Set/index.html | 2 +- .../odoc/next/infer/IBase/Checker/index.html | 2 +- .../next/infer/IBase/ClangProc/index.html | 2 - .../odoc/next/infer/IBase/Config/index.html | 4 +- .../next/infer/IBase/IssueType/index.html | 2 +- .../infer/IBase/IssuesTestField/index.html | 2 +- .../odoc/next/infer/IBase/Location/index.html | 2 +- .../odoc/next/infer/IBase/Logging/index.html | 2 +- .../infer/IBase/ProcessPoolState/index.html | 2 +- .../IBase/ResultsDirEntryName/index.html | 2 +- .../odoc/next/infer/IBase/Stats/index.html | 2 +- .../odoc/next/infer/IBase/TaskBar/index.html | 4 +- .../odoc/next/infer/IBase/Utils/index.html | 2 +- .../static/odoc/next/infer/IBase/index.html | 2 +- .../odoc/next/infer/IR/Annot/Item/index.html | 2 +- .../odoc/next/infer/IR/Annot/index.html | 2 +- .../odoc/next/infer/IR/CallFlags/index.html | 2 +- .../odoc/next/infer/IR/CapturedVar/index.html | 2 +- .../static/odoc/next/infer/IR/Exp/index.html | 2 +- .../next/infer/IR/Fieldname/Set/index.html | 2 +- .../next/infer/IR/HackClassName/index.html | 2 +- .../odoc/next/infer/IR/Mangled/Set/index.html | 2 +- .../next/infer/IR/Procname/Hack/index.html | 2 +- .../next/infer/IR/Procname/Set/index.html | 2 +- .../odoc/next/infer/IR/Procname/index.html | 2 +- .../odoc/next/infer/IR/Pvar/Set/index.html | 2 +- .../static/odoc/next/infer/IR/Pvar/index.html | 2 +- .../IR/Specialization/HeapPath/Set/index.html | 2 +- .../IR/Specialization/Pulse/Set/index.html | 2 +- .../next/infer/IR/Typ/Name/Set/index.html | 2 +- .../static/odoc/next/infer/IR/Typ/index.html | 2 +- .../odoc/next/infer/IR/Var/Set/index.html | 2 +- .../next/infer/IStdlib/IContainer/index.html | 1 + .../odoc/next/infer/IStdlib/IList/index.html | 10 +- .../IStdlib/IOption/Let_syntax/index.html | 2 +- .../next/infer/IStdlib/IOption/index.html | 2 +- .../PrettyPrintable/MakePPSet/index.html | 2 +- .../module-type-PPSet/index.html | 2 +- .../infer/IStdlib/UnionFind/Make/index.html | 2 +- .../next/infer/IStdlib/UnionFind/index.html | 4 +- .../JsonReports/JsonIssuePrinter/index.html | 2 + .../infer/Integration/JsonReports/index.html | 4 +- .../infer/Integration/MergeCapture/index.html | 2 +- .../Integration/Suppressions/Span/index.html | 2 + .../infer/Integration/Suppressions/index.html | 2 + .../odoc/next/infer/Integration/index.html | 2 +- .../AddressAttributes/index.html | 7 +- .../CanonValue/Attributes/index.html | 5 +- .../CanonValue/Set/index.html | 2 +- .../CanonValue/Stack/index.html | 15 +-- .../CanonValue/index.html | 8 +- .../PulseAbductiveDomain/Stack/index.html | 4 +- .../Pulselib/PulseAbductiveDomain/index.html | 8 +- .../PulseAbstractValue/Set/index.html | 2 +- .../infer/Pulselib/PulseAccess/index.html | 2 +- .../infer/Pulselib/PulseArithmetic/index.html | 2 + .../PulseAttribute/Attributes/index.html | 4 +- .../PulseAttribute/CopyOrigin/index.html | 2 +- .../TaintSanitizedSet/index.html | 2 +- .../PulseAttribute/TaintedSet/index.html | 2 +- .../infer/Pulselib/PulseAttribute/index.html | 4 +- .../PulseBaseAddressAttributes/index.html | 5 +- .../module-type-S/index.html | 5 +- .../infer/Pulselib/PulseBaseStack/index.html | 15 +-- .../infer/Pulselib/PulseCallEvent/index.html | 2 +- .../Make/Attributes/index.html | 5 +- .../PulseCanonValue/Make/Set/index.html | 2 +- .../PulseCanonValue/Make/Stack/index.html | 15 +-- .../Pulselib/PulseCanonValue/Make/index.html | 8 +- .../module-type-S/Attributes/index.html | 5 +- .../module-type-S/Set/index.html | 2 +- .../module-type-S/Stack/index.html | 15 +-- .../PulseCanonValue/module-type-S/index.html | 8 +- .../infer/Pulselib/PulseDiagnostic/index.html | 2 +- .../infer/Pulselib/PulseFormula/index.html | 3 +- .../infer/Pulselib/PulseInterproc/index.html | 2 +- .../Pulselib/PulseInvalidation/index.html | 2 +- .../infer/Pulselib/PulseModels/index.html | 4 +- .../PulseModelsDSL/Syntax/Basic/index.html | 1 - .../Pulselib/PulseModelsDSL/Syntax/index.html | 18 ++-- .../infer/Pulselib/PulseModelsDSL/index.html | 2 +- .../Pulselib/PulseModelsImport/index.html | 11 ++- .../PulseMutualRecursion/Set/index.html | 2 +- .../infer/Pulselib/PulseOperations/index.html | 9 +- .../PulseTaintConfig/Kind/Set/index.html | 2 +- .../PulseTaintConfig/SinkPolicy/index.html | 2 +- .../infer/Pulselib/PulseTrace/Set/index.html | 2 +- .../next/infer/Pulselib/PulseTrace/index.html | 2 +- .../MissedCaptures/index.html | 2 +- .../Pulselib/PulseValueOrigin/index.html | 4 +- .../odoc/next/infer/TestDeterminators.html | 2 - .../index.html | 2 - .../JProcname/JNI/index.html | 2 - .../TestDeterminators/JProcname/index.html | 7 -- .../JavaProfilerSamples/index.html | 14 --- .../TestDeterminator/index.html | 13 --- .../next/infer/TestDeterminators/index.html | 2 - .../AI_RPO/T/CFG/Node/IdSet/index.html | 2 +- .../AI_WTO/T/CFG/Node/IdSet/index.html | 2 +- .../AI_RPO/T/CFG/Node/IdSet/index.html | 2 +- .../AI_WTO/T/CFG/Node/IdSet/index.html | 2 +- .../argument-1-CFG/Node/IdSet/index.html | 2 +- .../MockTraceDomain/index.html | 2 +- .../AI_RPO/T/CFG/Node/IdSet/index.html | 2 +- .../AI_WTO/T/CFG/Node/IdSet/index.html | 2 +- .../Make/AI_RPO/T/CFG/Node/IdSet/index.html | 2 +- .../Make/AI_WTO/T/CFG/Node/IdSet/index.html | 2 +- .../argument-1-T/CFG/Node/IdSet/index.html | 2 +- .../AI_RPO/T/CFG/Node/IdSet/index.html | 2 +- .../AI_WTO/T/CFG/Node/IdSet/index.html | 2 +- .../argument-1-T/CFG/Node/IdSet/index.html | 2 +- .../CFG/Node/IdSet/index.html | 2 +- .../AI_RPO/T/CFG/Node/IdSet/index.html | 2 +- .../AI_WTO/T/CFG/Node/IdSet/index.html | 2 +- .../CFG/Node/IdSet/index.html | 2 +- .../infer/UnitTests/CStubsTests/index.html | 5 - .../JavaProfilerSamplesTest/index.html | 3 - .../AI_RPO/T/CFG/Node/IdSet/index.html | 2 +- .../AI_WTO/T/CFG/Node/IdSet/index.html | 2 +- .../BackwardCfg/Node/IdSet/index.html | 2 +- .../BackwardInstrCfg/Node/IdSet/index.html | 2 +- .../InstrCfg/Node/IdSet/index.html | 2 +- .../SchedulerTests/MockNode/IdSet/index.html | 2 +- .../S/CFG/Node/IdSet/index.html | 2 +- .../odoc/next/infer/UnitTests/index.html | 2 +- website/static/odoc/next/infer/index.html | 2 +- website/static/odoc/next/infer/infer.html | 2 +- 271 files changed, 477 insertions(+), 560 deletions(-) delete mode 100644 website/docs/checker-printf-args.md delete mode 100644 website/static/odoc/next/infer/ATDGenerated/Clang_profiler_samples_j/index.html delete mode 100644 website/static/odoc/next/infer/ATDGenerated/Clang_profiler_samples_t/index.html delete mode 100644 website/static/odoc/next/infer/ATDGenerated/Java_method_decl_j/index.html delete mode 100644 website/static/odoc/next/infer/ATDGenerated/Java_method_decl_t/index.html delete mode 100644 website/static/odoc/next/infer/ATDGenerated/Java_profiler_samples_j/index.html delete mode 100644 website/static/odoc/next/infer/ATDGenerated/Java_profiler_samples_t/index.html delete mode 100644 website/static/odoc/next/infer/CStubs/Fnv64Hash/index.html delete mode 100644 website/static/odoc/next/infer/CStubs/index.html delete mode 100644 website/static/odoc/next/infer/Checkers/PrintfArgs/index.html delete mode 100644 website/static/odoc/next/infer/ClangFrontend/AstToRangeMap/index.html delete mode 100644 website/static/odoc/next/infer/ClangFrontend/ProcessAST/index.html delete mode 100644 website/static/odoc/next/infer/IBase/ClangProc/index.html create mode 100644 website/static/odoc/next/infer/Integration/JsonReports/JsonIssuePrinter/index.html create mode 100644 website/static/odoc/next/infer/Integration/Suppressions/Span/index.html create mode 100644 website/static/odoc/next/infer/Integration/Suppressions/index.html delete mode 100644 website/static/odoc/next/infer/TestDeterminators.html delete mode 100644 website/static/odoc/next/infer/TestDeterminators/JProcname/JNI/VISIBLE_FOR_TESTING_DO_NOT_USE_DIRECTLY/index.html delete mode 100644 website/static/odoc/next/infer/TestDeterminators/JProcname/JNI/index.html delete mode 100644 website/static/odoc/next/infer/TestDeterminators/JProcname/index.html delete mode 100644 website/static/odoc/next/infer/TestDeterminators/JavaProfilerSamples/index.html delete mode 100644 website/static/odoc/next/infer/TestDeterminators/TestDeterminator/index.html delete mode 100644 website/static/odoc/next/infer/TestDeterminators/index.html delete mode 100644 website/static/odoc/next/infer/UnitTests/CStubsTests/index.html delete mode 100644 website/static/odoc/next/infer/UnitTests/JavaProfilerSamplesTest/index.html diff --git a/website/checkers.json b/website/checkers.json index 2e8cb854c8f..05397cedaf0 100644 --- a/website/checkers.json +++ b/website/checkers.json @@ -8,9 +8,9 @@ "checker-inefficient-keyset-iterator", "checker-lineage", "checker-litho-required-props", "checker-liveness", "checker-loop-hoisting", "checker-parameter-not-null-checked", - "checker-printf-args", "checker-pulse", "checker-purity", - "checker-racerd", "checker-resource-leak-lab", "checker-sil-validation", - "checker-siof", "checker-scope-leakage", "checker-self-in-block", - "checker-starvation", "checker-topl" + "checker-pulse", "checker-purity", "checker-racerd", + "checker-resource-leak-lab", "checker-sil-validation", "checker-siof", + "checker-scope-leakage", "checker-self-in-block", "checker-starvation", + "checker-topl" ] } \ No newline at end of file diff --git a/website/docs/all-categories.md b/website/docs/all-categories.md index 97a0ace6d63..e59e4daf1e1 100644 --- a/website/docs/all-categories.md +++ b/website/docs/all-categories.md @@ -50,6 +50,8 @@ Issue types in this category: The null pointer is used where a valid pointer is required, causing a memory fault and a crash. For example, it is dereferenced. Issue types in this category: +- [BLOCK_PARAMETER_NOT_NULL_CHECKED](/docs/next/all-issue-types#block_parameter_not_null_checked) +- [COMPARED_TO_NULL_AND_DEREFERENCED](/docs/next/all-issue-types#compared_to_null_and_dereferenced) - [NIL_BLOCK_CALL](/docs/next/all-issue-types#nil_block_call) - [NIL_BLOCK_CALL_LATENT](/docs/next/all-issue-types#nil_block_call_latent) - [NULLPTR_DEREFERENCE](/docs/next/all-issue-types#nullptr_dereference) @@ -80,6 +82,7 @@ Issue types in this category: - [PULSE_UNNECESSARY_COPY_OPTIONAL](/docs/next/all-issue-types#pulse_unnecessary_copy_optional) - [PULSE_UNNECESSARY_COPY_OPTIONAL_CONST](/docs/next/all-issue-types#pulse_unnecessary_copy_optional_const) - [PULSE_UNNECESSARY_COPY_RETURN](/docs/next/all-issue-types#pulse_unnecessary_copy_return) +- [PULSE_UNNECESSARY_COPY_THRIFT_ASSIGNMENT](/docs/next/all-issue-types#pulse_unnecessary_copy_thrift_assignment) - [REGEX_OP_ON_UI_THREAD](/docs/next/all-issue-types#regex_op_on_ui_thread) - [STRICT_MODE_VIOLATION](/docs/next/all-issue-types#strict_mode_violation) @@ -149,6 +152,7 @@ Sensitive data is flowing where it shouldn't. Issue types in this category: - [DATA_FLOW_TO_SINK](/docs/next/all-issue-types#data_flow_to_sink) +- [LINEAGE_FLOW](/docs/next/all-issue-types#lineage_flow) - [SCOPE_LEAKAGE](/docs/next/all-issue-types#scope_leakage) - [SENSITIVE_DATA_FLOW](/docs/next/all-issue-types#sensitive_data_flow) - [TAINT_ERROR](/docs/next/all-issue-types#taint_error) diff --git a/website/docs/all-checkers.md b/website/docs/all-checkers.md index 526d5c9597b..f38ee777954 100644 --- a/website/docs/all-checkers.md +++ b/website/docs/all-checkers.md @@ -41,8 +41,6 @@ Computes the asymptotic complexity of functions with respect to execution cost o Detects when Android fragments are not explicitly nullified before becoming unreachable. -**\*\*\*DEPRECATED\*\*\*** Unmaintained due to poor precision. - [Visit here for more information.](/docs/next/checker-fragment-retains-view) ## Impurity @@ -87,14 +85,6 @@ An Objective-C-specific analysis to detect when a block parameter is used before [Visit here for more information.](/docs/next/checker-parameter-not-null-checked) -## `printf()` Argument Types - -Detect mismatches between the Java `printf` format strings and the argument types For example, this checker will warn about the type error in `printf("Hello %d", "world")` - -**\*\*\*DEPRECATED\*\*\*** Unmaintained. - -[Visit here for more information.](/docs/next/checker-printf-args) - ## Pulse General-purpose memory and value analysis engine. diff --git a/website/docs/all-issue-types.md b/website/docs/all-issue-types.md index b4732dca431..64a9ed6a7b0 100644 --- a/website/docs/all-issue-types.md +++ b/website/docs/all-issue-types.md @@ -167,7 +167,7 @@ See [MEMORY_LEAK_C](#memory_leak_c). See [RETAIN_CYCLE](#retain_cycle). ## BLOCK_PARAMETER_NOT_NULL_CHECKED -*Reported as "Block Parameter Not Null Checked" by [parameter-not-null-checked](/docs/next/checker-parameter-not-null-checked).* +*Category: [Null pointer dereference](/docs/next/all-categories#null-pointer-dereference). Reported as "Block Parameter Not Null Checked" by [parameter-not-null-checked](/docs/next/checker-parameter-not-null-checked).* This error type is reported only in Objective-C/Objective-C++. It happens when a method has a block as a parameter, and the block is executed in the method's body without checking it for `nil` first. If a `nil` block is passed to @@ -416,20 +416,11 @@ retain a useless reference to that `View` that will not be cleaned up until the Action: Nullify the `View` in question in `onDestroyView`. -## CHECKERS_PRINTF_ARGS +## COMPARED_TO_NULL_AND_DEREFERENCED -*Reported as "Printf Args" by [printf-args](/docs/next/checker-printf-args).* - -This error is reported when the argument types to a `printf` method do not match the format string. - -```java - void stringInsteadOfInteger(PrintStream out) { - out.printf("Hello %d", "world"); - } -``` - -Action: fix the mismatch between format string and argument types. +*Category: [Null pointer dereference](/docs/next/all-categories#null-pointer-dereference). Reported as "Compared To Null And Dereferenced" by [pulse](/docs/next/checker-pulse).* +A pointer that has both been compared to null, whcich suggests that it could be null, but has also been dereferenced without a null check. ## CONFIG_IMPACT *Category: [Perf regression](/docs/next/all-categories#perf-regression). Reported as "Config Impact" by [config-impact-analysis](/docs/next/checker-config-impact-analysis).* @@ -995,6 +986,12 @@ A blocking `Binder` IPC call occurs on the UI thread. *Reported as "Lab Resource Leak" by [resource-leak-lab](/docs/next/checker-resource-leak-lab).* Toy issue. +## LINEAGE_FLOW + +*Category: [Sensitive data flow](/docs/next/all-categories#sensitive-data-flow). Reported as "Lineage Flow" by [lineage](/docs/next/checker-lineage).* + +A Lineage taint flow has been detected from a source to a sink. + ## LOCKLESS_VIOLATION *Reported as "Lockless Violation" by [starvation](/docs/next/checker-starvation).* @@ -2207,6 +2204,13 @@ void caller(MyClass obj) { } ``` +## PULSE_UNNECESSARY_COPY_THRIFT_ASSIGNMENT + +*Category: [Perf regression](/docs/next/all-categories#perf-regression). Reported as "Unnecessary Copy Assignment into Thrift" by [pulse](/docs/next/checker-pulse).* + +This is similar to [PULSE_UNNECESSARY_COPY_ASSIGNMENT](#pulse_unnecessary_copy_assignment), but is +reported when copied into thrift fields. + ## PURE_FUNCTION *Reported as "Pure Function" by [purity](/docs/next/checker-purity).* diff --git a/website/docs/checker-fragment-retains-view.md b/website/docs/checker-fragment-retains-view.md index f6525120c1e..cf92e530db2 100644 --- a/website/docs/checker-fragment-retains-view.md +++ b/website/docs/checker-fragment-retains-view.md @@ -5,8 +5,6 @@ description: "Detects when Android fragments are not explicitly nullified before Detects when Android fragments are not explicitly nullified before becoming unreachable. -**\*\*\*DEPRECATED\*\*\*** Unmaintained due to poor precision. - Activate with `--fragment-retains-view`. Supported languages: diff --git a/website/docs/checker-impurity.md b/website/docs/checker-impurity.md index 206fb484cfe..1d6baa4e5a8 100644 --- a/website/docs/checker-impurity.md +++ b/website/docs/checker-impurity.md @@ -11,7 +11,7 @@ Supported languages: - C/C++/ObjC: Experimental - C#/.Net: No - Erlang: No -- Hack: No +- Hack: Experimental - Java: Experimental - Python: No diff --git a/website/docs/checker-lineage.md b/website/docs/checker-lineage.md index ff1cbe28edd..240e6214e28 100644 --- a/website/docs/checker-lineage.md +++ b/website/docs/checker-lineage.md @@ -15,3 +15,9 @@ Supported languages: - Java: No - Python: No + + +## List of Issue Types + +The following issue types are reported by this checker: +- [LINEAGE_FLOW](/docs/next/all-issue-types#lineage_flow) diff --git a/website/docs/checker-printf-args.md b/website/docs/checker-printf-args.md deleted file mode 100644 index 446fdfcddc1..00000000000 --- a/website/docs/checker-printf-args.md +++ /dev/null @@ -1,25 +0,0 @@ ---- -title: "`printf()` Argument Types" -description: "Detect mismatches between the Java `printf` format strings and the argument types For example, this checker will warn about the type error in `printf(\"Hello %d\", \"world\")`" ---- - -Detect mismatches between the Java `printf` format strings and the argument types For example, this checker will warn about the type error in `printf("Hello %d", "world")` - -**\*\*\*DEPRECATED\*\*\*** Unmaintained. - -Activate with `--printf-args`. - -Supported languages: -- C/C++/ObjC: No -- C#/.Net: No -- Erlang: No -- Hack: No -- Java: Yes -- Python: No - - - -## List of Issue Types - -The following issue types are reported by this checker: -- [CHECKERS_PRINTF_ARGS](/docs/next/all-issue-types#checkers_printf_args) diff --git a/website/docs/checker-pulse.md b/website/docs/checker-pulse.md index 46179723352..22e7ebbd9fe 100644 --- a/website/docs/checker-pulse.md +++ b/website/docs/checker-pulse.md @@ -147,6 +147,7 @@ The following issue types are reported by this checker: - [BAD_RECORD_LATENT](/docs/next/all-issue-types#bad_record_latent) - [BAD_RETURN](/docs/next/all-issue-types#bad_return) - [BAD_RETURN_LATENT](/docs/next/all-issue-types#bad_return_latent) +- [COMPARED_TO_NULL_AND_DEREFERENCED](/docs/next/all-issue-types#compared_to_null_and_dereferenced) - [CONFIG_USAGE](/docs/next/all-issue-types#config_usage) - [CONSTANT_ADDRESS_DEREFERENCE](/docs/next/all-issue-types#constant_address_dereference) - [CONSTANT_ADDRESS_DEREFERENCE_LATENT](/docs/next/all-issue-types#constant_address_dereference_latent) @@ -202,6 +203,7 @@ The following issue types are reported by this checker: - [PULSE_UNNECESSARY_COPY_OPTIONAL](/docs/next/all-issue-types#pulse_unnecessary_copy_optional) - [PULSE_UNNECESSARY_COPY_OPTIONAL_CONST](/docs/next/all-issue-types#pulse_unnecessary_copy_optional_const) - [PULSE_UNNECESSARY_COPY_RETURN](/docs/next/all-issue-types#pulse_unnecessary_copy_return) +- [PULSE_UNNECESSARY_COPY_THRIFT_ASSIGNMENT](/docs/next/all-issue-types#pulse_unnecessary_copy_thrift_assignment) - [RETAIN_CYCLE](/docs/next/all-issue-types#retain_cycle) - [RETAIN_CYCLE_NO_WEAK_INFO](/docs/next/all-issue-types#retain_cycle_no_weak_info) - [SENSITIVE_DATA_FLOW](/docs/next/all-issue-types#sensitive_data_flow) diff --git a/website/static/man/next/infer-analyze.1.html b/website/static/man/next/infer-analyze.1.html index 0ef0102049c..89af9ad9a4e 100644 --- a/website/static/man/next/infer-analyze.1.html +++ b/website/static/man/next/infer-analyze.1.html @@ -273,12 +273,11 @@

OPTIONS

Deactivates: fragment-retains-view checker: Detects when Android fragments are not explicitly nullified before becoming -unreachable.

+unreachable. (Conversely: +--fragment-retains-view)

-

DEPRECATED: Unmaintained -due to poor precision.
-(Conversely: --fragment-retains-view)
---fragment-retains-view-only

+ +

--fragment-retains-view-only

Activates: Enable fragment-retains-view and disable all other checkers @@ -501,24 +500,6 @@

OPTIONS

Activates: Also log messages to stdout and stderr (Conversely: --no-print-logs)

-

--printf-args

- -

Activates: printf-args -checker: Detect mismatches between the Java -‘printf‘ format strings and the argument types -For example, this checker will warn about the type error in -‘printf("Hello %d", -"world")‘

- -

DEPRECATED: -Unmaintained.
-(Conversely: --no-printf-args)
---printf-args-only

- -

Activates: Enable -printf-args and disable all other checkers -(Conversely: --no-printf-args-only)

-

--progress-bar-style { auto | plain | multiline }

@@ -1343,6 +1324,13 @@

PULSE CHECKER OPTIONS modelled as returning non-null in Pulse

+

--pulse-model-return-nonnull-list ++string

+ +

Regex of methods that should be +modelled as returning non-null in Pulse

+ +

--pulse-model-return-this string

@@ -1509,6 +1497,15 @@

PULSE CHECKER OPTIONS source will be reported. If a sink has such a kind, only sensitive data flows to the sink will be reported.

+ +

--pulse-taint-opaque-files ++path

+ +

Specify files that should be +treated as opaque for taint analysis to make sure that +procedure's belonging to these files are always free of any +potential taint flows.

+

--pulse-taint-policies json

diff --git a/website/static/man/next/infer-capture.1.html b/website/static/man/next/infer-capture.1.html index 98aa2f0f06d..79cfff37aa3 100644 --- a/website/static/man/next/infer-capture.1.html +++ b/website/static/man/next/infer-capture.1.html @@ -738,6 +738,13 @@

JAVA OPTIONS thrown by Sawja/Javalib during Java capture (Conversely: --mask-sawja-exceptions)

+ +

--no-read-java-modules

+ +

Deactivates: Read java modules +file using jimage. (Conversely: +--read-java-modules)

+

ENVIRONMENT

diff --git a/website/static/man/next/infer-report.1.html b/website/static/man/next/infer-report.1.html index db549c883f1..b6a8694e7a2 100644 --- a/website/static/man/next/infer-report.1.html +++ b/website/static/man/next/infer-report.1.html @@ -238,8 +238,9 @@

OPTIONS CHECKERS_EXPENSIVE_OVERRIDES_UNANNOTATED (enabled by default),
CHECKERS_FRAGMENT_RETAINS_VIEW (enabled by default),
-CHECKERS_PRINTF_ARGS (enabled by default),
CLASS_CAST_EXCEPTION (disabled by default),
+COMPARED_TO_NULL_AND_DEREFERENCED (disabled by default), +
CONDITION_ALWAYS_FALSE (disabled by default),
CONDITION_ALWAYS_TRUE (disabled by default),
CONFIG_IMPACT (enabled by default),
@@ -289,6 +290,7 @@

OPTIONS IPC_ON_UI_THREAD (enabled by default),
Internal_error (enabled by default),
LAB_RESOURCE_LEAK (enabled by default),
+LINEAGE_FLOW (enabled by default),
LOCKLESS_VIOLATION (enabled by default),
LOCK_CONSISTENCY_VIOLATION (enabled by default),
Leak_after_array_abstraction (enabled by default),
@@ -366,6 +368,8 @@

OPTIONS PULSE_UNNECESSARY_COPY_OPTIONAL_CONST (disabled by default),
PULSE_UNNECESSARY_COPY_RETURN (disabled by default),
+PULSE_UNNECESSARY_COPY_THRIFT_ASSIGNMENT (enabled by +default),
PURE_FUNCTION (enabled by default),
REGEX_OP_ON_UI_THREAD (enabled by default),
RESOURCE_LEAK (enabled by default),
@@ -465,7 +469,7 @@

OPTIONS line_offset |
qualifier_contains_potential_exception_note | taint_extra |
-transitive_callees_extra }

+transitive_callees_extra | suppressed }

Fields to emit with --issues-tests

@@ -584,6 +588,14 @@

OPTIONS (Conversely: --no-skip-analysis-in-path-skips-compilation)

+

--no-suppressions

+ +

Deactivates: Suppress infer +issues on source lines matching the @infer-disable +ISSUE_TYPE1, ISSUE_TYPE2, ... and @infer-disable-every +ISSUE_TYPE1, ISSUE_TYPE2, ... keywords. (Conversely: +--suppressions)

+

HOISTING OPTIONS

@@ -614,15 +626,28 @@

LINEAGE OPTIONS

[EXPERIMENTAL; UNSTABLE API] Lineage sinks for taint finding, format -[module:]function/arity.{ret,argN}, comma-separated.

- -

--lineage-source -+string

+[module:]function/arity.{ret,argN}, comma-separated. Must be +used with --lineage-source as options to the report +subcommand.

+ +

Will produce a graph +materializing the flows between the sources
+and the sinks along with a json issues file. The issues file +will
+contain one trace per sink, exhibiting a shortest path from +a
+source. The report command will print the filesystem paths +of the
+files containing those results.
+--lineage-source +string

[EXPERIMENTAL; UNSTABLE API] Lineage sources for taint finding, format [module:]function/arity.{ret,argN}, comma-separated.

+

See --lineage-sink for +additional documentation.

+

PULSE CHECKER OPTIONS

diff --git a/website/static/man/next/infer.1.html b/website/static/man/next/infer.1.html index d93d9ca580e..681ec7734e6 100644 --- a/website/static/man/next/infer.1.html +++ b/website/static/man/next/infer.1.html @@ -939,8 +939,9 @@

OPTIONS CHECKERS_EXPENSIVE_OVERRIDES_UNANNOTATED (enabled by default),
CHECKERS_FRAGMENT_RETAINS_VIEW (enabled by default),
-CHECKERS_PRINTF_ARGS (enabled by default),
CLASS_CAST_EXCEPTION (disabled by default),
+COMPARED_TO_NULL_AND_DEREFERENCED (disabled by default), +
CONDITION_ALWAYS_FALSE (disabled by default),
CONDITION_ALWAYS_TRUE (disabled by default),
CONFIG_IMPACT (enabled by default),
@@ -990,6 +991,7 @@

OPTIONS IPC_ON_UI_THREAD (enabled by default),
Internal_error (enabled by default),
LAB_RESOURCE_LEAK (enabled by default),
+LINEAGE_FLOW (enabled by default),
LOCKLESS_VIOLATION (enabled by default),
LOCK_CONSISTENCY_VIOLATION (enabled by default),
Leak_after_array_abstraction (enabled by default),
@@ -1067,6 +1069,8 @@

OPTIONS PULSE_UNNECESSARY_COPY_OPTIONAL_CONST (disabled by default),
PULSE_UNNECESSARY_COPY_RETURN (disabled by default),
+PULSE_UNNECESSARY_COPY_THRIFT_ASSIGNMENT (enabled by +default),
PURE_FUNCTION (enabled by default),
REGEX_OP_ON_UI_THREAD (enabled by default),
RESOURCE_LEAK (enabled by default),
@@ -1261,12 +1265,11 @@

OPTIONS

Deactivates: fragment-retains-view checker: Detects when Android fragments are not explicitly nullified before becoming -unreachable.

+unreachable. (Conversely: +--fragment-retains-view)

-

DEPRECATED: Unmaintained -due to poor precision.
-(Conversely: --fragment-retains-view)
-See also infer-analyze(1).
+

See also +infer-analyze(1).
--fragment-retains-view-only

Activates: Enable @@ -1483,7 +1486,7 @@

OPTIONS line_offset |
qualifier_contains_potential_exception_note | taint_extra |
-transitive_callees_extra }

+transitive_callees_extra | suppressed }

Fields to emit with --issues-tests

@@ -1647,18 +1650,29 @@

OPTIONS

[EXPERIMENTAL; UNSTABLE API] Lineage sinks for taint finding, format -[module:]function/arity.{ret,argN}, comma-separated.

- -

See also -infer-report(1).
+[module:]function/arity.{ret,argN}, comma-separated. Must be +used with --lineage-source as options to the report +subcommand.

+ +

Will produce a graph +materializing the flows between the sources
+and the sinks along with a json issues file. The issues file +will
+contain one trace per sink, exhibiting a shortest path from +a
+source. The report command will print the filesystem paths +of the
+files containing those results.
+See also infer-report(1).
--lineage-source +string

[EXPERIMENTAL; UNSTABLE API] Lineage sources for taint finding, format [module:]function/arity.{ret,argN}, comma-separated.

-

See also -infer-report(1).
+

See --lineage-sink for +additional documentation.
+See also infer-report(1).
--lineage-variant-width int

Maximal width of variant types @@ -1973,27 +1987,6 @@

OPTIONS infer-analyze(1), infer-capture(1), infer-report(1), and
infer-run(1).
---printf-args

- -

Activates: printf-args -checker: Detect mismatches between the Java -‘printf‘ format strings and the argument types -For example, this checker will warn about the type error in -‘printf("Hello %d", -"world")‘

- -

DEPRECATED: -Unmaintained.
-(Conversely: --no-printf-args)
-See also infer-analyze(1).
---printf-args-only

- -

Activates: Enable -printf-args and disable all other checkers -(Conversely: --no-printf-args-only)

- -

See also -infer-analyze(1).
--procedures

Activates: Print functions and @@ -2276,6 +2269,13 @@

OPTIONS

Regex of methods that should be modelled as returning non-null in Pulse

+

See also +infer-analyze(1).
+--pulse-model-return-nonnull-list +string

+ +

Regex of methods that should be +modelled as returning non-null in Pulse

+

See also infer-analyze(1).
--pulse-model-return-this string

@@ -2473,6 +2473,15 @@

OPTIONS source will be reported. If a sink has such a kind, only sensitive data flows to the sink will be reported.

+

See also +infer-analyze(1).
+--pulse-taint-opaque-files +path

+ +

Specify files that should be +treated as opaque for taint analysis to make sure that +procedure's belonging to these files are always free of any +potential taint flows.

+

See also infer-analyze(1).
--pulse-taint-policies json

@@ -2776,6 +2785,14 @@

OPTIONS

See also infer-analyze(1).
+--no-read-java-modules

+ +

Deactivates: Read java modules +file using jimage. (Conversely: +--read-java-modules)

+ +

See also +infer-capture(1).
--replay-analysis-schedule

Activates: Replay the analysis @@ -3267,6 +3284,16 @@

OPTIONS

(Conversely: --no-struct-as-cpp-class)
See also infer-capture(1).
+--no-suppressions

+ +

Deactivates: Suppress infer +issues on source lines matching the @infer-disable +ISSUE_TYPE1, ISSUE_TYPE2, ... and @infer-disable-every +ISSUE_TYPE1, ISSUE_TYPE2, ... keywords. (Conversely: +--suppressions)

+ +

See also +infer-report(1).
--tenv-json file

Path to TEnv json file

diff --git a/website/static/odoc/next/infer/ATDGenerated/Clang_profiler_samples_j/index.html b/website/static/odoc/next/infer/ATDGenerated/Clang_profiler_samples_j/index.html deleted file mode 100644 index ed631507cf4..00000000000 --- a/website/static/odoc/next/infer/ATDGenerated/Clang_profiler_samples_j/index.html +++ /dev/null @@ -1,11 +0,0 @@ - -Clang_profiler_samples_j (infer.ATDGenerated.Clang_profiler_samples_j)

Module ATDGenerated.Clang_profiler_samples_j

type native_symbol = Clang_profiler_samples_t.native_symbol = {
  1. name : string;
  2. mangled_name : string option;
  3. hashed_mangled_name : string option;
}
type profiler_sample = Clang_profiler_samples_t.profiler_sample = {
  1. test : string;
  2. native_symbols : native_symbol list;
}
val write_native_symbol : Stdlib.Buffer.t -> native_symbol -> unit

Output a JSON value of type native_symbol.

val string_of_native_symbol : ?len:int -> native_symbol -> string

Serialize a value of type native_symbol into a JSON string.

  • parameter len

    specifies the initial length of the buffer used internally. Default: 1024.

val read_native_symbol : - Yojson.Safe.lexer_state -> - Stdlib.Lexing.lexbuf -> - native_symbol

Input JSON data of type native_symbol.

val native_symbol_of_string : string -> native_symbol

Deserialize JSON data of type native_symbol.

val write_profiler_sample : Stdlib.Buffer.t -> profiler_sample -> unit

Output a JSON value of type profiler_sample.

val string_of_profiler_sample : ?len:int -> profiler_sample -> string

Serialize a value of type profiler_sample into a JSON string.

  • parameter len

    specifies the initial length of the buffer used internally. Default: 1024.

val read_profiler_sample : - Yojson.Safe.lexer_state -> - Stdlib.Lexing.lexbuf -> - profiler_sample

Input JSON data of type profiler_sample.

val profiler_sample_of_string : string -> profiler_sample

Deserialize JSON data of type profiler_sample.

val write_profiler_samples : Stdlib.Buffer.t -> profiler_samples -> unit

Output a JSON value of type profiler_samples.

val string_of_profiler_samples : ?len:int -> profiler_samples -> string

Serialize a value of type profiler_samples into a JSON string.

  • parameter len

    specifies the initial length of the buffer used internally. Default: 1024.

val read_profiler_samples : - Yojson.Safe.lexer_state -> - Stdlib.Lexing.lexbuf -> - profiler_samples

Input JSON data of type profiler_samples.

val profiler_samples_of_string : string -> profiler_samples

Deserialize JSON data of type profiler_samples.

diff --git a/website/static/odoc/next/infer/ATDGenerated/Clang_profiler_samples_t/index.html b/website/static/odoc/next/infer/ATDGenerated/Clang_profiler_samples_t/index.html deleted file mode 100644 index 765da907c8f..00000000000 --- a/website/static/odoc/next/infer/ATDGenerated/Clang_profiler_samples_t/index.html +++ /dev/null @@ -1,2 +0,0 @@ - -Clang_profiler_samples_t (infer.ATDGenerated.Clang_profiler_samples_t)

Module ATDGenerated.Clang_profiler_samples_t

type native_symbol = {
  1. name : string;
  2. mangled_name : string option;
  3. hashed_mangled_name : string option;
}
type profiler_sample = {
  1. test : string;
  2. native_symbols : native_symbol list;
}
type profiler_samples = profiler_sample list
diff --git a/website/static/odoc/next/infer/ATDGenerated/Java_method_decl_j/index.html b/website/static/odoc/next/infer/ATDGenerated/Java_method_decl_j/index.html deleted file mode 100644 index 18d68ff3570..00000000000 --- a/website/static/odoc/next/infer/ATDGenerated/Java_method_decl_j/index.html +++ /dev/null @@ -1,8 +0,0 @@ - -Java_method_decl_j (infer.ATDGenerated.Java_method_decl_j)

Module ATDGenerated.Java_method_decl_j

type java_method_decl = Java_method_decl_t.java_method_decl = {
  1. signature : string option;
  2. unresolved_signature : bool;
  3. method_name : string;
  4. source_file : string;
  5. start_line : int;
  6. end_line : int;
}
type java_method_decls = Java_method_decl_t.java_method_decls
val write_java_method_decl : Stdlib.Buffer.t -> java_method_decl -> unit

Output a JSON value of type java_method_decl.

val string_of_java_method_decl : ?len:int -> java_method_decl -> string

Serialize a value of type java_method_decl into a JSON string.

  • parameter len

    specifies the initial length of the buffer used internally. Default: 1024.

val read_java_method_decl : - Yojson.Safe.lexer_state -> - Stdlib.Lexing.lexbuf -> - java_method_decl

Input JSON data of type java_method_decl.

val java_method_decl_of_string : string -> java_method_decl

Deserialize JSON data of type java_method_decl.

val write_java_method_decls : Stdlib.Buffer.t -> java_method_decls -> unit

Output a JSON value of type java_method_decls.

val string_of_java_method_decls : ?len:int -> java_method_decls -> string

Serialize a value of type java_method_decls into a JSON string.

  • parameter len

    specifies the initial length of the buffer used internally. Default: 1024.

val read_java_method_decls : - Yojson.Safe.lexer_state -> - Stdlib.Lexing.lexbuf -> - java_method_decls

Input JSON data of type java_method_decls.

val java_method_decls_of_string : string -> java_method_decls

Deserialize JSON data of type java_method_decls.

diff --git a/website/static/odoc/next/infer/ATDGenerated/Java_method_decl_t/index.html b/website/static/odoc/next/infer/ATDGenerated/Java_method_decl_t/index.html deleted file mode 100644 index 4df759c5cd1..00000000000 --- a/website/static/odoc/next/infer/ATDGenerated/Java_method_decl_t/index.html +++ /dev/null @@ -1,2 +0,0 @@ - -Java_method_decl_t (infer.ATDGenerated.Java_method_decl_t)

Module ATDGenerated.Java_method_decl_t

type java_method_decl = {
  1. signature : string option;
  2. unresolved_signature : bool;
  3. method_name : string;
  4. source_file : string;
  5. start_line : int;
  6. end_line : int;
}
type java_method_decls = java_method_decl list
diff --git a/website/static/odoc/next/infer/ATDGenerated/Java_profiler_samples_j/index.html b/website/static/odoc/next/infer/ATDGenerated/Java_profiler_samples_j/index.html deleted file mode 100644 index 45dd598b045..00000000000 --- a/website/static/odoc/next/infer/ATDGenerated/Java_profiler_samples_j/index.html +++ /dev/null @@ -1,20 +0,0 @@ - -Java_profiler_samples_j (infer.ATDGenerated.Java_profiler_samples_j)

Module ATDGenerated.Java_profiler_samples_j

type sampled_method = Java_profiler_samples_t.sampled_method = {
  1. classname : string;
  2. methodname : string;
  3. signature : string;
}
type java_profiler_sample = Java_profiler_samples_t.java_profiler_sample = {
  1. test : string;
  2. methods : sampled_method list;
}
val write_sampled_method : Stdlib.Buffer.t -> sampled_method -> unit

Output a JSON value of type sampled_method.

val string_of_sampled_method : ?len:int -> sampled_method -> string

Serialize a value of type sampled_method into a JSON string.

  • parameter len

    specifies the initial length of the buffer used internally. Default: 1024.

val read_sampled_method : - Yojson.Safe.lexer_state -> - Stdlib.Lexing.lexbuf -> - sampled_method

Input JSON data of type sampled_method.

val sampled_method_of_string : string -> sampled_method

Deserialize JSON data of type sampled_method.

val write_java_profiler_sample : - Stdlib.Buffer.t -> - java_profiler_sample -> - unit

Output a JSON value of type java_profiler_sample.

val string_of_java_profiler_sample : ?len:int -> java_profiler_sample -> string

Serialize a value of type java_profiler_sample into a JSON string.

  • parameter len

    specifies the initial length of the buffer used internally. Default: 1024.

val read_java_profiler_sample : - Yojson.Safe.lexer_state -> - Stdlib.Lexing.lexbuf -> - java_profiler_sample

Input JSON data of type java_profiler_sample.

val java_profiler_sample_of_string : string -> java_profiler_sample

Deserialize JSON data of type java_profiler_sample.

val write_java_profiler_samples : - Stdlib.Buffer.t -> - java_profiler_samples -> - unit

Output a JSON value of type java_profiler_samples.

val string_of_java_profiler_samples : - ?len:int -> - java_profiler_samples -> - string

Serialize a value of type java_profiler_samples into a JSON string.

  • parameter len

    specifies the initial length of the buffer used internally. Default: 1024.

val read_java_profiler_samples : - Yojson.Safe.lexer_state -> - Stdlib.Lexing.lexbuf -> - java_profiler_samples

Input JSON data of type java_profiler_samples.

val java_profiler_samples_of_string : string -> java_profiler_samples

Deserialize JSON data of type java_profiler_samples.

diff --git a/website/static/odoc/next/infer/ATDGenerated/Java_profiler_samples_t/index.html b/website/static/odoc/next/infer/ATDGenerated/Java_profiler_samples_t/index.html deleted file mode 100644 index 455afc90c34..00000000000 --- a/website/static/odoc/next/infer/ATDGenerated/Java_profiler_samples_t/index.html +++ /dev/null @@ -1,2 +0,0 @@ - -Java_profiler_samples_t (infer.ATDGenerated.Java_profiler_samples_t)

Module ATDGenerated.Java_profiler_samples_t

type sampled_method = {
  1. classname : string;
  2. methodname : string;
  3. signature : string;
}
type java_profiler_sample = {
  1. test : string;
  2. methods : sampled_method list;
}
type java_profiler_samples = java_profiler_sample list
diff --git a/website/static/odoc/next/infer/ATDGenerated/Jsonbug_j/index.html b/website/static/odoc/next/infer/ATDGenerated/Jsonbug_j/index.html index e9504c593e6..93adf9d4cb8 100644 --- a/website/static/odoc/next/infer/ATDGenerated/Jsonbug_j/index.html +++ b/website/static/odoc/next/infer/ATDGenerated/Jsonbug_j/index.html @@ -5,7 +5,7 @@ bool
type transitive_callee_kind = Jsonbug_t.transitive_callee_kind
val equal_transitive_callee_kind : transitive_callee_kind -> transitive_callee_kind -> - bool
type transitive_callee = Jsonbug_t.transitive_callee = {
  1. callsite_filename : string;
  2. callsite_absolute_position_in_file : int;
  3. caller_name : string;
  4. callsite_relative_position_in_caller : int;
  5. kind : transitive_callee_kind;
  6. resolution : transitive_callee_resolution;
}
val equal_transitive_callee : transitive_callee -> transitive_callee -> bool
type taint_extra = Jsonbug_t.taint_extra = {
  1. taint_source : string option;
  2. taint_sink : string option;
  3. taint_policy_privacy_effect : string option;
  4. tainted_expression : string option;
}
val equal_taint_extra : taint_extra -> taint_extra -> bool
type missed_capture = Jsonbug_t.missed_capture = {
  1. class_name : string;
}
val equal_missed_capture : missed_capture -> missed_capture -> bool
type loc = Jsonbug_t.loc = {
  1. file : string;
  2. lnum : int;
  3. cnum : int;
  4. enum : int;
}
val equal_loc : loc -> loc -> bool
type json_trace_item = Jsonbug_t.json_trace_item = {
  1. level : int;
  2. filename : string;
  3. line_number : int;
  4. column_number : int;
  5. description : string;
}
val equal_json_trace_item : json_trace_item -> json_trace_item -> bool
type config_usage_extra = Jsonbug_t.config_usage_extra = {
  1. config_name : string;
  2. function_name : string;
  3. filename : string;
  4. line_number : int;
}
val equal_config_usage_extra : config_usage_extra -> config_usage_extra -> bool
type extra = Jsonbug_t.extra = {
  1. cost_polynomial : string option;
  2. cost_degree : int option;
  3. copy_type : string option;
  4. config_usage_extra : config_usage_extra option;
  5. taint_extra : taint_extra option;
  6. transitive_callees : transitive_callee list;
  7. transitive_missed_captures : missed_capture list;
}
val equal_extra : extra -> extra -> bool
type jsonbug = Jsonbug_t.jsonbug = {
  1. bug_type : string;
  2. qualifier : string;
  3. suggestion : string option;
  4. severity : string;
  5. category : string;
  6. line : int;
  7. column : int;
  8. procedure : string;
  9. procedure_start_line : int;
  10. file : string;
  11. bug_trace : json_trace_item list;
  12. bug_trace_length : int;
  13. bug_trace_max_depth : int;
  14. key : string;
  15. node_key : string option;
  16. hash : string;
  17. dotty : string option;
  18. infer_source_loc : loc option;
  19. bug_type_hum : string;
  20. traceview_id : int option;
  21. censored_reason : string option;
  22. access : string option;
  23. extras : extra option;
}
val equal_jsonbug : jsonbug -> jsonbug -> bool
type report = Jsonbug_t.report
val equal_report : report -> report -> bool
val write_transitive_callee_resolution : + bool
type transitive_callee = Jsonbug_t.transitive_callee = {
  1. callsite_filename : string;
  2. callsite_absolute_position_in_file : int;
  3. caller_name : string;
  4. callsite_relative_position_in_caller : int;
  5. kind : transitive_callee_kind;
  6. resolution : transitive_callee_resolution;
}
val equal_transitive_callee : transitive_callee -> transitive_callee -> bool
type taint_extra = Jsonbug_t.taint_extra = {
  1. taint_source : string option;
  2. taint_sink : string option;
  3. taint_policy_privacy_effect : string option;
  4. tainted_expression : string option;
  5. report_as_issue_type : string option;
  6. report_as_category : string option;
}
val equal_taint_extra : taint_extra -> taint_extra -> bool
type missed_capture = Jsonbug_t.missed_capture = {
  1. class_name : string;
}
val equal_missed_capture : missed_capture -> missed_capture -> bool
type loc = Jsonbug_t.loc = {
  1. file : string;
  2. lnum : int;
  3. cnum : int;
  4. enum : int;
}
val equal_loc : loc -> loc -> bool
type json_trace_item = Jsonbug_t.json_trace_item = {
  1. level : int;
  2. filename : string;
  3. line_number : int;
  4. column_number : int;
  5. description : string;
}
val equal_json_trace_item : json_trace_item -> json_trace_item -> bool
type config_usage_extra = Jsonbug_t.config_usage_extra = {
  1. config_name : string;
  2. function_name : string;
  3. filename : string;
  4. line_number : int;
}
val equal_config_usage_extra : config_usage_extra -> config_usage_extra -> bool
type extra = Jsonbug_t.extra = {
  1. cost_polynomial : string option;
  2. cost_degree : int option;
  3. copy_type : string option;
  4. config_usage_extra : config_usage_extra option;
  5. taint_extra : taint_extra option;
  6. transitive_callees : transitive_callee list;
  7. transitive_missed_captures : missed_capture list;
}
val equal_extra : extra -> extra -> bool
type jsonbug = Jsonbug_t.jsonbug = {
  1. bug_type : string;
  2. qualifier : string;
  3. suggestion : string option;
  4. severity : string;
  5. category : string;
  6. line : int;
  7. column : int;
  8. procedure : string;
  9. procedure_start_line : int;
  10. file : string;
  11. bug_trace : json_trace_item list;
  12. bug_trace_length : int;
  13. bug_trace_max_depth : int;
  14. key : string;
  15. node_key : string option;
  16. hash : string;
  17. dotty : string option;
  18. infer_source_loc : loc option;
  19. bug_type_hum : string;
  20. traceview_id : int option;
  21. censored_reason : string option;
  22. access : string option;
  23. extras : extra option;
  24. suppressed : bool;
}
val equal_jsonbug : jsonbug -> jsonbug -> bool
type report = Jsonbug_t.report
val equal_report : report -> report -> bool
val write_transitive_callee_resolution : Stdlib.Buffer.t -> transitive_callee_resolution -> unit

Output a JSON value of type transitive_callee_resolution.

val string_of_transitive_callee_resolution : diff --git a/website/static/odoc/next/infer/ATDGenerated/Jsonbug_t/index.html b/website/static/odoc/next/infer/ATDGenerated/Jsonbug_t/index.html index dcfa6d4cf9a..cc28d4251f2 100644 --- a/website/static/odoc/next/infer/ATDGenerated/Jsonbug_t/index.html +++ b/website/static/odoc/next/infer/ATDGenerated/Jsonbug_t/index.html @@ -5,4 +5,4 @@ bool
type transitive_callee_kind = [
  1. | `Static
  2. | `Virtual
  3. | `Closure
]
val equal_transitive_callee_kind : transitive_callee_kind -> transitive_callee_kind -> - bool
type transitive_callee = {
  1. callsite_filename : string;
  2. callsite_absolute_position_in_file : int;
  3. caller_name : string;
  4. callsite_relative_position_in_caller : int;
  5. kind : transitive_callee_kind;
  6. resolution : transitive_callee_resolution;
}
val equal_transitive_callee : transitive_callee -> transitive_callee -> bool
type taint_extra = {
  1. taint_source : string option;
  2. taint_sink : string option;
  3. taint_policy_privacy_effect : string option;
  4. tainted_expression : string option;
}
val equal_taint_extra : taint_extra -> taint_extra -> bool
type missed_capture = {
  1. class_name : string;
}
val equal_missed_capture : missed_capture -> missed_capture -> bool
type loc = {
  1. file : string;
  2. lnum : int;
  3. cnum : int;
  4. enum : int;
}
val equal_loc : loc -> loc -> bool
type json_trace_item = {
  1. level : int;
  2. filename : string;
  3. line_number : int;
  4. column_number : int;
  5. description : string;
}
val equal_json_trace_item : json_trace_item -> json_trace_item -> bool
type config_usage_extra = {
  1. config_name : string;
  2. function_name : string;
  3. filename : string;
  4. line_number : int;
}
val equal_config_usage_extra : config_usage_extra -> config_usage_extra -> bool
type extra = {
  1. cost_polynomial : string option;
  2. cost_degree : int option;
  3. copy_type : string option;
  4. config_usage_extra : config_usage_extra option;
  5. taint_extra : taint_extra option;
  6. transitive_callees : transitive_callee list;
  7. transitive_missed_captures : missed_capture list;
}
val equal_extra : extra -> extra -> bool
type jsonbug = {
  1. bug_type : string;
  2. qualifier : string;
  3. suggestion : string option;
  4. severity : string;
  5. category : string;
  6. line : int;
  7. column : int;
  8. procedure : string;
  9. procedure_start_line : int;
  10. file : string;
  11. bug_trace : json_trace_item list;
  12. bug_trace_length : int;
  13. bug_trace_max_depth : int;
  14. key : string;
  15. node_key : string option;
  16. hash : string;
  17. dotty : string option;
  18. infer_source_loc : loc option;
  19. bug_type_hum : string;
  20. traceview_id : int option;
  21. censored_reason : string option;
  22. access : string option;
  23. extras : extra option;
}
val equal_jsonbug : jsonbug -> jsonbug -> bool
type report = jsonbug list
val equal_report : report -> report -> bool
+ bool
type transitive_callee = {
  1. callsite_filename : string;
  2. callsite_absolute_position_in_file : int;
  3. caller_name : string;
  4. callsite_relative_position_in_caller : int;
  5. kind : transitive_callee_kind;
  6. resolution : transitive_callee_resolution;
}
val equal_transitive_callee : transitive_callee -> transitive_callee -> bool
type taint_extra = {
  1. taint_source : string option;
  2. taint_sink : string option;
  3. taint_policy_privacy_effect : string option;
  4. tainted_expression : string option;
  5. report_as_issue_type : string option;
  6. report_as_category : string option;
}
val equal_taint_extra : taint_extra -> taint_extra -> bool
type missed_capture = {
  1. class_name : string;
}
val equal_missed_capture : missed_capture -> missed_capture -> bool
type loc = {
  1. file : string;
  2. lnum : int;
  3. cnum : int;
  4. enum : int;
}
val equal_loc : loc -> loc -> bool
type json_trace_item = {
  1. level : int;
  2. filename : string;
  3. line_number : int;
  4. column_number : int;
  5. description : string;
}
val equal_json_trace_item : json_trace_item -> json_trace_item -> bool
type config_usage_extra = {
  1. config_name : string;
  2. function_name : string;
  3. filename : string;
  4. line_number : int;
}
val equal_config_usage_extra : config_usage_extra -> config_usage_extra -> bool
type extra = {
  1. cost_polynomial : string option;
  2. cost_degree : int option;
  3. copy_type : string option;
  4. config_usage_extra : config_usage_extra option;
  5. taint_extra : taint_extra option;
  6. transitive_callees : transitive_callee list;
  7. transitive_missed_captures : missed_capture list;
}
val equal_extra : extra -> extra -> bool
type jsonbug = {
  1. bug_type : string;
  2. qualifier : string;
  3. suggestion : string option;
  4. severity : string;
  5. category : string;
  6. line : int;
  7. column : int;
  8. procedure : string;
  9. procedure_start_line : int;
  10. file : string;
  11. bug_trace : json_trace_item list;
  12. bug_trace_length : int;
  13. bug_trace_max_depth : int;
  14. key : string;
  15. node_key : string option;
  16. hash : string;
  17. dotty : string option;
  18. infer_source_loc : loc option;
  19. bug_type_hum : string;
  20. traceview_id : int option;
  21. censored_reason : string option;
  22. access : string option;
  23. extras : extra option;
  24. suppressed : bool;
}
val equal_jsonbug : jsonbug -> jsonbug -> bool
type report = jsonbug list
val equal_report : report -> report -> bool
diff --git a/website/static/odoc/next/infer/ATDGenerated/Pulse_config_j/index.html b/website/static/odoc/next/infer/ATDGenerated/Pulse_config_j/index.html index 12f86dcd418..7be00139ef2 100644 --- a/website/static/odoc/next/infer/ATDGenerated/Pulse_config_j/index.html +++ b/website/static/odoc/next/infer/ATDGenerated/Pulse_config_j/index.html @@ -1,5 +1,5 @@ -Pulse_config_j (infer.ATDGenerated.Pulse_config_j)

Module ATDGenerated.Pulse_config_j

type taint_target = Pulse_config_t.taint_target
type taint_flow = Pulse_config_t.taint_flow = {
  1. source_kinds : string list;
  2. sanitizer_kinds : string list;
  3. sink_kinds : string list;
}
type taint_policy = Pulse_config_t.taint_policy = {
  1. short_description : string;
  2. taint_flows : taint_flow list;
  3. privacy_effect : string option;
  4. exclude_in : string list option;
  5. exclude_matching : string list option;
}
type taint_policies = Pulse_config_t.taint_policies
type argument_constraint = Pulse_config_t.argument_constraint = {
  1. index : int;
  2. type_matches : string list;
}
type matcher = Pulse_config_t.matcher = {
  1. field_regex : string option;
  2. procedure : string option;
  3. procedure_regex : string option;
  4. class_name_regex : string option;
  5. class_names : string list option;
  6. class_with_annotation : string option;
  7. field_names : string list option;
  8. method_names : string list option;
  9. method_return_type_names : string list option;
  10. overrides_of_class_with_annotation : string option;
  11. method_with_annotation : string option;
  12. field_with_annotation : string option;
  13. annotation_values : string list option;
  14. block_passed_to : string option;
  15. block_passed_to_regex : string option;
  16. allocation : string option;
  17. argument_constraints : argument_constraint list;
  18. kinds : string list option;
  19. taint_target : taint_target option;
  20. exclude_from_regex_in : string list option;
  21. exclude_from_regex_names : string list option;
  22. sanitized_in : string list option;
}
type matchers = Pulse_config_t.matchers
type data_flow_kinds = Pulse_config_t.data_flow_kinds
val write_taint_target : Stdlib.Buffer.t -> taint_target -> unit

Output a JSON value of type taint_target.

val string_of_taint_target : ?len:int -> taint_target -> string

Serialize a value of type taint_target into a JSON string.

  • parameter len

    specifies the initial length of the buffer used internally. Default: 1024.

val read_taint_target : +Pulse_config_j (infer.ATDGenerated.Pulse_config_j)

Module ATDGenerated.Pulse_config_j

type taint_target = Pulse_config_t.taint_target
type taint_flow = Pulse_config_t.taint_flow = {
  1. source_kinds : string list;
  2. sanitizer_kinds : string list;
  3. sink_kinds : string list;
}
type taint_policy = Pulse_config_t.taint_policy = {
  1. short_description : string;
  2. taint_flows : taint_flow list;
  3. privacy_effect : string option;
  4. exclude_in : string list option;
  5. exclude_matching : string list option;
  6. report_as_issue_type : string option;
  7. report_as_category : string option;
}
type taint_policies = Pulse_config_t.taint_policies
type argument_constraint = Pulse_config_t.argument_constraint = {
  1. index : int;
  2. type_matches : string list;
}
type matcher = Pulse_config_t.matcher = {
  1. field_regex : string option;
  2. procedure : string option;
  3. procedure_regex : string option;
  4. class_name_regex : string option;
  5. class_names : string list option;
  6. class_with_annotation : string option;
  7. field_names : string list option;
  8. method_names : string list option;
  9. method_return_type_names : string list option;
  10. overrides_of_class_with_annotation : string option;
  11. method_with_annotation : string option;
  12. field_with_annotation : string option;
  13. annotation_values : string list option;
  14. block_passed_to : string option;
  15. block_passed_to_regex : string option;
  16. allocation : string option;
  17. argument_constraints : argument_constraint list;
  18. kinds : string list option;
  19. taint_target : taint_target option;
  20. exclude_from_regex_in : string list option;
  21. exclude_from_regex_names : string list option;
  22. sanitized_in : string list option;
}
type matchers = Pulse_config_t.matchers
type data_flow_kinds = Pulse_config_t.data_flow_kinds
val write_taint_target : Stdlib.Buffer.t -> taint_target -> unit

Output a JSON value of type taint_target.

val string_of_taint_target : ?len:int -> taint_target -> string

Serialize a value of type taint_target into a JSON string.

  • parameter len

    specifies the initial length of the buffer used internally. Default: 1024.

val read_taint_target : Yojson.Safe.lexer_state -> Stdlib.Lexing.lexbuf -> taint_target

Input JSON data of type taint_target.

val taint_target_of_string : string -> taint_target

Deserialize JSON data of type taint_target.

val write_taint_flow : Stdlib.Buffer.t -> taint_flow -> unit

Output a JSON value of type taint_flow.

val string_of_taint_flow : ?len:int -> taint_flow -> string

Serialize a value of type taint_flow into a JSON string.

  • parameter len

    specifies the initial length of the buffer used internally. Default: 1024.

val read_taint_flow : diff --git a/website/static/odoc/next/infer/ATDGenerated/Pulse_config_t/index.html b/website/static/odoc/next/infer/ATDGenerated/Pulse_config_t/index.html index 20aeb914806..f3b2aa112c0 100644 --- a/website/static/odoc/next/infer/ATDGenerated/Pulse_config_t/index.html +++ b/website/static/odoc/next/infer/ATDGenerated/Pulse_config_t/index.html @@ -1,2 +1,2 @@ -Pulse_config_t (infer.ATDGenerated.Pulse_config_t)

Module ATDGenerated.Pulse_config_t

type taint_target = [
  1. | `ReturnValue
  2. | `AllArguments
  3. | `ArgumentPositions of int list
  4. | `AllArgumentsButPositions of int list
  5. | `ArgumentsMatchingTypes of string list
  6. | `InstanceReference
  7. | `FieldsOfValue of (string * taint_target) list
  8. | `GetField
  9. | `SetField
]
type taint_flow = {
  1. source_kinds : string list;
  2. sanitizer_kinds : string list;
  3. sink_kinds : string list;
}
type taint_policy = {
  1. short_description : string;
  2. taint_flows : taint_flow list;
  3. privacy_effect : string option;
  4. exclude_in : string list option;
  5. exclude_matching : string list option;
}
type taint_policies = taint_policy list
type argument_constraint = {
  1. index : int;
  2. type_matches : string list;
}
type matcher = {
  1. field_regex : string option;
  2. procedure : string option;
  3. procedure_regex : string option;
  4. class_name_regex : string option;
  5. class_names : string list option;
  6. class_with_annotation : string option;
  7. field_names : string list option;
  8. method_names : string list option;
  9. method_return_type_names : string list option;
  10. overrides_of_class_with_annotation : string option;
  11. method_with_annotation : string option;
  12. field_with_annotation : string option;
  13. annotation_values : string list option;
  14. block_passed_to : string option;
  15. block_passed_to_regex : string option;
  16. allocation : string option;
  17. argument_constraints : argument_constraint list;
  18. kinds : string list option;
  19. taint_target : taint_target option;
  20. exclude_from_regex_in : string list option;
  21. exclude_from_regex_names : string list option;
  22. sanitized_in : string list option;
}
type matchers = matcher list
type data_flow_kinds = string list
+Pulse_config_t (infer.ATDGenerated.Pulse_config_t)

Module ATDGenerated.Pulse_config_t

type taint_target = [
  1. | `ReturnValue
  2. | `AllArguments
  3. | `ArgumentPositions of int list
  4. | `AllArgumentsButPositions of int list
  5. | `ArgumentsMatchingTypes of string list
  6. | `InstanceReference
  7. | `FieldsOfValue of (string * taint_target) list
  8. | `GetField
  9. | `SetField
]
type taint_flow = {
  1. source_kinds : string list;
  2. sanitizer_kinds : string list;
  3. sink_kinds : string list;
}
type taint_policy = {
  1. short_description : string;
  2. taint_flows : taint_flow list;
  3. privacy_effect : string option;
  4. exclude_in : string list option;
  5. exclude_matching : string list option;
  6. report_as_issue_type : string option;
  7. report_as_category : string option;
}
type taint_policies = taint_policy list
type argument_constraint = {
  1. index : int;
  2. type_matches : string list;
}
type matcher = {
  1. field_regex : string option;
  2. procedure : string option;
  3. procedure_regex : string option;
  4. class_name_regex : string option;
  5. class_names : string list option;
  6. class_with_annotation : string option;
  7. field_names : string list option;
  8. method_names : string list option;
  9. method_return_type_names : string list option;
  10. overrides_of_class_with_annotation : string option;
  11. method_with_annotation : string option;
  12. field_with_annotation : string option;
  13. annotation_values : string list option;
  14. block_passed_to : string option;
  15. block_passed_to_regex : string option;
  16. allocation : string option;
  17. argument_constraints : argument_constraint list;
  18. kinds : string list option;
  19. taint_target : taint_target option;
  20. exclude_from_regex_in : string list option;
  21. exclude_from_regex_names : string list option;
  22. sanitized_in : string list option;
}
type matchers = matcher list
type data_flow_kinds = string list
diff --git a/website/static/odoc/next/infer/ATDGenerated/index.html b/website/static/odoc/next/infer/ATDGenerated/index.html index 06d75ad906c..2a827d8d7e4 100644 --- a/website/static/odoc/next/infer/ATDGenerated/index.html +++ b/website/static/odoc/next/infer/ATDGenerated/index.html @@ -1,2 +1,2 @@ -ATDGenerated (infer.ATDGenerated)

Module ATDGenerated

module AtdDeps : sig ... end

functions necessary to include in atd generated files to enable ppx_compare

module Clang_ast_b : sig ... end
module Clang_ast_j : sig ... end
module Clang_ast_proj : sig ... end
module Clang_ast_t : sig ... end
module Clang_ast_types : sig ... end
module Clang_ast_v : sig ... end
module Clang_ast_visit : sig ... end
module Clang_profiler_samples_j : sig ... end
module Clang_profiler_samples_t : sig ... end
module Config_impact_data_j : sig ... end
module Config_impact_data_t : sig ... end
module InferCommand : sig ... end
module Java_method_decl_j : sig ... end
module Java_method_decl_t : sig ... end
module Java_profiler_samples_j : sig ... end
module Java_profiler_samples_t : sig ... end
module Jsonbug_j : sig ... end
module Jsonbug_t : sig ... end
module Jsonconfigimpact_j : sig ... end
module Jsonconfigimpact_t : sig ... end
module Jsoncost_j : sig ... end
module Jsoncost_t : sig ... end
module Pulse_config_j : sig ... end
module Pulse_config_t : sig ... end
module Report_block_list_spec_j : sig ... end
module Report_block_list_spec_t : sig ... end
module Runstate_j : sig ... end
module Runstate_t : sig ... end
module Sarifbug_j : sig ... end
module Sarifbug_t : sig ... end
+ATDGenerated (infer.ATDGenerated)

Module ATDGenerated

module AtdDeps : sig ... end

functions necessary to include in atd generated files to enable ppx_compare

module Clang_ast_b : sig ... end
module Clang_ast_j : sig ... end
module Clang_ast_proj : sig ... end
module Clang_ast_t : sig ... end
module Clang_ast_types : sig ... end
module Clang_ast_v : sig ... end
module Clang_ast_visit : sig ... end
module Config_impact_data_j : sig ... end
module Config_impact_data_t : sig ... end
module InferCommand : sig ... end
module Jsonbug_j : sig ... end
module Jsonbug_t : sig ... end
module Jsonconfigimpact_j : sig ... end
module Jsonconfigimpact_t : sig ... end
module Jsoncost_j : sig ... end
module Jsoncost_t : sig ... end
module Pulse_config_j : sig ... end
module Pulse_config_t : sig ... end
module Report_block_list_spec_j : sig ... end
module Report_block_list_spec_t : sig ... end
module Runstate_j : sig ... end
module Runstate_t : sig ... end
module Sarifbug_j : sig ... end
module Sarifbug_t : sig ... end
diff --git a/website/static/odoc/next/infer/Absint/AbstractDomain/FiniteSet/index.html b/website/static/odoc/next/infer/Absint/AbstractDomain/FiniteSet/index.html index 9d4e17c78bd..696aaeb1721 100644 --- a/website/static/odoc/next/infer/Absint/AbstractDomain/FiniteSet/index.html +++ b/website/static/odoc/next/infer/Absint/AbstractDomain/FiniteSet/index.html @@ -1,2 +1,2 @@ -FiniteSet (infer.Absint.AbstractDomain.FiniteSet)

Module AbstractDomain.FiniteSet

Lift a set to a powerset domain ordered by subset. The elements of the set should be drawn from a *finite* collection of possible values, since the widening operator here is just union.

Parameters

Signature

include IStdlib.PrettyPrintable.PPSet with type elt = Element.t
include IStdlib.IStd.Caml.Set.S with type elt = Element.t
type elt = Element.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include WithBottom with type t := t
include S with type t := t
include Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

+FiniteSet (infer.Absint.AbstractDomain.FiniteSet)

Module AbstractDomain.FiniteSet

Lift a set to a powerset domain ordered by subset. The elements of the set should be drawn from a *finite* collection of possible values, since the widening operator here is just union.

Parameters

Signature

include IStdlib.PrettyPrintable.PPSet with type elt = Element.t
include IStdlib.IStd.Caml.Set.S with type elt = Element.t
type elt = Element.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include WithBottom with type t := t
include S with type t := t
include Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

diff --git a/website/static/odoc/next/infer/Absint/AbstractDomain/FiniteSetOfPPSet/argument-1-PPSet/index.html b/website/static/odoc/next/infer/Absint/AbstractDomain/FiniteSetOfPPSet/argument-1-PPSet/index.html index 6e6d276c45c..f71c4504c24 100644 --- a/website/static/odoc/next/infer/Absint/AbstractDomain/FiniteSetOfPPSet/argument-1-PPSet/index.html +++ b/website/static/odoc/next/infer/Absint/AbstractDomain/FiniteSetOfPPSet/argument-1-PPSet/index.html @@ -1,2 +1,2 @@ -PPSet (infer.Absint.AbstractDomain.FiniteSetOfPPSet.PPSet)

Parameter FiniteSetOfPPSet.PPSet

include IStdlib.IStd.Caml.Set.S
type elt
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+PPSet (infer.Absint.AbstractDomain.FiniteSetOfPPSet.PPSet)

Parameter FiniteSetOfPPSet.PPSet

include IStdlib.IStd.Caml.Set.S
type elt
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/AbstractDomain/FiniteSetOfPPSet/index.html b/website/static/odoc/next/infer/Absint/AbstractDomain/FiniteSetOfPPSet/index.html index 745d3705c7c..58a1049910d 100644 --- a/website/static/odoc/next/infer/Absint/AbstractDomain/FiniteSetOfPPSet/index.html +++ b/website/static/odoc/next/infer/Absint/AbstractDomain/FiniteSetOfPPSet/index.html @@ -1,4 +1,4 @@ FiniteSetOfPPSet (infer.Absint.AbstractDomain.FiniteSetOfPPSet)

Module AbstractDomain.FiniteSetOfPPSet

Lift a PPSet to a powerset domain ordered by subset. The elements of the set should be drawn from a *finite* collection of possible values, since the widening operator here is just union.

Parameters

Signature

include IStdlib.PrettyPrintable.PPSet with type t = PPSet.t - with type elt = PPSet.elt
include IStdlib.IStd.Caml.Set.S with type t = PPSet.t with type elt = PPSet.elt
type elt = PPSet.elt
type t = PPSet.t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include WithBottom with type t := t
include S with type t := t
include Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

+ with type elt = PPSet.elt
include IStdlib.IStd.Caml.Set.S with type t = PPSet.t with type elt = PPSet.elt
type elt = PPSet.elt
type t = PPSet.t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include WithBottom with type t := t
include S with type t := t
include Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

diff --git a/website/static/odoc/next/infer/Absint/AbstractDomain/InvertedSet/index.html b/website/static/odoc/next/infer/Absint/AbstractDomain/InvertedSet/index.html index 931f28e1240..caaf85b2120 100644 --- a/website/static/odoc/next/infer/Absint/AbstractDomain/InvertedSet/index.html +++ b/website/static/odoc/next/infer/Absint/AbstractDomain/InvertedSet/index.html @@ -1,2 +1,2 @@ -InvertedSet (infer.Absint.AbstractDomain.InvertedSet)

Module AbstractDomain.InvertedSet

Lift a set to a powerset domain ordered by superset, so the join operator is intersection

Parameters

Signature

include IStdlib.PrettyPrintable.PPSet with type elt = Element.t
include IStdlib.IStd.Caml.Set.S with type elt = Element.t
type elt = Element.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include WithTop with type t := t
include S with type t := t
include Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val top : t
val is_top : t -> bool
+InvertedSet (infer.Absint.AbstractDomain.InvertedSet)

Module AbstractDomain.InvertedSet

Lift a set to a powerset domain ordered by superset, so the join operator is intersection

Parameters

Signature

include IStdlib.PrettyPrintable.PPSet with type elt = Element.t
include IStdlib.IStd.Caml.Set.S with type elt = Element.t
type elt = Element.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include WithTop with type t := t
include S with type t := t
include Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val top : t
val is_top : t -> bool
diff --git a/website/static/odoc/next/infer/Absint/AbstractDomain/module-type-FiniteSetS/index.html b/website/static/odoc/next/infer/Absint/AbstractDomain/module-type-FiniteSetS/index.html index 24d1412af87..b9a43042a90 100644 --- a/website/static/odoc/next/infer/Absint/AbstractDomain/module-type-FiniteSetS/index.html +++ b/website/static/odoc/next/infer/Absint/AbstractDomain/module-type-FiniteSetS/index.html @@ -1,2 +1,2 @@ -FiniteSetS (infer.Absint.AbstractDomain.FiniteSetS)

Module type AbstractDomain.FiniteSetS

include IStdlib.PrettyPrintable.PPSet
include IStdlib.IStd.Caml.Set.S
type elt
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include WithBottom with type t := t
include S with type t := t
include Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

+FiniteSetS (infer.Absint.AbstractDomain.FiniteSetS)

Module type AbstractDomain.FiniteSetS

include IStdlib.PrettyPrintable.PPSet
include IStdlib.IStd.Caml.Set.S
type elt
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include WithBottom with type t := t
include S with type t := t
include Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

diff --git a/website/static/odoc/next/infer/Absint/AbstractDomain/module-type-InvertedSetS/index.html b/website/static/odoc/next/infer/Absint/AbstractDomain/module-type-InvertedSetS/index.html index bc5606e40c9..2a530a77457 100644 --- a/website/static/odoc/next/infer/Absint/AbstractDomain/module-type-InvertedSetS/index.html +++ b/website/static/odoc/next/infer/Absint/AbstractDomain/module-type-InvertedSetS/index.html @@ -1,2 +1,2 @@ -InvertedSetS (infer.Absint.AbstractDomain.InvertedSetS)

Module type AbstractDomain.InvertedSetS

include IStdlib.PrettyPrintable.PPSet
include IStdlib.IStd.Caml.Set.S
type elt
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include WithTop with type t := t
include S with type t := t
include Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val top : t
val is_top : t -> bool
+InvertedSetS (infer.Absint.AbstractDomain.InvertedSetS)

Module type AbstractDomain.InvertedSetS

include IStdlib.PrettyPrintable.PPSet
include IStdlib.IStd.Caml.Set.S
type elt
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include WithTop with type t := t
include S with type t := t
include Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val top : t
val is_top : t -> bool
diff --git a/website/static/odoc/next/infer/Absint/AbstractInterpreter/MakeBackwardRPO/argument-1-T/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/AbstractInterpreter/MakeBackwardRPO/argument-1-T/CFG/Node/IdSet/index.html index 2498b4abf4c..d2314dd9476 100644 --- a/website/static/odoc/next/infer/Absint/AbstractInterpreter/MakeBackwardRPO/argument-1-T/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/AbstractInterpreter/MakeBackwardRPO/argument-1-T/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.AbstractInterpreter.MakeBackwardRPO.T.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.AbstractInterpreter.MakeBackwardRPO.T.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/AbstractInterpreter/MakeBackwardWTO/argument-1-T/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/AbstractInterpreter/MakeBackwardWTO/argument-1-T/CFG/Node/IdSet/index.html index e5d658819a7..acb9225d6ef 100644 --- a/website/static/odoc/next/infer/Absint/AbstractInterpreter/MakeBackwardWTO/argument-1-T/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/AbstractInterpreter/MakeBackwardWTO/argument-1-T/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.AbstractInterpreter.MakeBackwardWTO.T.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.AbstractInterpreter.MakeBackwardWTO.T.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/AbstractInterpreter/MakeDisjunctive/argument-1-T/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/AbstractInterpreter/MakeDisjunctive/argument-1-T/CFG/Node/IdSet/index.html index 4a529488b44..162a0a1c3ef 100644 --- a/website/static/odoc/next/infer/Absint/AbstractInterpreter/MakeDisjunctive/argument-1-T/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/AbstractInterpreter/MakeDisjunctive/argument-1-T/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.AbstractInterpreter.MakeDisjunctive.T.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.AbstractInterpreter.MakeDisjunctive.T.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/AbstractInterpreter/MakeRPO/argument-1-TransferFunctions/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/AbstractInterpreter/MakeRPO/argument-1-TransferFunctions/CFG/Node/IdSet/index.html index ddce0ef929f..30cec89d109 100644 --- a/website/static/odoc/next/infer/Absint/AbstractInterpreter/MakeRPO/argument-1-TransferFunctions/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/AbstractInterpreter/MakeRPO/argument-1-TransferFunctions/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.AbstractInterpreter.MakeRPO.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.AbstractInterpreter.MakeRPO.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/AbstractInterpreter/MakeWTO/argument-1-TransferFunctions/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/AbstractInterpreter/MakeWTO/argument-1-TransferFunctions/CFG/Node/IdSet/index.html index ee506b0dbee..f60bef42d48 100644 --- a/website/static/odoc/next/infer/Absint/AbstractInterpreter/MakeWTO/argument-1-TransferFunctions/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/AbstractInterpreter/MakeWTO/argument-1-TransferFunctions/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.AbstractInterpreter.MakeWTO.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.AbstractInterpreter.MakeWTO.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/AbstractInterpreter/module-type-Make/argument-1-TransferFunctions/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/AbstractInterpreter/module-type-Make/argument-1-TransferFunctions/CFG/Node/IdSet/index.html index 530ec311967..b3b9e4ac1d3 100644 --- a/website/static/odoc/next/infer/Absint/AbstractInterpreter/module-type-Make/argument-1-TransferFunctions/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/AbstractInterpreter/module-type-Make/argument-1-TransferFunctions/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.AbstractInterpreter.Make.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.AbstractInterpreter.Make.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/AbstractInterpreter/module-type-MakeExceptional/argument-1-T/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/AbstractInterpreter/module-type-MakeExceptional/argument-1-T/CFG/Node/IdSet/index.html index 7c39b26d4f4..ff972c1a798 100644 --- a/website/static/odoc/next/infer/Absint/AbstractInterpreter/module-type-MakeExceptional/argument-1-T/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/AbstractInterpreter/module-type-MakeExceptional/argument-1-T/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.AbstractInterpreter.MakeExceptional.T.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.AbstractInterpreter.MakeExceptional.T.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/AbstractInterpreter/module-type-S/TransferFunctions/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/AbstractInterpreter/module-type-S/TransferFunctions/CFG/Node/IdSet/index.html index 59800b71200..4bd7a1b7a99 100644 --- a/website/static/odoc/next/infer/Absint/AbstractInterpreter/module-type-S/TransferFunctions/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/AbstractInterpreter/module-type-S/TransferFunctions/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.AbstractInterpreter.S.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.AbstractInterpreter.S.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/AbstractInterpreter/module-type-TransferFunctions/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/AbstractInterpreter/module-type-TransferFunctions/CFG/Node/IdSet/index.html index 26782759161..b0156d8d74d 100644 --- a/website/static/odoc/next/infer/Absint/AbstractInterpreter/module-type-TransferFunctions/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/AbstractInterpreter/module-type-TransferFunctions/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.AbstractInterpreter.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.AbstractInterpreter.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/CallSite/Set/index.html b/website/static/odoc/next/infer/Absint/CallSite/Set/index.html index 211d98411b7..1901f4c0a03 100644 --- a/website/static/odoc/next/infer/Absint/CallSite/Set/index.html +++ b/website/static/odoc/next/infer/Absint/CallSite/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Absint.CallSite.Set)

Module CallSite.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Absint.CallSite.Set)

Module CallSite.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/Errlog/index.html b/website/static/odoc/next/infer/Absint/Errlog/index.html index 20c87ca4236..72d51ae717d 100644 --- a/website/static/odoc/next/infer/Absint/Errlog/index.html +++ b/website/static/odoc/next/infer/Absint/Errlog/index.html @@ -20,4 +20,4 @@ extras:ATDGenerated.Jsonbug_t.extra option -> IBase.Checker.t -> IssueToReport.t -> - unit
val merge : into:t -> t -> [ `Modified | `Intact ]
val loc_trace_length : loc_trace -> int
val loc_trace_max_depth : loc_trace -> int
+ unit
val merge : into:t -> t -> [ `Modified | `Intact ]
val loc_trace_length : loc_trace -> int
val loc_trace_max_depth : loc_trace -> int
val issue_type_override : err_data -> string option
val category_override : err_data -> string option
diff --git a/website/static/odoc/next/infer/Absint/ExplicitTrace/MakeTraceElem/FiniteSet/index.html b/website/static/odoc/next/infer/Absint/ExplicitTrace/MakeTraceElem/FiniteSet/index.html index 8db5cf7efb3..1fabe0d632f 100644 --- a/website/static/odoc/next/infer/Absint/ExplicitTrace/MakeTraceElem/FiniteSet/index.html +++ b/website/static/odoc/next/infer/Absint/ExplicitTrace/MakeTraceElem/FiniteSet/index.html @@ -1,2 +1,2 @@ -FiniteSet (infer.Absint.ExplicitTrace.MakeTraceElem.FiniteSet)

Module MakeTraceElem.FiniteSet

A powerset of traces.

include AbstractDomain.FiniteSetS with type elt = t
include IStdlib.PrettyPrintable.PPSet with type elt = t
include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include AbstractDomain.WithBottom with type t := t
include AbstractDomain.S with type t := t
include AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

val with_callsite : t -> CallSite.t -> t

Push given callsite onto all traces in set. Cf TraceElem.with_callsite

+FiniteSet (infer.Absint.ExplicitTrace.MakeTraceElem.FiniteSet)

Module MakeTraceElem.FiniteSet

A powerset of traces.

include AbstractDomain.FiniteSetS with type elt = t
include IStdlib.PrettyPrintable.PPSet with type elt = t
include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include AbstractDomain.WithBottom with type t := t
include AbstractDomain.S with type t := t
include AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

val with_callsite : t -> CallSite.t -> t

Push given callsite onto all traces in set. Cf TraceElem.with_callsite

diff --git a/website/static/odoc/next/infer/Absint/ExplicitTrace/MakeTraceElemModuloLocation/FiniteSet/index.html b/website/static/odoc/next/infer/Absint/ExplicitTrace/MakeTraceElemModuloLocation/FiniteSet/index.html index 9aa167ee6cc..3eb88eae799 100644 --- a/website/static/odoc/next/infer/Absint/ExplicitTrace/MakeTraceElemModuloLocation/FiniteSet/index.html +++ b/website/static/odoc/next/infer/Absint/ExplicitTrace/MakeTraceElemModuloLocation/FiniteSet/index.html @@ -1,2 +1,2 @@ -FiniteSet (infer.Absint.ExplicitTrace.MakeTraceElemModuloLocation.FiniteSet)

Module MakeTraceElemModuloLocation.FiniteSet

A powerset of traces.

include AbstractDomain.FiniteSetS with type elt = t
include IStdlib.PrettyPrintable.PPSet with type elt = t
include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include AbstractDomain.WithBottom with type t := t
include AbstractDomain.S with type t := t
include AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

val with_callsite : t -> CallSite.t -> t

Push given callsite onto all traces in set. Cf TraceElem.with_callsite

+FiniteSet (infer.Absint.ExplicitTrace.MakeTraceElemModuloLocation.FiniteSet)

Module MakeTraceElemModuloLocation.FiniteSet

A powerset of traces.

include AbstractDomain.FiniteSetS with type elt = t
include IStdlib.PrettyPrintable.PPSet with type elt = t
include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include AbstractDomain.WithBottom with type t := t
include AbstractDomain.S with type t := t
include AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

val with_callsite : t -> CallSite.t -> t

Push given callsite onto all traces in set. Cf TraceElem.with_callsite

diff --git a/website/static/odoc/next/infer/Absint/ExplicitTrace/module-type-FiniteSet/index.html b/website/static/odoc/next/infer/Absint/ExplicitTrace/module-type-FiniteSet/index.html index e64c98b4a08..3f9377d1c3a 100644 --- a/website/static/odoc/next/infer/Absint/ExplicitTrace/module-type-FiniteSet/index.html +++ b/website/static/odoc/next/infer/Absint/ExplicitTrace/module-type-FiniteSet/index.html @@ -1,2 +1,2 @@ -FiniteSet (infer.Absint.ExplicitTrace.FiniteSet)

Module type ExplicitTrace.FiniteSet

A powerset domain of traces, with bottom = empty and join = union

include AbstractDomain.FiniteSetS
include IStdlib.PrettyPrintable.PPSet
include IStdlib.IStd.Caml.Set.S
type elt
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include AbstractDomain.WithBottom with type t := t
include AbstractDomain.S with type t := t
include AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

val with_callsite : t -> CallSite.t -> t

Push given callsite onto all traces in set. Cf TraceElem.with_callsite

+FiniteSet (infer.Absint.ExplicitTrace.FiniteSet)

Module type ExplicitTrace.FiniteSet

A powerset domain of traces, with bottom = empty and join = union

include AbstractDomain.FiniteSetS
include IStdlib.PrettyPrintable.PPSet
include IStdlib.IStd.Caml.Set.S
type elt
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include AbstractDomain.WithBottom with type t := t
include AbstractDomain.S with type t := t
include AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

val with_callsite : t -> CallSite.t -> t

Push given callsite onto all traces in set. Cf TraceElem.with_callsite

diff --git a/website/static/odoc/next/infer/Absint/ExplicitTrace/module-type-TraceElem/FiniteSet/index.html b/website/static/odoc/next/infer/Absint/ExplicitTrace/module-type-TraceElem/FiniteSet/index.html index 217ceedf613..ea8e98be19f 100644 --- a/website/static/odoc/next/infer/Absint/ExplicitTrace/module-type-TraceElem/FiniteSet/index.html +++ b/website/static/odoc/next/infer/Absint/ExplicitTrace/module-type-TraceElem/FiniteSet/index.html @@ -1,2 +1,2 @@ -FiniteSet (infer.Absint.ExplicitTrace.TraceElem.FiniteSet)

Module TraceElem.FiniteSet

A powerset of traces.

include AbstractDomain.FiniteSetS with type elt = t
include IStdlib.PrettyPrintable.PPSet with type elt = t
include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include AbstractDomain.WithBottom with type t := t
include AbstractDomain.S with type t := t
include AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

val with_callsite : t -> CallSite.t -> t

Push given callsite onto all traces in set. Cf TraceElem.with_callsite

+FiniteSet (infer.Absint.ExplicitTrace.TraceElem.FiniteSet)

Module TraceElem.FiniteSet

A powerset of traces.

include AbstractDomain.FiniteSetS with type elt = t
include IStdlib.PrettyPrintable.PPSet with type elt = t
include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include AbstractDomain.WithBottom with type t := t
include AbstractDomain.S with type t := t
include AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

val with_callsite : t -> CallSite.t -> t

Push given callsite onto all traces in set. Cf TraceElem.with_callsite

diff --git a/website/static/odoc/next/infer/Absint/IssueLog/index.html b/website/static/odoc/next/infer/Absint/IssueLog/index.html index 754b0e57702..6949d6aba0f 100644 --- a/website/static/odoc/next/infer/Absint/IssueLog/index.html +++ b/website/static/odoc/next/infer/Absint/IssueLog/index.html @@ -1,4 +1,4 @@ -IssueLog (infer.Absint.IssueLog)

Module Absint.IssueLog

type t

Module for storing issues detected outside of per-procedure analysis (and hence not serialized as a part of procedure summary).

val empty : t
val get_or_add : proc:IR.Procname.t -> t -> t * Errlog.t

Get the error log for a given procname. If there is none, add an empty one to the map. Return the resulting map together with the errlog.

val is_stored : checker:IBase.Checker.t -> file:IBase.SourceFile.t -> bool

Returns true iff an issue log for the given checker and source file is stored in the database

val store : checker:IBase.Checker.t -> file:IBase.SourceFile.t -> t -> unit

If there are any issues in the log, store ~checker ~file stores the map in the database. Otherwise, no write occurs.

val invalidate : IBase.SourceFile.t -> unit

Delete any stored issues for the given source_file from the database.

val invalidate_all : procedures:IR.Procname.t list -> unit

Delete any stored issues that depend on the given procedures from the database.

val iter_all_issues : +IssueLog (infer.Absint.IssueLog)

Module Absint.IssueLog

type t

Module for storing issues detected outside of per-procedure analysis (and hence not serialized as a part of procedure summary).

val empty : t
val iter : f:(IR.Procname.t -> Errlog.t -> unit) -> t -> unit
val get_or_add : proc:IR.Procname.t -> t -> t * Errlog.t

Get the error log for a given procname. If there is none, add an empty one to the map. Return the resulting map together with the errlog.

val is_stored : checker:IBase.Checker.t -> file:IBase.SourceFile.t -> bool

Returns true iff an issue log for the given checker and source file is stored in the database

val store : checker:IBase.Checker.t -> file:IBase.SourceFile.t -> t -> unit

If there are any issues in the log, store ~checker ~file stores the map in the database. Otherwise, no write occurs.

val invalidate : IBase.SourceFile.t -> unit

Delete any stored issues for the given source_file from the database.

val invalidate_all : procedures:IR.Procname.t list -> unit

Delete any stored issues that depend on the given procedures from the database.

val iter_all_issues : f:(IBase.Checker.t -> IR.Procname.t -> Errlog.t -> unit) -> unit

iterate over all stored issues from all registered checkers in arbitrary order

diff --git a/website/static/odoc/next/infer/Absint/LowerHil/Make/argument-1-TransferFunctions/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/LowerHil/Make/argument-1-TransferFunctions/CFG/Node/IdSet/index.html index db893de132a..5e3767ba041 100644 --- a/website/static/odoc/next/infer/Absint/LowerHil/Make/argument-1-TransferFunctions/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/LowerHil/Make/argument-1-TransferFunctions/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.LowerHil.Make.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.LowerHil.Make.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/LowerHil/MakeAbstractInterpreter/Interpreter/TransferFunctions/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/LowerHil/MakeAbstractInterpreter/Interpreter/TransferFunctions/CFG/Node/IdSet/index.html index 06e52c63f14..79e6aab6e13 100644 --- a/website/static/odoc/next/infer/Absint/LowerHil/MakeAbstractInterpreter/Interpreter/TransferFunctions/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/LowerHil/MakeAbstractInterpreter/Interpreter/TransferFunctions/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.LowerHil.MakeAbstractInterpreter.Interpreter.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

type elt = id
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.LowerHil.MakeAbstractInterpreter.Interpreter.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

type elt = id
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/LowerHil/MakeAbstractInterpreter/argument-1-TransferFunctions/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/LowerHil/MakeAbstractInterpreter/argument-1-TransferFunctions/CFG/Node/IdSet/index.html index 375250bf80b..6b6246c397c 100644 --- a/website/static/odoc/next/infer/Absint/LowerHil/MakeAbstractInterpreter/argument-1-TransferFunctions/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/LowerHil/MakeAbstractInterpreter/argument-1-TransferFunctions/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.LowerHil.MakeAbstractInterpreter.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.LowerHil.MakeAbstractInterpreter.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/LowerHil/MakeAbstractInterpreterWithConfig/argument-1-MakeAbstractInterpreter/argument-1-TransferFunctions/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/LowerHil/MakeAbstractInterpreterWithConfig/argument-1-MakeAbstractInterpreter/argument-1-TransferFunctions/CFG/Node/IdSet/index.html index d10bb9a8eb6..f012cb289ac 100644 --- a/website/static/odoc/next/infer/Absint/LowerHil/MakeAbstractInterpreterWithConfig/argument-1-MakeAbstractInterpreter/argument-1-TransferFunctions/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/LowerHil/MakeAbstractInterpreterWithConfig/argument-1-MakeAbstractInterpreter/argument-1-TransferFunctions/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.LowerHil.MakeAbstractInterpreterWithConfig.MakeAbstractInterpreter.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.LowerHil.MakeAbstractInterpreterWithConfig.MakeAbstractInterpreter.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/LowerHil/MakeAbstractInterpreterWithConfig/argument-3-TransferFunctions/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/LowerHil/MakeAbstractInterpreterWithConfig/argument-3-TransferFunctions/CFG/Node/IdSet/index.html index 5c6fe07884b..bf2b31e27d3 100644 --- a/website/static/odoc/next/infer/Absint/LowerHil/MakeAbstractInterpreterWithConfig/argument-3-TransferFunctions/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/LowerHil/MakeAbstractInterpreterWithConfig/argument-3-TransferFunctions/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.LowerHil.MakeAbstractInterpreterWithConfig.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.LowerHil.MakeAbstractInterpreterWithConfig.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/LowerHil/module-type-S/Interpreter/TransferFunctions/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/LowerHil/module-type-S/Interpreter/TransferFunctions/CFG/Node/IdSet/index.html index bca4f75e962..73391406c96 100644 --- a/website/static/odoc/next/infer/Absint/LowerHil/module-type-S/Interpreter/TransferFunctions/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/LowerHil/module-type-S/Interpreter/TransferFunctions/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.LowerHil.S.Interpreter.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.LowerHil.S.Interpreter.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/Passthrough/Set/index.html b/website/static/odoc/next/infer/Absint/Passthrough/Set/index.html index d665eb64d92..54dfcffe1a5 100644 --- a/website/static/odoc/next/infer/Absint/Passthrough/Set/index.html +++ b/website/static/odoc/next/infer/Absint/Passthrough/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Absint.Passthrough.Set)

Module Passthrough.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Absint.Passthrough.Set)

Module Passthrough.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/PatternMatch/index.html b/website/static/odoc/next/infer/Absint/PatternMatch/index.html index 27f95c4be93..ae01b677b16 100644 --- a/website/static/odoc/next/infer/Absint/PatternMatch/index.html +++ b/website/static/odoc/next/infer/Absint/PatternMatch/index.html @@ -1,11 +1,7 @@ PatternMatch (infer.Absint.PatternMatch)

Module Absint.PatternMatch

Module for Pattern matching.

val get_this_type_nonstatic_methods_only : IR.ProcAttributes.t -> - IR.Typ.t option

Get the `this` type of a procedure. Should not be called on non-static methods, otherwise it can return a wrong type

val get_type_name : IR.Typ.t -> string

Get the name of a type

val get_vararg_type_names : - IR.Tenv.t -> - IR.Procdesc.Node.t -> - IR.Pvar.t -> - string list

Get the type names of a variable argument

val is_subtype : IR.Tenv.t -> IR.Typ.Name.t -> IR.Typ.Name.t -> bool

Is the type a transitive subtype of the typename?

val is_subtype_of_str : IR.Tenv.t -> IR.Typ.Name.t -> string -> bool

Resolve typ_str in tenv, then check typ <: typ_str

module CSharp : sig ... end
module Java : sig ... end
val supertype_exists : + IR.Typ.t option

Get the `this` type of a procedure. Should not be called on non-static methods, otherwise it can return a wrong type

val get_type_name : IR.Typ.t -> string

Get the name of a type

val is_subtype : IR.Tenv.t -> IR.Typ.Name.t -> IR.Typ.Name.t -> bool

Is the type a transitive subtype of the typename?

val is_subtype_of_str : IR.Tenv.t -> IR.Typ.Name.t -> string -> bool

Resolve typ_str in tenv, then check typ <: typ_str

module CSharp : sig ... end
module Java : sig ... end
val supertype_exists : IR.Tenv.t -> (IR.Typ.Name.t -> IR.Struct.t -> bool) -> IR.Typ.Name.t -> diff --git a/website/static/odoc/next/infer/Absint/ProcCfg/Backward/argument-1-Base/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/ProcCfg/Backward/argument-1-Base/Node/IdSet/index.html index f430a8a89ae..b4f3cd2616f 100644 --- a/website/static/odoc/next/infer/Absint/ProcCfg/Backward/argument-1-Base/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/ProcCfg/Backward/argument-1-Base/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.ProcCfg.Backward.Base.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.ProcCfg.Backward.Base.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/ProcCfg/DefaultNode/IdSet/index.html b/website/static/odoc/next/infer/Absint/ProcCfg/DefaultNode/IdSet/index.html index 7ecd8d2c879..1d891d4eab9 100644 --- a/website/static/odoc/next/infer/Absint/ProcCfg/DefaultNode/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/ProcCfg/DefaultNode/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.ProcCfg.DefaultNode.IdSet)

Module DefaultNode.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.ProcCfg.DefaultNode.IdSet)

Module DefaultNode.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/ProcCfg/InstrNode/IdSet/index.html b/website/static/odoc/next/infer/Absint/ProcCfg/InstrNode/IdSet/index.html index 4c80e031adf..0fca6c12666 100644 --- a/website/static/odoc/next/infer/Absint/ProcCfg/InstrNode/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/ProcCfg/InstrNode/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.ProcCfg.InstrNode.IdSet)

Module InstrNode.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.ProcCfg.InstrNode.IdSet)

Module InstrNode.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/ProcCfg/MakeOcamlGraph/argument-1-Base/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/ProcCfg/MakeOcamlGraph/argument-1-Base/Node/IdSet/index.html index 270d593c267..8cb3a8def04 100644 --- a/website/static/odoc/next/infer/Absint/ProcCfg/MakeOcamlGraph/argument-1-Base/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/ProcCfg/MakeOcamlGraph/argument-1-Base/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.ProcCfg.MakeOcamlGraph.Base.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.ProcCfg.MakeOcamlGraph.Base.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/ProcCfg/NormalOneInstrPerNode/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/ProcCfg/NormalOneInstrPerNode/Node/IdSet/index.html index 3148d83cf3b..a05cbb21f7f 100644 --- a/website/static/odoc/next/infer/Absint/ProcCfg/NormalOneInstrPerNode/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/ProcCfg/NormalOneInstrPerNode/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.ProcCfg.NormalOneInstrPerNode.Node.IdSet)

Module Node.IdSet

type elt = id
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.ProcCfg.NormalOneInstrPerNode.Node.IdSet)

Module Node.IdSet

type elt = id
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/ProcCfg/module-type-Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/ProcCfg/module-type-Node/IdSet/index.html index b8f83f3d964..df9d6467c85 100644 --- a/website/static/odoc/next/infer/Absint/ProcCfg/module-type-Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/ProcCfg/module-type-Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.ProcCfg.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.ProcCfg.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/ProcCfg/module-type-NodeCommonS/IdSet/index.html b/website/static/odoc/next/infer/Absint/ProcCfg/module-type-NodeCommonS/IdSet/index.html index c2f6b6d1e55..0ca3af92bc4 100644 --- a/website/static/odoc/next/infer/Absint/ProcCfg/module-type-NodeCommonS/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/ProcCfg/module-type-NodeCommonS/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.ProcCfg.NodeCommonS.IdSet)

Module NodeCommonS.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.ProcCfg.NodeCommonS.IdSet)

Module NodeCommonS.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/ProcCfg/module-type-S/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/ProcCfg/module-type-S/Node/IdSet/index.html index e9327f748a5..2027ade4352 100644 --- a/website/static/odoc/next/infer/Absint/ProcCfg/module-type-S/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/ProcCfg/module-type-S/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.ProcCfg.S.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.ProcCfg.S.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/Scheduler/ReversePostorder/argument-1-CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/Scheduler/ReversePostorder/argument-1-CFG/Node/IdSet/index.html index c86e1bf8eac..223831c5050 100644 --- a/website/static/odoc/next/infer/Absint/Scheduler/ReversePostorder/argument-1-CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/Scheduler/ReversePostorder/argument-1-CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.Scheduler.ReversePostorder.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.Scheduler.ReversePostorder.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/Scheduler/module-type-S/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/Scheduler/module-type-S/CFG/Node/IdSet/index.html index df6f90ced49..bb7c7cd9d10 100644 --- a/website/static/odoc/next/infer/Absint/Scheduler/module-type-S/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/Scheduler/module-type-S/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.Scheduler.S.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.Scheduler.S.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/Sink/module-type-S/Set/index.html b/website/static/odoc/next/infer/Absint/Sink/module-type-S/Set/index.html index 1ee6d45952d..d5da04f8565 100644 --- a/website/static/odoc/next/infer/Absint/Sink/module-type-S/Set/index.html +++ b/website/static/odoc/next/infer/Absint/Sink/module-type-S/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Absint.Sink.S.Set)

Module S.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Absint.Sink.S.Set)

Module S.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/SinkTrace/Make/Sources/Known/index.html b/website/static/odoc/next/infer/Absint/SinkTrace/Make/Sources/Known/index.html index 2b8ff15e61d..09f159feafe 100644 --- a/website/static/odoc/next/infer/Absint/SinkTrace/Make/Sources/Known/index.html +++ b/website/static/odoc/next/infer/Absint/SinkTrace/Make/Sources/Known/index.html @@ -1,2 +1,2 @@ -Known (infer.Absint.SinkTrace.Make.Sources.Known)

Module Sources.Known

Set of sources returned by callees of the current function

type elt = Source.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
+Known (infer.Absint.SinkTrace.Make.Sources.Known)

Module Sources.Known

Set of sources returned by callees of the current function

type elt = Source.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
diff --git a/website/static/odoc/next/infer/Absint/SinkTrace/Make/Sources/Sanitizers/index.html b/website/static/odoc/next/infer/Absint/SinkTrace/Make/Sources/Sanitizers/index.html index d1966b286e4..bdbc0e5ef7a 100644 --- a/website/static/odoc/next/infer/Absint/SinkTrace/Make/Sources/Sanitizers/index.html +++ b/website/static/odoc/next/infer/Absint/SinkTrace/Make/Sources/Sanitizers/index.html @@ -1,2 +1,2 @@ -Sanitizers (infer.Absint.SinkTrace.Make.Sources.Sanitizers)

Module Sources.Sanitizers

Set of sanitizers that have been applied to these sources

type elt = Sanitizer.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
+Sanitizers (infer.Absint.SinkTrace.Make.Sources.Sanitizers)

Module Sources.Sanitizers

Set of sanitizers that have been applied to these sources

type elt = Sanitizer.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
diff --git a/website/static/odoc/next/infer/Absint/SinkTrace/Make/argument-1-TaintTraceElem/Set/index.html b/website/static/odoc/next/infer/Absint/SinkTrace/Make/argument-1-TaintTraceElem/Set/index.html index c29bc771221..242e4406438 100644 --- a/website/static/odoc/next/infer/Absint/SinkTrace/Make/argument-1-TaintTraceElem/Set/index.html +++ b/website/static/odoc/next/infer/Absint/SinkTrace/Make/argument-1-TaintTraceElem/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Absint.SinkTrace.Make.TaintTraceElem.Set)

Module TaintTraceElem.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Absint.SinkTrace.Make.TaintTraceElem.Set)

Module TaintTraceElem.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/SinkTrace/MakeSink/Set/index.html b/website/static/odoc/next/infer/Absint/SinkTrace/MakeSink/Set/index.html index 967a86ef9f6..510a775c618 100644 --- a/website/static/odoc/next/infer/Absint/SinkTrace/MakeSink/Set/index.html +++ b/website/static/odoc/next/infer/Absint/SinkTrace/MakeSink/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Absint.SinkTrace.MakeSink.Set)

Module MakeSink.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Absint.SinkTrace.MakeSink.Set)

Module MakeSink.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/SinkTrace/MakeSink/argument-1-TaintTraceElem/Set/index.html b/website/static/odoc/next/infer/Absint/SinkTrace/MakeSink/argument-1-TaintTraceElem/Set/index.html index 700231f4863..d32b8dc7728 100644 --- a/website/static/odoc/next/infer/Absint/SinkTrace/MakeSink/argument-1-TaintTraceElem/Set/index.html +++ b/website/static/odoc/next/infer/Absint/SinkTrace/MakeSink/argument-1-TaintTraceElem/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Absint.SinkTrace.MakeSink.TaintTraceElem.Set)

Module TaintTraceElem.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Absint.SinkTrace.MakeSink.TaintTraceElem.Set)

Module TaintTraceElem.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/SinkTrace/module-type-S/Sink/Set/index.html b/website/static/odoc/next/infer/Absint/SinkTrace/module-type-S/Sink/Set/index.html index f3d26b95fd1..36b900cebf5 100644 --- a/website/static/odoc/next/infer/Absint/SinkTrace/module-type-S/Sink/Set/index.html +++ b/website/static/odoc/next/infer/Absint/SinkTrace/module-type-S/Sink/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Absint.SinkTrace.S.Sink.Set)

Module Sink.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Absint.SinkTrace.S.Sink.Set)

Module Sink.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/SinkTrace/module-type-S/Source/Set/index.html b/website/static/odoc/next/infer/Absint/SinkTrace/module-type-S/Source/Set/index.html index fbef9310058..3facb1ecaa4 100644 --- a/website/static/odoc/next/infer/Absint/SinkTrace/module-type-S/Source/Set/index.html +++ b/website/static/odoc/next/infer/Absint/SinkTrace/module-type-S/Source/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Absint.SinkTrace.S.Source.Set)

Module Source.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Absint.SinkTrace.S.Source.Set)

Module Source.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/SinkTrace/module-type-S/Sources/Known/index.html b/website/static/odoc/next/infer/Absint/SinkTrace/module-type-S/Sources/Known/index.html index b81a3e45354..aaca6f3f875 100644 --- a/website/static/odoc/next/infer/Absint/SinkTrace/module-type-S/Sources/Known/index.html +++ b/website/static/odoc/next/infer/Absint/SinkTrace/module-type-S/Sources/Known/index.html @@ -1,2 +1,2 @@ -Known (infer.Absint.SinkTrace.S.Sources.Known)

Module Sources.Known

Set of sources returned by callees of the current function

type elt = Source.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
+Known (infer.Absint.SinkTrace.S.Sources.Known)

Module Sources.Known

Set of sources returned by callees of the current function

type elt = Source.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
diff --git a/website/static/odoc/next/infer/Absint/SinkTrace/module-type-S/Sources/Sanitizers/index.html b/website/static/odoc/next/infer/Absint/SinkTrace/module-type-S/Sources/Sanitizers/index.html index 5307b14cef4..101c5ec7963 100644 --- a/website/static/odoc/next/infer/Absint/SinkTrace/module-type-S/Sources/Sanitizers/index.html +++ b/website/static/odoc/next/infer/Absint/SinkTrace/module-type-S/Sources/Sanitizers/index.html @@ -1,2 +1,2 @@ -Sanitizers (infer.Absint.SinkTrace.S.Sources.Sanitizers)

Module Sources.Sanitizers

Set of sanitizers that have been applied to these sources

type elt = Sanitizer.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
+Sanitizers (infer.Absint.SinkTrace.S.Sources.Sanitizers)

Module Sources.Sanitizers

Set of sanitizers that have been applied to these sources

type elt = Sanitizer.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
diff --git a/website/static/odoc/next/infer/Absint/Source/Dummy/Set/index.html b/website/static/odoc/next/infer/Absint/Source/Dummy/Set/index.html index 4dcb29269e6..09d932c717a 100644 --- a/website/static/odoc/next/infer/Absint/Source/Dummy/Set/index.html +++ b/website/static/odoc/next/infer/Absint/Source/Dummy/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Absint.Source.Dummy.Set)

Module Dummy.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Absint.Source.Dummy.Set)

Module Dummy.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/Source/module-type-S/Set/index.html b/website/static/odoc/next/infer/Absint/Source/module-type-S/Set/index.html index b03e291fd2c..51d7fc39d31 100644 --- a/website/static/odoc/next/infer/Absint/Source/module-type-S/Set/index.html +++ b/website/static/odoc/next/infer/Absint/Source/module-type-S/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Absint.Source.S.Set)

Module S.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Absint.Source.S.Set)

Module S.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/TaintTrace/Make/Sources/Known/index.html b/website/static/odoc/next/infer/Absint/TaintTrace/Make/Sources/Known/index.html index d276d5d2de0..95003a4bbbb 100644 --- a/website/static/odoc/next/infer/Absint/TaintTrace/Make/Sources/Known/index.html +++ b/website/static/odoc/next/infer/Absint/TaintTrace/Make/Sources/Known/index.html @@ -1,2 +1,2 @@ -Known (infer.Absint.TaintTrace.Make.Sources.Known)

Module Sources.Known

Set of sources returned by callees of the current function

type elt = Source.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
+Known (infer.Absint.TaintTrace.Make.Sources.Known)

Module Sources.Known

Set of sources returned by callees of the current function

type elt = Source.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
diff --git a/website/static/odoc/next/infer/Absint/TaintTrace/Make/Sources/Sanitizers/index.html b/website/static/odoc/next/infer/Absint/TaintTrace/Make/Sources/Sanitizers/index.html index 29de86dd9f8..7d500c5d4a3 100644 --- a/website/static/odoc/next/infer/Absint/TaintTrace/Make/Sources/Sanitizers/index.html +++ b/website/static/odoc/next/infer/Absint/TaintTrace/Make/Sources/Sanitizers/index.html @@ -1,2 +1,2 @@ -Sanitizers (infer.Absint.TaintTrace.Make.Sources.Sanitizers)

Module Sources.Sanitizers

Set of sanitizers that have been applied to these sources

type elt = Sanitizer.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
+Sanitizers (infer.Absint.TaintTrace.Make.Sources.Sanitizers)

Module Sources.Sanitizers

Set of sanitizers that have been applied to these sources

type elt = Sanitizer.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
diff --git a/website/static/odoc/next/infer/Absint/TaintTrace/Make/argument-1-Spec/Sink/Set/index.html b/website/static/odoc/next/infer/Absint/TaintTrace/Make/argument-1-Spec/Sink/Set/index.html index 82c9863683d..1124f3dd4c7 100644 --- a/website/static/odoc/next/infer/Absint/TaintTrace/Make/argument-1-Spec/Sink/Set/index.html +++ b/website/static/odoc/next/infer/Absint/TaintTrace/Make/argument-1-Spec/Sink/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Absint.TaintTrace.Make.Spec.Sink.Set)

Module Sink.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Absint.TaintTrace.Make.Spec.Sink.Set)

Module Sink.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/TaintTrace/Make/argument-1-Spec/Source/Set/index.html b/website/static/odoc/next/infer/Absint/TaintTrace/Make/argument-1-Spec/Source/Set/index.html index 80c9e61c173..40902c0d854 100644 --- a/website/static/odoc/next/infer/Absint/TaintTrace/Make/argument-1-Spec/Source/Set/index.html +++ b/website/static/odoc/next/infer/Absint/TaintTrace/Make/argument-1-Spec/Source/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Absint.TaintTrace.Make.Spec.Source.Set)

Module Source.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Absint.TaintTrace.Make.Spec.Source.Set)

Module Source.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/TaintTrace/module-type-S/Sink/Set/index.html b/website/static/odoc/next/infer/Absint/TaintTrace/module-type-S/Sink/Set/index.html index bb831117139..635bb7b74ac 100644 --- a/website/static/odoc/next/infer/Absint/TaintTrace/module-type-S/Sink/Set/index.html +++ b/website/static/odoc/next/infer/Absint/TaintTrace/module-type-S/Sink/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Absint.TaintTrace.S.Sink.Set)

Module Sink.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Absint.TaintTrace.S.Sink.Set)

Module Sink.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/TaintTrace/module-type-S/Source/Set/index.html b/website/static/odoc/next/infer/Absint/TaintTrace/module-type-S/Source/Set/index.html index 6104f93b9d3..ebea8b657e0 100644 --- a/website/static/odoc/next/infer/Absint/TaintTrace/module-type-S/Source/Set/index.html +++ b/website/static/odoc/next/infer/Absint/TaintTrace/module-type-S/Source/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Absint.TaintTrace.S.Source.Set)

Module Source.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Absint.TaintTrace.S.Source.Set)

Module Source.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/TaintTrace/module-type-S/Sources/Known/index.html b/website/static/odoc/next/infer/Absint/TaintTrace/module-type-S/Sources/Known/index.html index d60b201471c..21f2dc641ae 100644 --- a/website/static/odoc/next/infer/Absint/TaintTrace/module-type-S/Sources/Known/index.html +++ b/website/static/odoc/next/infer/Absint/TaintTrace/module-type-S/Sources/Known/index.html @@ -1,2 +1,2 @@ -Known (infer.Absint.TaintTrace.S.Sources.Known)

Module Sources.Known

Set of sources returned by callees of the current function

type elt = Source.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
+Known (infer.Absint.TaintTrace.S.Sources.Known)

Module Sources.Known

Set of sources returned by callees of the current function

type elt = Source.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
diff --git a/website/static/odoc/next/infer/Absint/TaintTrace/module-type-S/Sources/Sanitizers/index.html b/website/static/odoc/next/infer/Absint/TaintTrace/module-type-S/Sources/Sanitizers/index.html index 6f33d6d620a..3fd7359292c 100644 --- a/website/static/odoc/next/infer/Absint/TaintTrace/module-type-S/Sources/Sanitizers/index.html +++ b/website/static/odoc/next/infer/Absint/TaintTrace/module-type-S/Sources/Sanitizers/index.html @@ -1,2 +1,2 @@ -Sanitizers (infer.Absint.TaintTrace.S.Sources.Sanitizers)

Module Sources.Sanitizers

Set of sanitizers that have been applied to these sources

type elt = Sanitizer.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
+Sanitizers (infer.Absint.TaintTrace.S.Sources.Sanitizers)

Module Sources.Sanitizers

Set of sanitizers that have been applied to these sources

type elt = Sanitizer.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
diff --git a/website/static/odoc/next/infer/Absint/TaintTrace/module-type-Spec/Sink/Set/index.html b/website/static/odoc/next/infer/Absint/TaintTrace/module-type-Spec/Sink/Set/index.html index e73014b8df0..53eff7804bd 100644 --- a/website/static/odoc/next/infer/Absint/TaintTrace/module-type-Spec/Sink/Set/index.html +++ b/website/static/odoc/next/infer/Absint/TaintTrace/module-type-Spec/Sink/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Absint.TaintTrace.Spec.Sink.Set)

Module Sink.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Absint.TaintTrace.Spec.Sink.Set)

Module Sink.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/TaintTrace/module-type-Spec/Source/Set/index.html b/website/static/odoc/next/infer/Absint/TaintTrace/module-type-Spec/Source/Set/index.html index a7c5f403aa9..a05038032d8 100644 --- a/website/static/odoc/next/infer/Absint/TaintTrace/module-type-Spec/Source/Set/index.html +++ b/website/static/odoc/next/infer/Absint/TaintTrace/module-type-Spec/Source/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Absint.TaintTrace.Spec.Source.Set)

Module Source.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Absint.TaintTrace.Spec.Source.Set)

Module Source.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/TaintTraceElem/module-type-S/Set/index.html b/website/static/odoc/next/infer/Absint/TaintTraceElem/module-type-S/Set/index.html index 5e9ad14fb9f..a495b17cedb 100644 --- a/website/static/odoc/next/infer/Absint/TaintTraceElem/module-type-S/Set/index.html +++ b/website/static/odoc/next/infer/Absint/TaintTraceElem/module-type-S/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Absint.TaintTraceElem.S.Set)

Module S.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Absint.TaintTraceElem.S.Set)

Module S.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/TransferFunctions/module-type-DisjReady/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/TransferFunctions/module-type-DisjReady/CFG/Node/IdSet/index.html index 36d030aa5da..e2ed3ab13bc 100644 --- a/website/static/odoc/next/infer/Absint/TransferFunctions/module-type-DisjReady/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/TransferFunctions/module-type-DisjReady/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.TransferFunctions.DisjReady.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.TransferFunctions.DisjReady.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/TransferFunctions/module-type-HIL/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/TransferFunctions/module-type-HIL/CFG/Node/IdSet/index.html index c2ea5d855ac..7c617c3e043 100644 --- a/website/static/odoc/next/infer/Absint/TransferFunctions/module-type-HIL/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/TransferFunctions/module-type-HIL/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.TransferFunctions.HIL.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.TransferFunctions.HIL.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/TransferFunctions/module-type-S/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/TransferFunctions/module-type-S/CFG/Node/IdSet/index.html index 4c424ff75ca..76042ba0280 100644 --- a/website/static/odoc/next/infer/Absint/TransferFunctions/module-type-S/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/TransferFunctions/module-type-S/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.TransferFunctions.S.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.TransferFunctions.S.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Absint/TransferFunctions/module-type-SIL/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Absint/TransferFunctions/module-type-SIL/CFG/Node/IdSet/index.html index 5cb3ec9c0b4..997634ffe86 100644 --- a/website/static/odoc/next/infer/Absint/TransferFunctions/module-type-SIL/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Absint/TransferFunctions/module-type-SIL/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Absint.TransferFunctions.SIL.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Absint.TransferFunctions.SIL.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/BO/AbsLoc/LocSet/index.html b/website/static/odoc/next/infer/BO/AbsLoc/LocSet/index.html index f3f24ee8ac7..1999109ee0a 100644 --- a/website/static/odoc/next/infer/BO/AbsLoc/LocSet/index.html +++ b/website/static/odoc/next/infer/BO/AbsLoc/LocSet/index.html @@ -1,2 +1,2 @@ -LocSet (infer.BO.AbsLoc.LocSet)

Module AbsLoc.LocSet

include IStdlib.IStd.Caml.Set.S with type elt = Loc.t
type elt = Loc.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+LocSet (infer.BO.AbsLoc.LocSet)

Module AbsLoc.LocSet

include IStdlib.IStd.Caml.Set.S with type elt = Loc.t
type elt = Loc.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/BO/BufferOverrunDomain/ItvThresholds/index.html b/website/static/odoc/next/infer/BO/BufferOverrunDomain/ItvThresholds/index.html index 82ae1a3e11a..d82a07b1165 100644 --- a/website/static/odoc/next/infer/BO/BufferOverrunDomain/ItvThresholds/index.html +++ b/website/static/odoc/next/infer/BO/BufferOverrunDomain/ItvThresholds/index.html @@ -1,2 +1,2 @@ -ItvThresholds (infer.BO.BufferOverrunDomain.ItvThresholds)

Module BufferOverrunDomain.ItvThresholds

Set of integers for threshold widening

include IStdlib.PrettyPrintable.PPSet with type elt = Z.t
include IStdlib.IStd.Caml.Set.S with type elt = Z.t
type elt = Z.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

+ItvThresholds (infer.BO.BufferOverrunDomain.ItvThresholds)

Module BufferOverrunDomain.ItvThresholds

Set of integers for threshold widening

include IStdlib.PrettyPrintable.PPSet with type elt = Z.t
include IStdlib.IStd.Caml.Set.S with type elt = Z.t
type elt = Z.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

diff --git a/website/static/odoc/next/infer/BO/BufferOverrunSemantics/index.html b/website/static/odoc/next/infer/BO/BufferOverrunSemantics/index.html index f0cc8224e16..e855cad1f6a 100644 --- a/website/static/odoc/next/infer/BO/BufferOverrunSemantics/index.html +++ b/website/static/odoc/next/infer/BO/BufferOverrunSemantics/index.html @@ -27,13 +27,13 @@ IR.IntegerWidths.t -> (IR.Pvar.t * IR.Typ.t) list -> (IR.Exp.t * IR.Typ.t) list -> - (IR.Exp.t * IR.Pvar.t * IR.Typ.t * IR.CapturedVar.capture_mode) list -> + (IR.Exp.t * IR.CapturedVar.t) list -> BufferOverrunDomain.Mem.t -> mode:eval_mode -> BufferOverrunDomain.eval_sym_trace

Make eval_sym function for on-demand symbol evaluation

Make eval_sym function of EvalCost mode for on-demand symbol evaluation

module Prune : sig ... end
diff --git a/website/static/odoc/next/infer/BO/FuncPtr/Set/index.html b/website/static/odoc/next/infer/BO/FuncPtr/Set/index.html index 583bbc5b1ea..f1189aaca22 100644 --- a/website/static/odoc/next/infer/BO/FuncPtr/Set/index.html +++ b/website/static/odoc/next/infer/BO/FuncPtr/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.BO.FuncPtr.Set)

Module FuncPtr.Set

include Absint.AbstractDomain.FiniteSetS with type elt = t
include IStdlib.PrettyPrintable.PPSet with type elt = t
include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

type eval_func_ptrs = Symb.SymbolPath.partial -> t
val of_path : Symb.SymbolPath.partial -> t
val of_closure : IR.Exp.closure -> t
val subst : t -> eval_func_ptrs -> t
+Set (infer.BO.FuncPtr.Set)

Module FuncPtr.Set

include Absint.AbstractDomain.FiniteSetS with type elt = t
include IStdlib.PrettyPrintable.PPSet with type elt = t
include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

type eval_func_ptrs = Symb.SymbolPath.partial -> t
val of_path : Symb.SymbolPath.partial -> t
val of_closure : IR.Exp.closure -> t
val subst : t -> eval_func_ptrs -> t
diff --git a/website/static/odoc/next/infer/BO/Symb/SymbolSet/index.html b/website/static/odoc/next/infer/BO/Symb/SymbolSet/index.html index e56f29f5b04..78f329f2bb7 100644 --- a/website/static/odoc/next/infer/BO/Symb/SymbolSet/index.html +++ b/website/static/odoc/next/infer/BO/Symb/SymbolSet/index.html @@ -1,2 +1,2 @@ -SymbolSet (infer.BO.Symb.SymbolSet)

Module Symb.SymbolSet

include IStdlib.PrettyPrintable.PPSet with type elt = Symbol.t
include IStdlib.IStd.Caml.Set.S with type elt = Symbol.t
type elt = Symbol.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
val union3 : t -> t -> t -> t
+SymbolSet (infer.BO.Symb.SymbolSet)

Module Symb.SymbolSet

include IStdlib.PrettyPrintable.PPSet with type elt = Symbol.t
include IStdlib.IStd.Caml.Set.S with type elt = Symbol.t
type elt = Symbol.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
val union3 : t -> t -> t -> t
diff --git a/website/static/odoc/next/infer/Backend/LineageTaint/index.html b/website/static/odoc/next/infer/Backend/LineageTaint/index.html index 9b48b29c24c..1dc138d7e12 100644 --- a/website/static/odoc/next/infer/Backend/LineageTaint/index.html +++ b/website/static/odoc/next/infer/Backend/LineageTaint/index.html @@ -1,2 +1,7 @@ -LineageTaint (infer.Backend.LineageTaint)

Module Backend.LineageTaint

module TaintConfig : sig ... end
val report : TaintConfig.t -> unit
include sig ... end
module Private : sig ... end
+LineageTaint (infer.Backend.LineageTaint)

Module Backend.LineageTaint

module TaintConfig : sig ... end
val export_result : + name:string -> + fileparts:string list -> + 'a Fmt.t -> + 'a -> + unit
include sig ... end
module Private : sig ... end
diff --git a/website/static/odoc/next/infer/CStubs/Fnv64Hash/index.html b/website/static/odoc/next/infer/CStubs/Fnv64Hash/index.html deleted file mode 100644 index 5cb5d88cb45..00000000000 --- a/website/static/odoc/next/infer/CStubs/Fnv64Hash/index.html +++ /dev/null @@ -1,2 +0,0 @@ - -Fnv64Hash (infer.CStubs.Fnv64Hash)

Module CStubs.Fnv64Hash

val fnv64_hash : string -> string
diff --git a/website/static/odoc/next/infer/CStubs/index.html b/website/static/odoc/next/infer/CStubs/index.html deleted file mode 100644 index 729938509bb..00000000000 --- a/website/static/odoc/next/infer/CStubs/index.html +++ /dev/null @@ -1,2 +0,0 @@ - -CStubs (infer.CStubs)

Module CStubs

module Fnv64Hash : sig ... end
diff --git a/website/static/odoc/next/infer/Checkers/AddressTaken/Analyzer/TransferFunctions/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Checkers/AddressTaken/Analyzer/TransferFunctions/CFG/Node/IdSet/index.html index 9709e837281..e26a9c9c49e 100644 --- a/website/static/odoc/next/infer/Checkers/AddressTaken/Analyzer/TransferFunctions/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Checkers/AddressTaken/Analyzer/TransferFunctions/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Checkers.AddressTaken.Analyzer.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

type elt = id
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Checkers.AddressTaken.Analyzer.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

type elt = id
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Checkers/AddressTaken/Domain/index.html b/website/static/odoc/next/infer/Checkers/AddressTaken/Domain/index.html index d0af5400be3..b55e8226c41 100644 --- a/website/static/odoc/next/infer/Checkers/AddressTaken/Domain/index.html +++ b/website/static/odoc/next/infer/Checkers/AddressTaken/Domain/index.html @@ -1,2 +1,2 @@ -Domain (infer.Checkers.AddressTaken.Domain)

Module AddressTaken.Domain

type elt
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
+Domain (infer.Checkers.AddressTaken.Domain)

Module AddressTaken.Domain

type elt
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
diff --git a/website/static/odoc/next/infer/Checkers/AddressTaken/TransferFunctions/argument-1-CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Checkers/AddressTaken/TransferFunctions/argument-1-CFG/Node/IdSet/index.html index 4dc05977d47..7c49a073416 100644 --- a/website/static/odoc/next/infer/Checkers/AddressTaken/TransferFunctions/argument-1-CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Checkers/AddressTaken/TransferFunctions/argument-1-CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Checkers.AddressTaken.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Checkers.AddressTaken.TransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Checkers/AnnotationReachabilityDomain/CallSites/index.html b/website/static/odoc/next/infer/Checkers/AnnotationReachabilityDomain/CallSites/index.html index c983f2ac0bd..0584e46de8a 100644 --- a/website/static/odoc/next/infer/Checkers/AnnotationReachabilityDomain/CallSites/index.html +++ b/website/static/odoc/next/infer/Checkers/AnnotationReachabilityDomain/CallSites/index.html @@ -1,2 +1,2 @@ -CallSites (infer.Checkers.AnnotationReachabilityDomain.CallSites)

Module AnnotationReachabilityDomain.CallSites

include IStdlib.PrettyPrintable.PPSet with type elt = Absint.CallSite.t
include IStdlib.IStd.Caml.Set.S with type elt = Absint.CallSite.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

+CallSites (infer.Checkers.AnnotationReachabilityDomain.CallSites)

Module AnnotationReachabilityDomain.CallSites

include IStdlib.PrettyPrintable.PPSet with type elt = Absint.CallSite.t
include IStdlib.IStd.Caml.Set.S with type elt = Absint.CallSite.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

diff --git a/website/static/odoc/next/infer/Checkers/Control/GuardNodes/index.html b/website/static/odoc/next/infer/Checkers/Control/GuardNodes/index.html index 84b74cdf9ed..4d3524523e1 100644 --- a/website/static/odoc/next/infer/Checkers/Control/GuardNodes/index.html +++ b/website/static/odoc/next/infer/Checkers/Control/GuardNodes/index.html @@ -1,2 +1,2 @@ -GuardNodes (infer.Checkers.Control.GuardNodes)

Module Control.GuardNodes

type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
+GuardNodes (infer.Checkers.Control.GuardNodes)

Module Control.GuardNodes

type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
diff --git a/website/static/odoc/next/infer/Checkers/ImpurityDomain/index.html b/website/static/odoc/next/infer/Checkers/ImpurityDomain/index.html index d2f96a1ac94..fab00a912d6 100644 --- a/website/static/odoc/next/infer/Checkers/ImpurityDomain/index.html +++ b/website/static/odoc/next/infer/Checkers/ImpurityDomain/index.html @@ -9,4 +9,4 @@ Absint.Errlog.loc_trace_elem list
val join : t -> t -> t
val get_modified_immutables_opt : IR.Tenv.t -> t -> - (ModifiedVarMap.t * ModifiedVarMap.t) option
+ (ModifiedVarMap.t * ModifiedVarMap.t) option
diff --git a/website/static/odoc/next/infer/Checkers/Lineage/Edge/index.html b/website/static/odoc/next/infer/Checkers/Lineage/Edge/index.html index bddb8128a94..ebf7311ee2f 100644 --- a/website/static/odoc/next/infer/Checkers/Lineage/Edge/index.html +++ b/website/static/odoc/next/infer/Checkers/Lineage/Edge/index.html @@ -1,2 +1,2 @@ -Edge (infer.Checkers.Lineage.Edge)

Module Lineage.Edge

module Kind : sig ... end
type kind = Kind.t
type t
val kind : t -> kind
+Edge (infer.Checkers.Lineage.Edge)

Module Lineage.Edge

module Kind : sig ... end
type kind = Kind.t
type t
val pp : t Fmt.t
val kind : t -> kind
val location : t -> IBase.Location.t
val procname : t -> IR.Procname.t
diff --git a/website/static/odoc/next/infer/Checkers/Lineage/PPNode/index.html b/website/static/odoc/next/infer/Checkers/Lineage/PPNode/index.html index 4076be5bf5b..4afa6f6622a 100644 --- a/website/static/odoc/next/infer/Checkers/Lineage/PPNode/index.html +++ b/website/static/odoc/next/infer/Checkers/Lineage/PPNode/index.html @@ -1,2 +1,2 @@ -PPNode (infer.Checkers.Lineage.PPNode)

Module Lineage.PPNode

type t
+PPNode (infer.Checkers.Lineage.PPNode)

Module Lineage.PPNode

type t
val pp : t Fmt.t
diff --git a/website/static/odoc/next/infer/Checkers/Lineage/Unified/Dot/index.html b/website/static/odoc/next/infer/Checkers/Lineage/Unified/Dot/index.html index 69af3557c98..8c5ce2705c0 100644 --- a/website/static/odoc/next/infer/Checkers/Lineage/Unified/Dot/index.html +++ b/website/static/odoc/next/infer/Checkers/Lineage/Unified/Dot/index.html @@ -1,2 +1,2 @@ -Dot (infer.Checkers.Lineage.Unified.Dot)

Module Unified.Dot

val output_graph : Stdlib.out_channel -> G.t -> unit
+Dot (infer.Checkers.Lineage.Unified.Dot)

Module Unified.Dot

val pp : G.t Fmt.t
diff --git a/website/static/odoc/next/infer/Checkers/Lineage/Unified/UVertex/index.html b/website/static/odoc/next/infer/Checkers/Lineage/Unified/UVertex/index.html index 20437c784d5..7252de31f06 100644 --- a/website/static/odoc/next/infer/Checkers/Lineage/Unified/UVertex/index.html +++ b/website/static/odoc/next/infer/Checkers/Lineage/Unified/UVertex/index.html @@ -2,4 +2,4 @@ UVertex (infer.Checkers.Lineage.Unified.UVertex)

Module Unified.UVertex

type v =
  1. | Local of Local.t * PPNode.t
  2. | Argument of int * Checkers.LineageShape.StdModules.FieldPath.t
  3. | Return of Checkers.LineageShape.StdModules.FieldPath.t
  4. | Captured of int
  5. | Function
val sexp_of_v : v -> Sexplib0.Sexp.t
val v_of_sexp : Sexplib0.Sexp.t -> v
val compare_v : v -> v -> int
val equal_v : v -> v -> bool
val hash_fold_v : Ppx_hash_lib.Std.Hash.state -> v -> - Ppx_hash_lib.Std.Hash.state
val hash_v : v -> Ppx_hash_lib.Std.Hash.hash_value
type t = {
  1. procname : IR.Procname.t;
  2. vertex : v;
}
include Sexplib0.Sexpable.S with type t := t
val t_of_sexp : Sexplib0__.Sexp.t -> t
val sexp_of_t : t -> Sexplib0__.Sexp.t
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
include Ppx_hash_lib.Hashable.S with type t := t
val hash_fold_t : t Base__Ppx_hash_lib.hash_fold
val hash : t -> Base__Ppx_hash_lib.Std.Hash.hash_value
+ Ppx_hash_lib.Std.Hash.state
val hash_v : v -> Ppx_hash_lib.Std.Hash.hash_value
type t = {
  1. procname : IR.Procname.t;
  2. vertex : v;
}
include Sexplib0.Sexpable.S with type t := t
val t_of_sexp : Sexplib0__.Sexp.t -> t
val sexp_of_t : t -> Sexplib0__.Sexp.t
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
include Ppx_hash_lib.Hashable.S with type t := t
val hash_fold_t : t Base__Ppx_hash_lib.hash_fold
val hash : t -> Base__Ppx_hash_lib.Std.Hash.hash_value
val pp : t Fmt.t
diff --git a/website/static/odoc/next/infer/Checkers/Liveness/PreAnalysisTransferFunctions/argument-1-CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/Checkers/Liveness/PreAnalysisTransferFunctions/argument-1-CFG/Node/IdSet/index.html index a60472d280d..9f1987366ad 100644 --- a/website/static/odoc/next/infer/Checkers/Liveness/PreAnalysisTransferFunctions/argument-1-CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/Checkers/Liveness/PreAnalysisTransferFunctions/argument-1-CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.Checkers.Liveness.PreAnalysisTransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+IdSet (infer.Checkers.Liveness.PreAnalysisTransferFunctions.CFG.Node.IdSet)

Module Node.IdSet

include IStdlib.IStd.Caml.Set.S with type elt = id
type elt = id
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Checkers/LoopInvariant/InvariantVars/index.html b/website/static/odoc/next/infer/Checkers/LoopInvariant/InvariantVars/index.html index 0090e2c8ac9..b29ea0b99a9 100644 --- a/website/static/odoc/next/infer/Checkers/LoopInvariant/InvariantVars/index.html +++ b/website/static/odoc/next/infer/Checkers/LoopInvariant/InvariantVars/index.html @@ -1,2 +1,2 @@ -InvariantVars (infer.Checkers.LoopInvariant.InvariantVars)

Module LoopInvariant.InvariantVars

type elt = IR.Var.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
+InvariantVars (infer.Checkers.LoopInvariant.InvariantVars)

Module LoopInvariant.InvariantVars

type elt = IR.Var.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
diff --git a/website/static/odoc/next/infer/Checkers/LoopInvariant/LoopNodes/index.html b/website/static/odoc/next/infer/Checkers/LoopInvariant/LoopNodes/index.html index 844898da709..22a024fb813 100644 --- a/website/static/odoc/next/infer/Checkers/LoopInvariant/LoopNodes/index.html +++ b/website/static/odoc/next/infer/Checkers/LoopInvariant/LoopNodes/index.html @@ -1,2 +1,2 @@ -LoopNodes (infer.Checkers.LoopInvariant.LoopNodes)

Module LoopInvariant.LoopNodes

type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
+LoopNodes (infer.Checkers.LoopInvariant.LoopNodes)

Module LoopInvariant.LoopNodes

type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
diff --git a/website/static/odoc/next/infer/Checkers/LoopInvariant/VarSet/index.html b/website/static/odoc/next/infer/Checkers/LoopInvariant/VarSet/index.html index 6141779056b..ef1671ffaae 100644 --- a/website/static/odoc/next/infer/Checkers/LoopInvariant/VarSet/index.html +++ b/website/static/odoc/next/infer/Checkers/LoopInvariant/VarSet/index.html @@ -1,2 +1,2 @@ -VarSet (infer.Checkers.LoopInvariant.VarSet)

Module LoopInvariant.VarSet

type elt = IR.Var.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
+VarSet (infer.Checkers.LoopInvariant.VarSet)

Module LoopInvariant.VarSet

type elt = IR.Var.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
diff --git a/website/static/odoc/next/infer/Checkers/LoopInvariant/VarsInLoop/index.html b/website/static/odoc/next/infer/Checkers/LoopInvariant/VarsInLoop/index.html index 64944e24e74..68f58a4ef78 100644 --- a/website/static/odoc/next/infer/Checkers/LoopInvariant/VarsInLoop/index.html +++ b/website/static/odoc/next/infer/Checkers/LoopInvariant/VarsInLoop/index.html @@ -1,2 +1,2 @@ -VarsInLoop (infer.Checkers.LoopInvariant.VarsInLoop)

Module LoopInvariant.VarsInLoop

type elt = IR.Var.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
+VarsInLoop (infer.Checkers.LoopInvariant.VarsInLoop)

Module LoopInvariant.VarsInLoop

type elt = IR.Var.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
diff --git a/website/static/odoc/next/infer/Checkers/PrintfArgs/index.html b/website/static/odoc/next/infer/Checkers/PrintfArgs/index.html deleted file mode 100644 index 89716fbba1a..00000000000 --- a/website/static/odoc/next/infer/Checkers/PrintfArgs/index.html +++ /dev/null @@ -1,2 +0,0 @@ - -PrintfArgs (infer.Checkers.PrintfArgs)

Module Checkers.PrintfArgs

val checker : Absint.IntraproceduralAnalysis.t -> unit
diff --git a/website/static/odoc/next/infer/Checkers/ReachingDefs/Defs/index.html b/website/static/odoc/next/infer/Checkers/ReachingDefs/Defs/index.html index e958f5b107b..a4c2aec3df0 100644 --- a/website/static/odoc/next/infer/Checkers/ReachingDefs/Defs/index.html +++ b/website/static/odoc/next/infer/Checkers/ReachingDefs/Defs/index.html @@ -1,2 +1,2 @@ -Defs (infer.Checkers.ReachingDefs.Defs)

Module ReachingDefs.Defs

The node in which the reaching definition x := e is defined.

A definition x :=e, declared at node N, reaches the current node if there is a path from node N to the current node such that x is not modified along the path *

type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
+Defs (infer.Checkers.ReachingDefs.Defs)

Module ReachingDefs.Defs

The node in which the reaching definition x := e is defined.

A definition x :=e, declared at node N, reaches the current node if there is a path from node N to the current node such that x is not modified along the path *

type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
diff --git a/website/static/odoc/next/infer/Checkers/SiofDomain/VarNames/index.html b/website/static/odoc/next/infer/Checkers/SiofDomain/VarNames/index.html index f743616e009..65f3f334d1c 100644 --- a/website/static/odoc/next/infer/Checkers/SiofDomain/VarNames/index.html +++ b/website/static/odoc/next/infer/Checkers/SiofDomain/VarNames/index.html @@ -1,2 +1,2 @@ -VarNames (infer.Checkers.SiofDomain.VarNames)

Module SiofDomain.VarNames

type elt = IStdlib.IStd.String.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
+VarNames (infer.Checkers.SiofDomain.VarNames)

Module SiofDomain.VarNames

type elt = IStdlib.IStd.String.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
diff --git a/website/static/odoc/next/infer/Checkers/SiofTrace/GlobalVarSet/index.html b/website/static/odoc/next/infer/Checkers/SiofTrace/GlobalVarSet/index.html index 54a343bddf4..c73ca7cfbb0 100644 --- a/website/static/odoc/next/infer/Checkers/SiofTrace/GlobalVarSet/index.html +++ b/website/static/odoc/next/infer/Checkers/SiofTrace/GlobalVarSet/index.html @@ -1,2 +1,2 @@ -GlobalVarSet (infer.Checkers.SiofTrace.GlobalVarSet)

Module SiofTrace.GlobalVarSet

include IStdlib.IStd.Caml.Set.S with type elt = IR.Pvar.t
type elt = IR.Pvar.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+GlobalVarSet (infer.Checkers.SiofTrace.GlobalVarSet)

Module SiofTrace.GlobalVarSet

include IStdlib.IStd.Caml.Set.S with type elt = IR.Pvar.t
type elt = IR.Pvar.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Checkers/SiofTrace/Sink/Set/index.html b/website/static/odoc/next/infer/Checkers/SiofTrace/Sink/Set/index.html index fa52b90d006..9fa43b98fdc 100644 --- a/website/static/odoc/next/infer/Checkers/SiofTrace/Sink/Set/index.html +++ b/website/static/odoc/next/infer/Checkers/SiofTrace/Sink/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Checkers.SiofTrace.Sink.Set)

Module Sink.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Checkers.SiofTrace.Sink.Set)

Module Sink.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Checkers/SiofTrace/Source/Set/index.html b/website/static/odoc/next/infer/Checkers/SiofTrace/Source/Set/index.html index 199e26f9edd..877087a3f98 100644 --- a/website/static/odoc/next/infer/Checkers/SiofTrace/Source/Set/index.html +++ b/website/static/odoc/next/infer/Checkers/SiofTrace/Source/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Checkers.SiofTrace.Source.Set)

Module Source.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Checkers.SiofTrace.Source.Set)

Module Source.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Checkers/SiofTrace/Sources/Known/index.html b/website/static/odoc/next/infer/Checkers/SiofTrace/Sources/Known/index.html index 32ac6cd752b..6f54aa17f46 100644 --- a/website/static/odoc/next/infer/Checkers/SiofTrace/Sources/Known/index.html +++ b/website/static/odoc/next/infer/Checkers/SiofTrace/Sources/Known/index.html @@ -1,2 +1,2 @@ -Known (infer.Checkers.SiofTrace.Sources.Known)

Module Sources.Known

Set of sources returned by callees of the current function

type elt = Source.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
+Known (infer.Checkers.SiofTrace.Sources.Known)

Module Sources.Known

Set of sources returned by callees of the current function

type elt = Source.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
diff --git a/website/static/odoc/next/infer/Checkers/SiofTrace/Sources/Sanitizers/index.html b/website/static/odoc/next/infer/Checkers/SiofTrace/Sources/Sanitizers/index.html index 523a0e5b559..eb6a080951b 100644 --- a/website/static/odoc/next/infer/Checkers/SiofTrace/Sources/Sanitizers/index.html +++ b/website/static/odoc/next/infer/Checkers/SiofTrace/Sources/Sanitizers/index.html @@ -1,2 +1,2 @@ -Sanitizers (infer.Checkers.SiofTrace.Sources.Sanitizers)

Module Sources.Sanitizers

Set of sanitizers that have been applied to these sources

type elt = Sanitizer.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
+Sanitizers (infer.Checkers.SiofTrace.Sources.Sanitizers)

Module Sources.Sanitizers

Set of sanitizers that have been applied to these sources

type elt = Sanitizer.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool
diff --git a/website/static/odoc/next/infer/Checkers/index.html b/website/static/odoc/next/infer/Checkers/index.html index 0e5420a3f68..a7b7a8d3801 100644 --- a/website/static/odoc/next/infer/Checkers/index.html +++ b/website/static/odoc/next/infer/Checkers/index.html @@ -1,2 +1,2 @@ -Checkers (infer.Checkers)

Module Checkers

module AddressTaken : sig ... end
module AnnotationReachability : sig ... end
module AnnotationReachabilityDomain : sig ... end
module Control : sig ... end
module DisjunctiveDemo : sig ... end
module Dominators : sig ... end
module ExternalConfigImpactData : sig ... end
module FragmentRetainsViewChecker : sig ... end
module Impurity : sig ... end
module ImpurityDomain : sig ... end
module InefficientKeysetIterator : sig ... end
module Lineage : sig ... end
module LineageBase : sig ... end
module LineageShape : sig ... end
module LithoDomain : sig ... end
module Liveness : sig ... end
module LoopInvariant : sig ... end
module Loop_control : sig ... end
module ParameterNotNullChecked : sig ... end

Checker for when an Objective-C block is a parameter of a function or method, and it's executed in the method's body without being checked for null first.

module PrintfArgs : sig ... end
module PurityAnalysis : sig ... end
module PurityChecker : sig ... end
module PurityDomain : sig ... end
module PurityModels : sig ... end
module ReachingDefs : sig ... end
module RequiredProps : sig ... end
module ScopeLeakage : sig ... end
module SelfInBlock : sig ... end
module SilValidation : sig ... end
module Siof : sig ... end
module SiofDomain : sig ... end
module SiofTrace : sig ... end
+Checkers (infer.Checkers)

Module Checkers

module AddressTaken : sig ... end
module AnnotationReachability : sig ... end
module AnnotationReachabilityDomain : sig ... end
module Control : sig ... end
module DisjunctiveDemo : sig ... end
module Dominators : sig ... end
module ExternalConfigImpactData : sig ... end
module FragmentRetainsViewChecker : sig ... end
module Impurity : sig ... end
module ImpurityDomain : sig ... end
module InefficientKeysetIterator : sig ... end
module Lineage : sig ... end
module LineageBase : sig ... end
module LineageShape : sig ... end
module LithoDomain : sig ... end
module Liveness : sig ... end
module LoopInvariant : sig ... end
module Loop_control : sig ... end
module ParameterNotNullChecked : sig ... end

Checker for when an Objective-C block is a parameter of a function or method, and it's executed in the method's body without being checked for null first.

module PurityAnalysis : sig ... end
module PurityChecker : sig ... end
module PurityDomain : sig ... end
module PurityModels : sig ... end
module ReachingDefs : sig ... end
module RequiredProps : sig ... end
module ScopeLeakage : sig ... end
module SelfInBlock : sig ... end
module SilValidation : sig ... end
module Siof : sig ... end
module SiofDomain : sig ... end
module SiofTrace : sig ... end
diff --git a/website/static/odoc/next/infer/ClangFrontend/AstToRangeMap/index.html b/website/static/odoc/next/infer/ClangFrontend/AstToRangeMap/index.html deleted file mode 100644 index 9a2ee7c1871..00000000000 --- a/website/static/odoc/next/infer/ClangFrontend/AstToRangeMap/index.html +++ /dev/null @@ -1,6 +0,0 @@ - -AstToRangeMap (infer.ClangFrontend.AstToRangeMap)

Module ClangFrontend.AstToRangeMap

diff --git a/website/static/odoc/next/infer/ClangFrontend/CAst_utils/index.html b/website/static/odoc/next/infer/ClangFrontend/CAst_utils/index.html index 30c835a91ad..d168fdac07b 100644 --- a/website/static/odoc/next/infer/ClangFrontend/CAst_utils/index.html +++ b/website/static/odoc/next/infer/ClangFrontend/CAst_utils/index.html @@ -70,9 +70,7 @@ ATDGenerated.Clang_ast_t.decl -> ATDGenerated.Clang_ast_t.type_ptr list
val is_no_escape_block_arg : ATDGenerated.Clang_ast_t.decl -> bool
val is_cpp_implicit_decl : ATDGenerated.Clang_ast_t.decl -> bool
val get_superclass_curr_class_objc_from_decl : ATDGenerated.Clang_ast_t.decl -> - ATDGenerated.Clang_ast_t.decl_ref option
val get_method_body_opt : - ATDGenerated.Clang_ast_t.decl -> - ATDGenerated.Clang_ast_t.stmt option
val get_captured_mode : + ATDGenerated.Clang_ast_t.decl_ref option
val get_captured_mode : lci_capture_this:bool -> lci_capture_kind: [< `LCK_ByCopy | `LCK_ByRef | `LCK_StarThis | `LCK_This | `LCK_VLAType ] -> diff --git a/website/static/odoc/next/infer/ClangFrontend/CContext/CXXTemporarySet/index.html b/website/static/odoc/next/infer/ClangFrontend/CContext/CXXTemporarySet/index.html index 44159664aa8..6ed378bb741 100644 --- a/website/static/odoc/next/infer/ClangFrontend/CContext/CXXTemporarySet/index.html +++ b/website/static/odoc/next/infer/ClangFrontend/CContext/CXXTemporarySet/index.html @@ -1,2 +1,2 @@ -CXXTemporarySet (infer.ClangFrontend.CContext.CXXTemporarySet)

Module CContext.CXXTemporarySet

include IStdlib.IStd.Caml.Set.S with type elt = cxx_temporary
type elt = cxx_temporary
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+CXXTemporarySet (infer.ClangFrontend.CContext.CXXTemporarySet)

Module CContext.CXXTemporarySet

include IStdlib.IStd.Caml.Set.S with type elt = cxx_temporary
type elt = cxx_temporary
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/ClangFrontend/CLocation/index.html b/website/static/odoc/next/infer/ClangFrontend/CLocation/index.html index 557bc1e80b5..b28431681e7 100644 --- a/website/static/odoc/next/infer/ClangFrontend/CLocation/index.html +++ b/website/static/odoc/next/infer/ClangFrontend/CLocation/index.html @@ -14,7 +14,4 @@ IBase.Location.t

picks the start of the source range by default

+ IBase.Location.t diff --git a/website/static/odoc/next/infer/ClangFrontend/CMethod_trans/index.html b/website/static/odoc/next/infer/ClangFrontend/CMethod_trans/index.html index cd3eed8a4b2..e3e2ad2b7e4 100644 --- a/website/static/odoc/next/infer/ClangFrontend/CMethod_trans/index.html +++ b/website/static/odoc/next/infer/ClangFrontend/CMethod_trans/index.html @@ -14,7 +14,7 @@ IR.Tenv.t -> CMethodSignature.t -> ATDGenerated.Clang_ast_t.stmt list -> - (IR.Pvar.t * IR.Typ.t * IR.CapturedVar.capture_mode) list -> + IR.CapturedVar.t list -> bool
val create_attributes : ?loc_instantiated:IBase.Location.t -> ?set_objc_accessor_attr:bool -> @@ -22,7 +22,6 @@ IR.Tenv.t -> CMethodSignature.t -> ATDGenerated.Clang_ast_t.stmt list -> - (IR.Pvar.t * IR.Typ.t * IR.CapturedVar.capture_mode) list -> IR.ProcAttributes.t
val create_external_procdesc : CFrontend_config.translation_unit_context -> IR.Cfg.t -> @@ -45,7 +44,7 @@ CMethodSignature.t option -> IR.Procname.t option
val create_procdesc_with_pointer : ?is_cpp_lambda_call_operator:bool -> - ?captured_vars:(IR.Pvar.t * IR.Typ.t * IR.CapturedVar.capture_mode) list -> + ?captured_vars:IR.CapturedVar.t list -> CContext.t -> ATDGenerated.Clang_ast_t.pointer -> IR.Typ.Name.t option -> @@ -53,7 +52,7 @@ IR.Procname.t
diff --git a/website/static/odoc/next/infer/ClangFrontend/CModule_type/index.html b/website/static/odoc/next/infer/ClangFrontend/CModule_type/index.html index fe7d0a3b52b..cce2a87891a 100644 --- a/website/static/odoc/next/infer/ClangFrontend/CModule_type/index.html +++ b/website/static/odoc/next/infer/ClangFrontend/CModule_type/index.html @@ -1,2 +1,2 @@ -CModule_type (infer.ClangFrontend.CModule_type)

Module ClangFrontend.CModule_type

type block_data = {
  1. captured_vars : (IR.Pvar.t * IR.Typ.t * IR.CapturedVar.capture_mode) list;
  2. context : CContext.t;
  3. block_as_arg_attributes : IR.ProcAttributes.block_as_arg_attributes option;
  4. procname : IR.Procname.t;
  5. return_type : ATDGenerated.Clang_ast_t.qual_type;
}
module type CTranslation = sig ... end

Translates instructions: (statements and expressions) from the ast into sil

module type CFrontend = sig ... end
+CModule_type (infer.ClangFrontend.CModule_type)

Module ClangFrontend.CModule_type

type block_data = {
  1. captured_vars : IR.CapturedVar.t list;
  2. context : CContext.t;
  3. block_as_arg_attributes : IR.ProcAttributes.block_as_arg_attributes option;
  4. procname : IR.Procname.t;
  5. return_type : ATDGenerated.Clang_ast_t.qual_type;
}
module type CTranslation = sig ... end

Translates instructions: (statements and expressions) from the ast into sil

module type CFrontend = sig ... end
diff --git a/website/static/odoc/next/infer/ClangFrontend/CVar_decl/index.html b/website/static/odoc/next/infer/ClangFrontend/CVar_decl/index.html index 094f8d0b04c..e94c4635443 100644 --- a/website/static/odoc/next/infer/ClangFrontend/CVar_decl/index.html +++ b/website/static/odoc/next/infer/ClangFrontend/CVar_decl/index.html @@ -18,11 +18,11 @@ ATDGenerated.Clang_ast_t.source_range -> IR.Procname.t -> ATDGenerated.Clang_ast_t.decl_ref -> - (IR.Pvar.t * IR.Typ.t * bool) option
val captured_vars_from_block_info : + (IR.Pvar.t * IR.Typ.t * bool * IR.Procname.t option) option
val mk_temp_sil_var : IR.Procdesc.t -> name:string -> IR.Pvar.t
val mk_temp_sil_var_for_expr : + (IR.Pvar.t * IR.Typ.t * bool * IR.Procname.t option) list
val mk_temp_sil_var : IR.Procdesc.t -> name:string -> IR.Pvar.t
val mk_temp_sil_var_for_expr : CContext.t -> name:string -> clang_pointer:int -> diff --git a/website/static/odoc/next/infer/ClangFrontend/ProcessAST/index.html b/website/static/odoc/next/infer/ClangFrontend/ProcessAST/index.html deleted file mode 100644 index f2de776fce9..00000000000 --- a/website/static/odoc/next/infer/ClangFrontend/ProcessAST/index.html +++ /dev/null @@ -1,5 +0,0 @@ - -ProcessAST (infer.ClangFrontend.ProcessAST)

Module ClangFrontend.ProcessAST

diff --git a/website/static/odoc/next/infer/ClangFrontend/index.html b/website/static/odoc/next/infer/ClangFrontend/index.html index 1a5d2842952..c7340b1fb69 100644 --- a/website/static/odoc/next/infer/ClangFrontend/index.html +++ b/website/static/odoc/next/infer/ClangFrontend/index.html @@ -1,2 +1,2 @@ -ClangFrontend (infer.ClangFrontend)

Module ClangFrontend

module AstToRangeMap : sig ... end
module Ast_expressions : sig ... end

This module creates extra ast constructs that are needed for the translation

module CAddImplicitDeallocImpl : sig ... end
module CAddImplicitGettersSetters : sig ... end
module CArithmetic_trans : sig ... end

Utility module for translating unary, binary, and atomic operations and compound assignments

module CAst_utils : sig ... end

Functions for transformations of ast nodes

module CContext : sig ... end

Contains current class and current method to be translated as well as local variables, and the cfg, and tenv corresponding to the current file.

module CEnum_decl : sig ... end

Translate an enumeration declaration by adding it to the tenv and

module CField_decl : sig ... end

Utility module to retrieve fields of structs of classes

module CFrontend : sig ... end
module CFrontend_config : sig ... end

Module that contains constants and global state used in the frontend

module CFrontend_decl : sig ... end

Translate declarations *

module CFrontend_errors : sig ... end
module CGeneral_utils : sig ... end

General utility functions such as functions on lists

module CLocation : sig ... end

Module for function to retrieve the location (file, line, etc) of instructions

module CMethodProperties : sig ... end

Functions for extracting properties of functions or method declarations

module CMethodSignature : sig ... end

Define the signature of a method consisting of its name, its arguments, return type, location and whether its an instance method.

module CMethod_trans : sig ... end

Methods for creating a procdesc from a method or function declaration and for resolving a method call and finding the right callee

module CMockPointerSubst : sig ... end
module CModule_type : sig ... end
module CReplaceDynamicDispatch : sig ... end
module CScope : sig ... end
module CStructUtils : sig ... end
module CTrans : sig ... end
module CTrans_models : sig ... end
module CTrans_utils : sig ... end
module CType : sig ... end

Utility module for retrieving types

module CType_decl : sig ... end
module CType_to_sil_type : sig ... end
module CVar_decl : sig ... end

Process variable declarations by saving them as local or global variables.

module CViewControllerLifecycle : sig ... end
module Capture : sig ... end
module ClangCommand : sig ... end
module ClangPointers : sig ... end
module ClangQuotes : sig ... end

module for escaping clang arguments on the command line and put them into files

module ClangWrapper : sig ... end
module Clang_ast_extend : sig ... end
module CppLambdaCalls : sig ... end
module ObjcCategory_decl : sig ... end

In this module an ObjC category declaration or implementation is processed. The category

module ObjcInterface_decl : sig ... end

In this module an ObjC interface declaration is processed. The class is saved in the tenv as a struct with the corresponding fields, potential superclass and list of defined methods

module ObjcMethod_decl : sig ... end
module ObjcProtocol_decl : sig ... end

In this module an ObjC protocol declaration or implementation is processed. The protocol is saved in the tenv as a struct with the corresponding methods

module ProcessAST : sig ... end
module SwitchCase : sig ... end
+ClangFrontend (infer.ClangFrontend)

Module ClangFrontend

module Ast_expressions : sig ... end

This module creates extra ast constructs that are needed for the translation

module CAddImplicitDeallocImpl : sig ... end
module CAddImplicitGettersSetters : sig ... end
module CArithmetic_trans : sig ... end

Utility module for translating unary, binary, and atomic operations and compound assignments

module CAst_utils : sig ... end

Functions for transformations of ast nodes

module CContext : sig ... end

Contains current class and current method to be translated as well as local variables, and the cfg, and tenv corresponding to the current file.

module CEnum_decl : sig ... end

Translate an enumeration declaration by adding it to the tenv and

module CField_decl : sig ... end

Utility module to retrieve fields of structs of classes

module CFrontend : sig ... end
module CFrontend_config : sig ... end

Module that contains constants and global state used in the frontend

module CFrontend_decl : sig ... end

Translate declarations *

module CFrontend_errors : sig ... end
module CGeneral_utils : sig ... end

General utility functions such as functions on lists

module CLocation : sig ... end

Module for function to retrieve the location (file, line, etc) of instructions

module CMethodProperties : sig ... end

Functions for extracting properties of functions or method declarations

module CMethodSignature : sig ... end

Define the signature of a method consisting of its name, its arguments, return type, location and whether its an instance method.

module CMethod_trans : sig ... end

Methods for creating a procdesc from a method or function declaration and for resolving a method call and finding the right callee

module CMockPointerSubst : sig ... end
module CModule_type : sig ... end
module CReplaceDynamicDispatch : sig ... end
module CScope : sig ... end
module CStructUtils : sig ... end
module CTrans : sig ... end
module CTrans_models : sig ... end
module CTrans_utils : sig ... end
module CType : sig ... end

Utility module for retrieving types

module CType_decl : sig ... end
module CType_to_sil_type : sig ... end
module CVar_decl : sig ... end

Process variable declarations by saving them as local or global variables.

module CViewControllerLifecycle : sig ... end
module Capture : sig ... end
module ClangCommand : sig ... end
module ClangPointers : sig ... end
module ClangQuotes : sig ... end

module for escaping clang arguments on the command line and put them into files

module ClangWrapper : sig ... end
module Clang_ast_extend : sig ... end
module CppLambdaCalls : sig ... end
module ObjcCategory_decl : sig ... end

In this module an ObjC category declaration or implementation is processed. The category

module ObjcInterface_decl : sig ... end

In this module an ObjC interface declaration is processed. The class is saved in the tenv as a struct with the corresponding fields, potential superclass and list of defined methods

module ObjcMethod_decl : sig ... end
module ObjcProtocol_decl : sig ... end

In this module an ObjC protocol declaration or implementation is processed. The protocol is saved in the tenv as a struct with the corresponding methods

module SwitchCase : sig ... end
diff --git a/website/static/odoc/next/infer/Concurrency/RacerDDomain/AccessDomain/index.html b/website/static/odoc/next/infer/Concurrency/RacerDDomain/AccessDomain/index.html index 3d84d95b4d6..d88687fd27f 100644 --- a/website/static/odoc/next/infer/Concurrency/RacerDDomain/AccessDomain/index.html +++ b/website/static/odoc/next/infer/Concurrency/RacerDDomain/AccessDomain/index.html @@ -1,2 +1,2 @@ -AccessDomain (infer.Concurrency.RacerDDomain.AccessDomain)

Module RacerDDomain.AccessDomain

include IStdlib.PrettyPrintable.PPSet with type elt = AccessSnapshot.t
include IStdlib.IStd.Caml.Set.S with type elt = AccessSnapshot.t
type elt = AccessSnapshot.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

+AccessDomain (infer.Concurrency.RacerDDomain.AccessDomain)

Module RacerDDomain.AccessDomain

include IStdlib.PrettyPrintable.PPSet with type elt = AccessSnapshot.t
include IStdlib.IStd.Caml.Set.S with type elt = AccessSnapshot.t
type elt = AccessSnapshot.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

diff --git a/website/static/odoc/next/infer/Concurrency/RacerDDomain/AccessSnapshot/FiniteSet/index.html b/website/static/odoc/next/infer/Concurrency/RacerDDomain/AccessSnapshot/FiniteSet/index.html index 40269aa0e8e..ae345a7a377 100644 --- a/website/static/odoc/next/infer/Concurrency/RacerDDomain/AccessSnapshot/FiniteSet/index.html +++ b/website/static/odoc/next/infer/Concurrency/RacerDDomain/AccessSnapshot/FiniteSet/index.html @@ -1,2 +1,2 @@ -FiniteSet (infer.Concurrency.RacerDDomain.AccessSnapshot.FiniteSet)

Module AccessSnapshot.FiniteSet

A powerset of traces.

include Absint.AbstractDomain.FiniteSetS with type elt = t
include IStdlib.PrettyPrintable.PPSet with type elt = t
include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

val with_callsite : t -> Absint.CallSite.t -> t

Push given callsite onto all traces in set. Cf TraceElem.with_callsite

+FiniteSet (infer.Concurrency.RacerDDomain.AccessSnapshot.FiniteSet)

Module AccessSnapshot.FiniteSet

A powerset of traces.

include Absint.AbstractDomain.FiniteSetS with type elt = t
include IStdlib.PrettyPrintable.PPSet with type elt = t
include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

val with_callsite : t -> Absint.CallSite.t -> t

Push given callsite onto all traces in set. Cf TraceElem.with_callsite

diff --git a/website/static/odoc/next/infer/Concurrency/StarvationDomain/Acquisitions/index.html b/website/static/odoc/next/infer/Concurrency/StarvationDomain/Acquisitions/index.html index c79e623db2b..b0b04035444 100644 --- a/website/static/odoc/next/infer/Concurrency/StarvationDomain/Acquisitions/index.html +++ b/website/static/odoc/next/infer/Concurrency/StarvationDomain/Acquisitions/index.html @@ -1,2 +1,2 @@ -Acquisitions (infer.Concurrency.StarvationDomain.Acquisitions)

Module StarvationDomain.Acquisitions

A set of lock acquisitions with source locations and procnames.

include IStdlib.PrettyPrintable.PPSet with type elt = Acquisition.t
include IStdlib.IStd.Caml.Set.S with type elt = Acquisition.t
type elt = Acquisition.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
val lock_is_held : Lock.t -> t -> bool

is the given lock in the set

val lock_is_held_in_other_thread : IR.Tenv.t -> Lock.t -> t -> bool

is the given lock held, modulo memory abstraction across threads

+Acquisitions (infer.Concurrency.StarvationDomain.Acquisitions)

Module StarvationDomain.Acquisitions

A set of lock acquisitions with source locations and procnames.

include IStdlib.PrettyPrintable.PPSet with type elt = Acquisition.t
include IStdlib.IStd.Caml.Set.S with type elt = Acquisition.t
type elt = Acquisition.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
val lock_is_held : Lock.t -> t -> bool

is the given lock in the set

val lock_is_held_in_other_thread : IR.Tenv.t -> Lock.t -> t -> bool

is the given lock held, modulo memory abstraction across threads

diff --git a/website/static/odoc/next/infer/Concurrency/StarvationDomain/CriticalPairs/index.html b/website/static/odoc/next/infer/Concurrency/StarvationDomain/CriticalPairs/index.html index bd1531baf56..156b221dca8 100644 --- a/website/static/odoc/next/infer/Concurrency/StarvationDomain/CriticalPairs/index.html +++ b/website/static/odoc/next/infer/Concurrency/StarvationDomain/CriticalPairs/index.html @@ -1,2 +1,2 @@ -CriticalPairs (infer.Concurrency.StarvationDomain.CriticalPairs)

Module StarvationDomain.CriticalPairs

include IStdlib.PrettyPrintable.PPSet with type elt = CriticalPair.t
include IStdlib.IStd.Caml.Set.S with type elt = CriticalPair.t
type elt = CriticalPair.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

+CriticalPairs (infer.Concurrency.StarvationDomain.CriticalPairs)

Module StarvationDomain.CriticalPairs

include IStdlib.PrettyPrintable.PPSet with type elt = CriticalPair.t
include IStdlib.IStd.Caml.Set.S with type elt = CriticalPair.t
type elt = CriticalPair.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

diff --git a/website/static/odoc/next/infer/Concurrency/StarvationDomain/LazilyInitialized/index.html b/website/static/odoc/next/infer/Concurrency/StarvationDomain/LazilyInitialized/index.html index 88c04ebc80d..8c5c0bb993a 100644 --- a/website/static/odoc/next/infer/Concurrency/StarvationDomain/LazilyInitialized/index.html +++ b/website/static/odoc/next/infer/Concurrency/StarvationDomain/LazilyInitialized/index.html @@ -1,4 +1,4 @@ LazilyInitialized (infer.Concurrency.StarvationDomain.LazilyInitialized)

Module StarvationDomain.LazilyInitialized

include IStdlib.PrettyPrintable.PPSet with type elt = Absint.HilExp.AccessExpression.t
include IStdlib.IStd.Caml.Set.S - with type elt = Absint.HilExp.AccessExpression.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

+ with type elt = Absint.HilExp.AccessExpression.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

diff --git a/website/static/odoc/next/infer/Concurrency/StarvationDomain/NullLocs/index.html b/website/static/odoc/next/infer/Concurrency/StarvationDomain/NullLocs/index.html index 8776eaf5827..3ebe5a8560f 100644 --- a/website/static/odoc/next/infer/Concurrency/StarvationDomain/NullLocs/index.html +++ b/website/static/odoc/next/infer/Concurrency/StarvationDomain/NullLocs/index.html @@ -1,4 +1,4 @@ NullLocs (infer.Concurrency.StarvationDomain.NullLocs)

Module StarvationDomain.NullLocs

include IStdlib.PrettyPrintable.PPSet with type elt = Absint.HilExp.AccessExpression.t
include IStdlib.IStd.Caml.Set.S - with type elt = Absint.HilExp.AccessExpression.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithTop with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val top : t
val is_top : t -> bool
+ with type elt = Absint.HilExp.AccessExpression.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithTop with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val top : t
val is_top : t -> bool
diff --git a/website/static/odoc/next/infer/Concurrency/StarvationDomain/NullLocsCriticalPairs/index.html b/website/static/odoc/next/infer/Concurrency/StarvationDomain/NullLocsCriticalPairs/index.html index 5f06ea674cc..e5b7cbba3d0 100644 --- a/website/static/odoc/next/infer/Concurrency/StarvationDomain/NullLocsCriticalPairs/index.html +++ b/website/static/odoc/next/infer/Concurrency/StarvationDomain/NullLocsCriticalPairs/index.html @@ -1,2 +1,2 @@ -NullLocsCriticalPairs (infer.Concurrency.StarvationDomain.NullLocsCriticalPairs)

Module StarvationDomain.NullLocsCriticalPairs

include IStdlib.PrettyPrintable.PPSet
include IStdlib.IStd.Caml.Set.S
type elt
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

+NullLocsCriticalPairs (infer.Concurrency.StarvationDomain.NullLocsCriticalPairs)

Module StarvationDomain.NullLocsCriticalPairs

include IStdlib.PrettyPrintable.PPSet
include IStdlib.IStd.Caml.Set.S
type elt
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

diff --git a/website/static/odoc/next/infer/Concurrency/StarvationDomain/ScheduledWorkDomain/index.html b/website/static/odoc/next/infer/Concurrency/StarvationDomain/ScheduledWorkDomain/index.html index 4d138133e63..5e4366afea4 100644 --- a/website/static/odoc/next/infer/Concurrency/StarvationDomain/ScheduledWorkDomain/index.html +++ b/website/static/odoc/next/infer/Concurrency/StarvationDomain/ScheduledWorkDomain/index.html @@ -1,2 +1,2 @@ -ScheduledWorkDomain (infer.Concurrency.StarvationDomain.ScheduledWorkDomain)

Module StarvationDomain.ScheduledWorkDomain

include IStdlib.PrettyPrintable.PPSet with type elt = ScheduledWorkItem.t
include IStdlib.IStd.Caml.Set.S with type elt = ScheduledWorkItem.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

+ScheduledWorkDomain (infer.Concurrency.StarvationDomain.ScheduledWorkDomain)

Module StarvationDomain.ScheduledWorkDomain

include IStdlib.PrettyPrintable.PPSet with type elt = ScheduledWorkItem.t
include IStdlib.IStd.Caml.Set.S with type elt = ScheduledWorkItem.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

diff --git a/website/static/odoc/next/infer/Costlib/ConfigImpactAnalysis/LatentConfigs/index.html b/website/static/odoc/next/infer/Costlib/ConfigImpactAnalysis/LatentConfigs/index.html index 205b6ede5ea..66a3e449afe 100644 --- a/website/static/odoc/next/infer/Costlib/ConfigImpactAnalysis/LatentConfigs/index.html +++ b/website/static/odoc/next/infer/Costlib/ConfigImpactAnalysis/LatentConfigs/index.html @@ -1,2 +1,2 @@ -LatentConfigs (infer.Costlib.ConfigImpactAnalysis.LatentConfigs)

Module ConfigImpactAnalysis.LatentConfigs

include IStdlib.PrettyPrintable.PPSet with type elt = LatentConfig.t
include IStdlib.IStd.Caml.Set.S with type elt = LatentConfig.t
type elt = LatentConfig.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

+LatentConfigs (infer.Costlib.ConfigImpactAnalysis.LatentConfigs)

Module ConfigImpactAnalysis.LatentConfigs

include IStdlib.PrettyPrintable.PPSet with type elt = LatentConfig.t
include IStdlib.IStd.Caml.Set.S with type elt = LatentConfig.t
type elt = LatentConfig.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

diff --git a/website/static/odoc/next/infer/Costlib/ConfigImpactAnalysis/UncheckedCallees/index.html b/website/static/odoc/next/infer/Costlib/ConfigImpactAnalysis/UncheckedCallees/index.html index d4be26211e2..518fe8aae1d 100644 --- a/website/static/odoc/next/infer/Costlib/ConfigImpactAnalysis/UncheckedCallees/index.html +++ b/website/static/odoc/next/infer/Costlib/ConfigImpactAnalysis/UncheckedCallees/index.html @@ -1,2 +1,2 @@ -UncheckedCallees (infer.Costlib.ConfigImpactAnalysis.UncheckedCallees)

Module ConfigImpactAnalysis.UncheckedCallees

include Absint.AbstractDomain.FiniteSetS with type elt = UncheckedCallee.t
include IStdlib.PrettyPrintable.PPSet with type elt = UncheckedCallee.t
include IStdlib.IStd.Caml.Set.S with type elt = UncheckedCallee.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

val encode : t -> string
val decode : string -> t
val pp_without_location : Stdlib.Format.formatter -> t -> unit
+UncheckedCallees (infer.Costlib.ConfigImpactAnalysis.UncheckedCallees)

Module ConfigImpactAnalysis.UncheckedCallees

include Absint.AbstractDomain.FiniteSetS with type elt = UncheckedCallee.t
include IStdlib.PrettyPrintable.PPSet with type elt = UncheckedCallee.t
include IStdlib.IStd.Caml.Set.S with type elt = UncheckedCallee.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
include Absint.AbstractDomain.WithBottom with type t := t
include Absint.AbstractDomain.S with type t := t
include Absint.AbstractDomain.Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val leq : lhs:t -> rhs:t -> bool

the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t

The bottom value of the domain.

val is_bottom : t -> bool

Return true if this is the bottom value

val encode : t -> string
val decode : string -> t
val pp_without_location : Stdlib.Format.formatter -> t -> unit
diff --git a/website/static/odoc/next/infer/Costlib/Cost/index.html b/website/static/odoc/next/infer/Costlib/Cost/index.html index b6cde4c5e59..efe3068e60c 100644 --- a/website/static/odoc/next/infer/Costlib/Cost/index.html +++ b/website/static/odoc/next/infer/Costlib/Cost/index.html @@ -13,8 +13,7 @@ callee_pname:IR.Procname.t -> callee_formals:(IR.Pvar.t * IR.Typ.t) list -> args:(IR.Exp.t * IR.Typ.t) list -> - captured_vars: - (IR.Exp.t * IR.Pvar.t * IR.Typ.t * IR.CapturedVar.capture_mode) list -> + captured_vars:(IR.Exp.t * IR.CapturedVar.t) list -> callee_cost:CostDomain.BasicCostWithReason.t -> loc:IBase.Location.t -> CostDomain.BasicCostWithReason.t
val is_report_suppressed : IR.Procname.t -> bool
diff --git a/website/static/odoc/next/infer/Costlib/CostInstantiate/Call/index.html b/website/static/odoc/next/infer/Costlib/CostInstantiate/Call/index.html index 5bed08c1117..4acd8953ca7 100644 --- a/website/static/odoc/next/infer/Costlib/CostInstantiate/Call/index.html +++ b/website/static/odoc/next/infer/Costlib/CostInstantiate/Call/index.html @@ -1,3 +1,2 @@ -Call (infer.Costlib.CostInstantiate.Call)

Module CostInstantiate.Call

type t = {
  1. loc : IBase.Location.t;
  2. pname : IR.Procname.t;
  3. node : Absint.ProcCfg.InstrNode.t;
  4. args : (IR.Exp.t * IR.Typ.t) list;
  5. captured_vars : (IR.Exp.t * IR.Pvar.t * IR.Typ.t * IR.CapturedVar.capture_mode) - list;
  6. ret : IR.Ident.t * IR.Typ.t;
}
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
val pp : Stdlib.Format.formatter -> t -> unit
+Call (infer.Costlib.CostInstantiate.Call)

Module CostInstantiate.Call

type t = {
  1. loc : IBase.Location.t;
  2. pname : IR.Procname.t;
  3. node : Absint.ProcCfg.InstrNode.t;
  4. args : (IR.Exp.t * IR.Typ.t) list;
  5. captured_vars : (IR.Exp.t * IR.CapturedVar.t) list;
  6. ret : IR.Ident.t * IR.Typ.t;
}
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
val pp : Stdlib.Format.formatter -> t -> unit
diff --git a/website/static/odoc/next/infer/IBase/Checker/Set/index.html b/website/static/odoc/next/infer/IBase/Checker/Set/index.html index f6e2bd8be0a..ec73296a203 100644 --- a/website/static/odoc/next/infer/IBase/Checker/Set/index.html +++ b/website/static/odoc/next/infer/IBase/Checker/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.IBase.Checker.Set)

Module Checker.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.IBase.Checker.Set)

Module Checker.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/IBase/Checker/index.html b/website/static/odoc/next/infer/IBase/Checker/index.html index 33e2e548a45..02cdca68696 100644 --- a/website/static/odoc/next/infer/IBase/Checker/index.html +++ b/website/static/odoc/next/infer/IBase/Checker/index.html @@ -1,2 +1,2 @@ -Checker (infer.IBase.Checker)

Module IBase.Checker

module F = Stdlib.Format
type t =
  1. | AnnotationReachability
  2. | Biabduction
  3. | BufferOverrunAnalysis
  4. | BufferOverrunChecker
  5. | ConfigImpactAnalysis
  6. | Cost
  7. | DisjunctiveDemo
  8. | FragmentRetainsView
  9. | Impurity
  10. | InefficientKeysetIterator
  11. | Lineage
  12. | LineageShape
  13. | LithoRequiredProps
  14. | Liveness
  15. | LoopHoisting
  16. | ParameterNotNullChecked
  17. | PrintfArgs
  18. | Pulse
  19. | PurityAnalysis
  20. | PurityChecker
  21. | RacerD
  22. | ResourceLeakLabExercise
  23. | SILValidation
  24. | SIOF
  25. | ScopeLeakage
  26. | SelfInBlock
  27. | Starvation
  28. | Topl
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
include Ppx_enumerate_lib.Enumerable.S with type t := t
val all : t list
type support =
  1. | NoSupport
    (*

    checker does not run at all for this language

    *)
  2. | ExperimentalSupport
    (*

    checker runs but is not expected to give reasonable results

    *)
  3. | Support
    (*

    checker is expected to give reasonable results

    *)

per-language support for each checker

type cli_flags = {
  1. deprecated : string list;
    (*

    More command-line flags, similar to ~deprecated arguments in CommandLineOption.

    *)
  2. show_in_help : bool;
}
type kind =
  1. | UserFacing of {
    1. title : string;
      (*

      the title of the documentation web page

      *)
    2. markdown_body : string;
      (*

      main text of the documentation

      *)
    }
    (*

    can report issues to users

    *)
  2. | UserFacingDeprecated of {
    1. title : string;
      (*

      the title of the documentation web page

      *)
    2. markdown_body : string;
      (*

      main text of the documentation

      *)
    3. deprecation_message : string;
    }
    (*

    can report issues to users but should probably be deleted from infer

    *)
  3. | Internal
    (*

    Analysis that only serves other analyses. Do not use to mean experimental! Please still document experimental checkers as they will become non-experimental.

    *)
  4. | Exercise
    (*

    reserved for the "resource leak" lab exercise

    *)
type config = {
  1. id : string;
    (*

    Unique identifier. Used to generate web URLs for the documentation as well as the flag to enable this option on the command line.

    *)
  2. kind : kind;
  3. support : Language.t -> support;
  4. short_documentation : string;
    (*

    used in man pages and as a short intro on the website

    *)
  5. cli_flags : cli_flags option;
    (*

    If None then the checker cannot be enabled/disabled from the command line.

    *)
  6. enabled_by_default : bool;
  7. activates : t list;
    (*

    list of checkers that get enabled when this checker is enabled

    *)
}
val config : t -> config
val get_id : t -> string

get_id c is (config c).id

val from_id : string -> t option
val pp_manual : F.formatter -> t -> unit

prints a short explanation of the checker; used for the man pages

module Set : IStdlib.PrettyPrintable.PPSet with type elt = t
val get_dependencies : t -> Set.t
+Checker (infer.IBase.Checker)

Module IBase.Checker

module F = Stdlib.Format
type t =
  1. | AnnotationReachability
  2. | Biabduction
  3. | BufferOverrunAnalysis
  4. | BufferOverrunChecker
  5. | ConfigImpactAnalysis
  6. | Cost
  7. | DisjunctiveDemo
  8. | FragmentRetainsView
  9. | Impurity
  10. | InefficientKeysetIterator
  11. | Lineage
  12. | LineageShape
  13. | LithoRequiredProps
  14. | Liveness
  15. | LoopHoisting
  16. | ParameterNotNullChecked
  17. | Pulse
  18. | PurityAnalysis
  19. | PurityChecker
  20. | RacerD
  21. | ResourceLeakLabExercise
  22. | SILValidation
  23. | SIOF
  24. | ScopeLeakage
  25. | SelfInBlock
  26. | Starvation
  27. | Topl
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
include Ppx_enumerate_lib.Enumerable.S with type t := t
val all : t list
type support =
  1. | NoSupport
    (*

    checker does not run at all for this language

    *)
  2. | ExperimentalSupport
    (*

    checker runs but is not expected to give reasonable results

    *)
  3. | Support
    (*

    checker is expected to give reasonable results

    *)

per-language support for each checker

type cli_flags = {
  1. deprecated : string list;
    (*

    More command-line flags, similar to ~deprecated arguments in CommandLineOption.

    *)
  2. show_in_help : bool;
}
type kind =
  1. | UserFacing of {
    1. title : string;
      (*

      the title of the documentation web page

      *)
    2. markdown_body : string;
      (*

      main text of the documentation

      *)
    }
    (*

    can report issues to users

    *)
  2. | UserFacingDeprecated of {
    1. title : string;
      (*

      the title of the documentation web page

      *)
    2. markdown_body : string;
      (*

      main text of the documentation

      *)
    3. deprecation_message : string;
    }
    (*

    can report issues to users but should probably be deleted from infer

    *)
  3. | Internal
    (*

    Analysis that only serves other analyses. Do not use to mean experimental! Please still document experimental checkers as they will become non-experimental.

    *)
  4. | Exercise
    (*

    reserved for the "resource leak" lab exercise

    *)
type config = {
  1. id : string;
    (*

    Unique identifier. Used to generate web URLs for the documentation as well as the flag to enable this option on the command line.

    *)
  2. kind : kind;
  3. support : Language.t -> support;
  4. short_documentation : string;
    (*

    used in man pages and as a short intro on the website

    *)
  5. cli_flags : cli_flags option;
    (*

    If None then the checker cannot be enabled/disabled from the command line.

    *)
  6. enabled_by_default : bool;
  7. activates : t list;
    (*

    list of checkers that get enabled when this checker is enabled

    *)
}
val config : t -> config
val get_id : t -> string

get_id c is (config c).id

val from_id : string -> t option
val pp_manual : F.formatter -> t -> unit

prints a short explanation of the checker; used for the man pages

module Set : IStdlib.PrettyPrintable.PPSet with type elt = t
val get_dependencies : t -> Set.t
diff --git a/website/static/odoc/next/infer/IBase/ClangProc/index.html b/website/static/odoc/next/infer/IBase/ClangProc/index.html deleted file mode 100644 index 3f7fb0838a0..00000000000 --- a/website/static/odoc/next/infer/IBase/ClangProc/index.html +++ /dev/null @@ -1,2 +0,0 @@ - -ClangProc (infer.IBase.ClangProc)

Module IBase.ClangProc

type t =
  1. | CFunction of {
    1. name : string;
    2. mangled_name : string option;
    }
  2. | CppMethod of {
    1. mangled_name : string;
    }
  3. | ObjcMethod of {
    1. mangled_name : string;
    }
  4. | ObjcBlock of {
    1. mangled_name : string;
    }
diff --git a/website/static/odoc/next/infer/IBase/Config/index.html b/website/static/odoc/next/infer/IBase/Config/index.html index 7f7fbb399fc..2da6904e025 100644 --- a/website/static/odoc/next/infer/IBase/Config/index.html +++ b/website/static/odoc/next/infer/IBase/Config/index.html @@ -8,5 +8,5 @@ | `MLeak_unknown ] list
val biabduction_models_mode : bool
val biabduction_monitor_prop_size : bool
val biabduction_nelseg : bool
val biabduction_only_footprint : bool
val biabduction_seconds_per_iteration : float option
val biabduction_symops_per_iteration : int option
val biabduction_trace_join : bool
val biabduction_trace_rearrange : bool
val biabduction_type_size : bool
val biabduction_unsafe_malloc : bool
val biabduction_worklist_mode : int
val biabduction_write_dotty : bool
val bo_assume_void : bool
val bo_bottom_as_default : bool
val bo_context_sensitive_allocsites : bool
val bo_debug : int
val bo_exit_frontend_gener_vars : bool
val bo_field_depth_limit : int option
val bo_max_cfg_size : int
val bo_sound_unknown_sets_join : bool
val bootclasspath : string option
val buck : bool
val buck2_build_args : string list
val buck2_build_args_no_inline : string list
val buck2_bxl_capture_file_block_list : string list
val buck2_bxl_target : string option
val buck2_inferconfig_target : string option
val buck2_infertoolchain_target : string option
val buck2_isolation_dir : string option
val buck2_query_deps : bool
val buck2_root : string
val buck_block_list : string list
val buck_build_args : string list
val buck_build_args_no_inline : string list
val buck_cache_mode : bool
val buck_clang_use_toolchain_config : bool
val buck_dependency_depth : int option
val buck_java_heap_size_gb : int option
val buck_java_suppress_config : bool
val buck_merge_all_deps : bool
val buck_mode : BuckMode.t option
val buck_out : string
val buck_out_gen : string
val buck_targets_block_list : string list
val capture : bool
val capture_block_list : string * Yojson.Safe.t
val capture_textual : string list
val censor_report : ((bool * IStdlib.IStd.Str.regexp) * (bool * IStdlib.IStd.Str.regexp) * string) - list
val cfg_json : string option
val changed_files_index : string option
val check_version : string option
val clang_ast_file : [ `Biniou of string | `Yojson of string ] option
val clang_block_listed_flags : string list
val clang_block_listed_flags_with_arg : string list
val clang_compound_literal_init_limit : int
val clang_extra_flags : string list
val clang_frontend_action_string : string
val clang_idirafter_to_override_regex : IStdlib.IStd.Str.regexp option
val clang_ignore_regex : IStdlib.IStd.Str.regexp option
val clang_isystem_to_override_regex : IStdlib.IStd.Str.regexp option
val clang_libcxx_include_to_override_regex : string option
val classpath : string option
val compaction_if_heap_greater_equal_to_GB : int
val compaction_minimum_interval_s : int
val complete_capture_from : string option
val config_impact_config_field_patterns : IStdlib.IStd.Str.regexp list
val config_impact_config_function_patterns : IStdlib.IStd.Str.regexp list
val config_impact_config_param_patterns : IStdlib.IStd.Str.regexp list
val config_impact_current : string option
val config_impact_data_file : string option
val config_impact_issues_tests : string option
val config_impact_max_callees_to_print : int
val config_impact_previous : string option
val config_impact_strict_mode : bool
val config_impact_strict_mode_paths : IStdlib.IStd.Str.regexp list
val config_impact_test_paths : IStdlib.IStd.Str.regexp list
val continue_analysis : bool
val continue_capture : bool
val cost_issues_tests : string option
val cost_log_unknown_calls : bool
val cost_suppress_func_ptr : bool
val costs_current : string option
val costs_previous : string option
val cxx : bool
val cxx_scope_guards : Yojson.Safe.t
val data_flow_queries_on_topl : string list
val dbwriter : bool
val debug_exceptions : bool
val debug_level_analysis : int
val debug_level_capture : int
val debug_level_report : int
val debug_level_test_determinator : int
val debug_mode : bool
val deduplicate : bool
val dependency_mode : bool
val detach_analysis_dependency : bool
val developer_mode : bool
val dict_missing_key_var_block_list : IStdlib.IStd.Str.regexp option
val differential_filter_files : string option
val differential_filter_set : [ `Introduced | `Fixed | `Preexisting ] list
val dotty_cfg_libs : bool
val dump_duplicate_symbols : bool
val dump_textual : bool
val dynamic_dispatch_json_file_path : string option
val erlang_ast_dir : string option
val erlang_check_return : bool
val erlang_list_unfold_depth : int
val erlang_reliability : bool
val erlang_skip_compile : bool
val erlang_with_otp_specs : bool
val export_changed_functions : bool
val extract_capture_from : string option
val fail_on_bug : bool
val fcp_apple_clang : string option
val fcp_syntax_only : bool
val file_renamings : string option
val files_to_analyze_index : string option
val filter_paths : bool
val filtering : bool
val force_delete_results_dir : bool
val force_integration : build_system option
val from_json_config_impact_report : string
val from_json_costs_report : string
val from_json_report : string
val frontend_stats : bool
val frontend_tests : bool
val generated_classes : string option
val genrule_mode : bool
val global_tenv : bool
val hackc_binary : string option
val hack_builder_patterns : (string * string list) list
val hack_builtin_models : string
val hack_models : string list
val hack_naming_table : string option
val hack_verify_capture_only : bool
val help_checker : Checker.t list
val help_issue_type : IssueType.t list
val hoisting_report_only_expensive : bool
val html : bool
val icfg_dotty_outfile : string option
val implicit_sdk_root : string option
val impurity_report_immutable_modifications : bool
val inclusive_cost : bool
val incremental_analysis : bool
val infer_binary : string

absolute canonicalized path to the current executable

val infer_is_clang : bool
val infer_is_javac : bool
val inferconfig_file : string option
val inline_func_pointer_for_testing : string option
val invalidate_only : bool
val is_checker_enabled : Checker.t -> bool
val issues_tests : string option
val issues_tests_fields : IssuesTestField.t list
val java_debug_source_file_info : string option
val java_jar_compiler : string option
val java_source_parser_experimental : bool
val java_version : int option
val javac_classes_out : string
val job_id : string option
val jobs : int
val keep_going : bool
val kotlin_capture : bool
val lineage_source : string list
val lineage_sink : string list
val lineage_sanitizers : string list
val lineage_limit : int option
val lineage_dedup : bool
val lineage_field_depth : int
val lineage_field_max_cfg_size : int option
val lineage_field_width : int
val lineage_include_builtins : bool
val lineage_json_report : bool
val lineage_keep_temporaries : bool
val lineage_max_cfg_size : int option
val lineage_prevent_cycles : bool
val lineage_seed : int
val lineage_variant_width : int
val list_categories : bool
val list_checkers : bool
val list_issue_types : bool
val liveness_block_list_var_regex : IStdlib.IStd.Str.regexp option
val liveness_dangerous_classes : Yojson.Safe.t
val liveness_ignored_constant : string list
val load_average : float option
val lock_model : Yojson.Safe.t
val log_pulse_disjunct_increase_after_model_call : bool
val log_pulse_coverage : bool
val log_missing_deps : bool
val margin_html : int
val mark_unchanged_procs : bool
val mask_sajwa_exceptions : bool
val max_nesting : int option
val memtrace_analysis : bool
val memtrace_sampling_rate : float
val merge_capture : string list
val merge_report : string list
val merge_summaries : string list
val method_decls_info : string option
val modeled_expensive : string * Yojson.Safe.t
val modified_lines : string option
val never_returning_null : string * Yojson.Safe.t
val no_censor_report : IStdlib.IStd.Str.regexp list
val no_translate_libs : bool
val nullable_annotation : string option
val only_cheap_debug : bool
val oom_threshold : int option
val objc_synthesize_dealloc : bool
val pmd_xml : bool
val preanalysis_html : bool
val print_active_checkers : bool
val print_builtins : bool
val print_jbir : bool
val print_logs : bool
val print_types : bool
val print_using_diff : bool
val procedures : bool
val procedures_attributes : bool
val procedures_call_graph : bool
val procedures_callees : bool
val procedures_cfg : bool
val procedures_definedness : bool
val procedures_filter : string option
val procedures_name : bool
val procedures_source_file : bool
val procedures_summary : bool
val procedures_summary_json : bool
val procedures_summary_skip_empty : bool
val process_clang_ast : bool
val profiler_samples : string option
val progress_bar : [ `MultiLine | `Plain | `Quiet ]
val project_root : string
val pulse_cut_to_one_path_procedures_pattern : IStdlib.IStd.Str.regexp option
val pulse_force_continue : bool
val pulse_havoc_arguments : bool
val pulse_inline_global_init_func_pointer : bool
val pulse_intraprocedural_only : bool
val pulse_log_summary_count : bool
val pulse_log_unknown_calls : bool
val pulse_max_cfg_size : int
val pulse_max_disjuncts : int
val pulse_max_heap : int option
val pulse_model_abort : string list
val pulse_model_alloc_pattern : IStdlib.IStd.Str.regexp option
val pulse_model_cheap_copy_type : IStdlib.IStd.Str.regexp option
val pulse_model_free_pattern : IStdlib.IStd.Str.regexp option
val pulse_model_malloc_pattern : IStdlib.IStd.Str.regexp option
val pulse_model_realloc_pattern : IStdlib.IStd.Str.regexp option
val pulse_model_release_pattern : IStdlib.IStd.Str.regexp option
val pulse_model_return_first_arg : IStdlib.IStd.Str.regexp option
val pulse_model_return_nonnull : IStdlib.IStd.Str.regexp option
val pulse_model_return_this : IStdlib.IStd.Str.regexp option
val pulse_model_returns_copy_pattern : IStdlib.IStd.Str.regexp option
val pulse_model_skip_pattern : IStdlib.IStd.Str.regexp option
val pulse_model_transfer_ownership : string list
val pulse_model_transfer_ownership_namespace : (string * string) list
val pulse_models_for_erlang : string list
val pulse_monitor_transitive_callees : bool
val pulse_monitor_transitive_missed_captures : bool
val pulse_nullsafe_report_npe : bool
val pulse_nullsafe_report_npe_as_separate_issue_type : bool
val pulse_prevent_non_disj_top : bool
val pulse_recency_limit : int
val pulse_report_flows_from_taint_source : string option
val pulse_report_flows_to_taint_sink : string option
val pulse_report_issues_for_tests : bool
val pulse_report_latent_issues : bool
val pulse_sanity_checks : bool
val pulse_skip_procedures : IStdlib.IStd.Str.regexp option
val pulse_specialization_iteration_limit : int
val pulse_specialization_limit : int
val pulse_specialization_partial : bool
val pulse_taint_check_history : bool
val pulse_taint_config : pulse_taint_config
val pulse_taint_short_traces : bool
val pulse_taint_skip_sources : bool
val pulse_transitive_access_config : string list
val pulse_transitive_access_enabled : bool
val pulse_transitive_access_verbose : bool
val pulse_unsafe_malloc : bool
val pulse_widen_threshold : int
val pure_by_default : bool
val pyc_file : string list
val python_builtin_models : string
val qualified_cpp_name_block_list : string list
val quiet : bool
val racerd_always_report_java : bool
val racerd_guardedby : bool
val racerd_ignore_classes : IStdlib.IStd.String.Set.t
val reactive_mode : bool
val reactive_capture : bool
val reanalyze : bool
val relative_path_backtrack : int
val replay_analysis_schedule : bool
val replay_ondemand_should_error : bool
val report : bool
val report_block_list_files_containing : string list
val report_console_limit : int option
val report_current : string option
val report_custom_error : bool
val report_force_relative_path : bool
val report_formatter : [ `No_formatter | `Phabricator_formatter ]
val report_path_regex_allow_list : string list
val report_path_regex_block_list : string list
val report_previous : string option
val report_suppress_errors : string list
val reports_include_ml_loc : bool
val rest : string list
val results_dir : string
val run_as_child : int option
val sarif : bool
val scheduler : scheduler
val scope_leakage_config : Yojson.Safe.t
val scuba_logging : bool
val scuba_normals : string IStdlib.IStd.String.Map.t
val scuba_tags : string list IStdlib.IStd.String.Map.t
val select : [ `All | `Select of int ] option
val show_buckets : bool
val shrink_analysis_db : bool
val siof_check_iostreams : bool
val siof_safe_methods : string list
val skip_analysis_in_path : IStdlib.IStd.Str.regexp option
val skip_analysis_in_path_skips_compilation : bool
val skip_duplicated_types : bool
val skip_non_capture_clang_commands : bool
val skip_translation_headers : string list
val source_files : bool
val source_files_call_graph : bool
val source_files_call_graph_partition : int option
val source_files_cfg : bool
val source_files_filter : string option
val source_files_freshly_captured : bool
val source_files_procedure_names : bool
val source_files_type_environment : bool
val source_preview : bool
val sourcepath : string option
val sources : string list
val sqlite_cache_size : int
val sqlite_lock_timeout : int
val sqlite_max_blob_size : int
val sqlite_mmap_size : int
val sqlite_page_size : int
val sqlite_vfs : string option
val starvation_c_function_pointer_models : Yojson.Safe.t
val starvation_c_named_threads_annot : Yojson.Safe.t
val starvation_skip_analysis : Yojson.Safe.t
val starvation_strict_mode : bool
val starvation_whole_program : bool
val stats_dir_current : string option
val stats_dir_previous : string option
val struct_as_cpp_class : bool
val store_analysis_schedule : bool
val subtype_multirange : bool
val suffix_match_changed_files : bool
val summaries_caches_max_size : int
val suppress_lint_ignore_types : bool
val tenv_json : string option
val test_determinator : bool
val testing_mode : bool
val threadsafe_aliases : Yojson.Safe.t
val timeout : float option
val top_longest_proc_duration_size : int option
val topl_max_conjuncts : int
val topl_max_disjuncts : int
val topl_properties : ToplAst.t list
val topl_report_latent_issues : bool
val trace_absarray : bool
val trace_error : bool
val trace_events : bool
val trace_ondemand : bool
val trace_topl : bool
val unix_fork : bool
val workspace : string option
val write_html : bool
val write_html_allow_list_regex : string list
val write_website : string option
val xcode_developer_dir : string option
val xcode_isysroot_suffix : string option
val xcpretty : bool

Configuration values derived from command-line options

val toplevel_results_dir : string

In some integrations, eg Buck, infer subprocesses started by the build system (started by the toplevel infer process) will have their own results directory; this points to the results directory of the toplevel infer process, which can be useful for, eg, storing debug info. In other cases this is equal to results_dir.

val java_package_is_external : string -> bool

Check if a Java package is external to the repository

val scuba_execution_id : IStdlib.IStd.Int64.t option

a random number to (hopefully) uniquely identify this run

val is_originator : bool

is the current process (forked from) the root of the Infer process tree

Global variables with initial values specified by command-line options

val clang_compilation_dbs : [ `Escaped of string | `Raw of string ] list
+ list
val cfg_json : string option
val changed_files_index : string option
val check_version : string option
val clang_ast_file : [ `Biniou of string | `Yojson of string ] option
val clang_block_listed_flags : string list
val clang_block_listed_flags_with_arg : string list
val clang_compound_literal_init_limit : int
val clang_extra_flags : string list
val clang_frontend_action_string : string
val clang_idirafter_to_override_regex : IStdlib.IStd.Str.regexp option
val clang_ignore_regex : IStdlib.IStd.Str.regexp option
val clang_isystem_to_override_regex : IStdlib.IStd.Str.regexp option
val clang_libcxx_include_to_override_regex : string option
val classpath : string option
val compaction_if_heap_greater_equal_to_GB : int
val compaction_minimum_interval_s : int
val complete_capture_from : string option
val config_impact_config_field_patterns : IStdlib.IStd.Str.regexp list
val config_impact_config_function_patterns : IStdlib.IStd.Str.regexp list
val config_impact_config_param_patterns : IStdlib.IStd.Str.regexp list
val config_impact_current : string option
val config_impact_data_file : string option
val config_impact_issues_tests : string option
val config_impact_max_callees_to_print : int
val config_impact_previous : string option
val config_impact_strict_mode : bool
val config_impact_strict_mode_paths : IStdlib.IStd.Str.regexp list
val config_impact_test_paths : IStdlib.IStd.Str.regexp list
val continue_analysis : bool
val continue_capture : bool
val cost_issues_tests : string option
val cost_log_unknown_calls : bool
val cost_suppress_func_ptr : bool
val costs_current : string option
val costs_previous : string option
val cxx : bool
val cxx_scope_guards : Yojson.Safe.t
val data_flow_queries_on_topl : string list
val dbwriter : bool
val debug_exceptions : bool
val debug_level_analysis : int
val debug_level_capture : int
val debug_level_report : int
val debug_mode : bool
val deduplicate : bool
val dependency_mode : bool
val detach_analysis_dependency : bool
val developer_mode : bool
val dict_missing_key_var_block_list : IStdlib.IStd.Str.regexp option
val differential_filter_files : string option
val differential_filter_set : [ `Introduced | `Fixed | `Preexisting ] list
val dotty_cfg_libs : bool
val dump_duplicate_symbols : bool
val dump_textual : bool
val dynamic_dispatch_json_file_path : string option
val erlang_ast_dir : string option
val erlang_check_return : bool
val erlang_list_unfold_depth : int
val erlang_reliability : bool
val erlang_skip_compile : bool
val erlang_with_otp_specs : bool
val extract_capture_from : string option
val fail_on_bug : bool
val fcp_apple_clang : string option
val fcp_syntax_only : bool
val file_renamings : string option
val files_to_analyze_index : string option
val filter_paths : bool
val filtering : bool
val force_delete_results_dir : bool
val force_integration : build_system option
val from_json_config_impact_report : string
val from_json_costs_report : string
val from_json_report : string
val frontend_stats : bool
val frontend_tests : bool
val generated_classes : string option
val genrule_mode : bool
val global_tenv : bool
val hackc_binary : string option
val hack_builder_patterns : (string * string list) list
val hack_builtin_models : string
val hack_models : string list
val hack_naming_table : string option
val hack_verify_capture_only : bool
val help_checker : Checker.t list
val help_issue_type : IssueType.t list
val hoisting_report_only_expensive : bool
val html : bool
val icfg_dotty_outfile : string option
val implicit_sdk_root : string option
val impurity_report_immutable_modifications : bool
val inclusive_cost : bool
val incremental_analysis : bool
val infer_binary : string

absolute canonicalized path to the current executable

val infer_is_clang : bool
val infer_is_javac : bool
val inferconfig_file : string option
val inline_func_pointer_for_testing : string option
val invalidate_only : bool
val is_checker_enabled : Checker.t -> bool
val issues_tests : string option
val issues_tests_fields : IssuesTestField.t list
val java_debug_source_file_info : string option
val java_jar_compiler : string option
val java_read_modules : bool
val java_source_parser_experimental : bool
val java_version : int option
val javac_classes_out : string
val job_id : string option
val jobs : int
val keep_going : bool
val kotlin_capture : bool
val lineage_source : string list
val lineage_sink : string list
val lineage_sanitizers : string list
val lineage_limit : int option
val lineage_dedup : bool
val lineage_field_depth : int
val lineage_field_max_cfg_size : int option
val lineage_field_width : int
val lineage_include_builtins : bool
val lineage_json_report : bool
val lineage_keep_temporaries : bool
val lineage_max_cfg_size : int option
val lineage_prevent_cycles : bool
val lineage_seed : int
val lineage_variant_width : int
val list_categories : bool
val list_checkers : bool
val list_issue_types : bool
val liveness_block_list_var_regex : IStdlib.IStd.Str.regexp option
val liveness_dangerous_classes : Yojson.Safe.t
val liveness_ignored_constant : string list
val load_average : float option
val lock_model : Yojson.Safe.t
val log_pulse_disjunct_increase_after_model_call : bool
val log_pulse_coverage : bool
val log_missing_deps : bool
val margin_html : int
val mark_unchanged_procs : bool
val mask_sajwa_exceptions : bool
val max_nesting : int option
val memtrace_analysis : bool
val memtrace_sampling_rate : float
val merge_capture : string list
val merge_report : string list
val merge_summaries : string list
val modeled_expensive : string * Yojson.Safe.t
val never_returning_null : string * Yojson.Safe.t
val no_censor_report : IStdlib.IStd.Str.regexp list
val no_translate_libs : bool
val nullable_annotation : string option
val only_cheap_debug : bool
val oom_threshold : int option
val objc_synthesize_dealloc : bool
val pmd_xml : bool
val preanalysis_html : bool
val print_active_checkers : bool
val print_builtins : bool
val print_jbir : bool
val print_logs : bool
val print_types : bool
val print_using_diff : bool
val procedures : bool
val procedures_attributes : bool
val procedures_call_graph : bool
val procedures_callees : bool
val procedures_cfg : bool
val procedures_definedness : bool
val procedures_filter : string option
val procedures_name : bool
val procedures_source_file : bool
val procedures_summary : bool
val procedures_summary_json : bool
val procedures_summary_skip_empty : bool
val process_clang_ast : bool
val progress_bar : [ `MultiLine | `Plain | `Quiet ]
val project_root : string
val pulse_cut_to_one_path_procedures_pattern : IStdlib.IStd.Str.regexp option
val pulse_force_continue : bool
val pulse_havoc_arguments : bool
val pulse_inline_global_init_func_pointer : bool
val pulse_intraprocedural_only : bool
val pulse_log_summary_count : bool
val pulse_log_unknown_calls : bool
val pulse_max_cfg_size : int
val pulse_max_disjuncts : int
val pulse_max_heap : int option
val pulse_model_abort : string list
val pulse_model_alloc_pattern : IStdlib.IStd.Str.regexp option
val pulse_model_cheap_copy_type : IStdlib.IStd.Str.regexp option
val pulse_model_free_pattern : IStdlib.IStd.Str.regexp option
val pulse_model_malloc_pattern : IStdlib.IStd.Str.regexp option
val pulse_model_realloc_pattern : IStdlib.IStd.Str.regexp option
val pulse_model_release_pattern : IStdlib.IStd.Str.regexp option
val pulse_model_return_first_arg : IStdlib.IStd.Str.regexp option
val pulse_model_return_nonnull : IStdlib.IStd.Str.regexp option
val pulse_model_return_this : IStdlib.IStd.Str.regexp option
val pulse_model_returns_copy_pattern : IStdlib.IStd.Str.regexp option
val pulse_model_skip_pattern : IStdlib.IStd.Str.regexp option
val pulse_model_transfer_ownership : string list
val pulse_model_transfer_ownership_namespace : (string * string) list
val pulse_models_for_erlang : string list
val pulse_monitor_transitive_callees : bool
val pulse_monitor_transitive_missed_captures : bool
val pulse_nullsafe_report_npe : bool
val pulse_nullsafe_report_npe_as_separate_issue_type : bool
val pulse_prevent_non_disj_top : bool
val pulse_recency_limit : int
val pulse_report_flows_from_taint_source : string option
val pulse_report_flows_to_taint_sink : string option
val pulse_report_issues_for_tests : bool
val pulse_report_latent_issues : bool
val pulse_sanity_checks : bool
val pulse_skip_procedures : IStdlib.IStd.Str.regexp option
val pulse_specialization_iteration_limit : int
val pulse_specialization_limit : int
val pulse_specialization_partial : bool
val pulse_taint_check_history : bool
val pulse_taint_config : pulse_taint_config
val pulse_taint_opaque_files : string list
val pulse_taint_short_traces : bool
val pulse_taint_skip_sources : bool
val pulse_transitive_access_config : string list
val pulse_transitive_access_enabled : bool
val pulse_transitive_access_verbose : bool
val pulse_unsafe_malloc : bool
val pulse_widen_threshold : int
val pure_by_default : bool
val pyc_file : string list
val python_builtin_models : string
val qualified_cpp_name_block_list : string list
val quiet : bool
val racerd_always_report_java : bool
val racerd_guardedby : bool
val racerd_ignore_classes : IStdlib.IStd.String.Set.t
val reactive_mode : bool
val reactive_capture : bool
val reanalyze : bool
val relative_path_backtrack : int
val replay_analysis_schedule : bool
val replay_ondemand_should_error : bool
val report : bool
val report_block_list_files_containing : string list
val report_console_limit : int option
val report_current : string option
val report_custom_error : bool
val report_force_relative_path : bool
val report_formatter : [ `No_formatter | `Phabricator_formatter ]
val report_path_regex_allow_list : string list
val report_path_regex_block_list : string list
val report_previous : string option
val report_suppress_errors : string list
val reports_include_ml_loc : bool
val rest : string list
val results_dir : string
val run_as_child : int option
val sarif : bool
val scheduler : scheduler
val scope_leakage_config : Yojson.Safe.t
val scuba_logging : bool
val scuba_normals : string IStdlib.IStd.String.Map.t
val scuba_tags : string list IStdlib.IStd.String.Map.t
val select : [ `All | `Select of int ] option
val show_buckets : bool
val shrink_analysis_db : bool
val siof_check_iostreams : bool
val siof_safe_methods : string list
val skip_analysis_in_path : IStdlib.IStd.Str.regexp option
val skip_analysis_in_path_skips_compilation : bool
val skip_duplicated_types : bool
val skip_non_capture_clang_commands : bool
val skip_translation_headers : string list
val source_files : bool
val source_files_call_graph : bool
val source_files_call_graph_partition : int option
val source_files_cfg : bool
val source_files_filter : string option
val source_files_freshly_captured : bool
val source_files_procedure_names : bool
val source_files_type_environment : bool
val source_preview : bool
val sourcepath : string option
val sources : string list
val sqlite_cache_size : int
val sqlite_lock_timeout : int
val sqlite_max_blob_size : int
val sqlite_mmap_size : int
val sqlite_page_size : int
val sqlite_vfs : string option
val starvation_c_function_pointer_models : Yojson.Safe.t
val starvation_c_named_threads_annot : Yojson.Safe.t
val starvation_skip_analysis : Yojson.Safe.t
val starvation_strict_mode : bool
val starvation_whole_program : bool
val stats_dir_current : string option
val stats_dir_previous : string option
val struct_as_cpp_class : bool
val store_analysis_schedule : bool
val subtype_multirange : bool
val suffix_match_changed_files : bool
val summaries_caches_max_size : int
val suppress_lint_ignore_types : bool
val suppressions : bool
val tenv_json : string option
val testing_mode : bool
val threadsafe_aliases : Yojson.Safe.t
val timeout : float option
val top_longest_proc_duration_size : int option
val topl_max_conjuncts : int
val topl_max_disjuncts : int
val topl_properties : ToplAst.t list
val topl_report_latent_issues : bool
val trace_absarray : bool
val trace_error : bool
val trace_events : bool
val trace_ondemand : bool
val trace_topl : bool
val unix_fork : bool
val workspace : string option
val write_html : bool
val write_html_allow_list_regex : string list
val write_website : string option
val xcode_developer_dir : string option
val xcode_isysroot_suffix : string option
val xcpretty : bool

Configuration values derived from command-line options

val toplevel_results_dir : string

In some integrations, eg Buck, infer subprocesses started by the build system (started by the toplevel infer process) will have their own results directory; this points to the results directory of the toplevel infer process, which can be useful for, eg, storing debug info. In other cases this is equal to results_dir.

val java_package_is_external : string -> bool

Check if a Java package is external to the repository

val scuba_execution_id : IStdlib.IStd.Int64.t option

a random number to (hopefully) uniquely identify this run

val is_originator : bool

is the current process (forked from) the root of the Infer process tree

Global variables with initial values specified by command-line options

val clang_compilation_dbs : [ `Escaped of string | `Raw of string ] list
diff --git a/website/static/odoc/next/infer/IBase/IssueType/index.html b/website/static/odoc/next/infer/IBase/IssueType/index.html index 761e9d65751..7241d46c0cc 100644 --- a/website/static/odoc/next/infer/IBase/IssueType/index.html +++ b/website/static/odoc/next/infer/IBase/IssueType/index.html @@ -6,4 +6,4 @@ ?user_documentation:string -> severity -> Checker.t -> - t

Create a new issue and register it in the list of all issues. NOTE: if the issue with the same string id is already registered, overrides `hum` but DOES NOT override `enabled`. This trick allows to deal with disabling/enabling dynamic issues from the config, when we don't know all params yet. Thus, the human-readable description can be updated when we encounter the definition of the issue type.

val checker_can_report : Checker.t -> t -> bool

Whether the issue was registered as coming from the given checker. Important to call this before reporting to keep documentation accurate.

val set_enabled : t -> bool -> unit
val abduction_case_not_implemented : t
val arbitrary_code_execution_under_lock : t
val array_of_pointsto : t
val array_out_of_bounds_l1 : t
val array_out_of_bounds_l2 : t
val array_out_of_bounds_l3 : t
val assert_failure : t
val bad_footprint : t
val bad_arg : latent:bool -> t
val bad_generator : latent:bool -> t
val bad_key : latent:bool -> t
val bad_map : latent:bool -> t
val bad_record : latent:bool -> t
val bad_return : latent:bool -> t
val biabduction_analysis_stops : t
val biabduction_retain_cycle : t
val block_parameter_not_null_checked : t
val buffer_overrun_l1 : t
val buffer_overrun_l2 : t
val buffer_overrun_l3 : t
val buffer_overrun_l4 : t
val buffer_overrun_l5 : t
val buffer_overrun_s2 : t
val buffer_overrun_u5 : t
val cannot_star : t
val captured_strong_self : t
val checkers_allocates_memory : t

Warning name when a performance critical method directly or indirectly calls a method allocating memory

val checkers_annotation_reachability_error : t
val checkers_calls_expensive_method : t

Warning name when a performance critical method directly or indirectly calls a method annotatd as expensive

val checkers_expensive_overrides_unexpensive : t

Warning name for the subtyping rule: method not annotated as expensive cannot be overridden by a method annotated as expensive

val checkers_fragment_retain_view : t
val checkers_printf_args : t
val class_cast_exception : t
val complexity_increase : kind:CostKind.t -> is_on_ui_thread:bool -> t
val condition_always_false : t
val condition_always_true : t
val config_impact_analysis : t
val config_impact_analysis_strict : t
val pulse_config_usage : t
val pulse_const_refable : t
val constant_address_dereference : latent:bool -> t
val cxx_ref_captured_in_block : t
val dangling_pointer_dereference : t
val dangling_pointer_dereference_maybe : t
val data_flow_to_sink : t
val dead_store : t
val deadlock : t
val divide_by_zero : t
val do_not_report : t

an issue type that should never be reported

val empty_vector_access : t
val expensive_cost_call : kind:CostKind.t -> t
val failure_exe : t
val guardedby_violation : t
val impure_function : t
val inefficient_keyset_iterator : t
val inferbo_alloc_is_big : t
val inferbo_alloc_is_negative : t
val inferbo_alloc_is_zero : t
val inferbo_alloc_may_be_big : t
val inferbo_alloc_may_be_negative : t
val infinite_cost_call : kind:CostKind.t -> t
val inherently_dangerous_function : t
val integer_overflow_l1 : t
val integer_overflow_l2 : t
val integer_overflow_l5 : t
val integer_overflow_u5 : t
val interface_not_thread_safe : t
val internal_error : t
val invalid_sil : t
val invariant_call : t
val ipc_on_ui_thread : t
val lab_resource_leak : t
val leak_after_array_abstraction : t
val leak_in_footprint : t
val leak_unknown_origin : t
val lockless_violation : t
val lock_consistency_violation : t
val expensive_loop_invariant_call : t
val memory_leak : t
val missing_fld : t
val missing_required_prop : t
val mixed_self_weakself : t
val modifies_immutable : t
val multiple_weakself : t
val mutual_recursion_cycle : t
val nil_block_call : latent:bool -> t
val nil_insertion_into_collection : latent:bool -> t
val nil_messaging_to_non_pod : latent:bool -> t
val no_match_of_rhs : latent:bool -> t
val no_matching_case_clause : latent:bool -> t
val no_matching_else_clause : latent:bool -> t
val no_matching_function_clause : latent:bool -> t
val no_true_branch_in_if : latent:bool -> t
val no_matching_branch_in_try : latent:bool -> t
val null_argument : latent:bool -> t
val null_dereference : t
val nullptr_dereference : latent:bool -> t
val nullptr_dereference_in_nullsafe_class : latent:bool -> t
val optional_empty_access : latent:bool -> t
val precondition_not_found : t
val precondition_not_met : t
val premature_nil_termination : t
val pulse_cannot_instantiate_abstract_class : t
val pulse_dict_missing_key : t
val pulse_dynamic_type_mismatch : t
val pulse_transitive_access : t
val pulse_memory_leak_c : t
val pulse_memory_leak_cpp : t
val pulse_resource_leak : t
val pulse_unawaited_awaitable : t
val pulse_unfinished_builder : t
val pulse_uninitialized_const : t
val pure_function : t
val readonly_shared_ptr_param : t
val regex_op_on_ui_thread : t
val resource_leak : t
val retain_cycle : t
val retain_cycle_no_weak_info : t
val scope_leakage : t
val self_in_block_passed_to_init : t
val sensitive_data_flow : t
val skip_function : t
val stack_variable_address_escape : t
val starvation : t
val static_initialization_order_fiasco : t
val strict_mode_violation : t
val strong_self_not_checked : t
val symexec_memory_error : t
val taint_error : t
val thread_safety_violation : t
val topl_error : latent:bool -> t
val uninitialized_value_pulse : t
val unnecessary_copy_pulse : t
val unnecessary_copy_assignment_pulse : t
val unnecessary_copy_assignment_const_pulse : t
val unnecessary_copy_assignment_movable_pulse : t
val unnecessary_copy_intermediate_pulse : t
val unnecessary_copy_intermediate_const_pulse : t
val unnecessary_copy_movable_pulse : t
val unnecessary_copy_optional_pulse : t
val unnecessary_copy_optional_const_pulse : t
val unnecessary_copy_return_pulse : t
val unreachable_code_after : t
val use_after_delete : latent:bool -> t
val use_after_free : latent:bool -> t
val use_after_lifetime : latent:bool -> t
val vector_invalidation : latent:bool -> t
val pulse_reference_stability : t
val weak_self_in_noescape_block : t
val wrong_argument_number : t
val unreachable_cost_call : kind:CostKind.t -> t
module Map : IStdlib.PrettyPrintable.PPMap with type key = t
+ t

Create a new issue and register it in the list of all issues. NOTE: if the issue with the same string id is already registered, overrides `hum` but DOES NOT override `enabled`. This trick allows to deal with disabling/enabling dynamic issues from the config, when we don't know all params yet. Thus, the human-readable description can be updated when we encounter the definition of the issue type.

val checker_can_report : Checker.t -> t -> bool

Whether the issue was registered as coming from the given checker. Important to call this before reporting to keep documentation accurate.

val set_enabled : t -> bool -> unit
val abduction_case_not_implemented : t
val arbitrary_code_execution_under_lock : t
val array_of_pointsto : t
val array_out_of_bounds_l1 : t
val array_out_of_bounds_l2 : t
val array_out_of_bounds_l3 : t
val assert_failure : t
val bad_footprint : t
val bad_arg : latent:bool -> t
val bad_generator : latent:bool -> t
val bad_key : latent:bool -> t
val bad_map : latent:bool -> t
val bad_record : latent:bool -> t
val bad_return : latent:bool -> t
val biabduction_analysis_stops : t
val biabduction_retain_cycle : t
val block_parameter_not_null_checked : t
val buffer_overrun_l1 : t
val buffer_overrun_l2 : t
val buffer_overrun_l3 : t
val buffer_overrun_l4 : t
val buffer_overrun_l5 : t
val buffer_overrun_s2 : t
val buffer_overrun_u5 : t
val cannot_star : t
val captured_strong_self : t
val checkers_allocates_memory : t

Warning name when a performance critical method directly or indirectly calls a method allocating memory

val checkers_annotation_reachability_error : t
val checkers_calls_expensive_method : t

Warning name when a performance critical method directly or indirectly calls a method annotatd as expensive

val checkers_expensive_overrides_unexpensive : t

Warning name for the subtyping rule: method not annotated as expensive cannot be overridden by a method annotated as expensive

val checkers_fragment_retain_view : t
val class_cast_exception : t
val compared_to_null_and_dereferenced : t
val complexity_increase : kind:CostKind.t -> is_on_ui_thread:bool -> t
val condition_always_false : t
val condition_always_true : t
val config_impact_analysis : t
val config_impact_analysis_strict : t
val pulse_config_usage : t
val pulse_const_refable : t
val constant_address_dereference : latent:bool -> t
val cxx_ref_captured_in_block : t
val dangling_pointer_dereference : t
val dangling_pointer_dereference_maybe : t
val data_flow_to_sink : t
val dead_store : t
val deadlock : t
val divide_by_zero : t
val do_not_report : t

an issue type that should never be reported

val empty_vector_access : t
val expensive_cost_call : kind:CostKind.t -> t
val failure_exe : t
val guardedby_violation : t
val impure_function : t
val inefficient_keyset_iterator : t
val inferbo_alloc_is_big : t
val inferbo_alloc_is_negative : t
val inferbo_alloc_is_zero : t
val inferbo_alloc_may_be_big : t
val inferbo_alloc_may_be_negative : t
val infinite_cost_call : kind:CostKind.t -> t
val inherently_dangerous_function : t
val integer_overflow_l1 : t
val integer_overflow_l2 : t
val integer_overflow_l5 : t
val integer_overflow_u5 : t
val interface_not_thread_safe : t
val internal_error : t
val invalid_sil : t
val invariant_call : t
val ipc_on_ui_thread : t
val lab_resource_leak : t
val leak_after_array_abstraction : t
val leak_in_footprint : t
val leak_unknown_origin : t
val lockless_violation : t
val lock_consistency_violation : t
val expensive_loop_invariant_call : t
val memory_leak : t
val missing_fld : t
val missing_required_prop : t
val mixed_self_weakself : t
val modifies_immutable : t
val multiple_weakself : t
val mutual_recursion_cycle : t
val nil_block_call : latent:bool -> t
val nil_insertion_into_collection : latent:bool -> t
val nil_messaging_to_non_pod : latent:bool -> t
val no_match_of_rhs : latent:bool -> t
val no_matching_case_clause : latent:bool -> t
val no_matching_else_clause : latent:bool -> t
val no_matching_function_clause : latent:bool -> t
val no_true_branch_in_if : latent:bool -> t
val no_matching_branch_in_try : latent:bool -> t
val null_argument : latent:bool -> t
val null_dereference : t
val nullptr_dereference : latent:bool -> t
val nullptr_dereference_in_nullsafe_class : latent:bool -> t
val optional_empty_access : latent:bool -> t
val precondition_not_found : t
val precondition_not_met : t
val premature_nil_termination : t
val pulse_cannot_instantiate_abstract_class : t
val pulse_dict_missing_key : t
val pulse_dynamic_type_mismatch : t
val pulse_transitive_access : t
val pulse_memory_leak_c : t
val pulse_memory_leak_cpp : t
val pulse_resource_leak : t
val pulse_unawaited_awaitable : t
val pulse_unfinished_builder : t
val pulse_uninitialized_const : t
val pure_function : t
val readonly_shared_ptr_param : t
val regex_op_on_ui_thread : t
val resource_leak : t
val retain_cycle : t
val retain_cycle_no_weak_info : t
val scope_leakage : t
val self_in_block_passed_to_init : t
val sensitive_data_flow : t
val skip_function : t
val stack_variable_address_escape : t
val starvation : t
val static_initialization_order_fiasco : t
val strict_mode_violation : t
val strong_self_not_checked : t
val symexec_memory_error : t
val taint_error : t
val thread_safety_violation : t
val topl_error : latent:bool -> t
val uninitialized_value_pulse : t
val unnecessary_copy_pulse : t
val unnecessary_copy_assignment_pulse : t
val unnecessary_copy_assignment_const_pulse : t
val unnecessary_copy_assignment_movable_pulse : t
val unnecessary_copy_intermediate_pulse : t
val unnecessary_copy_intermediate_const_pulse : t
val unnecessary_copy_movable_pulse : t
val unnecessary_copy_optional_pulse : t
val unnecessary_copy_optional_const_pulse : t
val unnecessary_copy_return_pulse : t
val unnecessary_copy_thrift_assignment_pulse : t
val unreachable_code_after : t
val use_after_delete : latent:bool -> t
val use_after_free : latent:bool -> t
val use_after_lifetime : latent:bool -> t
val vector_invalidation : latent:bool -> t
val pulse_reference_stability : t
val weak_self_in_noescape_block : t
val wrong_argument_number : t
val unreachable_cost_call : kind:CostKind.t -> t
val lineage_flow : t
module Map : IStdlib.PrettyPrintable.PPMap with type key = t
diff --git a/website/static/odoc/next/infer/IBase/IssuesTestField/index.html b/website/static/odoc/next/infer/IBase/IssuesTestField/index.html index 9b28c7b2b02..6ce65c6af2e 100644 --- a/website/static/odoc/next/infer/IBase/IssuesTestField/index.html +++ b/website/static/odoc/next/infer/IBase/IssuesTestField/index.html @@ -1,2 +1,2 @@ -IssuesTestField (infer.IBase.IssuesTestField)

Module IBase.IssuesTestField

type t =
  1. | BugType
  2. | Qualifier
  3. | Severity
  4. | Suggestion
  5. | Bucket
  6. | Line
  7. | Column
  8. | Procedure
  9. | ProcedureStartLine
  10. | File
  11. | BugTrace
  12. | Key
  13. | Hash
  14. | LineOffset
  15. | QualifierContainsPotentialExceptionNote
  16. | TaintExtra
  17. | TransitiveCalleesExtra
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
val all_symbols : (string * t) list
+IssuesTestField (infer.IBase.IssuesTestField)

Module IBase.IssuesTestField

type t =
  1. | BugType
  2. | Qualifier
  3. | Severity
  4. | Suggestion
  5. | Bucket
  6. | Line
  7. | Column
  8. | Procedure
  9. | ProcedureStartLine
  10. | File
  11. | BugTrace
  12. | Key
  13. | Hash
  14. | LineOffset
  15. | QualifierContainsPotentialExceptionNote
  16. | TaintExtra
  17. | TransitiveCalleesExtra
  18. | Suppressed
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
val all_symbols : (string * t) list
diff --git a/website/static/odoc/next/infer/IBase/Location/index.html b/website/static/odoc/next/infer/IBase/Location/index.html index 4a0297610c9..791e2503252 100644 --- a/website/static/odoc/next/infer/IBase/Location/index.html +++ b/website/static/odoc/next/infer/IBase/Location/index.html @@ -1,2 +1,2 @@ -Location (infer.IBase.Location)

Module IBase.Location

type t = {
  1. file : SourceFile.t;
    (*

    The name of the source file

    *)
  2. line : int;
    (*

    The line number. -1 means "do not know"

    *)
  3. col : int;
    (*

    The column number. -1 means "do not know"

    *)
  4. macro_file_opt : SourceFile.t option;
    (*

    If the location is coming from macro expansion, the name of the file macro is defined in

    *)
  5. macro_line : int;
    (*

    If the location is coming from macro expansion, the line number

    *)
}

Location in the original source file

include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Sexplib0.Sexpable.S with type t := t
val t_of_sexp : Sexplib0__.Sexp.t -> t
val sexp_of_t : t -> Sexplib0__.Sexp.t
include Ppx_hash_lib.Hashable.S with type t := t
val hash_fold_t : t Base__Ppx_hash_lib.hash_fold
val hash : t -> Base__Ppx_hash_lib.Std.Hash.hash_value
val hash_normalize : t -> t
val hash_normalize_opt : t option -> t option
val hash_normalize_list : t list -> t list
val get_macro_file_line_opt : t -> (SourceFile.t * int) option
val equal : t -> t -> bool
val none : SourceFile.t -> t

Dummy source location for the given file

val dummy : t

Dummy location with no source file

val pp : Stdlib.Format.formatter -> t -> unit

Pretty print a location.

val pp_line : Stdlib.Format.formatter -> t -> unit

print just the line information

val to_string : t -> string

String representation of a location.

val pp_file_pos : Stdlib.Format.formatter -> t -> unit

Pretty print a file-position of a location

val pp_range : Stdlib.Format.formatter -> (t * t) -> unit
module Map : IStdlib.PrettyPrintable.PPMap with type key = t
+Location (infer.IBase.Location)

Module IBase.Location

type t = {
  1. file : SourceFile.t;
    (*

    The name of the source file

    *)
  2. line : int;
    (*

    The line number. -1 means "do not know"

    *)
  3. col : int;
    (*

    The column number. -1 means "do not know"

    *)
  4. macro_file_opt : SourceFile.t option;
    (*

    If the location is coming from macro expansion, the name of the file macro is defined in

    *)
  5. macro_line : int;
    (*

    If the location is coming from macro expansion, the line number

    *)
}

Location in the original source file

include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Sexplib0.Sexpable.S with type t := t
val t_of_sexp : Sexplib0__.Sexp.t -> t
val sexp_of_t : t -> Sexplib0__.Sexp.t
include Ppx_hash_lib.Hashable.S with type t := t
val hash_fold_t : t Base__Ppx_hash_lib.hash_fold
val hash : t -> Base__Ppx_hash_lib.Std.Hash.hash_value
val hash_normalize : t -> t
val hash_normalize_opt : t option -> t option
val hash_normalize_list : t list -> t list
val get_macro_file_line_opt : t -> (SourceFile.t * int) option
val equal : t -> t -> bool
val none : SourceFile.t -> t

Dummy source location for the given file

val dummy : t

Dummy location with no source file

val pp : Stdlib.Format.formatter -> t -> unit

Pretty print a location.

val pp_line : Stdlib.Format.formatter -> t -> unit

print just the line information

val pp_file_pos : Stdlib.Format.formatter -> t -> unit

Pretty print a file-position of a location

val pp_range : Stdlib.Format.formatter -> (t * t) -> unit
module Map : IStdlib.PrettyPrintable.PPMap with type key = t
diff --git a/website/static/odoc/next/infer/IBase/Logging/index.html b/website/static/odoc/next/infer/IBase/Logging/index.html index e1b4a5c19c8..d7bfc970125 100644 --- a/website/static/odoc/next/infer/IBase/Logging/index.html +++ b/website/static/odoc/next/infer/IBase/Logging/index.html @@ -9,7 +9,7 @@ 'a
type style =
  1. | Error
  2. | Fatal
  3. | Normal
  4. | Warning
val term_styles_of_style : style -> IStdlib.IStd.ANSITerminal.style list
val environment_info : ('a, F.formatter, unit) IStdlib.IStd.format -> 'a

log information about the environment

val progress : ('a, F.formatter, unit) IStdlib.IStd.format -> 'a

print immediately to standard error unless --quiet is specified

val log_task : ('a, F.formatter, unit) IStdlib.IStd.format -> 'a

log progress in the log file and on the console unless there is an active task bar

val task_progress : f:(unit -> 'a) -> (F.formatter -> 'b -> unit) -> 'b -> 'a

task_progress ~f pp x executes f and log progress pp x in the log file and also on the console unless there is an active task bar

val result : ?style:IStdlib.IStd.ANSITerminal.style list -> ('a, F.formatter, unit) IStdlib.IStd.format -> - 'a

Emit a result to stdout. Use only if the output format is stable and useful enough that it may conceivably get piped to another program, ie, almost never (use progress instead otherwise).

val user_error : ('a, F.formatter, unit) IStdlib.IStd.format -> 'a

bad input, etc. detected

val user_warning : ('a, F.formatter, unit) IStdlib.IStd.format -> 'a

the user may have done something wrong

val internal_error : ('a, F.formatter, unit) IStdlib.IStd.format -> 'a

huho, infer has a bug

val external_error : ('a, F.formatter, unit) IStdlib.IStd.format -> 'a

some other tool has a bug or is called wrongly

val external_warning : ('a, F.formatter, unit) IStdlib.IStd.format -> 'a
type debug_kind =
  1. | Analysis
  2. | BufferOverrun
  3. | Capture
  4. | MergeCapture
  5. | Report
  6. | TestDeterminator
type debug_level =
  1. | Quiet
    (*

    innocuous, eg emitted once per toplevel execution

    *)
  2. | Medium
    (*

    still fairly lightweight, eg emitted O(<number of infer processes>)

    *)
  3. | Verbose
    (*

    go crazy

    *)

Level of verbosity for debug output. Each level enables all the levels before it.

val debug : + 'a

Emit a result to stdout. Use only if the output format is stable and useful enough that it may conceivably get piped to another program, ie, almost never (use progress instead otherwise).

val user_error : ('a, F.formatter, unit) IStdlib.IStd.format -> 'a

bad input, etc. detected

val user_warning : ('a, F.formatter, unit) IStdlib.IStd.format -> 'a

the user may have done something wrong

val internal_error : ('a, F.formatter, unit) IStdlib.IStd.format -> 'a

huho, infer has a bug

val external_error : ('a, F.formatter, unit) IStdlib.IStd.format -> 'a

some other tool has a bug or is called wrongly

val external_warning : ('a, F.formatter, unit) IStdlib.IStd.format -> 'a
type debug_kind =
  1. | Analysis
  2. | BufferOverrun
  3. | Capture
  4. | MergeCapture
  5. | Report
type debug_level =
  1. | Quiet
    (*

    innocuous, eg emitted once per toplevel execution

    *)
  2. | Medium
    (*

    still fairly lightweight, eg emitted O(<number of infer processes>)

    *)
  3. | Verbose
    (*

    go crazy

    *)

Level of verbosity for debug output. Each level enables all the levels before it.

val debug : debug_kind -> debug_level -> ('a, F.formatter, unit) IStdlib.IStd.format -> diff --git a/website/static/odoc/next/infer/IBase/ProcessPoolState/index.html b/website/static/odoc/next/infer/IBase/ProcessPoolState/index.html index be7a71ec3c2..8a34be4f1db 100644 --- a/website/static/odoc/next/infer/IBase/ProcessPoolState/index.html +++ b/website/static/odoc/next/infer/IBase/ProcessPoolState/index.html @@ -1,2 +1,2 @@ -ProcessPoolState (infer.IBase.ProcessPoolState)

Module IBase.ProcessPoolState

val in_child : int option IStdlib.IStd.ref

Keep track of whether the current execution is in a child process

val update_status : (Mtime.t -> string -> unit) IStdlib.IStd.ref

Ping the task bar whenever a new task is started with the start time and a description for the task

val update_heap_words : (unit -> unit) IStdlib.IStd.ref
val get_pid : unit -> IStdlib.IStd.Pid.t
val reset_pid : unit -> unit
val has_running_children : bool IStdlib.IStd.ref
+ProcessPoolState (infer.IBase.ProcessPoolState)

Module IBase.ProcessPoolState

val in_child : int option IStdlib.IStd.ref

Keep track of whether the current execution is in a child process

val update_status : (Mtime.t option -> string -> unit) IStdlib.IStd.ref

Ping the task bar whenever a new task is started with the start time (or just rename the current task if the start time is None) and a description for the task

val update_heap_words : (unit -> unit) IStdlib.IStd.ref
val get_pid : unit -> IStdlib.IStd.Pid.t
val reset_pid : unit -> unit
val has_running_children : bool IStdlib.IStd.ref
diff --git a/website/static/odoc/next/infer/IBase/ResultsDirEntryName/index.html b/website/static/odoc/next/infer/IBase/ResultsDirEntryName/index.html index 885eec619b8..c123340adff 100644 --- a/website/static/odoc/next/infer/IBase/ResultsDirEntryName/index.html +++ b/website/static/odoc/next/infer/IBase/ResultsDirEntryName/index.html @@ -1,4 +1,4 @@ -ResultsDirEntryName (infer.IBase.ResultsDirEntryName)

Module IBase.ResultsDirEntryName

Entries in the results directory (infer-out/).

type id =
  1. | AllocationTraces
    (*

    directory for storing allocation traces

    *)
  2. | AnalysisDependencyGraph
    (*

    the inter-procedures dependencies revealed during an analysis phase; used for the replay analysis

    *)
  3. | AnalysisDependencyGraphDot
    (*

    the above in dotty format, for debug

    *)
  4. | AnalysisDependencyInvalidationGraphDot
    (*

    the inter-procedures dependencies revealed during an analysis phase used for invalidating procedure summaries that need re-analyzing, in dotty format for debug

    *)
  5. | AnalysisDB
    (*

    the analysis database

    *)
  6. | AnalysisDBShm
    (*

    SQLite-generated index file for the results database's write-ahead log

    *)
  7. | AnalysisDBWal
    (*

    the results database's write-ahead log generated by SQLite

    *)
  8. | CallGraphCyclesDot
    (*

    cycles in the call graph used for analysis scheduling in dotty format

    *)
  9. | CaptureDB
    (*

    the capture database

    *)
  10. | CaptureDBShm
    (*

    SQLite-generated index file for the capture database's write-ahead log

    *)
  11. | CaptureDBWal
    (*

    the capture database's write-ahead log generated by SQLite

    *)
  12. | CaptureDependencies
    (*

    list of infer-out/ directories that contain capture artefacts

    *)
  13. | ChangedFunctions
    (*

    results of the clang test determinator

    *)
  14. | ChangedFunctionsTempResults
    (*

    a directory for temporary ChangedFunctions files

    *)
  15. | DBWriterSocket
    (*

    socket to the DBWriter process for serializing writes to SQLite

    *)
  16. | Debug
    (*

    directory containing debug data

    *)
  17. | Differential
    (*

    contains the results of infer reportdiff

    *)
  18. | DuplicateFunctions
    (*

    list of duplicated functions

    *)
  19. | GlobalTypeEnvironment
    (*

    internal IR.Tenv.t object corresponding to the whole project

    *)
  20. | Logs
    (*

    log file

    *)
  21. | MissingSourceFiles
    (*

    Source files missing during analysis

    *)
  22. | MissingProcedures
    (*

    Procedures missing during analysis

    *)
  23. | PerfEvents
    (*

    file containing events for performance profiling

    *)
  24. | ProcnamesLocks
    (*

    directory of per-IR.Procname.t file locks, used by the analysis scheduler in certain modes

    *)
  25. | ReactiveCaptureMissingTypes
    (*

    file containing missed types (reactive capture mode)

    *)
  26. | ReportConfigImpactJson
    (*

    reports of the config impact analysis

    *)
  27. | ReportCostsJson
    (*

    reports of the costs analysis

    *)
  28. | ReportHtml
    (*

    directory of the HTML report

    *)
  29. | ReportJson
    (*

    the main product of the analysis: report.json

    *)
  30. | ReportSarif
    (*

    a sarif version of report.json: report.sarif

    *)
  31. | ReportText
    (*

    a human-readable textual version of report.json

    *)
  32. | ReportXML
    (*

    a PMD-style XML version of report.json

    *)
  33. | RetainCycles
    (*

    directory of retain cycles dotty files

    *)
  34. | RunState
    (*

    internal data about the last infer run

    *)
  35. | Stats
    (*

    internal statistics about the infer run

    *)
  36. | SyntacticDependencyGraphDot
    (*

    the inter-procedures dependencies obtained by syntactically inspecting the source of each procedure and recording the (static) calls it makes during an analysis phase; used by the callgraph analysis scheduler and presented here in dotty format for debug purposes

    *)
  37. | Temporary
    (*

    directory containing temp files

    *)
  38. | TestDeterminatorReport
    (*

    the report produced by the test determinator capture mode

    *)
  39. | TestDeterminatorTempResults
    (*

    a directory for temporary TestDeterminatorReport files

    *)
val get_path : results_dir:string -> id -> string

the absolute path for the given entry

val to_keep_before_incremental_capture_and_analysis : +ResultsDirEntryName (infer.IBase.ResultsDirEntryName)

Module IBase.ResultsDirEntryName

Entries in the results directory (infer-out/).

type id =
  1. | AllocationTraces
    (*

    directory for storing allocation traces

    *)
  2. | AnalysisDependencyGraph
    (*

    the inter-procedures dependencies revealed during an analysis phase; used for the replay analysis

    *)
  3. | AnalysisDependencyGraphDot
    (*

    the above in dotty format, for debug

    *)
  4. | AnalysisDependencyInvalidationGraphDot
    (*

    the inter-procedures dependencies revealed during an analysis phase used for invalidating procedure summaries that need re-analyzing, in dotty format for debug

    *)
  5. | AnalysisDB
    (*

    the analysis database

    *)
  6. | AnalysisDBShm
    (*

    SQLite-generated index file for the results database's write-ahead log

    *)
  7. | AnalysisDBWal
    (*

    the results database's write-ahead log generated by SQLite

    *)
  8. | CallGraphCyclesDot
    (*

    cycles in the call graph used for analysis scheduling in dotty format

    *)
  9. | CaptureDB
    (*

    the capture database

    *)
  10. | CaptureDBShm
    (*

    SQLite-generated index file for the capture database's write-ahead log

    *)
  11. | CaptureDBWal
    (*

    the capture database's write-ahead log generated by SQLite

    *)
  12. | CaptureDependencies
    (*

    list of infer-out/ directories that contain capture artefacts

    *)
  13. | ChangedFunctions
    (*

    results of the clang test determinator

    *)
  14. | DBWriterSocket
    (*

    socket to the DBWriter process for serializing writes to SQLite

    *)
  15. | Debug
    (*

    directory containing debug data

    *)
  16. | Differential
    (*

    contains the results of infer reportdiff

    *)
  17. | DuplicateFunctions
    (*

    list of duplicated functions

    *)
  18. | GlobalTypeEnvironment
    (*

    internal IR.Tenv.t object corresponding to the whole project

    *)
  19. | Logs
    (*

    log file

    *)
  20. | MissingSourceFiles
    (*

    Source files missing during analysis

    *)
  21. | MissingProcedures
    (*

    Procedures missing during analysis

    *)
  22. | PerfEvents
    (*

    file containing events for performance profiling

    *)
  23. | ProcnamesLocks
    (*

    directory of per-IR.Procname.t file locks, used by the analysis scheduler in certain modes

    *)
  24. | ReactiveCaptureMissingTypes
    (*

    file containing missed types (reactive capture mode)

    *)
  25. | ReportConfigImpactJson
    (*

    reports of the config impact analysis

    *)
  26. | ReportCostsJson
    (*

    reports of the costs analysis

    *)
  27. | ReportHtml
    (*

    directory of the HTML report

    *)
  28. | ReportJson
    (*

    the main product of the analysis: report.json

    *)
  29. | ReportSarif
    (*

    a sarif version of report.json: report.sarif

    *)
  30. | ReportText
    (*

    a human-readable textual version of report.json

    *)
  31. | ReportXML
    (*

    a PMD-style XML version of report.json

    *)
  32. | RetainCycles
    (*

    directory of retain cycles dotty files

    *)
  33. | RunState
    (*

    internal data about the last infer run

    *)
  34. | Stats
    (*

    internal statistics about the infer run

    *)
  35. | SyntacticDependencyGraphDot
    (*

    the inter-procedures dependencies obtained by syntactically inspecting the source of each procedure and recording the (static) calls it makes during an analysis phase; used by the callgraph analysis scheduler and presented here in dotty format for debug purposes

    *)
  36. | Temporary
    (*

    directory containing temp files

    *)
val get_path : results_dir:string -> id -> string

the absolute path for the given entry

val to_keep_before_incremental_capture_and_analysis : results_dir:string -> string list

utility for ResultsDir.scrub_for_incremental, you probably want to use that instead

val to_keep_before_caching_capture : results_dir:string -> string list

utility for ResultsDir.scrub_for_caching, you probably want to use that instead

val to_keep_before_new_capture : results_dir:string -> string list

utility for ResultsDir.remove_results_dir, you probably want to use that instead

val db_writer_socket_name : string

see comment in DBWriter as to why we need the relative path of the socket

val infer_deps_file_name : string

sad that we have to have this here but some code path is looking for all files with that name in buck-out/

diff --git a/website/static/odoc/next/infer/IBase/Stats/index.html b/website/static/odoc/next/infer/IBase/Stats/index.html index a85b33a46c6..0a0ec6f5206 100644 --- a/website/static/odoc/next/infer/IBase/Stats/index.html +++ b/website/static/odoc/next/infer/IBase/Stats/index.html @@ -1,2 +1,2 @@ -Stats (infer.IBase.Stats)

Module IBase.Stats

collect statistics about backend/analysis operations

type t
val incr_summary_file_try_load : unit -> unit

a query to the filesystem attempting to load a summary file

val incr_summary_read_from_disk : unit -> unit

a summary file is deserialized from disk

val incr_summary_cache_hits : unit -> unit
val incr_summary_cache_misses : unit -> unit
val incr_ondemand_procs_analyzed : unit -> unit
val add_to_proc_locker_lock_time : ExecutionDuration.t -> unit
val add_to_proc_locker_unlock_time : ExecutionDuration.t -> unit
val add_to_restart_scheduler_total_time : ExecutionDuration.t -> unit
val add_to_restart_scheduler_useful_time : ExecutionDuration.t -> unit
val incr_pulse_aliasing_contradictions : unit -> unit
val incr_pulse_args_length_contradictions : unit -> unit
val incr_pulse_captured_vars_length_contradictions : unit -> unit
val add_pulse_disjuncts_dropped : int -> unit
val add_pulse_interrupted_loops : int -> unit
val incr_pulse_summaries_contradictions : unit -> unit
val incr_pulse_summaries_unsat_for_caller : unit -> unit
val incr_pulse_summaries_with_some_unreachable_nodes : unit -> unit
val incr_pulse_summaries_with_some_unreachable_returns : unit -> unit
val incr_pulse_summaries_count_0_continue_program : unit -> unit
val add_pulse_summaries_count : int -> unit
val add_proc_duration_us : string -> string -> int -> unit
val incr_topl_reachable_calls : unit -> unit
val incr_timeouts : unit -> unit
val add_timing : Timeable.t -> float -> unit
val set_process_times : ExecutionDuration.t -> unit
val set_useful_times : ExecutionDuration.t -> unit
val incr_spec_store_times : ExecutionDuration.counter -> unit
val reset : unit -> unit

reset all stats

val get : unit -> t

get the stats so far

val log_aggregate : t list -> unit

log aggregated stats to infer's log file and to Scuba

+Stats (infer.IBase.Stats)

Module IBase.Stats

collect statistics about backend/analysis operations

type t
val incr_summary_file_try_load : unit -> unit

a query to the filesystem attempting to load a summary file

val incr_summary_read_from_disk : unit -> unit

a summary file is deserialized from disk

val incr_summary_cache_hits : unit -> unit
val incr_summary_cache_misses : unit -> unit
val incr_ondemand_procs_analyzed : unit -> unit
val add_to_proc_locker_lock_time : ExecutionDuration.t -> unit
val add_to_proc_locker_unlock_time : ExecutionDuration.t -> unit
val add_to_restart_scheduler_total_time : ExecutionDuration.t -> unit
val add_to_restart_scheduler_useful_time : ExecutionDuration.t -> unit
val incr_pulse_aliasing_contradictions : unit -> unit
val incr_pulse_args_length_contradictions : unit -> unit
val incr_pulse_captured_vars_length_contradictions : unit -> unit
val add_pulse_disjuncts_dropped : int -> unit
val add_pulse_interrupted_loops : int -> unit
val incr_pulse_unknown_calls : unit -> unit
val incr_pulse_unknown_calls_on_hack_resource : unit -> unit
val incr_pulse_summaries_contradictions : unit -> unit
val incr_pulse_summaries_unsat_for_caller : unit -> unit
val incr_pulse_summaries_with_some_unreachable_nodes : unit -> unit
val incr_pulse_summaries_with_some_unreachable_returns : unit -> unit
val incr_pulse_summaries_count_0_continue_program : unit -> unit
val add_pulse_summaries_count : int -> unit
val add_proc_duration_us : string -> string -> int -> unit
val incr_topl_reachable_calls : unit -> unit
val incr_timeouts : unit -> unit
val add_timing : Timeable.t -> float -> unit
val set_process_times : ExecutionDuration.t -> unit
val set_useful_times : ExecutionDuration.t -> unit
val incr_spec_store_times : ExecutionDuration.counter -> unit
val reset : unit -> unit

reset all stats

val get : unit -> t

get the stats so far

val log_aggregate : t list -> unit

log aggregated stats to infer's log file and to Scuba

diff --git a/website/static/odoc/next/infer/IBase/TaskBar/index.html b/website/static/odoc/next/infer/IBase/TaskBar/index.html index faabfa29c61..5b2e264400d 100644 --- a/website/static/odoc/next/infer/IBase/TaskBar/index.html +++ b/website/static/odoc/next/infer/IBase/TaskBar/index.html @@ -2,7 +2,7 @@ TaskBar (infer.IBase.TaskBar)

Module IBase.TaskBar

type t
val refresh : t -> unit

draw the taskbar

val create : jobs:int -> t

creates a task bar for running jobs jobs in parallel

val update_status : t -> slot:int -> - Mtime.t -> + Mtime.t option -> ?heap_words:int -> string -> - unit

update_status task_bar ~slot t ?heap_words status records an event described by status on slot slot started at time t with total size of the major heap heap_words

val update_heap_words : t -> slot:int -> int -> unit

update_heap_words task_bar ~slot heap_words records heap_words on slot slot

val set_tasks_total : t -> int -> unit

set the total number of tasks to do

val tasks_done_reset : t -> unit

record that 0 tasks have been completed so far

val set_remaining_tasks : t -> int -> unit

set the number of tasks remaining to complete

val finish : t -> unit

tear down the task bar and ready the terminal for more output

+ unit

update_status task_bar ~slot t ?heap_words status records an event described by status on slot slot started at time t with total size of the major heap heap_words. If t is None then the timer for the current task is not reset, so in effect this simply renames the currently-running task on slot slot.

val update_heap_words : t -> slot:int -> int -> unit

update_heap_words task_bar ~slot heap_words records heap_words on slot slot

val set_tasks_total : t -> int -> unit

set the total number of tasks to do

val tasks_done_reset : t -> unit

record that 0 tasks have been completed so far

val set_remaining_tasks : t -> int -> unit

set the number of tasks remaining to complete

val finish : t -> unit

tear down the task bar and ready the terminal for more output

diff --git a/website/static/odoc/next/infer/IBase/Utils/index.html b/website/static/odoc/next/infer/IBase/Utils/index.html index 1f5221face4..bee82010f96 100644 --- a/website/static/odoc/next/infer/IBase/Utils/index.html +++ b/website/static/odoc/next/infer/IBase/Utils/index.html @@ -16,7 +16,7 @@ ?retry:bool -> string -> f:(IStdlib.IStd.Out_channel.t -> 'a) -> - 'a

like with_file_out but uses a fresh intermediate temporary file and rename to avoid write-write races

val write_json_to_file : string -> Yojson.Safe.t -> unit
val consume_in : IStdlib.IStd.In_channel.t -> unit

consume and ignore all the lines from the channel until End_of_file is reached

val echo_in : IStdlib.IStd.In_channel.t -> unit

echo the lines we get to stdout until End_of_file is reached

val with_channel_in : f:(string -> unit) -> IStdlib.IStd.In_channel.t -> unit
val with_process_in : + 'a

like with_file_out but uses a fresh intermediate temporary file and rename to avoid write-write races

val consume_in : IStdlib.IStd.In_channel.t -> unit

consume and ignore all the lines from the channel until End_of_file is reached

val echo_in : IStdlib.IStd.In_channel.t -> unit

echo the lines we get to stdout until End_of_file is reached

val with_channel_in : f:(string -> unit) -> IStdlib.IStd.In_channel.t -> unit
val with_process_in : string -> (IStdlib.IStd.In_channel.t -> 'a) -> 'a * IStdlib.IStd.Unix.Exit_or_signal.t
val create_dir : string -> unit

recursively create a directory if it does not exist already

val out_channel_create_with_dir : diff --git a/website/static/odoc/next/infer/IBase/index.html b/website/static/odoc/next/infer/IBase/index.html index 1bd3be9e85f..007dfd20aae 100644 --- a/website/static/odoc/next/infer/IBase/index.html +++ b/website/static/odoc/next/infer/IBase/index.html @@ -1,2 +1,2 @@ -IBase (infer.IBase)

Module IBase

module AnalysisRequest : sig ... end
module BuckMode : sig ... end
module Checker : sig ... end
module ClangProc : sig ... end
module CommandDoc : sig ... end
module CommandLineOption : sig ... end

Definition and parsing of command line arguments

module Config : sig ... end

Configuration values: either constant, determined at compile time, or set at startup time by system calls, environment variables, or command line options

module CostIssues : sig ... end
module CostIssuesTestField : sig ... end
module CostKind : sig ... end
module DB : sig ... end

Database of analysis results

module DBWriter : sig ... end
module Database : sig ... end
module Die : sig ... end
module EarlyScubaLogging : sig ... end
module Epilogues : sig ... end
module Exception : sig ... end

The restart scheduler and biabduction use exceptions for control flow (restarts/timeouts respectively). Functions here abstract away the semantics of when an exception can be ignored.

module ExecutionDuration : sig ... end
module FileDiff : sig ... end
module ForkUtils : sig ... end
module IssueType : sig ... end
module IssuesTestField : sig ... end
module Language : sig ... end
module LineReader : sig ... end

Module to read specific lines from files. The data from any file will stay in memory until the handle is collected by the gc

module Location : sig ... end
module LogEntry : sig ... end

Log entry data model, global log entry store and functions to manipulate it. Direct access to the store is not exposed.

module Logging : sig ... end

log messages at different levels of verbosity

module MarkupFormatter : sig ... end
module MissingDependencyException : sig ... end
module PayloadId : sig ... end
module PerfEvent : sig ... end
module Process : sig ... end
module ProcessPool : sig ... end
module ProcessPoolState : sig ... end
module RestartSchedulerException : sig ... end
module ResultsDir : sig ... end
module ResultsDirEntryName : sig ... end

Entries in the results directory (infer-out/).

module Scuba : sig ... end

Low-level Scuba logging functionality. Provides functionality to log anything to any scuba table. (Note that Scuba is a schema-free storage, so it won't require any changes). Don't use this module directly for logging to tables with known structure. Use high-level functions that are aware of the table structure.

module ScubaLogging : sig ... end

Functionality for logging into "infer_events" Scuba table. The table is organized in form of key-value pairs. Two most important fields are "event" and "value". Other fields in the table correspond to things common for this particular run of Infer.

module Serialization : sig ... end

Serialization of data stuctures

module SourceFile : sig ... end
module SqliteUtils : sig ... end
module Stats : sig ... end

collect statistics about backend/analysis operations

module TaskBar : sig ... end
module Timeable : sig ... end
module Timer : sig ... end

Time long-running operations listed in Timeable under a timeout

module Timings : sig ... end
module ToplAst : sig ... end
module ToplLexer : sig ... end
module ToplParser : sig ... end
module Utils : sig ... end
module Version : sig ... end
+IBase (infer.IBase)

Module IBase

module AnalysisRequest : sig ... end
module BuckMode : sig ... end
module Checker : sig ... end
module CommandDoc : sig ... end
module CommandLineOption : sig ... end

Definition and parsing of command line arguments

module Config : sig ... end

Configuration values: either constant, determined at compile time, or set at startup time by system calls, environment variables, or command line options

module CostIssues : sig ... end
module CostIssuesTestField : sig ... end
module CostKind : sig ... end
module DB : sig ... end

Database of analysis results

module DBWriter : sig ... end
module Database : sig ... end
module Die : sig ... end
module EarlyScubaLogging : sig ... end
module Epilogues : sig ... end
module Exception : sig ... end

The restart scheduler and biabduction use exceptions for control flow (restarts/timeouts respectively). Functions here abstract away the semantics of when an exception can be ignored.

module ExecutionDuration : sig ... end
module FileDiff : sig ... end
module ForkUtils : sig ... end
module IssueType : sig ... end
module IssuesTestField : sig ... end
module Language : sig ... end
module LineReader : sig ... end

Module to read specific lines from files. The data from any file will stay in memory until the handle is collected by the gc

module Location : sig ... end
module LogEntry : sig ... end

Log entry data model, global log entry store and functions to manipulate it. Direct access to the store is not exposed.

module Logging : sig ... end

log messages at different levels of verbosity

module MarkupFormatter : sig ... end
module MissingDependencyException : sig ... end
module PayloadId : sig ... end
module PerfEvent : sig ... end
module Process : sig ... end
module ProcessPool : sig ... end
module ProcessPoolState : sig ... end
module RestartSchedulerException : sig ... end
module ResultsDir : sig ... end
module ResultsDirEntryName : sig ... end

Entries in the results directory (infer-out/).

module Scuba : sig ... end

Low-level Scuba logging functionality. Provides functionality to log anything to any scuba table. (Note that Scuba is a schema-free storage, so it won't require any changes). Don't use this module directly for logging to tables with known structure. Use high-level functions that are aware of the table structure.

module ScubaLogging : sig ... end

Functionality for logging into "infer_events" Scuba table. The table is organized in form of key-value pairs. Two most important fields are "event" and "value". Other fields in the table correspond to things common for this particular run of Infer.

module Serialization : sig ... end

Serialization of data stuctures

module SourceFile : sig ... end
module SqliteUtils : sig ... end
module Stats : sig ... end

collect statistics about backend/analysis operations

module TaskBar : sig ... end
module Timeable : sig ... end
module Timer : sig ... end

Time long-running operations listed in Timeable under a timeout

module Timings : sig ... end
module ToplAst : sig ... end
module ToplLexer : sig ... end
module ToplParser : sig ... end
module Utils : sig ... end
module Version : sig ... end
diff --git a/website/static/odoc/next/infer/IR/Annot/Item/index.html b/website/static/odoc/next/infer/IR/Annot/Item/index.html index ceece237c26..9a25487f38c 100644 --- a/website/static/odoc/next/infer/IR/Annot/Item/index.html +++ b/website/static/odoc/next/infer/IR/Annot/Item/index.html @@ -1,2 +1,2 @@ -Item (infer.IR.Annot.Item)

Module Annot.Item

type nonrec t = t list

Annotation for one item: a list of annotations with visibility.

include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
include Ppx_hash_lib.Hashable.S with type t := t
val hash_fold_t : t Base__Ppx_hash_lib.hash_fold
val hash : t -> Base__Ppx_hash_lib.Std.Hash.hash_value
val hash_normalize : t -> t
val hash_normalize_opt : t option -> t option
val hash_normalize_list : t list -> t list
val pp : F.formatter -> t -> unit

Pretty print an item annotation.

val empty : t

Empty item annotation.

val is_empty : t -> bool
val is_final : t -> bool

Check if final annotation is included in.

val is_notnull : t -> bool

Check if notnull annotation is included in.

+Item (infer.IR.Annot.Item)

Module Annot.Item

type nonrec t = t list

Annotation for one item: a list of annotations with visibility.

include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
include Ppx_hash_lib.Hashable.S with type t := t
val hash_fold_t : t Base__Ppx_hash_lib.hash_fold
val hash : t -> Base__Ppx_hash_lib.Std.Hash.hash_value
val hash_normalize : t -> t
val hash_normalize_opt : t option -> t option
val hash_normalize_list : t list -> t list
val pp : F.formatter -> t -> unit

Pretty print an item annotation.

val empty : t

Empty item annotation.

val is_abstract : t -> bool

Check if abstract annotation is included in.

val is_empty : t -> bool
val is_final : t -> bool

Check if final annotation is included in.

val is_notnull : t -> bool

Check if notnull annotation is included in.

diff --git a/website/static/odoc/next/infer/IR/Annot/index.html b/website/static/odoc/next/infer/IR/Annot/index.html index 8c1a79e206a..cac406443f0 100644 --- a/website/static/odoc/next/infer/IR/Annot/index.html +++ b/website/static/odoc/next/infer/IR/Annot/index.html @@ -1,2 +1,2 @@ -Annot (infer.IR.Annot)

Module IR.Annot

The Smallfoot Intermediate Language: Annotations

module F = Stdlib.Format
type t = {
  1. class_name : string;
    (*

    name of the annotation

    *)
  2. parameters : parameter list;
}

Type to represent an @Annotation with potentially complex parameter values such as arrays or other annotations.

and parameter = {
  1. name : string option;
  2. value : value;
}
and value =
  1. | Str of string
  2. | Bool of bool
  3. | Enum of {
    1. class_typ : Typ.t;
    2. value : string;
    }
  4. | Array of value list
  5. | Class of Typ.t
  6. | Annot of t

Type to represent possible annotation parameter values. Note that support for numeric parameters is missing for now due to an issue with MaximumSharing and int64.

val equal : t -> t -> bool
val equal_parameter : parameter -> parameter -> bool
val equal_value : value -> value -> bool
val hash_normalize : t -> t
val hash_normalize_opt : t option -> t option
val hash_normalize_list : t list -> t list
val hash_normalize_parameter : parameter -> parameter
val hash_normalize_parameter_opt : parameter option -> parameter option
val hash_normalize_parameter_list : parameter list -> parameter list
val hash_normalize_value : value -> value
val hash_normalize_value_opt : value option -> value option
val hash_normalize_value_list : value list -> value list
val compare : t -> t -> int
val compare_parameter : parameter -> parameter -> int
val compare_value : value -> value -> int
val volatile : t

annotation for fields marked with the "volatile" keyword

val final : t

annotation for fields marked with the "final" keyword

val notnull : t

annotation for fields/params marked as "never null"

val has_matching_str_value : pred:(string -> bool) -> value -> bool

Check if annotation parameter value contains a string satisfying a predicate. For convenience it works both with raw Str, Str inside Array and Enum values.

val find_parameter : t -> name:string -> value option
val pp : F.formatter -> t -> unit

Pretty print an annotation.

module Item : sig ... end
module Class : sig ... end
+Annot (infer.IR.Annot)

Module IR.Annot

The Smallfoot Intermediate Language: Annotations

module F = Stdlib.Format
type t = {
  1. class_name : string;
    (*

    name of the annotation

    *)
  2. parameters : parameter list;
}

Type to represent an @Annotation with potentially complex parameter values such as arrays or other annotations.

and parameter = {
  1. name : string option;
  2. value : value;
}
and value =
  1. | Str of string
  2. | Bool of bool
  3. | Enum of {
    1. class_typ : Typ.t;
    2. value : string;
    }
  4. | Array of value list
  5. | Class of Typ.t
  6. | Annot of t

Type to represent possible annotation parameter values. Note that support for numeric parameters is missing for now due to an issue with MaximumSharing and int64.

val equal : t -> t -> bool
val equal_parameter : parameter -> parameter -> bool
val equal_value : value -> value -> bool
val hash_normalize : t -> t
val hash_normalize_opt : t option -> t option
val hash_normalize_list : t list -> t list
val hash_normalize_parameter : parameter -> parameter
val hash_normalize_parameter_opt : parameter option -> parameter option
val hash_normalize_parameter_list : parameter list -> parameter list
val hash_normalize_value : value -> value
val hash_normalize_value_opt : value option -> value option
val hash_normalize_value_list : value list -> value list
val compare : t -> t -> int
val compare_parameter : parameter -> parameter -> int
val compare_value : value -> value -> int
val abstract : t

annotation for fields marked with the "abstract" keyword

val volatile : t

annotation for fields marked with the "volatile" keyword

val final : t

annotation for fields marked with the "final" keyword

val notnull : t

annotation for fields/params marked as "never null"

val has_matching_str_value : pred:(string -> bool) -> value -> bool

Check if annotation parameter value contains a string satisfying a predicate. For convenience it works both with raw Str, Str inside Array and Enum values.

val find_parameter : t -> name:string -> value option
val pp : F.formatter -> t -> unit

Pretty print an annotation.

module Item : sig ... end
module Class : sig ... end
diff --git a/website/static/odoc/next/infer/IR/CallFlags/index.html b/website/static/odoc/next/infer/IR/CallFlags/index.html index 0a8d24d451e..64c2ca9c7e8 100644 --- a/website/static/odoc/next/infer/IR/CallFlags/index.html +++ b/website/static/odoc/next/infer/IR/CallFlags/index.html @@ -1,2 +1,2 @@ -CallFlags (infer.IR.CallFlags)

Module IR.CallFlags

The Smallfoot Intermediate Language: Call Flags

module F = Stdlib.Format
type t = {
  1. cf_assign_last_arg : bool;
  2. cf_injected_destructor : bool;
    (*

    true if this is an implicit C++ destructor call injected by the clang frontend

    *)
  3. cf_interface : bool;
  4. cf_is_objc_block : bool;
  5. cf_is_c_function_ptr : bool;
  6. cf_virtual : bool;
}

Flags for a procedure call

include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
include Ppx_hash_lib.Hashable.S with type t := t
val hash_fold_t : t Base__Ppx_hash_lib.hash_fold
val hash : t -> Base__Ppx_hash_lib.Std.Hash.hash_value
val hash_normalize : t -> t
val hash_normalize_opt : t option -> t option
val hash_normalize_list : t list -> t list
val pp : F.formatter -> t -> unit
val default : t

Default value where all fields are set to false

+CallFlags (infer.IR.CallFlags)

Module IR.CallFlags

The Smallfoot Intermediate Language: Call Flags

module F = Stdlib.Format
type t = {
  1. cf_assign_last_arg : bool;
  2. cf_injected_destructor : bool;
    (*

    true if this is an implicit C++ destructor call injected by the clang frontend

    *)
  3. cf_interface : bool;
  4. cf_is_objc_block : bool;
  5. cf_virtual : bool;
}

Flags for a procedure call

include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
include Ppx_hash_lib.Hashable.S with type t := t
val hash_fold_t : t Base__Ppx_hash_lib.hash_fold
val hash : t -> Base__Ppx_hash_lib.Std.Hash.hash_value
val hash_normalize : t -> t
val hash_normalize_opt : t option -> t option
val hash_normalize_list : t list -> t list
val pp : F.formatter -> t -> unit
val default : t

Default value where all fields are set to false

diff --git a/website/static/odoc/next/infer/IR/CapturedVar/index.html b/website/static/odoc/next/infer/IR/CapturedVar/index.html index 1bf1cda7d9a..8569a1e36df 100644 --- a/website/static/odoc/next/infer/IR/CapturedVar/index.html +++ b/website/static/odoc/next/infer/IR/CapturedVar/index.html @@ -4,4 +4,4 @@ capture_mode -> Ppx_hash_lib.Std.Hash.state
val hash_capture_mode : capture_mode -> Ppx_hash_lib.Std.Hash.hash_value
val hash_normalize_capture_mode : capture_mode -> capture_mode
val hash_normalize_capture_mode_opt : capture_mode option -> - capture_mode option
val hash_normalize_capture_mode_list : capture_mode list -> capture_mode list
val string_of_capture_mode : capture_mode -> string
val is_captured_by_ref : capture_mode -> bool
type t = {
  1. pvar : Pvar.t;
  2. typ : Typ.t;
  3. capture_mode : capture_mode;
}
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
val hash_normalize : t -> t
val hash_normalize_opt : t option -> t option
val hash_normalize_list : t list -> t list
val pp : Stdlib.Format.formatter -> t -> unit
+ capture_mode option
val hash_normalize_capture_mode_list : capture_mode list -> capture_mode list
val string_of_capture_mode : capture_mode -> string
val is_captured_by_ref : capture_mode -> bool
type t = {
  1. pvar : Pvar.t;
  2. typ : Typ.t;
  3. capture_mode : capture_mode;
  4. is_formal_of : Procname.t option;
}

is_formal only set for captured variables in Objective-C blocks

include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
val yojson_of_t : t -> Ppx_yojson_conv_lib.Yojson.Safe.t
include Sexplib0.Sexpable.S with type t := t
val t_of_sexp : Sexplib0__.Sexp.t -> t
val sexp_of_t : t -> Sexplib0__.Sexp.t
include Ppx_hash_lib.Hashable.S with type t := t
val hash_fold_t : t Base__Ppx_hash_lib.hash_fold
val hash : t -> Base__Ppx_hash_lib.Std.Hash.hash_value
val hash_normalize : t -> t
val hash_normalize_opt : t option -> t option
val hash_normalize_list : t list -> t list
val pp : Stdlib.Format.formatter -> t -> unit
diff --git a/website/static/odoc/next/infer/IR/Exp/index.html b/website/static/odoc/next/infer/IR/Exp/index.html index 2dce341ddbc..1ada6bb9ede 100644 --- a/website/static/odoc/next/infer/IR/Exp/index.html +++ b/website/static/odoc/next/infer/IR/Exp/index.html @@ -1,5 +1,5 @@ -Exp (infer.IR.Exp)

Module IR.Exp

The Smallfoot Intermediate Language: Expressions

NOTE: For doing substitutionson expressions, there are some functions in Sil.

module F = Stdlib.Format
type closure = {
  1. name : Procname.t;
  2. captured_vars : (t * Pvar.t * Typ.t * CapturedVar.capture_mode) list;
}
and sizeof_data = {
  1. typ : Typ.t;
  2. nbytes : int option;
  3. dynamic_length : t option;
  4. subtype : Subtype.t;
  5. nullable : bool;
}

This records information about a sizeof(typ) expression.

nbytes represents the result of the evaluation of sizeof(typ) if it is statically known.

If typ is of the form Tarray elt (Some static_length), then dynamic_length is the number of elements of type elt in the array. The dynamic_length, tracked by symbolic execution, may differ from the static_length obtained from the type definition, e.g. when an array is over-allocated.

If typ is a struct type, the dynamic_length is that of the final extensible array, if any.

and t =
  1. | Var of Ident.t
    (*

    Pure variable: it is not an lvalue

    *)
  2. | UnOp of Unop.t * t * Typ.t option
    (*

    Unary operator with type of the result if known

    *)
  3. | BinOp of Binop.t * t * t
    (*

    Binary operator

    *)
  4. | Exn of t
    (*

    Exception

    *)
  5. | Closure of closure
    (*

    Anonymous function

    *)
  6. | Const of Const.t
    (*

    Constants

    *)
  7. | Cast of Typ.t * t
    (*

    Type cast

    *)
  8. | Lvar of Pvar.t
    (*

    The address of a program variable

    *)
  9. | Lfield of t * Fieldname.t * Typ.t
    (*

    A field offset, the type is the surrounding struct type

    *)
  10. | Lindex of t * t
    (*

    An array index offset: exp1[exp2]

    *)
  11. | Sizeof of sizeof_data

Program expressions.

val compare_closure : closure -> closure -> int
val compare_sizeof_data : sizeof_data -> sizeof_data -> int
val compare : t -> t -> int
val hash_fold_closure : +Exp (infer.IR.Exp)

Module IR.Exp

The Smallfoot Intermediate Language: Expressions

NOTE: For doing substitutionson expressions, there are some functions in Sil.

module F = Stdlib.Format
type closure = {
  1. name : Procname.t;
  2. captured_vars : (t * CapturedVar.t) list;
}
and sizeof_data = {
  1. typ : Typ.t;
  2. nbytes : int option;
  3. dynamic_length : t option;
  4. subtype : Subtype.t;
  5. nullable : bool;
}

This records information about a sizeof(typ) expression.

nbytes represents the result of the evaluation of sizeof(typ) if it is statically known.

If typ is of the form Tarray elt (Some static_length), then dynamic_length is the number of elements of type elt in the array. The dynamic_length, tracked by symbolic execution, may differ from the static_length obtained from the type definition, e.g. when an array is over-allocated.

If typ is a struct type, the dynamic_length is that of the final extensible array, if any.

and t =
  1. | Var of Ident.t
    (*

    Pure variable: it is not an lvalue

    *)
  2. | UnOp of Unop.t * t * Typ.t option
    (*

    Unary operator with type of the result if known

    *)
  3. | BinOp of Binop.t * t * t
    (*

    Binary operator

    *)
  4. | Exn of t
    (*

    Exception

    *)
  5. | Closure of closure
    (*

    Anonymous function

    *)
  6. | Const of Const.t
    (*

    Constants

    *)
  7. | Cast of Typ.t * t
    (*

    Type cast

    *)
  8. | Lvar of Pvar.t
    (*

    The address of a program variable

    *)
  9. | Lfield of t * Fieldname.t * Typ.t
    (*

    A field offset, the type is the surrounding struct type

    *)
  10. | Lindex of t * t
    (*

    An array index offset: exp1[exp2]

    *)
  11. | Sizeof of sizeof_data

Program expressions.

val compare_closure : closure -> closure -> int
val compare_sizeof_data : sizeof_data -> sizeof_data -> int
val compare : t -> t -> int
val hash_fold_closure : Ppx_hash_lib.Std.Hash.state -> closure -> Ppx_hash_lib.Std.Hash.state
val hash_closure : closure -> Ppx_hash_lib.Std.Hash.hash_value
val hash_fold_sizeof_data : diff --git a/website/static/odoc/next/infer/IR/Fieldname/Set/index.html b/website/static/odoc/next/infer/IR/Fieldname/Set/index.html index 29fd5bbb12c..5ce5e406f67 100644 --- a/website/static/odoc/next/infer/IR/Fieldname/Set/index.html +++ b/website/static/odoc/next/infer/IR/Fieldname/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.IR.Fieldname.Set)

Module Fieldname.Set

Set for fieldnames

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.IR.Fieldname.Set)

Module Fieldname.Set

Set for fieldnames

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/IR/HackClassName/index.html b/website/static/odoc/next/infer/IR/HackClassName/index.html index d5be8442498..5f88728c6c8 100644 --- a/website/static/odoc/next/infer/IR/HackClassName/index.html +++ b/website/static/odoc/next/infer/IR/HackClassName/index.html @@ -1,2 +1,2 @@ -HackClassName (infer.IR.HackClassName)

Module IR.HackClassName

module F = Stdlib.Format
type t
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
val yojson_of_t : t -> Ppx_yojson_conv_lib.Yojson.Safe.t
include Sexplib0.Sexpable.S with type t := t
val t_of_sexp : Sexplib0__.Sexp.t -> t
val sexp_of_t : t -> Sexplib0__.Sexp.t
include Ppx_hash_lib.Hashable.S with type t := t
val hash_fold_t : t Base__Ppx_hash_lib.hash_fold
val hash : t -> Base__Ppx_hash_lib.Std.Hash.hash_value
val hash_normalize : t -> t
val hash_normalize_opt : t option -> t option
val hash_normalize_list : t list -> t list
val make : ?namespace:string -> string -> t
val classname : t -> string
val components : t -> string list
val wildcard : t
val pp : F.formatter -> t -> unit
val to_string : t -> string
val static_companion : t -> t

return the class of the companion class object of this class eg: Foo -> Foo$static

val static_companion_origin : t -> t

return the origin class of a companion class object eg: Foo$static -> Foo. the result is not specified if is the name is not a valid static class name

val is_static_companion : t -> bool

tests if the name is a valid static class name (ie. ends with "$static")

val is_builtins : t -> bool

tests if the name of the class is $builtins where hhbc functions and models belong to

val is_generated_curry : t -> bool

tests if the name of the class if of the special form used by HackC for function references

val extract_curry_info : t -> (t * string) option

returns a pair (classname, short_method_name) from a generated curry type:

  • classname is the enclosing type of the corresponding function reference
  • short_method_name is the short name of the corresponding function reference
+HackClassName (infer.IR.HackClassName)

Module IR.HackClassName

module F = Stdlib.Format
type t
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
val yojson_of_t : t -> Ppx_yojson_conv_lib.Yojson.Safe.t
include Sexplib0.Sexpable.S with type t := t
val t_of_sexp : Sexplib0__.Sexp.t -> t
val sexp_of_t : t -> Sexplib0__.Sexp.t
include Ppx_hash_lib.Hashable.S with type t := t
val hash_fold_t : t Base__Ppx_hash_lib.hash_fold
val hash : t -> Base__Ppx_hash_lib.Std.Hash.hash_value
val hash_normalize : t -> t
val hash_normalize_opt : t option -> t option
val hash_normalize_list : t list -> t list
val make : ?namespace:string -> string -> t
val classname : t -> string
val components : t -> string list
val wildcard : t
val pp : F.formatter -> t -> unit
val to_string : t -> string
val static_suffix : string
val static_companion : t -> t

return the class of the companion class object of this class eg: Foo -> Foo$static

val static_companion_origin : t -> t

return the origin class of a companion class object eg: Foo$static -> Foo. the result is not specified if is the name is not a valid static class name

val is_static_companion : t -> bool

tests if the name is a valid static class name (ie. ends with "$static")

val is_builtins : t -> bool

tests if the name of the class is $builtins where hhbc functions and models belong to

val is_generated_curry : t -> bool

tests if the name of the class if of the special form used by HackC for function references

val extract_curry_info : t -> (t * string) option

returns a pair (classname, short_method_name) from a generated curry type:

  • classname is the enclosing type of the corresponding function reference
  • short_method_name is the short name of the corresponding function reference
diff --git a/website/static/odoc/next/infer/IR/Mangled/Set/index.html b/website/static/odoc/next/infer/IR/Mangled/Set/index.html index 3cc159b70d1..1f8f5733d36 100644 --- a/website/static/odoc/next/infer/IR/Mangled/Set/index.html +++ b/website/static/odoc/next/infer/IR/Mangled/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.IR.Mangled.Set)

Module Mangled.Set

Set of Mangled.

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.IR.Mangled.Set)

Module Mangled.Set

Set of Mangled.

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/IR/Procname/Hack/index.html b/website/static/odoc/next/infer/IR/Procname/Hack/index.html index 7d94b1dc91e..347837f533d 100644 --- a/website/static/odoc/next/infer/IR/Procname/Hack/index.html +++ b/website/static/odoc/next/infer/IR/Procname/Hack/index.html @@ -1,2 +1,2 @@ -Hack (infer.IR.Procname.Hack)

Module Procname.Hack

type t = private {
  1. class_name : HackClassName.t option;
  2. function_name : string;
  3. arity : int option;
}

Hack procedure is identified by the class and function names and its arity. The arity can be absent for external function declarations of the form declare F.f(...): ...

TODO(arr): consider making the arity non-optional if we remove function declarations from the Tenv

val get_class_name_as_a_string : t -> string option
+Hack (infer.IR.Procname.Hack)

Module Procname.Hack

type t = private {
  1. class_name : HackClassName.t option;
  2. function_name : string;
  3. arity : int option;
}

Hack procedure is identified by the class and function names and its arity. The arity can be absent for external function declarations of the form declare F.f(...): ...

TODO(arr): consider making the arity non-optional if we remove function declarations from the Tenv

val get_class_name_as_a_string : t -> string option
val is_xinit : t -> bool
val belongs_to_static_companion : t -> bool
diff --git a/website/static/odoc/next/infer/IR/Procname/Set/index.html b/website/static/odoc/next/infer/IR/Procname/Set/index.html index 6dfd8de389e..7ed72ea2f58 100644 --- a/website/static/odoc/next/infer/IR/Procname/Set/index.html +++ b/website/static/odoc/next/infer/IR/Procname/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.IR.Procname.Set)

Module Procname.Set

Sets of proc names.

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.IR.Procname.Set)

Module Procname.Set

Sets of proc names.

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/IR/Procname/index.html b/website/static/odoc/next/infer/IR/Procname/index.html index f01146f7740..05e7894eb4c 100644 --- a/website/static/odoc/next/infer/IR/Procname/index.html +++ b/website/static/odoc/next/infer/IR/Procname/index.html @@ -22,4 +22,4 @@ class_name:PythonClassName.t option -> function_name:string -> arity:int option -> - t

Create a Python procedure name.

val empty_block : t

Empty block name.

val get_language : t -> IBase.Language.t

Return the language of the procedure.

val get_method : t -> string

Return the method/function of a procname.

val is_objc_block : t -> bool

Return whether the procname is a block procname.

val is_cpp_lambda : t -> bool

Return whether the procname is a cpp lambda procname.

val is_objc_dealloc : t -> bool

Return whether the dealloc method of an Objective-C class.

val is_objc_init : t -> bool

Return whether the init method of an Objective-C class.

val is_c_method : t -> bool

Return true this is an Objective-C/C++ method name.

val is_clang : t -> bool

Return true this is an Objective-C/C++ method name or a C function.

val is_constructor : t -> bool

Check if this is a constructor.

val is_csharp : t -> bool

Check if this is a CSharp procedure name.

val is_hack : t -> bool

Check if this is a Hack procedure name.

val is_java : t -> bool

Check if this is a Java procedure name.

val is_python : t -> bool

Check if this is a Python procedure name.

val objc_cpp_replace_method_name : t -> string -> t
val is_infer_undefined : t -> bool

Check if this is a special Infer undefined procedure.

val is_static : t -> bool option

Check if a procedure is a static class method or not. If the procedure is not a class method or is unknown to be static, it returns None. For now, this checking does not work on C++ methods.

val get_global_name_of_initializer : t -> string option

Return the name of the global for which this procedure is the initializer if this is an initializer, None otherwise.

val pp_without_templates : Stdlib.Format.formatter -> t -> unit

Pretty print a c++ proc name for the user to see.

val pp : Stdlib.Format.formatter -> t -> unit

Pretty print a proc name for the user to see.

val pp_verbose : Stdlib.Format.formatter -> t -> unit

Pretty print a proc name for the user to see with verbosity parameter.

val to_string : ?verbosity:detail_level -> t -> string

Convert a proc name into a string for the user to see.

val to_string_verbose : t -> string

Convert a proc name into a string for the user to see with verbosity parameter.

val describe : Stdlib.Format.formatter -> t -> unit

to use in user messages

val replace_class : t -> ?arity_incr:int -> Typ.Name.t -> t

Replace the class name component of a procedure name. In case of Java, replace package and class name.

val is_method_in_objc_protocol : t -> bool
val pp_simplified_string : ?withclass:bool -> F.formatter -> t -> unit

Pretty print a proc name as an easy string for the user to see in an IDE.

val to_simplified_string : ?withclass:bool -> t -> string

Convert a proc name into an easy string for the user to see in an IDE.

val from_string_c_fun : string -> t

Convert a string to a c function name.

val replace_java_inner_class_prefix_regex : string -> string

Replace "$[0-9]+" index into "$_" in Java proc name.

val hashable_name : t -> string

Convert the procedure name in a format suitable for computing the bug hash.

val pp_unique_id : F.formatter -> t -> unit

Print a proc name as a unique identifier.

val to_unique_id : t -> string

Convert a proc name into a unique identifier.

val to_short_unique_name : t -> string

Convert a proc name into a unique identfier guaranteed to be short (less than 50 characters)

val to_filename : t -> string

Convert a proc name to a filename.

val get_qualifiers : t -> QualifiedCppName.t

get qualifiers of C/objc/C++ method/function

val decr_hack_arity : t -> t option

return a Hack procname with decremented arity. Return None if input has no arity or 0 arity

val get_hack_arity : t -> int option

get the arity of a Hack procname

val get_hack_static_init : is_trait:bool -> HackClassName.t -> t

get the sinit procname in Hack

val pp_name_only : F.formatter -> t -> unit

Print name of procedure with at most one-level path. For example,

  • In C++: "<ClassName>::<ProcName>"
  • In Java, ObjC, C#: "<ClassName>.<ProcName>"
  • In C: "<ProcName>"
  • In Erlang: "<ModuleName>:<ProcName>"
val pp_fullname_only : F.formatter -> t -> unit

Like pp_name_only, but include package name for Java.

val is_c : t -> bool
val is_lambda_name : string -> bool
val is_lambda : t -> bool
val is_lambda_or_block : t -> bool
val patterns_match : IStdlib.IStd.Str.regexp list -> t -> bool

Test whether a proc name matches to one of the regular expressions.

val is_erlang_unsupported : t -> bool
val is_erlang : t -> bool
val erlang_call_unqualified : arity:int -> t

A special infer-erlang procname that represents a syntactic erlang (unqualified) function call. arity is the arity of the erlang function. First parameter of this procedure is expecteed to be the erlang function name, and the remaining parameters are the erlang parameters (given one-by-one and not as an erlang list).

val erlang_call_qualified : arity:int -> t

Same as erlang_call_unqualified but is expected to have an erlang module name as the first parameter, and the function name as second. arity is (still) the erlang arity of the function.

val is_erlang_call_unqualified : t -> bool
val is_erlang_call_qualified : t -> bool
val is_hack_builtins : t -> bool
val is_hack_sinit : t -> bool
val has_hack_classname : t -> bool
val is_hack_async_name : t -> bool
val is_hack_construct : t -> bool
+ t

Create a Python procedure name.

val empty_block : t

Empty block name.

val get_language : t -> IBase.Language.t

Return the language of the procedure.

val get_method : t -> string

Return the method/function of a procname.

val is_objc_block : t -> bool

Return whether the procname is a block procname.

val is_cpp_lambda : t -> bool

Return whether the procname is a cpp lambda procname.

val is_objc_dealloc : t -> bool

Return whether the dealloc method of an Objective-C class.

val is_objc_init : t -> bool

Return whether the init method of an Objective-C class.

val is_c_method : t -> bool

Return true this is an Objective-C/C++ method name.

val is_clang : t -> bool

Return true this is an Objective-C/C++ method name or a C function.

val is_constructor : t -> bool

Check if this is a constructor.

val is_csharp : t -> bool

Check if this is a CSharp procedure name.

val is_hack : t -> bool

Check if this is a Hack procedure name.

val is_java : t -> bool

Check if this is a Java procedure name.

val is_python : t -> bool

Check if this is a Python procedure name.

val objc_cpp_replace_method_name : t -> string -> t
val is_infer_undefined : t -> bool

Check if this is a special Infer undefined procedure.

val is_static : t -> bool option

Check if a procedure is a static class method or not. If the procedure is not a class method or is unknown to be static, it returns None. For now, this checking does not work on C++ methods.

val get_global_name_of_initializer : t -> string option

Return the name of the global for which this procedure is the initializer if this is an initializer, None otherwise.

val pp_without_templates : Stdlib.Format.formatter -> t -> unit

Pretty print a c++ proc name for the user to see.

val pp : Stdlib.Format.formatter -> t -> unit

Pretty print a proc name for the user to see.

val pp_verbose : Stdlib.Format.formatter -> t -> unit

Pretty print a proc name for the user to see with verbosity parameter.

val to_string : ?verbosity:detail_level -> t -> string

Convert a proc name into a string for the user to see.

val to_string_verbose : t -> string

Convert a proc name into a string for the user to see with verbosity parameter.

val describe : Stdlib.Format.formatter -> t -> unit

to use in user messages

val replace_class : t -> ?arity_incr:int -> Typ.Name.t -> t

Replace the class name component of a procedure name. In case of Java, replace package and class name.

val is_method_in_objc_protocol : t -> bool
val pp_simplified_string : ?withclass:bool -> F.formatter -> t -> unit

Pretty print a proc name as an easy string for the user to see in an IDE.

val to_simplified_string : ?withclass:bool -> t -> string

Convert a proc name into an easy string for the user to see in an IDE.

val from_string_c_fun : string -> t

Convert a string to a c function name.

val replace_java_inner_class_prefix_regex : string -> string

Replace "$[0-9]+" index into "$_" in Java proc name.

val hashable_name : t -> string

Convert the procedure name in a format suitable for computing the bug hash.

val pp_unique_id : F.formatter -> t -> unit

Print a proc name as a unique identifier.

val to_unique_id : t -> string

Convert a proc name into a unique identifier.

val to_short_unique_name : t -> string

Convert a proc name into a unique identfier guaranteed to be short (less than 50 characters)

val to_filename : t -> string

Convert a proc name to a filename.

val get_qualifiers : t -> QualifiedCppName.t

get qualifiers of C/objc/C++ method/function

val decr_hack_arity : t -> t option

return a Hack procname with decremented arity. Return None if input has no arity or 0 arity

val get_hack_arity : t -> int option

get the arity of a Hack procname

val get_hack_static_init : is_trait:bool -> HackClassName.t -> t

get the sinit procname in Hack

val get_hack_static_constinit : is_trait:bool -> HackClassName.t -> t

get the constinit procname in Hack

val pp_name_only : F.formatter -> t -> unit

Print name of procedure with at most one-level path. For example,

  • In C++: "<ClassName>::<ProcName>"
  • In Java, ObjC, C#: "<ClassName>.<ProcName>"
  • In C: "<ProcName>"
  • In Erlang: "<ModuleName>:<ProcName>"
val pp_fullname_only : F.formatter -> t -> unit

Like pp_name_only, but include package name for Java.

val is_c : t -> bool
val is_lambda_name : string -> bool
val is_lambda : t -> bool
val is_lambda_or_block : t -> bool
val patterns_match : IStdlib.IStd.Str.regexp list -> t -> bool

Test whether a proc name matches to one of the regular expressions.

val is_erlang_unsupported : t -> bool
val is_erlang : t -> bool
val erlang_call_unqualified : arity:int -> t

A special infer-erlang procname that represents a syntactic erlang (unqualified) function call. arity is the arity of the erlang function. First parameter of this procedure is expecteed to be the erlang function name, and the remaining parameters are the erlang parameters (given one-by-one and not as an erlang list).

val erlang_call_qualified : arity:int -> t

Same as erlang_call_unqualified but is expected to have an erlang module name as the first parameter, and the function name as second. arity is (still) the erlang arity of the function.

val is_erlang_call_unqualified : t -> bool
val is_erlang_call_qualified : t -> bool
val is_hack_builtins : t -> bool
val is_hack_sinit : t -> bool
val is_hack_constinit : t -> bool
val has_hack_classname : t -> bool
val is_hack_async_name : t -> bool
val is_hack_construct : t -> bool
diff --git a/website/static/odoc/next/infer/IR/Pvar/Set/index.html b/website/static/odoc/next/infer/IR/Pvar/Set/index.html index 08fc1e9a780..f9092c7c024 100644 --- a/website/static/odoc/next/infer/IR/Pvar/Set/index.html +++ b/website/static/odoc/next/infer/IR/Pvar/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.IR.Pvar.Set)

Module Pvar.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.IR.Pvar.Set)

Module Pvar.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/IR/Pvar/index.html b/website/static/odoc/next/infer/IR/Pvar/index.html index 4976772c594..0efee379c4b 100644 --- a/website/static/odoc/next/infer/IR/Pvar/index.html +++ b/website/static/odoc/next/infer/IR/Pvar/index.html @@ -1,5 +1,5 @@ -Pvar (infer.IR.Pvar)

Module IR.Pvar

Program variables.

module F = Stdlib.Format
type translation_unit = IBase.SourceFile.t option
type t

Type for program variables. There are 4 kinds of variables:

  1. local variables, used for local variables and formal parameters
  2. callee program variables, used to handle recursion (x | callee is distinguished from x)
  3. global variables
  4. seed variables, used to store the initial value of formal parameters
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
val yojson_of_t : t -> Ppx_yojson_conv_lib.Yojson.Safe.t
include Sexplib0.Sexpable.S with type t := t
val t_of_sexp : Sexplib0__.Sexp.t -> t
val sexp_of_t : t -> Sexplib0__.Sexp.t
include Ppx_hash_lib.Hashable.S with type t := t
val hash_fold_t : t Base__Ppx_hash_lib.hash_fold
val hash : t -> Base__Ppx_hash_lib.Std.Hash.hash_value
val hash_normalize : t -> t
val hash_normalize_opt : t option -> t option
val hash_normalize_list : t list -> t list
val compare_modulo_this : t -> t -> int

Comparison considering all pvars named 'this'/'self' to be equal

val equal : t -> t -> bool

Equality for pvar's

val get_declaring_function : t -> Procname.t option

if not a global, return function declaring var

val d : t -> unit

Dump a program variable.

val get_name : t -> Mangled.t

Get the name component of a program variable.

val get_ret_pvar : Procname.t -> t

get_ret_pvar proc_name retuns the return pvar associated with the procedure name

val get_ret_param_pvar : Procname.t -> t

get_ret_param_pvar proc_name retuns the return_param pvar associated with the procedure name

val get_simplified_name : t -> string

Get a simplified version of the name component of a program variable.

val is_abduced : t -> bool

Check if the pvar is an abduced return var or param passed by ref

val is_callee : t -> bool

Check if the pvar is a callee var

val is_global : t -> bool

Check if the pvar is a global var or a static local var

val is_static_local : t -> bool

Check if the pvar is a static variable declared inside a function

val is_constant_array : t -> bool

Check if the pvar has a constant array type

val is_const : t -> bool

Check if the pvar has a const type

val is_local : t -> bool

Check if the pvar is a (non-static) local var

val is_seed : t -> bool

Check if the pvar is a seed var

val is_return : t -> bool

Check if the pvar is a return var

val is_this : t -> bool

Check if a pvar is the special "this" var

val is_self : t -> bool

Check if a pvar is the special "self" var

val is_artificial : t -> bool

Check if a pvar is an artificial variable related coroutine, "__promise" or "__coro_frame"

val is_frontend_tmp : t -> bool

return true if pvar is a temporary variable generated by the frontend

val is_clang_tmp : t -> bool

return true if pvar is a temporary variable generated by clang

val is_ssa_frontend_tmp : t -> bool

return true if pvar is a temporary variable generated by the frontend and is only assigned once on a non-looping control-flow path

val is_cpp_temporary : t -> bool

return true if this pvar represents a C++ temporary object (see http://en.cppreference.com/w/cpp/language/lifetime)

val is_cpp_unnamed_param : t -> bool

return true if this pvar represents an unnamed parameter

val is_gmock_param : t -> bool

return true if the parameter is for mock methods of GoogleTest

val is_objc_static_local_of_proc_name : string -> t -> bool

Check if a pvar is a local static in objc

val is_block_pvar : t -> bool

Check if a pvar is a local pointing to a block in objc

val get_tmp_id : t -> Ident.t option

In case of a temporary variable, returns the id used to create it, or None otherwise.

val mk : Mangled.t -> Procname.t -> t

mk name proc_name creates a program var with the given function name

val mk_abduced_ref_param : Procname.t -> int -> IBase.Location.t -> t

create an abduced variable for a parameter passed by reference

val mk_abduced_ret : Procname.t -> IBase.Location.t -> t

create an abduced return variable for a call to proc_name at loc

val mk_callee : Mangled.t -> Procname.t -> t

mk_callee name proc_name creates a program var for a callee function with the given function name

val mk_global : +Pvar (infer.IR.Pvar)

Module IR.Pvar

Program variables.

module F = Stdlib.Format
type translation_unit = IBase.SourceFile.t option
type t

Type for program variables. There are 4 kinds of variables:

  1. local variables, used for local variables and formal parameters
  2. callee program variables, used to handle recursion (x | callee is distinguished from x)
  3. global variables
  4. seed variables, used to store the initial value of formal parameters
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
val yojson_of_t : t -> Ppx_yojson_conv_lib.Yojson.Safe.t
include Sexplib0.Sexpable.S with type t := t
val t_of_sexp : Sexplib0__.Sexp.t -> t
val sexp_of_t : t -> Sexplib0__.Sexp.t
include Ppx_hash_lib.Hashable.S with type t := t
val hash_fold_t : t Base__Ppx_hash_lib.hash_fold
val hash : t -> Base__Ppx_hash_lib.Std.Hash.hash_value
val hash_normalize : t -> t
val hash_normalize_opt : t option -> t option
val hash_normalize_list : t list -> t list
val compare_modulo_this : t -> t -> int

Comparison considering all pvars named 'this'/'self' to be equal

val equal : t -> t -> bool

Equality for pvar's

val get_declaring_function : t -> Procname.t option

if not a global, return function declaring var

val d : t -> unit

Dump a program variable.

val get_name : t -> Mangled.t

Get the name component of a program variable.

val get_ret_pvar : Procname.t -> t

get_ret_pvar proc_name retuns the return pvar associated with the procedure name

val get_ret_param_pvar : Procname.t -> t

get_ret_param_pvar proc_name retuns the return_param pvar associated with the procedure name

val get_simplified_name : t -> string

Get a simplified version of the name component of a program variable.

val is_abduced : t -> bool

Check if the pvar is an abduced return var or param passed by ref

val is_callee : t -> bool

Check if the pvar is a callee var

val is_global : t -> bool

Check if the pvar is a global var or a static local var

val is_static_companion : t -> bool

Check if the pvar is a global var of a static companion

val is_static_local : t -> bool

Check if the pvar is a static variable declared inside a function

val is_constant_array : t -> bool

Check if the pvar has a constant array type

val is_const : t -> bool

Check if the pvar has a const type

val is_local : t -> bool

Check if the pvar is a (non-static) local var

val is_seed : t -> bool

Check if the pvar is a seed var

val is_return : t -> bool

Check if the pvar is a return var

val is_this : t -> bool

Check if a pvar is the special "this" var

val is_self : t -> bool

Check if a pvar is the special "self" var

val is_artificial : t -> bool

Check if a pvar is an artificial variable related coroutine, "__promise" or "__coro_frame"

val is_frontend_tmp : t -> bool

return true if pvar is a temporary variable generated by the frontend

val is_clang_tmp : t -> bool

return true if pvar is a temporary variable generated by clang

val is_ssa_frontend_tmp : t -> bool

return true if pvar is a temporary variable generated by the frontend and is only assigned once on a non-looping control-flow path

val is_cpp_temporary : t -> bool

return true if this pvar represents a C++ temporary object (see http://en.cppreference.com/w/cpp/language/lifetime)

val is_cpp_unnamed_param : t -> bool

return true if this pvar represents an unnamed parameter

val is_gmock_param : t -> bool

return true if the parameter is for mock methods of GoogleTest

val is_objc_static_local_of_proc_name : string -> t -> bool

Check if a pvar is a local static in objc

val is_block_pvar : t -> bool

Check if a pvar is a local pointing to a block in objc

val get_tmp_id : t -> Ident.t option

In case of a temporary variable, returns the id used to create it, or None otherwise.

val mk : Mangled.t -> Procname.t -> t

mk name proc_name creates a program var with the given function name

val mk_abduced_ref_param : Procname.t -> int -> IBase.Location.t -> t

create an abduced variable for a parameter passed by reference

val mk_abduced_ret : Procname.t -> IBase.Location.t -> t

create an abduced return variable for a call to proc_name at loc

val mk_callee : Mangled.t -> Procname.t -> t

mk_callee name proc_name creates a program var for a callee function with the given function name

val mk_global : ?is_constexpr:bool -> ?is_ice:bool -> ?is_pod:bool -> diff --git a/website/static/odoc/next/infer/IR/Specialization/HeapPath/Set/index.html b/website/static/odoc/next/infer/IR/Specialization/HeapPath/Set/index.html index 68542361b96..8f8c279d4a4 100644 --- a/website/static/odoc/next/infer/IR/Specialization/HeapPath/Set/index.html +++ b/website/static/odoc/next/infer/IR/Specialization/HeapPath/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.IR.Specialization.HeapPath.Set)

Module HeapPath.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.IR.Specialization.HeapPath.Set)

Module HeapPath.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/IR/Specialization/Pulse/Set/index.html b/website/static/odoc/next/infer/IR/Specialization/Pulse/Set/index.html index 5384afacdaa..9bf30dcacf1 100644 --- a/website/static/odoc/next/infer/IR/Specialization/Pulse/Set/index.html +++ b/website/static/odoc/next/infer/IR/Specialization/Pulse/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.IR.Specialization.Pulse.Set)

Module Pulse.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.IR.Specialization.Pulse.Set)

Module Pulse.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/IR/Typ/Name/Set/index.html b/website/static/odoc/next/infer/IR/Typ/Name/Set/index.html index 484fbbf800c..cc3fa04364e 100644 --- a/website/static/odoc/next/infer/IR/Typ/Name/Set/index.html +++ b/website/static/odoc/next/infer/IR/Typ/Name/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.IR.Typ.Name.Set)

Module Name.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.IR.Typ.Name.Set)

Module Name.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/IR/Typ/index.html b/website/static/odoc/next/infer/IR/Typ/index.html index 0c7c2895821..04a2761e661 100644 --- a/website/static/odoc/next/infer/IR/Typ/index.html +++ b/website/static/odoc/next/infer/IR/Typ/index.html @@ -67,4 +67,4 @@ ?length:IntLit.t -> ?stride:IntLit.t -> t -> - t

Create an array type from a given element type. If length or stride value is given, use them as static length and size.

val mk_struct : name -> t
val mk_ptr : ?ptr_kind:ptr_kind -> t -> t

make a pointer to t, default kind is Pk_pointer

val set_ptr_to_const : t -> t
val set_to_const : t -> t
val get_ikind_opt : t -> ikind option

Get ikind if the type is integer.

val size_t : ikind

ikind of size_t

val is_weak_pointer : t -> bool
val is_strong_pointer : t -> bool
module Name : sig ... end
val equal : t -> t -> bool

Equality for types.

val equal_desc : desc -> desc -> bool
val equal_name : name -> name -> bool
val equal_ignore_quals : t -> t -> bool

Equality for types, but ignoring quals in it.

val overloading_resolution : (t -> t -> bool) list

overloading_resolution is a list of predicates that compare whether a type T1 binds a type T2.

val pp_full : IStdlib.Pp.env -> F.formatter -> t -> unit

Pretty print a type with all the details.

val pp : IStdlib.Pp.env -> F.formatter -> t -> unit

Pretty print a type.

val pp_desc : IStdlib.Pp.env -> F.formatter -> desc -> unit

Pretty print a type desc.

val pp_java : verbose:bool -> F.formatter -> t -> unit

Pretty print a Java type. Raises if type isn't produced by the Java frontend

val pp_cs : verbose:bool -> F.formatter -> t -> unit

Pretty print a Java type. Raises if type isn't produced by the CSharp frontend

val to_string : t -> string
val desc_to_string : desc -> string
val d_full : t -> unit

Dump a type with all the details.

val d_list : t list -> unit

Dump a list of types.

val name : t -> Name.t option

The name of a type

val strip_ptr : t -> t

turn a *T into a T. fails if t is not a pointer type

val is_ptr_to_ignore_quals : t -> ptr:t -> bool

check if ptr is a pointer type to t, ignoring quals

val is_ptr_to_const : t -> bool

check if typ is a pointer type to const

val array_elem : t option -> t -> t

If an array type, return the type of the element. If not, return the default type if given, otherwise raise an exception

val is_objc_class : t -> bool
val is_cpp_class : t -> bool
val is_pointer_to_cpp_class : t -> bool
val is_pointer_to_smart_pointer : t -> bool
val is_pointer_to_unique_pointer : t -> bool
val shared_pointer_matcher : QualifiedCppName.Match.quals_matcher
val is_shared_pointer : t -> bool
val is_folly_coro : t -> bool
val is_pointer_to_void : t -> bool
val is_void : t -> bool
val is_pointer_to_int : t -> bool
val is_pointer_to_const : t -> bool
val is_pointer_to_function : t -> bool
val is_pointer : t -> bool
val is_reference : t -> bool
val is_rvalue_reference : t -> bool
val is_const_reference_on_source : t -> bool
val is_struct : t -> bool
val is_int : t -> bool
val is_unsigned_int : t -> bool
val is_char : t -> bool
val is_csharp_type : t -> bool

is t a type produced by the Java frontend?

val is_java_type : t -> bool

is t a type produced by the Java frontend?

val unsome : string -> t option -> t
+ t

Create an array type from a given element type. If length or stride value is given, use them as static length and size.

val mk_struct : name -> t
val mk_ptr : ?ptr_kind:ptr_kind -> t -> t

make a pointer to t, default kind is Pk_pointer

val set_ptr_to_const : t -> t
val set_to_const : t -> t
val get_ikind_opt : t -> ikind option

Get ikind if the type is integer.

val size_t : ikind

ikind of size_t

val is_weak_pointer : t -> bool
val is_strong_pointer : t -> bool
module Name : sig ... end
val equal : t -> t -> bool

Equality for types.

val equal_desc : desc -> desc -> bool
val equal_name : name -> name -> bool
val equal_ignore_quals : t -> t -> bool

Equality for types, but ignoring quals in it.

val overloading_resolution : (t -> t -> bool) list

overloading_resolution is a list of predicates that compare whether a type T1 binds a type T2.

val pp_full : IStdlib.Pp.env -> F.formatter -> t -> unit

Pretty print a type with all the details.

val pp : IStdlib.Pp.env -> F.formatter -> t -> unit

Pretty print a type.

val pp_desc : IStdlib.Pp.env -> F.formatter -> desc -> unit

Pretty print a type desc.

val pp_java : verbose:bool -> F.formatter -> t -> unit

Pretty print a Java type. Raises if type isn't produced by the Java frontend

val pp_cs : verbose:bool -> F.formatter -> t -> unit

Pretty print a Java type. Raises if type isn't produced by the CSharp frontend

val to_string : t -> string
val desc_to_string : desc -> string
val d_full : t -> unit

Dump a type with all the details.

val d_list : t list -> unit

Dump a list of types.

val name : t -> Name.t option

The name of a type

val strip_ptr : t -> t

turn a *T into a T. fails if t is not a pointer type

val is_ptr_to_ignore_quals : t -> ptr:t -> bool

check if ptr is a pointer type to t, ignoring quals

val is_ptr_to_const : t -> bool

check if typ is a pointer type to const

val array_elem : t option -> t -> t

If an array type, return the type of the element. If not, return the default type if given, otherwise raise an exception

val is_objc_class : t -> bool
val is_cpp_class : t -> bool
val is_pointer_to_cpp_class : t -> bool
val is_pointer_to_smart_pointer : t -> bool
val is_unique_pointer : t -> bool
val is_pointer_to_unique_pointer : t -> bool
val shared_pointer_matcher : QualifiedCppName.Match.quals_matcher
val is_shared_pointer : t -> bool
val is_folly_coro : t -> bool
val is_thrift_field_ref : t -> bool
val is_pointer_to_void : t -> bool
val is_void : t -> bool
val is_pointer_to_int : t -> bool
val is_pointer_to_const : t -> bool
val is_pointer_to_function : t -> bool
val is_pointer : t -> bool
val is_reference : t -> bool
val is_rvalue_reference : t -> bool
val is_const_reference_on_source : t -> bool
val is_struct : t -> bool
val is_int : t -> bool
val is_unsigned_int : t -> bool
val is_char : t -> bool
val is_csharp_type : t -> bool

is t a type produced by the Java frontend?

val is_java_type : t -> bool

is t a type produced by the Java frontend?

val unsome : string -> t option -> t
diff --git a/website/static/odoc/next/infer/IR/Var/Set/index.html b/website/static/odoc/next/infer/IR/Var/Set/index.html index 2c1f93775f2..45b249a4e6f 100644 --- a/website/static/odoc/next/infer/IR/Var/Set/index.html +++ b/website/static/odoc/next/infer/IR/Var/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.IR.Var.Set)

Module Var.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.IR.Var.Set)

Module Var.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/IStdlib/IContainer/index.html b/website/static/odoc/next/infer/IStdlib/IContainer/index.html index 0ca3cd976d1..67159bdaf46 100644 --- a/website/static/odoc/next/infer/IStdlib/IContainer/index.html +++ b/website/static/odoc/next/infer/IStdlib/IContainer/index.html @@ -26,6 +26,7 @@ 't -> f:('a -> 'a -> unit) -> unit
val pp_collection : + ?hov:bool -> fold:('t, 'a, 'a option) IStdlib.IStd.Container.fold -> pp_item:(F.formatter -> 'a -> unit) -> F.formatter -> diff --git a/website/static/odoc/next/infer/IStdlib/IList/index.html b/website/static/odoc/next/infer/IStdlib/IList/index.html index 9148e92c062..25c718161ef 100644 --- a/website/static/odoc/next/infer/IStdlib/IList/index.html +++ b/website/static/odoc/next/infer/IStdlib/IList/index.html @@ -19,7 +19,7 @@ f_last:('b -> 'a -> 'b) -> 'b

like fold, but apply f_last to the last element

val split_last_rev : 'a list -> ('a * 'a list) option

split_last_rev l is Some (last, rev_prefix) where l == List.rev (last :: rev_prefix), None if l is empty

val append_no_duplicates : cmp:('a -> 'a -> int) -> - ('a list -> 'a list -> 'a list) IStdlib.IStd.Staged.t

append_no_duplicates list1 list2, assuming that list1 and list2 have no duplicates on their own, it computes list1 @ (filtered list2), so it keeps the order of both lists and has no duplicates.

val merge_dedup : 'a list -> 'a list -> compare:('a -> 'a -> int) -> 'a list
val drop : 'a list -> int -> 'a list

drop l n returns l without the first n elements, or the empty list if n > length l.

val opt_cons : 'a option -> 'a list -> 'a list

opt_cons None l returns l. opt_cons (Some x) l returns x :: l

val remove_first : 'a list -> f:('a -> bool) -> 'a list option
val eval_until_first_some : (unit -> 'a option) list -> 'a option

given a list of functions taking unit, evaluate and return the first one to return Some x

val product : 'a list list -> 'a list list

n-ary cartesian product

val pp_print_list : + ('a list -> 'a list -> 'a list) Core.Staged.t

append_no_duplicates list1 list2, assuming that list1 and list2 have no duplicates on their own, it computes list1 @ (filtered list2), so it keeps the order of both lists and has no duplicates.

val merge_dedup : 'a list -> 'a list -> compare:('a -> 'a -> int) -> 'a list
val drop : 'a list -> int -> 'a list

drop l n returns l without the first n elements, or the empty list if n > length l.

val opt_cons : 'a option -> 'a list -> 'a list

opt_cons None l returns l. opt_cons (Some x) l returns x :: l

val remove_first : 'a list -> f:('a -> bool) -> 'a list option
val eval_until_first_some : (unit -> 'a option) list -> 'a option

given a list of functions taking unit, evaluate and return the first one to return Some x

val product : 'a list list -> 'a list list

n-ary cartesian product

val pp_print_list : max:int -> ?pp_sep:(Stdlib.Format.formatter -> unit -> unit) -> (Stdlib.Format.formatter -> 'a -> unit) -> @@ -27,11 +27,11 @@ 'a list -> unit
val fold2_result : init:'acc -> - f:('acc -> 'a -> 'b -> ('acc, 'err) IStd.result) -> + f:('acc -> 'a -> 'b -> ('acc, 'err) Core.result) -> 'a list -> 'b list -> - ('acc, 'err) IStd.result Base.List.Or_unequal_lengths.t
val foldi_result : + ('acc, 'err) Core.result Base.List.Or_unequal_lengths.t
val foldi_result : init:'acc -> - f:(int -> 'acc -> 'a -> ('acc, 'err) IStd.result) -> + f:(int -> 'acc -> 'a -> ('acc, 'err) Core.result) -> 'a list -> - ('acc, 'err) IStd.result
val move_last_to_first : 'a list -> 'a list
val traverse_opt : 'a list -> f:('a -> 'b option) -> 'b list option

Applies f to the elements of the list and returns None if any application results in None otherwise returns Some list'.

+ ('acc, 'err) Core.result
val move_last_to_first : 'a list -> 'a list
val traverse_opt : 'a list -> f:('a -> 'b option) -> 'b list option

Applies f to the elements of the list and returns None if any application results in None otherwise returns Some list'.

diff --git a/website/static/odoc/next/infer/IStdlib/IOption/Let_syntax/index.html b/website/static/odoc/next/infer/IStdlib/IOption/Let_syntax/index.html index d8e9624aa8a..675e39fd503 100644 --- a/website/static/odoc/next/infer/IStdlib/IOption/Let_syntax/index.html +++ b/website/static/odoc/next/infer/IStdlib/IOption/Let_syntax/index.html @@ -1,2 +1,2 @@ -Let_syntax (infer.IStdlib.IOption.Let_syntax)

Module IOption.Let_syntax

Provides signatures for OCaml 4.08 binding operators

include module type of IStdlib.IStd.Option.Let_syntax
val return : 'a -> 'a Base__Option.t
val (>>=) : 'a Base__Option.t -> ('a -> 'b Base__Option.t) -> 'b Base__Option.t
val (>>|) : 'a Base__Option.t -> ('a -> 'b) -> 'b Base__Option.t
module Let_syntax : sig ... end
val let+ : 'a option -> ('a -> 'b) -> 'b option
val and+ : 'a option -> 'b option -> ('a * 'b) option
val let* : 'a option -> ('a -> 'b option) -> 'b option
val and* : 'a option -> 'b option -> ('a * 'b) option
+Let_syntax (infer.IStdlib.IOption.Let_syntax)

Module IOption.Let_syntax

Provides signatures for OCaml 4.08 binding operators

include module type of Core.Option.Let_syntax
val return : 'a -> 'a Base__Option.t
val (>>=) : 'a Base__Option.t -> ('a -> 'b Base__Option.t) -> 'b Base__Option.t
val (>>|) : 'a Base__Option.t -> ('a -> 'b) -> 'b Base__Option.t
module Let_syntax : sig ... end
val let+ : 'a option -> ('a -> 'b) -> 'b option
val and+ : 'a option -> 'b option -> ('a * 'b) option
val let* : 'a option -> ('a -> 'b option) -> 'b option
val and* : 'a option -> 'b option -> ('a * 'b) option
diff --git a/website/static/odoc/next/infer/IStdlib/IOption/index.html b/website/static/odoc/next/infer/IStdlib/IOption/index.html index 966afa3aa85..20f22e93b8d 100644 --- a/website/static/odoc/next/infer/IStdlib/IOption/index.html +++ b/website/static/odoc/next/infer/IStdlib/IOption/index.html @@ -1,5 +1,5 @@ -IOption (infer.IStdlib.IOption)

Module IStdlib.IOption

val find_value_exn : 'a option -> 'a

Like Option.value_exn but raises Caml.Not_found when called with None.

val value_default_f : f:(unit -> 'a) -> 'a option -> 'a

Like Option.value ~default:(f ()) but f is called only if None.

val if_none_evalopt : f:(unit -> 'a option) -> 'a option -> 'a option

if_none_evalopt ~f x evaluates to f () if x = None, otherwise returns x. Useful for chaining matchers where the first returning non-None determines the result.

val if_none_eval : f:(unit -> 'a) -> 'a option -> 'a

if_none_eval ~f x evaluates to y if x=Some y else to f (). Useful for terminating chains built with if_none_evalopt. This is exactly the same as value_default_f but with a better name.

val exists2 : 'a option -> 'b option -> f:('a -> 'b -> bool) -> bool

Like Option.exists but gets two parameters.

val iter2 : 'a option -> 'b option -> f:('a -> 'b -> unit) -> unit

Like Option.iter but gets two parameters.

val map_changed : +IOption (infer.IStdlib.IOption)

Module IStdlib.IOption

val value_default_f : f:(unit -> 'a) -> 'a option -> 'a

Like Option.value ~default:(f ()) but f is called only if None.

val if_none_evalopt : f:(unit -> 'a option) -> 'a option -> 'a option

if_none_evalopt ~f x evaluates to f () if x = None, otherwise returns x. Useful for chaining matchers where the first returning non-None determines the result.

val if_none_eval : f:(unit -> 'a) -> 'a option -> 'a

if_none_eval ~f x evaluates to y if x=Some y else to f (). Useful for terminating chains built with if_none_evalopt. This is exactly the same as value_default_f but with a better name.

val exists2 : 'a option -> 'b option -> f:('a -> 'b -> bool) -> bool

Like Option.exists but gets two parameters.

val iter2 : 'a option -> 'b option -> f:('a -> 'b -> unit) -> unit

Like Option.iter but gets two parameters.

val map_changed : 'a option -> equal:('a -> 'a -> bool) -> f:('a -> 'a) -> diff --git a/website/static/odoc/next/infer/IStdlib/PrettyPrintable/MakePPSet/index.html b/website/static/odoc/next/infer/IStdlib/PrettyPrintable/MakePPSet/index.html index ff63bea13aa..fa3b74d13c3 100644 --- a/website/static/odoc/next/infer/IStdlib/PrettyPrintable/MakePPSet/index.html +++ b/website/static/odoc/next/infer/IStdlib/PrettyPrintable/MakePPSet/index.html @@ -1,2 +1,2 @@ -MakePPSet (infer.IStdlib.PrettyPrintable.MakePPSet)

Module PrettyPrintable.MakePPSet

Parameters

Signature

include IStdlib.IStd.Caml.Set.S with type elt = Ord.t
type elt = Ord.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IContainer.singleton_or_more
include PrintableType with type t := t
val pp : F.formatter -> t -> unit
val pp_element : F.formatter -> elt -> unit
+MakePPSet (infer.IStdlib.PrettyPrintable.MakePPSet)

Module PrettyPrintable.MakePPSet

Parameters

Signature

include IStdlib.IStd.Caml.Set.S with type elt = Ord.t
type elt = Ord.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IContainer.singleton_or_more
include PrintableType with type t := t
val pp : F.formatter -> t -> unit
val pp_hov : F.formatter -> t -> unit
val pp_element : F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/IStdlib/PrettyPrintable/module-type-PPSet/index.html b/website/static/odoc/next/infer/IStdlib/PrettyPrintable/module-type-PPSet/index.html index 87108ccfe1c..b6846991713 100644 --- a/website/static/odoc/next/infer/IStdlib/PrettyPrintable/module-type-PPSet/index.html +++ b/website/static/odoc/next/infer/IStdlib/PrettyPrintable/module-type-PPSet/index.html @@ -1,2 +1,2 @@ -PPSet (infer.IStdlib.PrettyPrintable.PPSet)

Module type PrettyPrintable.PPSet

include IStdlib.IStd.Caml.Set.S
type elt
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IContainer.singleton_or_more
include PrintableType with type t := t
val pp : F.formatter -> t -> unit
val pp_element : F.formatter -> elt -> unit
+PPSet (infer.IStdlib.PrettyPrintable.PPSet)

Module type PrettyPrintable.PPSet

include IStdlib.IStd.Caml.Set.S
type elt
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IContainer.singleton_or_more
include PrintableType with type t := t
val pp : F.formatter -> t -> unit
val pp_hov : F.formatter -> t -> unit
val pp_element : F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/IStdlib/UnionFind/Make/index.html b/website/static/odoc/next/infer/IStdlib/UnionFind/Make/index.html index 5452884e9c6..97535d6ebe1 100644 --- a/website/static/odoc/next/infer/IStdlib/UnionFind/Make/index.html +++ b/website/static/odoc/next/infer/IStdlib/UnionFind/Make/index.html @@ -1,2 +1,2 @@ -Make (infer.IStdlib.UnionFind.Make)

Module UnionFind.Make

Parameters

module X : Element
module XSet : IStdlib.IStd.Caml.Set.S with type elt = X.t
module XMap : IStdlib.IStd.Caml.Map.S with type key = X.t

Signature

type t
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
val pp : (F.formatter -> X.t -> unit) -> F.formatter -> t -> unit
type repr = private X.t
val empty : t
val is_empty : t -> bool
val union : t -> X.t -> X.t -> t * (X.t * repr) option

return the optional new equality added between the old representatives of the two items in the form of "old representative = new representative", None if they were already in the same congruence class

val find : t -> X.t -> repr

return the element given if it wasn't found in the relation

val fold_congruences : (t, repr * XSet.t, 'acc) IStdlib.IStd.Container.fold

fold over the equivalence classes of the relation, singling out the representative for each class

val reorient : should_keep:(X.t -> bool) -> t -> X.t XMap.t

the relation x -> x' derived from the equality relation that relates all x, x' such that ¬(should_keep x), should_keep x', and x=x', as well as y -> y' when no element in the equivalence class of y satisfies should_keep and y' is the representative of the class

val apply_subst : _ XMap.t -> t -> t

apply_subst subst uf eliminate all variables in the domain of subst from uf, keeping the smallest representative not in the domain of subst for each class. Classes without any such elements are kept intact.

val filter : f:(X.t -> bool) -> t -> t

only keep items satisfying f

val fold_elements : (t, X.t, 'acc) IStdlib.IStd.Container.fold
+Make (infer.IStdlib.UnionFind.Make)

Module UnionFind.Make

Parameters

module X : Element
module XSet : Core.Caml.Set.S with type elt = X.t
module XMap : Core.Caml.Map.S with type key = X.t

Signature

type t
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
val pp : (F.formatter -> X.t -> unit) -> F.formatter -> t -> unit
type repr = private X.t
val empty : t
val is_empty : t -> bool
val union : t -> X.t -> X.t -> t * (X.t * repr) option

return the optional new equality added between the old representatives of the two items in the form of "old representative = new representative", None if they were already in the same congruence class

val find : t -> X.t -> repr

return the element given if it wasn't found in the relation

val fold_congruences : (t, repr * XSet.t, 'acc) Core.Container.fold

fold over the equivalence classes of the relation, singling out the representative for each class

val reorient : should_keep:(X.t -> bool) -> t -> X.t XMap.t

the relation x -> x' derived from the equality relation that relates all x, x' such that ¬(should_keep x), should_keep x', and x=x', as well as y -> y' when no element in the equivalence class of y satisfies should_keep and y' is the representative of the class

val apply_subst : _ XMap.t -> t -> t

apply_subst subst uf eliminate all variables in the domain of subst from uf, keeping the smallest representative not in the domain of subst for each class. Classes without any such elements are kept intact.

val filter : f:(X.t -> bool) -> t -> t

only keep items satisfying f

val fold_elements : (t, X.t, 'acc) Core.Container.fold
diff --git a/website/static/odoc/next/infer/IStdlib/UnionFind/index.html b/website/static/odoc/next/infer/IStdlib/UnionFind/index.html index aca18ff3682..31f13094357 100644 --- a/website/static/odoc/next/infer/IStdlib/UnionFind/index.html +++ b/website/static/odoc/next/infer/IStdlib/UnionFind/index.html @@ -1,6 +1,6 @@ UnionFind (infer.IStdlib.UnionFind)

Module IStdlib.UnionFind

module F = Stdlib.Format

A union-find data structure.

module type Element = sig ... end
module Make (X : Element) - (XSet : IStdlib.IStd.Caml.Set.S with type elt = X.t) - (XMap : IStdlib.IStd.Caml.Map.S with type key = X.t) : + (XSet : Core.Caml.Set.S with type elt = X.t) + (XMap : Core.Caml.Map.S with type key = X.t) : sig ... end
diff --git a/website/static/odoc/next/infer/Integration/JsonReports/JsonIssuePrinter/index.html b/website/static/odoc/next/infer/Integration/JsonReports/JsonIssuePrinter/index.html new file mode 100644 index 00000000000..e596426ab9e --- /dev/null +++ b/website/static/odoc/next/infer/Integration/JsonReports/JsonIssuePrinter/index.html @@ -0,0 +1,2 @@ + +JsonIssuePrinter (infer.Integration.JsonReports.JsonIssuePrinter)

Module JsonReports.JsonIssuePrinter

val pp_open : unit Fmt.t
val pp : elt Fmt.t
val pp_close : unit Fmt.t
diff --git a/website/static/odoc/next/infer/Integration/JsonReports/index.html b/website/static/odoc/next/infer/Integration/JsonReports/index.html index c73e3bd29b0..0c15a393184 100644 --- a/website/static/odoc/next/infer/Integration/JsonReports/index.html +++ b/website/static/odoc/next/infer/Integration/JsonReports/index.html @@ -1,7 +1,7 @@ JsonReports (infer.Integration.JsonReports)

Module Integration.JsonReports

val potential_exception_message : string
val loc_trace_to_jsonbug_record : Absint.Errlog.loc_trace_elem list -> - ATDGenerated.Jsonbug_t.json_trace_item list
val censored_reason : IBase.IssueType.t -> IBase.SourceFile.t -> string option
val sanitize_qualifier : string -> string
val compute_hash : + ATDGenerated.Jsonbug_t.json_trace_item list
val censored_reason : issue_id:string -> IBase.SourceFile.t -> string option
val sanitize_qualifier : string -> string
val compute_hash : severity:string -> bug_type:string -> proc_name:IR.Procname.t -> @@ -11,4 +11,4 @@ issues_json:string -> costs_json:string -> config_impact_json:string -> - unit
+ unit
type json_issue_printer_typ = {
  1. error_filter : IBase.SourceFile.t -> IBase.IssueType.t -> bool;
  2. proc_name : IR.Procname.t;
  3. proc_location_opt : IBase.Location.t option;
  4. err_key : Absint.Errlog.err_key;
  5. err_data : Absint.Errlog.err_data;
}
module JsonIssuePrinter : sig ... end
diff --git a/website/static/odoc/next/infer/Integration/MergeCapture/index.html b/website/static/odoc/next/infer/Integration/MergeCapture/index.html index 058943baa22..d8e17bf94ed 100644 --- a/website/static/odoc/next/infer/Integration/MergeCapture/index.html +++ b/website/static/odoc/next/infer/Integration/MergeCapture/index.html @@ -1,2 +1,2 @@ -MergeCapture (infer.Integration.MergeCapture)

Module Integration.MergeCapture

val merge_global_tenv : normalize:bool -> IBase.DB.filename list -> unit

Merge tenvs from the given paths and store the result as a global tenv

val merge_captured_targets : root:string -> unit
val merge_changed_functions : unit -> unit
+MergeCapture (infer.Integration.MergeCapture)

Module Integration.MergeCapture

val merge_global_tenv : normalize:bool -> IBase.DB.filename list -> unit

Merge tenvs from the given paths and store the result as a global tenv

val merge_captured_targets : root:string -> unit
diff --git a/website/static/odoc/next/infer/Integration/Suppressions/Span/index.html b/website/static/odoc/next/infer/Integration/Suppressions/Span/index.html new file mode 100644 index 00000000000..7c3579dfd18 --- /dev/null +++ b/website/static/odoc/next/infer/Integration/Suppressions/Span/index.html @@ -0,0 +1,2 @@ + +Span (infer.Integration.Suppressions.Span)

Module Suppressions.Span

type block = {
  1. first : int;
  2. last : int;
}
val compare_block : block -> block -> int
val equal_block : block -> block -> bool
type t =
  1. | Every
  2. | Blocks of block list
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
diff --git a/website/static/odoc/next/infer/Integration/Suppressions/index.html b/website/static/odoc/next/infer/Integration/Suppressions/index.html new file mode 100644 index 00000000000..a5b95873289 --- /dev/null +++ b/website/static/odoc/next/infer/Integration/Suppressions/index.html @@ -0,0 +1,2 @@ + +Suppressions (infer.Integration.Suppressions)

Module Integration.Suppressions

module Span : sig ... end
type t = Span.t IStdlib.IStd.String.Map.t
val parse_lines : ?file:string -> string list -> t
val is_suppressed : suppressions:t -> issue_type:string -> line:int -> bool
diff --git a/website/static/odoc/next/infer/Integration/index.html b/website/static/odoc/next/infer/Integration/index.html index 64615a97244..8538eaefbc4 100644 --- a/website/static/odoc/next/infer/Integration/index.html +++ b/website/static/odoc/next/infer/Integration/index.html @@ -1,2 +1,2 @@ -Integration (infer.Integration)

Module Integration

module Ant : sig ... end
module Buck : sig ... end
module BuckBuildReport : sig ... end
module BuckFlavors : sig ... end
module BuckJavaFlavor : sig ... end
module BxlCapture : sig ... end
module CaptureCompilationDatabase : sig ... end
module CaptureManipulation : sig ... end
module CaptureSILJson : sig ... end

Capture module for the json analysis in the capture phase

module Clang : sig ... end
module CompilationDatabase : sig ... end
module ConfigImpactIssuesTest : sig ... end
module ConfigImpactPostProcess : sig ... end
module CostIssuesTest : sig ... end
module Differential : sig ... end
module DifferentialFilters : sig ... end
module Driver : sig ... end

entry points for top-level functionalities such as capture under various build systems, analysis, and reporting

module Erlang : sig ... end
module Gradle : sig ... end
module Hack : sig ... end
module Help : sig ... end
module InferCommandImplementation : sig ... end

implementations of infer commands

module IssuesTest : sig ... end
module Javac : sig ... end
module JsonReports : sig ... end
module Kotlinc : sig ... end
module Maven : sig ... end
module MergeCapture : sig ... end
module NdkBuild : sig ... end
module Python : sig ... end
module ReportDataFlows : sig ... end
module ReportDiff : sig ... end
module ReportLineage : sig ... end
module SarifReport : sig ... end
module StatsDiff : sig ... end
module TextReport : sig ... end
module TraceBugs : sig ... end
module XMLReport : sig ... end
module XcodeBuild : sig ... end
+Integration (infer.Integration)

Module Integration

module Ant : sig ... end
module Buck : sig ... end
module BuckBuildReport : sig ... end
module BuckFlavors : sig ... end
module BuckJavaFlavor : sig ... end
module BxlCapture : sig ... end
module CaptureCompilationDatabase : sig ... end
module CaptureManipulation : sig ... end
module CaptureSILJson : sig ... end

Capture module for the json analysis in the capture phase

module Clang : sig ... end
module CompilationDatabase : sig ... end
module ConfigImpactIssuesTest : sig ... end
module ConfigImpactPostProcess : sig ... end
module CostIssuesTest : sig ... end
module Differential : sig ... end
module DifferentialFilters : sig ... end
module Driver : sig ... end

entry points for top-level functionalities such as capture under various build systems, analysis, and reporting

module Erlang : sig ... end
module Gradle : sig ... end
module Hack : sig ... end
module Help : sig ... end
module InferCommandImplementation : sig ... end

implementations of infer commands

module IssuesTest : sig ... end
module Javac : sig ... end
module JsonReports : sig ... end
module Kotlinc : sig ... end
module Maven : sig ... end
module MergeCapture : sig ... end
module NdkBuild : sig ... end
module Python : sig ... end
module ReportDataFlows : sig ... end
module ReportDiff : sig ... end
module ReportLineage : sig ... end
module SarifReport : sig ... end
module StatsDiff : sig ... end
module Suppressions : sig ... end
module TextReport : sig ... end
module TraceBugs : sig ... end
module XMLReport : sig ... end
module XcodeBuild : sig ... end
diff --git a/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/AddressAttributes/index.html b/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/AddressAttributes/index.html index db123ffa5e3..b086bbf1a7c 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/AddressAttributes/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/AddressAttributes/index.html @@ -112,7 +112,12 @@ t
val remove_allocation_attr : Pulselib.PulseBasicInterface.AbstractValue.t -> t -> - t
val remove_taint_attrs : Pulselib.PulseBasicInterface.AbstractValue.t -> t -> t
val get_static_type : + t
val remove_taint_attrs : Pulselib.PulseBasicInterface.AbstractValue.t -> t -> t
val get_closure_proc_name : diff --git a/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/CanonValue/Attributes/index.html b/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/CanonValue/Attributes/index.html index 686cf03ef0d..624f5bf0502 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/CanonValue/Attributes/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/CanonValue/Attributes/index.html @@ -107,7 +107,4 @@ t -> t -> (IR.Var.t * IBase.Location.t * Pulselib.PulseBasicInterface.ValueHistory.t) - option
val has_unknown_effect : t -> t -> bool
val is_hack_sinit_called : t -> t -> bool
val get_hack_sinit_must_not_be_called : - t -> - t -> - Pulselib.PulseBasicInterface.Timestamp.t option
+ option
val has_unknown_effect : t -> t -> bool
val is_hack_sinit_called : t -> t -> bool
diff --git a/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/CanonValue/Set/index.html b/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/CanonValue/Set/index.html index b4c7121e2dd..cbe655ac8b1 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/CanonValue/Set/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/CanonValue/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Pulselib.PulseAbductiveDomain.CanonValue.Set)

Module CanonValue.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Pulselib.PulseAbductiveDomain.CanonValue.Set)

Module CanonValue.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/CanonValue/Stack/index.html b/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/CanonValue/Stack/index.html index ad030fd2c3e..2254e9ac41b 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/CanonValue/Stack/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/CanonValue/Stack/index.html @@ -1,21 +1,16 @@ Stack (infer.Pulselib.PulseAbductiveDomain.CanonValue.Stack)

Module CanonValue.Stack

include PulseBaseStack.S - with type value = needs_canon * Pulselib.PulseBasicInterface.ValueHistory.t + with type value = needs_canon Pulselib.PulseBasicInterface.ValueOrigin.t_ and type t = PulseBaseStack.t
include IStdlib.PrettyPrintable.PPMonoMap with type key = IR.Var.t - with type value = needs_canon * Pulselib.PulseBasicInterface.ValueHistory.t + with type value = needs_canon Pulselib.PulseBasicInterface.ValueOrigin.t_ with type t = PulseBaseStack.t
include IStdlib.PrettyPrintable.MonoMap with type key = IR.Var.t - with type value = needs_canon * Pulselib.PulseBasicInterface.ValueHistory.t - with type t = PulseBaseStack.t
type key = IR.Var.t
val empty : t
val is_empty : t -> bool
val mem : key -> t -> bool
val update : key -> (value option -> value option) -> t -> t
val singleton : key -> value -> t
val remove : key -> t -> t
val merge : + with type value = needs_canon Pulselib.PulseBasicInterface.ValueOrigin.t_ + with type t = PulseBaseStack.t
type key = IR.Var.t
val empty : t
val is_empty : t -> bool
val mem : key -> t -> bool
val update : key -> (value option -> value option) -> t -> t
val singleton : key -> value -> t
val remove : key -> t -> t
val merge : (key -> value option -> value option -> value option) -> t -> t -> t
val union : (key -> value -> value -> value option) -> t -> t -> t
val iter : (key -> value -> unit) -> t -> unit
val fold : (key -> value -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (key -> value -> bool) -> t -> bool
val exists : (key -> value -> bool) -> t -> bool
val filter : (key -> value -> bool) -> t -> t
val filter_map : (key -> value -> value option) -> t -> t
val partition : (key -> value -> bool) -> t -> t * t
val cardinal : t -> int
val bindings : t -> (key * value) list
val min_binding : t -> key * value
val min_binding_opt : t -> (key * value) option
val max_binding : t -> key * value
val max_binding_opt : t -> (key * value) option
val choose : t -> key * value
val choose_opt : t -> (key * value) option
val split : key -> t -> t * value option * t
val find : key -> t -> value
val find_opt : key -> t -> value option
val find_first : (key -> bool) -> t -> key * value
val find_first_opt : (key -> bool) -> t -> (key * value) option
val find_last : (key -> bool) -> t -> key * value
val find_last_opt : (key -> bool) -> t -> (key * value) option
val map : (value -> value) -> t -> t
val mapi : (key -> value -> value) -> t -> t
val is_singleton_or_more : t -> - (key * value) IStdlib.IContainer.singleton_or_more
val fold_map : t -> init:'a -> f:('a -> value -> 'a * value) -> 'a * t
val fold_mapi : t -> init:'a -> f:(key -> 'a -> value -> 'a * value) -> 'a * t
val of_seq : (key * value) Stdlib.Seq.t -> t
val to_seq : t -> (key * value) Stdlib.Seq.t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_key : IStdlib.PrettyPrintable.F.formatter -> key -> unit
val compare : t -> t -> int
val equal : t -> t -> bool
+ (key * value) IStdlib.IContainer.singleton_or_more
val fold_map : t -> init:'a -> f:('a -> value -> 'a * value) -> 'a * t
val fold_mapi : t -> init:'a -> f:(key -> 'a -> value -> 'a * value) -> 'a * t
val of_seq : (key * value) Stdlib.Seq.t -> t
val to_seq : t -> (key * value) Stdlib.Seq.t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_key : IStdlib.PrettyPrintable.F.formatter -> key -> unit
val compare : t -> t -> int
val equal : t -> t -> bool
diff --git a/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/CanonValue/index.html b/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/CanonValue/index.html index 804c694341c..08dde9efc78 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/CanonValue/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/CanonValue/index.html @@ -8,7 +8,13 @@ t option
val canon_opt_fst : astate -> (needs_canon * 'a) option -> (t * 'a) option
val canon_opt_fst4' : astate -> (Pulselib.PulseBasicInterface.AbstractValue.t * 'a * 'b * 'c) option -> - (t * 'a * 'b * 'c) option
val mk_fresh : unit -> t

This is just AbstractValue.mk_fresh so technically is only guaranteed to produce a canonical representative if the value is not immediately made equal to another one... Use with caution!

  • deprecated unsafe, obviously; please add a comment why you need to use this and suppress this warning locally with [@alert "-deprecated"]

Domain elements, revisited to be safe wrt value normalization

module Stack : sig ... end
module Memory : + (t * 'a * 'b * 'c) option
val mk_fresh : unit -> t

This is just AbstractValue.mk_fresh so technically is only guaranteed to produce a canonical representative if the value is not immediately made equal to another one... Use with caution!

  • deprecated unsafe, obviously; please add a comment why you need to use this and suppress this warning locally with [@alert "-deprecated"]

Domain elements, revisited to be safe wrt value normalization

module Stack : sig ... end
module Memory : PulseBaseMemory.S with type key := t and type in_map_t := diff --git a/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/Stack/index.html b/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/Stack/index.html index ddfabf72295..d528eccad7c 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/Stack/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/Stack/index.html @@ -8,6 +8,4 @@ Pulselib.PulseBasicInterface.ValueHistory.t -> IR.Var.t -> t -> - t - * (Pulselib.PulseBasicInterface.AbstractValue.t - * Pulselib.PulseBasicInterface.ValueHistory.t)

return the value of the variable in the stack or create a fresh one if needed

val mem : IR.Var.t -> t -> bool
val exists : (IR.Var.t -> PulseBaseStack.value -> bool) -> t -> bool
val keys : t -> IR.Var.t list
+ t * Pulselib.PulseBasicInterface.ValueOrigin.t

return the value of the variable in the stack or create a fresh one if needed

val mem : IR.Var.t -> t -> bool
val exists : (IR.Var.t -> PulseBaseStack.value -> bool) -> t -> bool
val keys : t -> IR.Var.t list
diff --git a/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/index.html b/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/index.html index 79b1e255464..779da7ac6a5 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseAbductiveDomain/index.html @@ -89,7 +89,13 @@ Pulselib.PulseBasicInterface.SatUnsat.t

Check that the new equalities discovered are compatible with the current pre and post heaps, e.g. x = 0 is not compatible with x being allocated, and x = y is not compatible with x and y being allocated separately. In those cases, the result is Unsat.

Similar to incorporate_new_eqs, but apply to an abstract value.

module Summary : sig ... end
val transfer_transitive_info_to_caller : + Pulselib.PulseBasicInterface.AbstractValue.t

Similar to incorporate_new_eqs, but apply to an abstract value.

module Summary : sig ... end
val transfer_transitive_info_to_caller : IR.Procname.t -> IBase.Location.t -> Summary.t -> diff --git a/website/static/odoc/next/infer/Pulselib/PulseAbstractValue/Set/index.html b/website/static/odoc/next/infer/Pulselib/PulseAbstractValue/Set/index.html index cd17831a26e..266f7d649b7 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseAbstractValue/Set/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseAbstractValue/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Pulselib.PulseAbstractValue.Set)

Module PulseAbstractValue.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Pulselib.PulseAbstractValue.Set)

Module PulseAbstractValue.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Pulselib/PulseAccess/index.html b/website/static/odoc/next/infer/Pulselib/PulseAccess/index.html index 6f0e15fb98f..ed1c8d63526 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseAccess/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseAccess/index.html @@ -14,5 +14,5 @@ (F.formatter -> 'array_index -> unit) -> F.formatter -> 'array_index access -> - unit
module type S = sig ... end
include S with type key := AbstractValue.t
include IStdlib.PrettyPrintable.PrintableEquatableOrderedType + unit
val map_array_index : f:('idx -> 'idx') -> 'idx access -> 'idx' access
module type S = sig ... end
include S with type key := AbstractValue.t
include IStdlib.PrettyPrintable.PrintableEquatableOrderedType with type t = AbstractValue.t access
include IStdlib.IStd.Caml.Set.OrderedType with type t = AbstractValue.t access
val compare : t -> t -> int
include IStdlib.PrettyPrintable.PrintableEquatableType with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val equal : t -> t -> bool
val canonicalize : get_var_repr:(AbstractValue.t -> AbstractValue.t) -> t -> t
val yojson_of_t : t -> Yojson.Safe.t
module Set : IStdlib.IStd.Caml.Set.S with type elt = t
diff --git a/website/static/odoc/next/infer/Pulselib/PulseArithmetic/index.html b/website/static/odoc/next/infer/Pulselib/PulseArithmetic/index.html index fa551921c19..36a88454d7a 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseArithmetic/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseArithmetic/index.html @@ -50,6 +50,7 @@ (AbductiveDomain.t * Pulselib.PulseBasicInterface.AbstractValue.t) AccessResult.t Pulselib.PulseBasicInterface.SatUnsat.t

helper function wrapping prune_binop

helper function wrapping prune_binop

val prune_positive : diff --git a/website/static/odoc/next/infer/Pulselib/PulseAttribute/Attributes/index.html b/website/static/odoc/next/infer/Pulselib/PulseAttribute/Attributes/index.html index 56aca82c9df..9fe60bfe639 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseAttribute/Attributes/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseAttribute/Attributes/index.html @@ -9,7 +9,7 @@ t -> (IR.Procname.t * IBase.Location.t * Trace.t) option
val get_copied_into : t -> CopiedInto.t option
val get_copied_return : t -> - (AbstractValue.t * bool * CopyOrigin.t * IBase.Location.t) option
val remove_copied_return : t -> t
val get_source_origin_of_copy : t -> (PulseAbstractValue.t * bool) option
val get_allocation : t -> (allocator * Trace.t) option
val remove_allocation : t -> t
val get_unknown_effect : t -> (CallEvent.t * ValueHistory.t) option
val remove_dict_contain_const_keys : t -> t
val is_dict_contain_const_keys : t -> bool
val get_dict_read_const_keys : t -> ConstKeys.t option
val get_static_type : t -> IR.Typ.Name.t option
val is_java_resource_released : t -> bool
val get_hack_builder : t -> Builder.t option
val remove_hack_builder : t -> t
val is_hack_builder_discardable : t -> bool
val is_hack_sinit_called : t -> bool
val get_hack_sinit_must_not_be_called : t -> Timestamp.t option
val is_csharp_resource_released : t -> bool
val is_end_of_collection : t -> bool
val get_invalid : t -> (Invalidation.t * Trace.t) option
val get_tainted : t -> TaintedSet.t
val remove_tainted : t -> t
val remove_must_not_be_tainted : ?kinds:TaintConfig.Kind.Set.t -> t -> t
val get_propagate_taint_from : + (AbstractValue.t * bool * CopyOrigin.t * IBase.Location.t) option
val remove_copied_return : t -> t
val get_source_origin_of_copy : t -> (PulseAbstractValue.t * bool) option
val get_allocation : t -> (allocator * Trace.t) option
val remove_allocation : t -> t
val get_unknown_effect : t -> (CallEvent.t * ValueHistory.t) option
val remove_dict_contain_const_keys : t -> t
val is_dict_contain_const_keys : t -> bool
val get_dict_read_const_keys : t -> ConstKeys.t option
val get_static_type : t -> IR.Typ.Name.t option
val is_java_resource_released : t -> bool
val get_hack_builder : t -> Builder.t option
val remove_hack_builder : t -> t
val is_hack_builder_discardable : t -> bool
val is_hack_sinit_called : t -> bool
val is_csharp_resource_released : t -> bool
val is_end_of_collection : t -> bool
val get_invalid : t -> (Invalidation.t * Trace.t) option
val get_tainted : t -> TaintedSet.t
val remove_tainted : t -> t
val remove_must_not_be_tainted : ?kinds:TaintConfig.Kind.Set.t -> t -> t
val get_propagate_taint_from : t -> (taint_propagation_reason * taint_in list) option
val remove_propagate_taint_from : t -> t
val get_returned_from_unknown : t -> AbstractValue.t list option
val get_taint_sanitized : t -> TaintSanitizedSet.t
val remove_taint_sanitized : t -> t
val get_must_be_valid : t -> @@ -20,4 +20,4 @@ IBase.Location.t -> ValueHistory.t -> t -> - t
val get_allocated_not_freed : t -> (allocator * Trace.t) option
val make_suitable_for_pre_summary : t -> t
val make_suitable_for_post_summary : t -> t
+ t
val get_allocated_not_freed : t -> (allocator * Trace.t) option
val make_suitable_for_pre_summary : t -> t
val make_suitable_for_post_summary : t -> t
diff --git a/website/static/odoc/next/infer/Pulselib/PulseAttribute/CopyOrigin/index.html b/website/static/odoc/next/infer/Pulselib/PulseAttribute/CopyOrigin/index.html index a3d5938dc45..569409a66c6 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseAttribute/CopyOrigin/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseAttribute/CopyOrigin/index.html @@ -1,2 +1,2 @@ -CopyOrigin (infer.Pulselib.PulseAttribute.CopyOrigin)

Module PulseAttribute.CopyOrigin

type t =
  1. | CopyCtor
  2. | CopyAssignment
  3. | CopyToOptional
  4. | CopyInGetDefault
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
val pp : IStdlib.IStd.Formatter.t -> t -> unit
+CopyOrigin (infer.Pulselib.PulseAttribute.CopyOrigin)

Module PulseAttribute.CopyOrigin

type assign_t =
  1. | Normal
  2. | Thrift
val compare_assign_t : assign_t -> assign_t -> int
val equal_assign_t : assign_t -> assign_t -> bool
type t =
  1. | CopyCtor
  2. | CopyAssignment of assign_t
  3. | CopyToOptional
  4. | CopyInGetDefault
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
val pp : IStdlib.IStd.Formatter.t -> t -> unit
diff --git a/website/static/odoc/next/infer/Pulselib/PulseAttribute/TaintSanitizedSet/index.html b/website/static/odoc/next/infer/Pulselib/PulseAttribute/TaintSanitizedSet/index.html index dac726e7f58..ab893d7e1a7 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseAttribute/TaintSanitizedSet/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseAttribute/TaintSanitizedSet/index.html @@ -1,2 +1,2 @@ -TaintSanitizedSet (infer.Pulselib.PulseAttribute.TaintSanitizedSet)

Module PulseAttribute.TaintSanitizedSet

include IStdlib.IStd.Caml.Set.S with type elt = TaintSanitized.t
type elt = TaintSanitized.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+TaintSanitizedSet (infer.Pulselib.PulseAttribute.TaintSanitizedSet)

Module PulseAttribute.TaintSanitizedSet

include IStdlib.IStd.Caml.Set.S with type elt = TaintSanitized.t
type elt = TaintSanitized.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Pulselib/PulseAttribute/TaintedSet/index.html b/website/static/odoc/next/infer/Pulselib/PulseAttribute/TaintedSet/index.html index 09ef38e4a12..6ccd45dd969 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseAttribute/TaintedSet/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseAttribute/TaintedSet/index.html @@ -1,2 +1,2 @@ -TaintedSet (infer.Pulselib.PulseAttribute.TaintedSet)

Module PulseAttribute.TaintedSet

include IStdlib.IStd.Caml.Set.S with type elt = Tainted.t
type elt = Tainted.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+TaintedSet (infer.Pulselib.PulseAttribute.TaintedSet)

Module PulseAttribute.TaintedSet

include IStdlib.IStd.Caml.Set.S with type elt = Tainted.t
type elt = Tainted.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Pulselib/PulseAttribute/index.html b/website/static/odoc/next/infer/Pulselib/PulseAttribute/index.html index b745ca4c82b..5b4cf15c476 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseAttribute/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseAttribute/index.html @@ -1,10 +1,10 @@ -PulseAttribute (infer.Pulselib.PulseAttribute)

Module Pulselib.PulseAttribute

module F = Stdlib.Format
module AbstractValue = PulseAbstractValue
module CallEvent = PulseCallEvent
module ConfigName = OpenSource.FbPulseConfigName
module DecompilerExpr = PulseDecompilerExpr
module Invalidation = PulseInvalidation
module TaintItem = PulseTaintItem
module TaintConfig = PulseTaintConfig
module Timestamp = PulseTimestamp
module Trace = PulseTrace
module ValueHistory = PulseValueHistory
type allocator =
  1. | CMalloc
  2. | CustomMalloc of IR.Procname.t
  3. | CRealloc
  4. | CustomRealloc of IR.Procname.t
  5. | CppNew
  6. | CppNewArray
  7. | JavaResource of IR.JavaClassName.t
  8. | CSharpResource of IR.CSharpClassName.t
  9. | ObjCAlloc
  10. | HackAsync
  11. | HackBuilderResource of IR.HackClassName.t
val equal_allocator : allocator -> allocator -> bool
val pp_allocator : F.formatter -> allocator -> unit
type taint_in = {
  1. v : AbstractValue.t;
  2. history : ValueHistory.t;
}

Describes the source of taint in taint propagation.

NOTE: history is ignored in equality and comparison.

val compare_taint_in : taint_in -> taint_in -> int
val equal_taint_in : taint_in -> taint_in -> bool
module Tainted : sig ... end
module TaintSink : sig ... end
module TaintSinkMap : +PulseAttribute (infer.Pulselib.PulseAttribute)

Module Pulselib.PulseAttribute

module F = Stdlib.Format
module AbstractValue = PulseAbstractValue
module CallEvent = PulseCallEvent
module ConfigName = OpenSource.FbPulseConfigName
module DecompilerExpr = PulseDecompilerExpr
module Invalidation = PulseInvalidation
module TaintItem = PulseTaintItem
module TaintConfig = PulseTaintConfig
module Timestamp = PulseTimestamp
module Trace = PulseTrace
module ValueHistory = PulseValueHistory
type allocator =
  1. | CMalloc
  2. | CustomMalloc of IR.Procname.t
  3. | CRealloc
  4. | CustomRealloc of IR.Procname.t
  5. | CppNew
  6. | CppNewArray
  7. | JavaResource of IR.JavaClassName.t
  8. | CSharpResource of IR.CSharpClassName.t
  9. | ObjCAlloc
  10. | HackAsync
  11. | HackBuilderResource of IR.HackClassName.t
val equal_allocator : allocator -> allocator -> bool
val pp_allocator : F.formatter -> allocator -> unit
val is_hack_resource : allocator -> bool
type taint_in = {
  1. v : AbstractValue.t;
  2. history : ValueHistory.t;
}

Describes the source of taint in taint propagation.

NOTE: history is ignored in equality and comparison.

val compare_taint_in : taint_in -> taint_in -> int
val equal_taint_in : taint_in -> taint_in -> bool
module Tainted : sig ... end
module TaintSink : sig ... end
module TaintSanitized : sig ... end
type taint_propagation_reason =
  1. | InternalModel
  2. | UnknownCall
  3. | UserConfig
val pp_taint_propagation_reason : F.formatter -> taint_propagation_reason -> - unit
module CopyOrigin : sig ... end
module CopiedInto : sig ... end
module ConfigUsage : sig ... end
module Builder : sig ... end
module UninitializedTyp : sig ... end
module ConstKeys : sig ... end
type t =
  1. | AddressOfCppTemporary of IR.Var.t * ValueHistory.t
  2. | AddressOfStackVariable of IR.Var.t * IBase.Location.t * ValueHistory.t
  3. | Allocated of allocator * Trace.t
  4. | AlwaysReachable
  5. | Closure of IR.Procname.t
  6. | ConfigUsage of ConfigUsage.t
  7. | CopiedInto of CopiedInto.t
    (*

    records the copied var/field for each source address

    *)
  8. | CopiedReturn of {
    1. source : AbstractValue.t;
    2. is_const_ref : bool;
    3. from : CopyOrigin.t;
    4. copied_location : IBase.Location.t;
    }
    (*

    records the copied value for the return address

    *)
  9. | DictContainConstKeys
    (*

    the dictionary contains only constant keys (note: only string constant is supported for now)

    *)
  10. | DictReadConstKeys of ConstKeys.t
    (*

    constant string keys that are read from the dictionary

    *)
  11. | EndOfCollection
  12. | HackBuilder of Builder.t
  13. | HackSinitCalled
  14. | HackSinitMustNotBeCalled of Timestamp.t
  15. | InReportedRetainCycle
  16. | Initialized
  17. | Invalid of Invalidation.t * Trace.t
  18. | LastLookup of AbstractValue.t
  19. | MustBeInitialized of Timestamp.t * Trace.t
  20. | MustBeValid of Timestamp.t * Trace.t * Invalidation.must_be_valid_reason option
  21. | MustNotBeTainted of TaintSink.t TaintSinkMap.t
  22. | JavaResourceReleased
  23. | CSharpResourceReleased
  24. | HackAsyncAwaited
  25. | PropagateTaintFrom of taint_propagation_reason * taint_in list
  26. | ReturnedFromUnknown of AbstractValue.t list
  27. | SourceOriginOfCopy of {
    1. source : PulseAbstractValue.t;
    2. is_const_ref : bool;
    }
    (*

    records the source value for a given copy to lookup the appropriate heap in non-disj domain

    *)
  28. | StaticType of IR.Typ.Name.t
    (*

    type gotten or inferred from types in SIL instructions (only for Hack frontend)

    *)
  29. | StdMoved
  30. | StdVectorReserve
  31. | Tainted of TaintedSet.t
  32. | TaintSanitized of TaintSanitizedSet.t
  33. | Uninitialized of UninitializedTyp.t
  34. | UnknownEffect of CallEvent.t * ValueHistory.t
    (*

    generated by calls to unknown functions to remember that a pointer has been passed to an unknown function and so everything reachable from it has potentially been affected in unknown ways

    *)
  35. | UnreachableAt of IBase.Location.t
    (*

    temporary marker to remember where a variable became unreachable; helps with accurately reporting leaks

    *)
  36. | UsedAsBranchCond of IR.Procname.t * IBase.Location.t * Trace.t
  37. | WrittenTo of Timestamp.t * Trace.t
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
val pp : F.formatter -> t -> unit
val filter_unreachable : + unit
module CopyOrigin : sig ... end
module CopiedInto : sig ... end
module ConfigUsage : sig ... end
module Builder : sig ... end
module UninitializedTyp : sig ... end
module ConstKeys : sig ... end
type t =
  1. | AddressOfCppTemporary of IR.Var.t * ValueHistory.t
  2. | AddressOfStackVariable of IR.Var.t * IBase.Location.t * ValueHistory.t
  3. | Allocated of allocator * Trace.t
  4. | AlwaysReachable
  5. | Closure of IR.Procname.t
  6. | ConfigUsage of ConfigUsage.t
  7. | CopiedInto of CopiedInto.t
    (*

    records the copied var/field for each source address

    *)
  8. | CopiedReturn of {
    1. source : AbstractValue.t;
    2. is_const_ref : bool;
    3. from : CopyOrigin.t;
    4. copied_location : IBase.Location.t;
    }
    (*

    records the copied value for the return address

    *)
  9. | DictContainConstKeys
    (*

    the dictionary contains only constant keys (note: only string constant is supported for now)

    *)
  10. | DictReadConstKeys of ConstKeys.t
    (*

    constant string keys that are read from the dictionary

    *)
  11. | EndOfCollection
  12. | HackBuilder of Builder.t
  13. | HackSinitCalled
  14. | InReportedRetainCycle
  15. | Initialized
  16. | Invalid of Invalidation.t * Trace.t
  17. | LastLookup of AbstractValue.t
  18. | MustBeInitialized of Timestamp.t * Trace.t
  19. | MustBeValid of Timestamp.t * Trace.t * Invalidation.must_be_valid_reason option
  20. | MustNotBeTainted of TaintSink.t TaintSinkMap.t
  21. | JavaResourceReleased
  22. | CSharpResourceReleased
  23. | HackAsyncAwaited
  24. | PropagateTaintFrom of taint_propagation_reason * taint_in list
  25. | ReturnedFromUnknown of AbstractValue.t list
  26. | SourceOriginOfCopy of {
    1. source : PulseAbstractValue.t;
    2. is_const_ref : bool;
    }
    (*

    records the source value for a given copy to lookup the appropriate heap in non-disj domain

    *)
  27. | StaticType of IR.Typ.Name.t
    (*

    type gotten or inferred from types in SIL instructions (only for Hack frontend)

    *)
  28. | StdMoved
  29. | StdVectorReserve
  30. | Tainted of TaintedSet.t
  31. | TaintSanitized of TaintSanitizedSet.t
  32. | Uninitialized of UninitializedTyp.t
  33. | UnknownEffect of CallEvent.t * ValueHistory.t
    (*

    generated by calls to unknown functions to remember that a pointer has been passed to an unknown function and so everything reachable from it has potentially been affected in unknown ways

    *)
  34. | UnreachableAt of IBase.Location.t
    (*

    temporary marker to remember where a variable became unreachable; helps with accurately reporting leaks

    *)
  35. | UsedAsBranchCond of IR.Procname.t * IBase.Location.t * Trace.t
  36. | WrittenTo of Timestamp.t * Trace.t
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
val pp : F.formatter -> t -> unit
val filter_unreachable : AbstractValue.Set.t AbstractValue.Map.t -> (AbstractValue.t -> bool) -> t -> diff --git a/website/static/odoc/next/infer/Pulselib/PulseBaseAddressAttributes/index.html b/website/static/odoc/next/infer/Pulselib/PulseBaseAddressAttributes/index.html index 84a9802db75..e99ac541da0 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseBaseAddressAttributes/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseBaseAddressAttributes/index.html @@ -198,10 +198,7 @@ bool
val is_hack_sinit_called : Pulselib.PulseBasicInterface.AbstractValue.t -> t -> - bool
val get_hack_sinit_must_not_be_called : - Pulselib.PulseBasicInterface.AbstractValue.t -> - t -> - Pulselib.PulseBasicInterface.Timestamp.t option
val make_suitable_for_pre_summary : t -> t
val canonicalize_post : + bool
val make_suitable_for_pre_summary : t -> t
val canonicalize_post : get_var_repr: (Pulselib.PulseBasicInterface.AbstractValue.t -> Pulselib.PulseBasicInterface.AbstractValue.t) -> diff --git a/website/static/odoc/next/infer/Pulselib/PulseBaseAddressAttributes/module-type-S/index.html b/website/static/odoc/next/infer/Pulselib/PulseBaseAddressAttributes/module-type-S/index.html index 1c01f3f5db9..30c6b62116d 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseBaseAddressAttributes/module-type-S/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseBaseAddressAttributes/module-type-S/index.html @@ -110,7 +110,4 @@ key -> t -> (IR.Var.t * IBase.Location.t * Pulselib.PulseBasicInterface.ValueHistory.t) - option
val has_unknown_effect : key -> t -> bool
val is_hack_sinit_called : key -> t -> bool
val get_hack_sinit_must_not_be_called : - key -> - t -> - Pulselib.PulseBasicInterface.Timestamp.t option
+ option
val has_unknown_effect : key -> t -> bool
val is_hack_sinit_called : key -> t -> bool
diff --git a/website/static/odoc/next/infer/Pulselib/PulseBaseStack/index.html b/website/static/odoc/next/infer/Pulselib/PulseBaseStack/index.html index 51191ba29f5..6ea9463567e 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseBaseStack/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseBaseStack/index.html @@ -1,18 +1,9 @@ -PulseBaseStack (infer.Pulselib.PulseBaseStack)

Module Pulselib.PulseBaseStack

module type S = sig ... end
include S - with type value = - Pulselib.PulseBasicInterface.AbstractValue.t - * Pulselib.PulseBasicInterface.ValueHistory.t
include IStdlib.PrettyPrintable.PPMonoMap +PulseBaseStack (infer.Pulselib.PulseBaseStack)

Module Pulselib.PulseBaseStack

module type S = sig ... end

Values are ValueOrigin.t, which should always be Unknown for program variables, and always be not Unknown for logical variables, as we record what was loaded into each logical variable. For example, after n$1 = *&p, n$1 should have p as its value origin.

include S with type value = Pulselib.PulseBasicInterface.ValueOrigin.t
include IStdlib.PrettyPrintable.PPMonoMap with type key = IR.Var.t - with type value = - Pulselib.PulseBasicInterface.AbstractValue.t - * Pulselib.PulseBasicInterface.ValueHistory.t
include IStdlib.PrettyPrintable.MonoMap + with type value = Pulselib.PulseBasicInterface.ValueOrigin.t
include IStdlib.PrettyPrintable.MonoMap with type key = IR.Var.t - with type value = - Pulselib.PulseBasicInterface.AbstractValue.t - * Pulselib.PulseBasicInterface.ValueHistory.t
type key = IR.Var.t
type t
val empty : t
val is_empty : t -> bool
val mem : key -> t -> bool
val add : key -> value -> t -> t
val update : key -> (value option -> value option) -> t -> t
val singleton : key -> value -> t
val remove : key -> t -> t
type key = IR.Var.t
type t
val empty : t
val is_empty : t -> bool
val mem : key -> t -> bool
val add : key -> value -> t -> t
val update : key -> (value option -> value option) -> t -> t
val singleton : key -> value -> t
val remove : key -> t -> t
val merge : (key -> value option -> value option -> value option) -> t -> t -> diff --git a/website/static/odoc/next/infer/Pulselib/PulseCallEvent/index.html b/website/static/odoc/next/infer/Pulselib/PulseCallEvent/index.html index 50e909ff7a7..2b4474bd10e 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseCallEvent/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseCallEvent/index.html @@ -1,2 +1,2 @@ -PulseCallEvent (infer.Pulselib.PulseCallEvent)

Module Pulselib.PulseCallEvent

module F = Stdlib.Format
type t =
  1. | Call of IR.Procname.t
    (*

    known function with summary

    *)
  2. | Model of string
    (*

    hardcoded model

    *)
  3. | SkippedKnownCall of IR.Procname.t
    (*

    known function without summary

    *)
  4. | SkippedUnknownCall of IR.Exp.t
    (*

    couldn't link the expression to a proc name

    *)
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
val pp : F.formatter -> t -> unit
val describe : F.formatter -> t -> unit
val pp_name_only : F.formatter -> t -> unit
+PulseCallEvent (infer.Pulselib.PulseCallEvent)

Module Pulselib.PulseCallEvent

module F = Stdlib.Format
type t =
  1. | Call of IR.Procname.t
    (*

    known function with summary

    *)
  2. | Model of string
    (*

    hardcoded model with hardcoded name

    *)
  3. | ModelName of IR.Procname.t
    (*

    hardcoded model taking the name of the original procedure

    *)
  4. | SkippedKnownCall of IR.Procname.t
    (*

    known function without summary

    *)
  5. | SkippedUnknownCall of IR.Exp.t
    (*

    couldn't link the expression to a proc name

    *)
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
val pp : F.formatter -> t -> unit
val describe : F.formatter -> t -> unit
val pp_name_only : F.formatter -> t -> unit
val to_name_only : t -> string
diff --git a/website/static/odoc/next/infer/Pulselib/PulseCanonValue/Make/Attributes/index.html b/website/static/odoc/next/infer/Pulselib/PulseCanonValue/Make/Attributes/index.html index 3a1839d0eb5..14b97d1ff42 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseCanonValue/Make/Attributes/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseCanonValue/Make/Attributes/index.html @@ -107,7 +107,4 @@ t -> t -> (IR.Var.t * IBase.Location.t * Pulselib.PulseBasicInterface.ValueHistory.t) - option
val has_unknown_effect : t -> t -> bool
val is_hack_sinit_called : t -> t -> bool
val get_hack_sinit_must_not_be_called : - t -> - t -> - Pulselib.PulseBasicInterface.Timestamp.t option
+ option
val has_unknown_effect : t -> t -> bool
val is_hack_sinit_called : t -> t -> bool
diff --git a/website/static/odoc/next/infer/Pulselib/PulseCanonValue/Make/Set/index.html b/website/static/odoc/next/infer/Pulselib/PulseCanonValue/Make/Set/index.html index 3a24b3d7f87..8abdd60c9c8 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseCanonValue/Make/Set/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseCanonValue/Make/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Pulselib.PulseCanonValue.Make.Set)

Module Make.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Pulselib.PulseCanonValue.Make.Set)

Module Make.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Pulselib/PulseCanonValue/Make/Stack/index.html b/website/static/odoc/next/infer/Pulselib/PulseCanonValue/Make/Stack/index.html index a16c5cc38b5..691d1e79494 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseCanonValue/Make/Stack/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseCanonValue/Make/Stack/index.html @@ -1,21 +1,16 @@ Stack (infer.Pulselib.PulseCanonValue.Make.Stack)

Module Make.Stack

include PulseBaseStack.S - with type value = needs_canon * Pulselib.PulseBasicInterface.ValueHistory.t + with type value = needs_canon Pulselib.PulseBasicInterface.ValueOrigin.t_ and type t = PulseBaseStack.t
include IStdlib.PrettyPrintable.PPMonoMap with type key = IR.Var.t - with type value = needs_canon * Pulselib.PulseBasicInterface.ValueHistory.t + with type value = needs_canon Pulselib.PulseBasicInterface.ValueOrigin.t_ with type t = PulseBaseStack.t
include IStdlib.PrettyPrintable.MonoMap with type key = IR.Var.t - with type value = needs_canon * Pulselib.PulseBasicInterface.ValueHistory.t - with type t = PulseBaseStack.t
type key = IR.Var.t
val empty : t
val is_empty : t -> bool
val mem : key -> t -> bool
val update : key -> (value option -> value option) -> t -> t
val singleton : key -> value -> t
val remove : key -> t -> t
val merge : + with type value = needs_canon Pulselib.PulseBasicInterface.ValueOrigin.t_ + with type t = PulseBaseStack.t
type key = IR.Var.t
val empty : t
val is_empty : t -> bool
val mem : key -> t -> bool
val update : key -> (value option -> value option) -> t -> t
val singleton : key -> value -> t
val remove : key -> t -> t
val merge : (key -> value option -> value option -> value option) -> t -> t -> t
val union : (key -> value -> value -> value option) -> t -> t -> t
val iter : (key -> value -> unit) -> t -> unit
val fold : (key -> value -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (key -> value -> bool) -> t -> bool
val exists : (key -> value -> bool) -> t -> bool
val filter : (key -> value -> bool) -> t -> t
val filter_map : (key -> value -> value option) -> t -> t
val partition : (key -> value -> bool) -> t -> t * t
val cardinal : t -> int
val bindings : t -> (key * value) list
val min_binding : t -> key * value
val min_binding_opt : t -> (key * value) option
val max_binding : t -> key * value
val max_binding_opt : t -> (key * value) option
val choose : t -> key * value
val choose_opt : t -> (key * value) option
val split : key -> t -> t * value option * t
val find : key -> t -> value
val find_opt : key -> t -> value option
val find_first : (key -> bool) -> t -> key * value
val find_first_opt : (key -> bool) -> t -> (key * value) option
val find_last : (key -> bool) -> t -> key * value
val find_last_opt : (key -> bool) -> t -> (key * value) option
val map : (value -> value) -> t -> t
val mapi : (key -> value -> value) -> t -> t
val is_singleton_or_more : t -> - (key * value) IStdlib.IContainer.singleton_or_more
val fold_map : t -> init:'a -> f:('a -> value -> 'a * value) -> 'a * t
val fold_mapi : t -> init:'a -> f:(key -> 'a -> value -> 'a * value) -> 'a * t
val of_seq : (key * value) Stdlib.Seq.t -> t
val to_seq : t -> (key * value) Stdlib.Seq.t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_key : IStdlib.PrettyPrintable.F.formatter -> key -> unit
val compare : t -> t -> int
val equal : t -> t -> bool
+ (key * value) IStdlib.IContainer.singleton_or_more
val fold_map : t -> init:'a -> f:('a -> value -> 'a * value) -> 'a * t
val fold_mapi : t -> init:'a -> f:(key -> 'a -> value -> 'a * value) -> 'a * t
val of_seq : (key * value) Stdlib.Seq.t -> t
val to_seq : t -> (key * value) Stdlib.Seq.t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_key : IStdlib.PrettyPrintable.F.formatter -> key -> unit
val compare : t -> t -> int
val equal : t -> t -> bool
diff --git a/website/static/odoc/next/infer/Pulselib/PulseCanonValue/Make/index.html b/website/static/odoc/next/infer/Pulselib/PulseCanonValue/Make/index.html index 28d291c90ad..71826a7149f 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseCanonValue/Make/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseCanonValue/Make/index.html @@ -8,7 +8,13 @@ t option
val canon_opt_fst : astate -> (needs_canon * 'a) option -> (t * 'a) option
val canon_opt_fst4' : astate -> (Pulselib.PulseBasicInterface.AbstractValue.t * 'a * 'b * 'c) option -> - (t * 'a * 'b * 'c) option
val mk_fresh : unit -> t

This is just AbstractValue.mk_fresh so technically is only guaranteed to produce a canonical representative if the value is not immediately made equal to another one... Use with caution!

  • deprecated unsafe, obviously; please add a comment why you need to use this and suppress this warning locally with [@alert "-deprecated"]

Domain elements, revisited to be safe wrt value normalization

module Stack : sig ... end
module Memory : + (t * 'a * 'b * 'c) option
val mk_fresh : unit -> t

This is just AbstractValue.mk_fresh so technically is only guaranteed to produce a canonical representative if the value is not immediately made equal to another one... Use with caution!

  • deprecated unsafe, obviously; please add a comment why you need to use this and suppress this warning locally with [@alert "-deprecated"]

Domain elements, revisited to be safe wrt value normalization

module Stack : sig ... end
module Memory : PulseBaseMemory.S with type key := t and type in_map_t := diff --git a/website/static/odoc/next/infer/Pulselib/PulseCanonValue/module-type-S/Attributes/index.html b/website/static/odoc/next/infer/Pulselib/PulseCanonValue/module-type-S/Attributes/index.html index ff37c613e18..847a08e4e9a 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseCanonValue/module-type-S/Attributes/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseCanonValue/module-type-S/Attributes/index.html @@ -107,7 +107,4 @@ t -> t -> (IR.Var.t * IBase.Location.t * Pulselib.PulseBasicInterface.ValueHistory.t) - option
val has_unknown_effect : t -> t -> bool
val is_hack_sinit_called : t -> t -> bool
val get_hack_sinit_must_not_be_called : - t -> - t -> - Pulselib.PulseBasicInterface.Timestamp.t option
+ option
val has_unknown_effect : t -> t -> bool
val is_hack_sinit_called : t -> t -> bool
diff --git a/website/static/odoc/next/infer/Pulselib/PulseCanonValue/module-type-S/Set/index.html b/website/static/odoc/next/infer/Pulselib/PulseCanonValue/module-type-S/Set/index.html index 0cae2d48f03..0862f1eeee9 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseCanonValue/module-type-S/Set/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseCanonValue/module-type-S/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Pulselib.PulseCanonValue.S.Set)

Module S.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
+Set (infer.Pulselib.PulseCanonValue.S.Set)

Module S.Set

include IStdlib.IStd.Caml.Set.S with type elt = t
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib.Seq.t
val to_seq : t -> elt Stdlib.Seq.t
val to_rev_seq : t -> elt Stdlib.Seq.t
val add_seq : elt Stdlib.Seq.t -> t -> t
val of_seq : elt Stdlib.Seq.t -> t
val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
diff --git a/website/static/odoc/next/infer/Pulselib/PulseCanonValue/module-type-S/Stack/index.html b/website/static/odoc/next/infer/Pulselib/PulseCanonValue/module-type-S/Stack/index.html index f9e78926a8b..ada07dc0211 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseCanonValue/module-type-S/Stack/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseCanonValue/module-type-S/Stack/index.html @@ -1,21 +1,16 @@ Stack (infer.Pulselib.PulseCanonValue.S.Stack)

Module S.Stack

include PulseBaseStack.S - with type value = needs_canon * Pulselib.PulseBasicInterface.ValueHistory.t + with type value = needs_canon Pulselib.PulseBasicInterface.ValueOrigin.t_ and type t = PulseBaseStack.t
include IStdlib.PrettyPrintable.PPMonoMap with type key = IR.Var.t - with type value = needs_canon * Pulselib.PulseBasicInterface.ValueHistory.t + with type value = needs_canon Pulselib.PulseBasicInterface.ValueOrigin.t_ with type t = PulseBaseStack.t
include IStdlib.PrettyPrintable.MonoMap with type key = IR.Var.t - with type value = needs_canon * Pulselib.PulseBasicInterface.ValueHistory.t - with type t = PulseBaseStack.t
type key = IR.Var.t
val empty : t
val is_empty : t -> bool
val mem : key -> t -> bool
val update : key -> (value option -> value option) -> t -> t
val singleton : key -> value -> t
val remove : key -> t -> t
val merge : + with type value = needs_canon Pulselib.PulseBasicInterface.ValueOrigin.t_ + with type t = PulseBaseStack.t
type key = IR.Var.t
val empty : t
val is_empty : t -> bool
val mem : key -> t -> bool
val update : key -> (value option -> value option) -> t -> t
val singleton : key -> value -> t
val remove : key -> t -> t
val merge : (key -> value option -> value option -> value option) -> t -> t -> t
val union : (key -> value -> value -> value option) -> t -> t -> t
val iter : (key -> value -> unit) -> t -> unit
val fold : (key -> value -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (key -> value -> bool) -> t -> bool
val exists : (key -> value -> bool) -> t -> bool
val filter : (key -> value -> bool) -> t -> t
val filter_map : (key -> value -> value option) -> t -> t
val partition : (key -> value -> bool) -> t -> t * t
val cardinal : t -> int
val bindings : t -> (key * value) list
val min_binding : t -> key * value
val min_binding_opt : t -> (key * value) option
val max_binding : t -> key * value
val max_binding_opt : t -> (key * value) option
val choose : t -> key * value
val choose_opt : t -> (key * value) option
val split : key -> t -> t * value option * t
val find : key -> t -> value
val find_opt : key -> t -> value option
val find_first : (key -> bool) -> t -> key * value
val find_first_opt : (key -> bool) -> t -> (key * value) option
val find_last : (key -> bool) -> t -> key * value
val find_last_opt : (key -> bool) -> t -> (key * value) option
val map : (value -> value) -> t -> t
val mapi : (key -> value -> value) -> t -> t
val is_singleton_or_more : t -> - (key * value) IStdlib.IContainer.singleton_or_more
val fold_map : t -> init:'a -> f:('a -> value -> 'a * value) -> 'a * t
val fold_mapi : t -> init:'a -> f:(key -> 'a -> value -> 'a * value) -> 'a * t
val of_seq : (key * value) Stdlib.Seq.t -> t
val to_seq : t -> (key * value) Stdlib.Seq.t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_key : IStdlib.PrettyPrintable.F.formatter -> key -> unit
val compare : t -> t -> int
val equal : t -> t -> bool
+ (key * value) IStdlib.IContainer.singleton_or_more
val fold_map : t -> init:'a -> f:('a -> value -> 'a * value) -> 'a * t
val fold_mapi : t -> init:'a -> f:(key -> 'a -> value -> 'a * value) -> 'a * t
val of_seq : (key * value) Stdlib.Seq.t -> t
val to_seq : t -> (key * value) Stdlib.Seq.t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val pp_key : IStdlib.PrettyPrintable.F.formatter -> key -> unit
val compare : t -> t -> int
val equal : t -> t -> bool
diff --git a/website/static/odoc/next/infer/Pulselib/PulseCanonValue/module-type-S/index.html b/website/static/odoc/next/infer/Pulselib/PulseCanonValue/module-type-S/index.html index 6c62a93465c..32213ee37da 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseCanonValue/module-type-S/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseCanonValue/module-type-S/index.html @@ -8,7 +8,13 @@ t option
val canon_opt_fst : astate -> (needs_canon * 'a) option -> (t * 'a) option
val canon_opt_fst4' : astate -> (Pulselib.PulseBasicInterface.AbstractValue.t * 'a * 'b * 'c) option -> - (t * 'a * 'b * 'c) option
val mk_fresh : unit -> t

This is just AbstractValue.mk_fresh so technically is only guaranteed to produce a canonical representative if the value is not immediately made equal to another one... Use with caution!

  • deprecated unsafe, obviously; please add a comment why you need to use this and suppress this warning locally with [@alert "-deprecated"]

Domain elements, revisited to be safe wrt value normalization

module Stack : sig ... end
module Memory : + (t * 'a * 'b * 'c) option
val mk_fresh : unit -> t

This is just AbstractValue.mk_fresh so technically is only guaranteed to produce a canonical representative if the value is not immediately made equal to another one... Use with caution!

  • deprecated unsafe, obviously; please add a comment why you need to use this and suppress this warning locally with [@alert "-deprecated"]

Domain elements, revisited to be safe wrt value normalization

module Stack : sig ... end
module Memory : PulseBaseMemory.S with type key := t and type in_map_t := diff --git a/website/static/odoc/next/infer/Pulselib/PulseDiagnostic/index.html b/website/static/odoc/next/infer/Pulselib/PulseDiagnostic/index.html index f3de5db6cf6..25da7e81c54 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseDiagnostic/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseDiagnostic/index.html @@ -7,4 +7,4 @@ access_to_invalid_address -> bool
val yojson_of_access_to_invalid_address : access_to_invalid_address -> - Ppx_yojson_conv_lib.Yojson.Safe.t
module ErlangError : sig ... end
module ReadUninitialized : sig ... end
type flow_kind =
  1. | TaintedFlow
  2. | FlowToSink
  3. | FlowFromSource
val equal_flow_kind : flow_kind -> flow_kind -> bool
type retain_cycle_data = {
  1. expr : DecompilerExpr.t;
  2. location : IBase.Location.t option;
  3. trace : Trace.t option;
}
val equal_retain_cycle_data : retain_cycle_data -> retain_cycle_data -> bool
type t =
  1. | AccessToInvalidAddress of access_to_invalid_address
  2. | ConfigUsage of {
    1. pname : IR.Procname.t;
    2. config : ConfigName.t;
    3. branch_location : IBase.Location.t;
    4. location : IBase.Location.t;
    5. trace : Trace.t;
    }
  3. | ConstRefableParameter of {
    1. param : IR.Var.t;
    2. typ : IR.Typ.t;
    3. location : IBase.Location.t;
    }
  4. | CSharpResourceLeak of {
    1. class_name : IR.CSharpClassName.t;
    2. allocation_trace : Trace.t;
    3. location : IBase.Location.t;
    }
  5. | DynamicTypeMismatch of {
    1. location : IBase.Location.t;
    }
  6. | ErlangError of ErlangError.t
  7. | TransitiveAccess of {
    1. tag : string;
    2. description : string;
    3. call_trace : Trace.t;
    4. transitive_callees : TransitiveInfo.Callees.t;
    5. transitive_missed_captures : IR.Typ.Name.Set.t;
    }
  8. | JavaResourceLeak of {
    1. class_name : IR.JavaClassName.t;
    2. allocation_trace : Trace.t;
    3. location : IBase.Location.t;
    }
  9. | HackCannotInstantiateAbstractClass of {
    1. type_name : IR.Typ.Name.t;
    2. trace : Trace.t;
    }
  10. | HackUnawaitedAwaitable of {
    1. allocation_trace : Trace.t;
    2. location : IBase.Location.t;
    }
  11. | HackUnfinishedBuilder of {
    1. builder_type : IR.HackClassName.t;
    2. allocation_trace : Trace.t;
    3. location : IBase.Location.t;
    }
  12. | MemoryLeak of {
    1. allocator : Attribute.allocator;
    2. allocation_trace : Trace.t;
    3. location : IBase.Location.t;
    }
  13. | MutualRecursionCycle of {
    1. cycle : PulseMutualRecursion.t;
    2. location : IBase.Location.t;
    }
  14. | ReadonlySharedPtrParameter of {
    1. param : IR.Var.t;
    2. typ : IR.Typ.t;
    3. location : IBase.Location.t;
    4. used_locations : IBase.Location.t list;
    }
  15. | ReadUninitialized of ReadUninitialized.t
  16. | RetainCycle of {
    1. values : retain_cycle_data list;
    2. location : IBase.Location.t;
    3. unknown_access_type : bool;
    }
  17. | StackVariableAddressEscape of {
    1. variable : IR.Var.t;
    2. history : ValueHistory.t;
    3. location : IBase.Location.t;
    }
  18. | TaintFlow of {
    1. expr : DecompilerExpr.t;
    2. source : TaintItem.t * ValueHistory.t;
    3. sink : TaintItem.t * Trace.t;
    4. location : IBase.Location.t;
    5. flow_kind : flow_kind;
    6. policy_description : string;
    7. policy_id : int;
    8. policy_privacy_effect : string option;
    }
  19. | UnnecessaryCopy of {
    1. copied_into : PulseAttribute.CopiedInto.t;
    2. source_typ : IR.Typ.t option;
    3. source_opt : DecompilerExpr.source_expr option;
    4. location : IBase.Location.t;
    5. copied_location : (IR.Procname.t * IBase.Location.t) option;
    6. location_instantiated : IBase.Location.t option;
    7. from : PulseAttribute.CopyOrigin.t;
    }

an error to report to the user

include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
val pp : F.formatter -> t -> unit
val aborts_execution : t -> bool

whether the presence of an error should abort the execution

val get_message_and_suggestion : t -> string * string option
val get_location : t -> IBase.Location.t
val get_location_instantiated : t -> IBase.Location.t option
val get_copy_type : t -> IR.Typ.t option
val get_issue_type : latent:bool -> t -> IBase.IssueType.t
val get_trace : t -> Absint.Errlog.loc_trace
+ Ppx_yojson_conv_lib.Yojson.Safe.t
module ErlangError : sig ... end
module ReadUninitialized : sig ... end
type flow_kind =
  1. | TaintedFlow
  2. | FlowToSink
  3. | FlowFromSource
val equal_flow_kind : flow_kind -> flow_kind -> bool
type retain_cycle_data = {
  1. expr : DecompilerExpr.t;
  2. location : IBase.Location.t option;
  3. trace : Trace.t option;
}
val equal_retain_cycle_data : retain_cycle_data -> retain_cycle_data -> bool
type resource =
  1. | CSharpClass of IR.CSharpClassName.t
  2. | JavaClass of IR.JavaClassName.t
  3. | HackAsync
  4. | HackBuilderResource of IR.HackClassName.t
  5. | Memory of Attribute.allocator
type t =
  1. | AccessToInvalidAddress of access_to_invalid_address
  2. | ConfigUsage of {
    1. pname : IR.Procname.t;
    2. config : ConfigName.t;
    3. branch_location : IBase.Location.t;
    4. location : IBase.Location.t;
    5. trace : Trace.t;
    }
  3. | ConstRefableParameter of {
    1. param : IR.Var.t;
    2. typ : IR.Typ.t;
    3. location : IBase.Location.t;
    }
  4. | DynamicTypeMismatch of {
    1. location : IBase.Location.t;
    }
  5. | ErlangError of ErlangError.t
  6. | HackCannotInstantiateAbstractClass of {
    1. type_name : IR.Typ.Name.t;
    2. trace : Trace.t;
    }
  7. | MutualRecursionCycle of {
    1. cycle : PulseMutualRecursion.t;
    2. location : IBase.Location.t;
    }
  8. | ReadonlySharedPtrParameter of {
    1. param : IR.Var.t;
    2. typ : IR.Typ.t;
    3. location : IBase.Location.t;
    4. used_locations : IBase.Location.t list;
    }
  9. | ReadUninitialized of ReadUninitialized.t
  10. | ResourceLeak of {
    1. resource : resource;
    2. allocation_trace : Trace.t;
    3. location : IBase.Location.t;
    }
  11. | RetainCycle of {
    1. values : retain_cycle_data list;
    2. location : IBase.Location.t;
    3. unknown_access_type : bool;
    }
  12. | StackVariableAddressEscape of {
    1. variable : IR.Var.t;
    2. history : ValueHistory.t;
    3. location : IBase.Location.t;
    }
  13. | TaintFlow of {
    1. expr : DecompilerExpr.t;
    2. source : TaintItem.t * ValueHistory.t;
    3. sink : TaintItem.t * Trace.t;
    4. location : IBase.Location.t;
    5. flow_kind : flow_kind;
    6. policy_description : string;
    7. policy_id : int;
    8. policy_privacy_effect : string option;
    9. report_as_issue_type : string option;
    10. report_as_category : string option;
    }
  14. | TransitiveAccess of {
    1. tag : string;
    2. description : string;
    3. call_trace : Trace.t;
    4. transitive_callees : TransitiveInfo.Callees.t;
    5. transitive_missed_captures : IR.Typ.Name.Set.t;
    }
  15. | UnnecessaryCopy of {
    1. copied_into : PulseAttribute.CopiedInto.t;
    2. source_typ : IR.Typ.t option;
    3. source_opt : DecompilerExpr.source_expr option;
    4. location : IBase.Location.t;
    5. copied_location : (IR.Procname.t * IBase.Location.t) option;
    6. location_instantiated : IBase.Location.t option;
    7. from : PulseAttribute.CopyOrigin.t;
    }

an error to report to the user

include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
val pp : F.formatter -> t -> unit
val aborts_execution : t -> bool

whether the presence of an error should abort the execution

val get_message_and_suggestion : t -> string * string option
val get_location : t -> IBase.Location.t
val get_location_instantiated : t -> IBase.Location.t option
val get_copy_type : t -> IR.Typ.t option
val get_issue_type : latent:bool -> t -> IBase.IssueType.t
val get_trace : t -> Absint.Errlog.loc_trace
diff --git a/website/static/odoc/next/infer/Pulselib/PulseFormula/index.html b/website/static/odoc/next/infer/Pulselib/PulseFormula/index.html index 0ea032ac443..bd1e4a6f522 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseFormula/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseFormula/index.html @@ -37,6 +37,7 @@ operand -> t -> (t * new_eqs) SatUnsat.t
val and_is_int : Var.t -> t -> (t * new_eqs) SatUnsat.t
val prune_binop : + ?depth:int -> negated:bool -> IR.Binop.t -> operand -> @@ -46,7 +47,7 @@ precondition_vocabulary:Var.Set.t -> keep:Var.Set.t -> t -> - (t * Var.Set.t * new_eqs) SatUnsat.t
val is_known_zero : t -> Var.t -> bool
val as_constant_q : t -> Var.t -> Q.t option
val as_constant_string : t -> Var.t -> string option
val is_known_non_pointer : t -> Var.t -> bool
val is_manifest : is_allocated:(Var.t -> bool) -> t -> bool

Some types or errors detected by Pulse require that the state be *manifest*, which corresponds to the fact that the error can happen in *any reasonable* calling context (see below). If not, the error is flagged as *latent* and not reported until it becomes manifest.

A state is *manifest* when its path condition (here meaning the conjunction of conditions encountered in if statements, loop conditions, etc., i.e. anything in a IR.Sil.instr.Prune node) is either a) empty or b) comprised only of facts of the form p>0 or p≠0 where p is known to be allocated. The latter condition captures the idea that addresses being valid pointers in memory should not deter us from reporting any error that we find on that program path as it is somewhat the happy/expected case (also, the fact p is allocated already implies p≠0). The unhappy/unexpected case here would be to report errors that require a pointer to be invalid or null in the precondition; we do not want to report such errors until we see that there exists a calling context in which the pointer is indeed invalid or null! But, to reiterate, we do want to report errors that only have valid pointers in their precondition. Similarly, ignore conditions of the form x≠y where x and y are already different according to the heap (because they are separate memory allocations).

Some equalities might be represented implicitly in the precondition, see the documentation of PulseArithmetic.is_manifest.

val get_var_repr : t -> Var.t -> Var.t

get the canonical representative for the variable according to the equality relation

val and_callee_formula : + (t * Var.Set.t * new_eqs) SatUnsat.t
val is_known_zero : t -> Var.t -> bool
val as_constant_q : t -> Var.t -> Q.t option
val as_constant_string : t -> Var.t -> string option
val is_known_non_pointer : t -> Var.t -> bool
val is_manifest : is_allocated:(Var.t -> bool) -> t -> bool

Some types or errors detected by Pulse require that the state be *manifest*, which corresponds to the fact that the error can happen in *any reasonable* calling context (see below). If not, the error is flagged as *latent* and not reported until it becomes manifest.

A state is *manifest* when its path condition (here meaning the conjunction of conditions encountered in if statements, loop conditions, etc., i.e. anything in a IR.Sil.instr.Prune node) is either a) empty or b) comprised only of facts of the form p>0 or p≠0 where p is known to be allocated. The latter condition captures the idea that addresses being valid pointers in memory should not deter us from reporting any error that we find on that program path as it is somewhat the happy/expected case (also, the fact p is allocated already implies p≠0). The unhappy/unexpected case here would be to report errors that require a pointer to be invalid or null in the precondition; we do not want to report such errors until we see that there exists a calling context in which the pointer is indeed invalid or null! But, to reiterate, we do want to report errors that only have valid pointers in their precondition. Similarly, ignore conditions of the form x≠y where x and y are already different according to the heap (because they are separate memory allocations).

In addition, only conditions in callees of the current procedure may cause a path to become latent, i.e. direct tests in the current function do not make an issue latent. The rationale for this is that, if the current function branches on a particular condition, it must have some reason to believe both paths are possible in its calling contexts, hence should not exhibit a bug under these conditions. This is different from conditions arising from tests in callees, which may be written more defensively than the current function. (NOTE: this doesn't apply to Erlang)

Some equalities might be represented implicitly in the precondition, see the documentation of PulseArithmetic.is_manifest.

val get_var_repr : t -> Var.t -> Var.t

get the canonical representative for the variable according to the equality relation

val and_callee_formula : (Var.t * ValueHistory.t) Var.Map.t -> t -> callee:t -> diff --git a/website/static/odoc/next/infer/Pulselib/PulseInterproc/index.html b/website/static/odoc/next/infer/Pulselib/PulseInterproc/index.html index 7c6eeaa53dc..8ce9deccb6a 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseInterproc/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseInterproc/index.html @@ -6,7 +6,7 @@ list;}
  • | FormalActualLength of {
    1. formals : (IR.Pvar.t * IR.Typ.t) list;
    2. actuals : ((Pulselib.PulseBasicInterface.AbstractValue.t * Pulselib.PulseBasicInterface.ValueHistory.t) * IR.Typ.t) - list;
    }
  • | HackSinitMustNotBeCalled of Pulselib.PulseBasicInterface.AbstractValue.t
  • | PathCondition
    • val is_dynamic_type_needed_contradiction : + list;}
  • | PathCondition
    • val merge_contradictions : diff --git a/website/static/odoc/next/infer/Pulselib/PulseInvalidation/index.html b/website/static/odoc/next/infer/Pulselib/PulseInvalidation/index.html index 98a2602515b..7eea4acb89f 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseInvalidation/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseInvalidation/index.html @@ -1,5 +1,5 @@ -PulseInvalidation (infer.Pulselib.PulseInvalidation)

    Module Pulselib.PulseInvalidation

    module F = Stdlib.Format
    type std_vector_function =
    1. | Assign
    2. | Clear
    3. | Emplace
    4. | EmplaceBack
    5. | Insert
    6. | PushBack
    7. | Reserve
    8. | ShrinkToFit
    val pp_std_vector_function : F.formatter -> std_vector_function -> unit
    type map_type =
    1. | FollyF14Value
    2. | FollyF14Vector
    3. | FollyF14Fast
    type map_function =
    1. | Clear
    2. | Rehash
    3. | Reserve
    4. | OperatorEqual
    5. | Insert
    6. | InsertOrAssign
    7. | Emplace
    8. | TryEmplace
    9. | TryEmplaceToken
    10. | EmplaceHint
    11. | OperatorBracket
    val pp_map_type : F.formatter -> map_type -> unit
    val pp_map_function : F.formatter -> map_function -> unit
    type t =
    1. | CFree
    2. | ConstantDereference of IR.IntLit.t
    3. | CppDelete
    4. | CppDeleteArray
    5. | EndIterator
    6. | GoneOutOfScope of IR.Pvar.t * IR.Typ.t
    7. | OptionalEmpty
    8. | StdVector of std_vector_function
    9. | CppMap of map_type * map_function
    include Ppx_compare_lib.Comparable.S with type t := t
    val compare : t Base__Ppx_compare_lib.compare
    include Ppx_compare_lib.Equal.S with type t := t
    val equal : t Base__Ppx_compare_lib.equal
    val pp : F.formatter -> t -> unit
    val describe : F.formatter -> t -> unit
    val suggest : t -> string option
    type must_be_valid_reason =
    1. | BlockCall
    2. | InsertionIntoCollectionKey
    3. | InsertionIntoCollectionValue
    4. | SelfOfNonPODReturnMethod of IR.Typ.t
    5. | NullArgumentWhereNonNullExpected of PulseCallEvent.t * int option
    val compare_must_be_valid_reason : +PulseInvalidation (infer.Pulselib.PulseInvalidation)

    Module Pulselib.PulseInvalidation

    module F = Stdlib.Format
    type std_vector_function =
    1. | Assign
    2. | Clear
    3. | Emplace
    4. | EmplaceBack
    5. | Insert
    6. | PushBack
    7. | Reserve
    8. | ShrinkToFit
    val pp_std_vector_function : F.formatter -> std_vector_function -> unit
    type map_type =
    1. | FollyF14Value
    2. | FollyF14Vector
    3. | FollyF14Fast
    type map_function =
    1. | Clear
    2. | Rehash
    3. | Reserve
    4. | OperatorEqual
    5. | Insert
    6. | InsertOrAssign
    7. | Emplace
    8. | TryEmplace
    9. | TryEmplaceToken
    10. | EmplaceHint
    11. | OperatorBracket
    val pp_map_type : F.formatter -> map_type -> unit
    val pp_map_function : F.formatter -> map_function -> unit
    type t =
    1. | CFree
    2. | ComparedToNullInThisProcedure of IBase.Location.t
    3. | ConstantDereference of IR.IntLit.t
    4. | CppDelete
    5. | CppDeleteArray
    6. | EndIterator
    7. | GoneOutOfScope of IR.Pvar.t * IR.Typ.t
    8. | OptionalEmpty
    9. | StdVector of std_vector_function
    10. | CppMap of map_type * map_function
    include Ppx_compare_lib.Comparable.S with type t := t
    val compare : t Base__Ppx_compare_lib.compare
    include Ppx_compare_lib.Equal.S with type t := t
    val equal : t Base__Ppx_compare_lib.equal
    val pp : F.formatter -> t -> unit
    val describe : F.formatter -> t -> unit
    val suggest : t -> string option
    val is_same_type : t -> t -> bool

    whether both invalidations have are of the same variant case

    type must_be_valid_reason =
    1. | BlockCall
    2. | InsertionIntoCollectionKey
    3. | InsertionIntoCollectionValue
    4. | SelfOfNonPODReturnMethod of IR.Typ.t
    5. | NullArgumentWhereNonNullExpected of PulseCallEvent.t * int option
    val compare_must_be_valid_reason : must_be_valid_reason -> must_be_valid_reason -> int
    val equal_must_be_valid_reason : diff --git a/website/static/odoc/next/infer/Pulselib/PulseModels/index.html b/website/static/odoc/next/infer/Pulselib/PulseModels/index.html index f9f809f8a8d..b727539a81b 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseModels/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseModels/index.html @@ -2,5 +2,7 @@ PulseModels (infer.Pulselib.PulseModels)

    Module Pulselib.PulseModels

    diff --git a/website/static/odoc/next/infer/Pulselib/PulseModelsDSL/Syntax/Basic/index.html b/website/static/odoc/next/infer/Pulselib/PulseModelsDSL/Syntax/Basic/index.html index 40d9dd2742c..b797a835f3b 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseModelsDSL/Syntax/Basic/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseModelsDSL/Syntax/Basic/index.html @@ -1,6 +1,5 @@ Basic (infer.Pulselib.PulseModelsDSL.Syntax.Basic)

    Module Syntax.Basic

    val alloc_not_null : - ?desc:string -> Pulselib.PulseBasicInterface.Attribute.allocator -> IR.Exp.t option -> initialize:bool -> diff --git a/website/static/odoc/next/infer/Pulselib/PulseModelsDSL/Syntax/index.html b/website/static/odoc/next/infer/Pulselib/PulseModelsDSL/Syntax/index.html index 827153a04bd..92bd1e067cb 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseModelsDSL/Syntax/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseModelsDSL/Syntax/index.html @@ -23,17 +23,15 @@ 'a model_monad

    Disjunctive reasoning

    val disjuncts : 'a model_monad list -> 'a model_monad
    val start_model : unit model_monad -> PulseModelsImport.model

    get a model from a disjunctive model_monad

    val lift_to_monad : PulseModelsImport.model -> unit model_monad

    beware that the model may modify the PulseModelsImport.model_data.ret field

    val lift_to_monad_and_get_result : PulseModelsImport.model -> aval model_monad

    apply the model and return its result. fails if the model did not assign the reserved model_data.ret variable.

    Operations

    PulseOperations functions you need should be copied here

    val allocation : + unit model_monad
    val apply_hack_closure : aval -> aval list -> aval model_monad

    Disjunctive reasoning

    val disjuncts : 'a model_monad list -> 'a model_monad
    val start_model : unit model_monad -> PulseModelsImport.model

    get a model from a disjunctive model_monad

    val start_named_model : string -> unit model_monad -> PulseModelsImport.model
    val lift_to_monad : PulseModelsImport.model -> unit model_monad

    beware that the model may modify the PulseModelsImport.model_data.ret field

    val lift_to_monad_and_get_result : PulseModelsImport.model -> aval model_monad

    apply the model and return its result. fails if the model did not assign the reserved model_data.ret variable.

    Operations

    PulseOperations functions you need should be copied here

    val add_dict_contain_const_keys : aval -> unit model_monad
    val add_dict_read_const_key : aval -> IR.Fieldname.t -> unit model_monad
    val remove_dict_contain_const_keys : aval -> unit model_monad
    val is_hack_sinit_called : aval -> bool model_monad
    val set_hack_sinit_called : aval -> unit model_monad
    val set_hack_sinit_must_not_be_called : aval -> unit model_monad
    val add_static_type : IR.Typ.name -> aval -> unit model_monad
    val deep_copy : ?depth_max:int -> aval -> aval model_monad
    val eval_binop : IR.Binop.t -> aval -> aval -> aval model_monad
    val eval_binop_int : IR.Binop.t -> aval -> IR.IntLit.t -> aval model_monad
    val eval_read : IR.Exp.t -> aval model_monad
    val eval_const_int : int -> aval model_monad
    val eval_const_string : string -> aval model_monad
    val eval_string_concat : aval -> aval -> aval model_monad
    val eval_access : - ?desc:string -> + unit model_monad
    val add_dict_contain_const_keys : aval -> unit model_monad
    val add_dict_read_const_key : aval -> IR.Fieldname.t -> unit model_monad
    val remove_dict_contain_const_keys : aval -> unit model_monad
    val is_hack_sinit_called : aval -> bool model_monad
    val set_hack_sinit_called : aval -> unit model_monad
    val add_static_type : IR.Typ.name -> aval -> unit model_monad
    val deep_copy : ?depth_max:int -> aval -> aval model_monad
    val eval_binop : IR.Binop.t -> aval -> aval -> aval model_monad
    val eval_binop_int : IR.Binop.t -> aval -> IR.IntLit.t -> aval model_monad
    val eval_read : IR.Exp.t -> aval model_monad
    val eval_const_int : int -> aval model_monad
    val eval_const_string : string -> aval model_monad
    val eval_string_concat : aval -> aval -> aval model_monad
    val get_dynamic_type : ask_specialization:bool -> aval -> - Pulselib.PulseBasicInterface.Formula.dynamic_type_data option model_monad
    val new_ : IR.Exp.t -> aval model_monad
    val constructor : IR.Typ.Name.t -> (string * aval) list -> aval model_monad

    constructor_dsl typ_name fields builds a fresh object of type typ_name and initializes its fields using list fields

    val remove_hack_builder_attributes : aval -> unit model_monad
    val get_const_string : aval -> string option model_monad
    val mk_fresh : model_desc:string -> ?more:string -> unit -> aval model_monad
    val write_field : ref:aval -> obj:aval -> IR.Fieldname.t -> unit model_monad
    val new_ : IR.Exp.t -> aval model_monad
    val constructor : IR.Typ.Name.t -> (string * aval) list -> aval model_monad

    constructor_dsl typ_name fields builds a fresh object of type typ_name and initializes its fields using list fields

    val remove_hack_builder_attributes : aval -> unit model_monad
    val get_const_string : aval -> string option model_monad
    val mk_fresh : ?more:string -> unit -> aval model_monad
    val write_field : ref:aval -> obj:aval -> IR.Fieldname.t -> unit model_monad
    val write_deref_field : ref:aval -> obj:aval -> IR.Fieldname.t -> unit model_monad
    val get_known_fields : aval -> - Pulselib.PulseBasicInterface.Access.t list model_monad

    Return the fields we know about. There may be more, so use with caution

    PulseFormula operations

    val prune_eq : aval -> aval -> unit model_monad
    val prune_eq_int : aval -> IR.IntLit.t -> unit model_monad
    val prune_eq_string : aval -> string -> unit model_monad
    val prune_ne_string : aval -> string -> unit model_monad
    val prune_eq_zero : aval -> unit model_monad
    val prune_positive : aval -> unit model_monad
    val prune_lt : aval -> aval -> unit model_monad
    val prune_lt_int : aval -> IR.IntLit.t -> unit model_monad
    val prune_le : aval -> aval -> unit model_monad
    val prune_gt : aval -> aval -> unit model_monad
    val prune_ge : aval -> aval -> unit model_monad
    val prune_ge_int : aval -> IR.IntLit.t -> unit model_monad
    val prune_ne : aval -> aval -> unit model_monad
    val prune_ne_int : aval -> IR.IntLit.t -> unit model_monad
    val prune_ne_zero : aval -> unit model_monad
    val and_eq_int : aval -> IR.IntLit.t -> unit model_monad
    val and_eq : aval -> aval -> unit model_monad
    val and_equal_instanceof : + Pulselib.PulseBasicInterface.Access.t list model_monad

    Return the fields we know about. There may be more, so use with caution

    PulseFormula operations

    val prune_eq : aval -> aval -> unit model_monad
    val prune_eq_int : aval -> IR.IntLit.t -> unit model_monad
    val prune_eq_string : aval -> string -> unit model_monad
    val prune_ne_string : aval -> string -> unit model_monad
    val prune_eq_zero : aval -> unit model_monad
    val prune_positive : aval -> unit model_monad
    val prune_lt : aval -> aval -> unit model_monad
    val prune_lt_int : aval -> IR.IntLit.t -> unit model_monad
    val prune_le : aval -> aval -> unit model_monad
    val prune_gt : aval -> aval -> unit model_monad
    val prune_gt_int : aval -> IR.IntLit.t -> unit model_monad
    val prune_ge : aval -> aval -> unit model_monad
    val prune_ge_int : aval -> IR.IntLit.t -> unit model_monad
    val prune_ne : aval -> aval -> unit model_monad
    val prune_ne_int : aval -> IR.IntLit.t -> unit model_monad
    val prune_ne_zero : aval -> unit model_monad
    val and_eq_int : aval -> IR.IntLit.t -> unit model_monad
    val and_eq : aval -> aval -> unit model_monad
    val and_equal_instanceof : aval -> aval -> IR.Typ.t -> nullable:bool -> - unit model_monad
    val and_positive : aval -> unit model_monad
    val as_constant_q : aval -> Q.t option model_monad
    val as_constant_int : aval -> int option model_monad
    val as_constant_bool : aval -> bool option model_monad
    val as_constant_string : aval -> string option model_monad
    val and_positive : aval -> unit model_monad
    val as_constant_q : aval -> Q.t option model_monad
    val as_constant_int : aval -> int option model_monad
    val as_constant_bool : aval -> bool option model_monad
    val as_constant_string : aval -> string option model_monad

    Tenv operations

    val tenv_resolve_field_info : IR.Typ.name -> diff --git a/website/static/odoc/next/infer/Pulselib/PulseModelsDSL/index.html b/website/static/odoc/next/infer/Pulselib/PulseModelsDSL/index.html index c4f99efb6d2..e0af13b9b39 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseModelsDSL/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseModelsDSL/index.html @@ -3,6 +3,6 @@ Pulselib.PulseBasicInterface.AbstractValue.t * Pulselib.PulseBasicInterface.ValueHistory.t
    module Syntax : sig ... end

    warning: the transformation will fail if the result of the computation is not a single abstract state with no error and it ignores the non-disjunctive state. You should think twice before using it...

    diff --git a/website/static/odoc/next/infer/Pulselib/PulseModelsImport/index.html b/website/static/odoc/next/infer/Pulselib/PulseModelsImport/index.html index e4faf252aab..90735dc255b 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseModelsImport/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseModelsImport/index.html @@ -1,10 +1,11 @@ -PulseModelsImport (infer.Pulselib.PulseModelsImport)

    Module Pulselib.PulseModelsImport

    type model_data = {
    1. analysis_data : PulseSummary.t Absint.InterproceduralAnalysis.t;
    2. dispatch_call_eval_args : PulseSummary.t Absint.InterproceduralAnalysis.t -> +PulseModelsImport (infer.Pulselib.PulseModelsImport)

      Module Pulselib.PulseModelsImport

      val lift_model : model_no_non_disj -> model
      module Hist : sig ... end
      module Basic : sig ... end
      diff --git a/website/static/odoc/next/infer/Pulselib/PulseMutualRecursion/Set/index.html b/website/static/odoc/next/infer/Pulselib/PulseMutualRecursion/Set/index.html index 9a686d59a9c..395df4c2131 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseMutualRecursion/Set/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseMutualRecursion/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Pulselib.PulseMutualRecursion.Set)

      Module PulseMutualRecursion.Set

      include IStdlib.IStd.Caml.Set.S with type elt = t
      type elt = t
      type t
      val empty : t
      val is_empty : t -> bool
      val mem : elt -> t -> bool
      val add : elt -> t -> t
      val singleton : elt -> t
      val remove : elt -> t -> t
      val union : t -> t -> t
      val inter : t -> t -> t
      val disjoint : t -> t -> bool
      val diff : t -> t -> t
      val compare : t -> t -> int
      val equal : t -> t -> bool
      val subset : t -> t -> bool
      val iter : (elt -> unit) -> t -> unit
      val map : (elt -> elt) -> t -> t
      val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
      val for_all : (elt -> bool) -> t -> bool
      val exists : (elt -> bool) -> t -> bool
      val filter : (elt -> bool) -> t -> t
      val filter_map : (elt -> elt option) -> t -> t
      val partition : (elt -> bool) -> t -> t * t
      val cardinal : t -> int
      val elements : t -> elt list
      val min_elt : t -> elt
      val min_elt_opt : t -> elt option
      val max_elt : t -> elt
      val max_elt_opt : t -> elt option
      val choose : t -> elt
      val choose_opt : t -> elt option
      val split : elt -> t -> t * bool * t
      val find : elt -> t -> elt
      val find_opt : elt -> t -> elt option
      val find_first : (elt -> bool) -> t -> elt
      val find_first_opt : (elt -> bool) -> t -> elt option
      val find_last : (elt -> bool) -> t -> elt
      val find_last_opt : (elt -> bool) -> t -> elt option
      val of_list : elt list -> t
      val to_seq_from : elt -> t -> elt Stdlib.Seq.t
      val to_seq : t -> elt Stdlib.Seq.t
      val to_rev_seq : t -> elt Stdlib.Seq.t
      val add_seq : elt Stdlib.Seq.t -> t -> t
      val of_seq : elt Stdlib.Seq.t -> t
      val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
      include IStdlib.PrettyPrintable.PrintableType with type t := t
      val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
      val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
      +Set (infer.Pulselib.PulseMutualRecursion.Set)

      Module PulseMutualRecursion.Set

      include IStdlib.IStd.Caml.Set.S with type elt = t
      type elt = t
      type t
      val empty : t
      val is_empty : t -> bool
      val mem : elt -> t -> bool
      val add : elt -> t -> t
      val singleton : elt -> t
      val remove : elt -> t -> t
      val union : t -> t -> t
      val inter : t -> t -> t
      val disjoint : t -> t -> bool
      val diff : t -> t -> t
      val compare : t -> t -> int
      val equal : t -> t -> bool
      val subset : t -> t -> bool
      val iter : (elt -> unit) -> t -> unit
      val map : (elt -> elt) -> t -> t
      val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
      val for_all : (elt -> bool) -> t -> bool
      val exists : (elt -> bool) -> t -> bool
      val filter : (elt -> bool) -> t -> t
      val filter_map : (elt -> elt option) -> t -> t
      val partition : (elt -> bool) -> t -> t * t
      val cardinal : t -> int
      val elements : t -> elt list
      val min_elt : t -> elt
      val min_elt_opt : t -> elt option
      val max_elt : t -> elt
      val max_elt_opt : t -> elt option
      val choose : t -> elt
      val choose_opt : t -> elt option
      val split : elt -> t -> t * bool * t
      val find : elt -> t -> elt
      val find_opt : elt -> t -> elt option
      val find_first : (elt -> bool) -> t -> elt
      val find_first_opt : (elt -> bool) -> t -> elt option
      val find_last : (elt -> bool) -> t -> elt
      val find_last_opt : (elt -> bool) -> t -> elt option
      val of_list : elt list -> t
      val to_seq_from : elt -> t -> elt Stdlib.Seq.t
      val to_seq : t -> elt Stdlib.Seq.t
      val to_rev_seq : t -> elt Stdlib.Seq.t
      val add_seq : elt Stdlib.Seq.t -> t -> t
      val of_seq : elt Stdlib.Seq.t -> t
      val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
      include IStdlib.PrettyPrintable.PrintableType with type t := t
      val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
      val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
      val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
      diff --git a/website/static/odoc/next/infer/Pulselib/PulseOperations/index.html b/website/static/odoc/next/infer/Pulselib/PulseOperations/index.html index 5d3b5557b86..ad2bd6ceaeb 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseOperations/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseOperations/index.html @@ -146,6 +146,10 @@ (Pulselib.PulseBasicInterface.AbstractValue.t * Pulselib.PulseBasicInterface.ValueHistory.t) -> t -> + t

    does not record the value origin, unlike write_load_id, so only use for return values

    val write_load_id : + IR.Ident.t -> + Pulselib.PulseBasicInterface.ValueOrigin.t -> + t -> t
    type call_kind = [
    1. | `Closure of - (IR.Exp.t * IR.Pvar.t * IR.Typ.t * IR.CapturedVar.capture_mode) list
    2. | `Var of IR.Ident.t
    3. | `ResolvedProcname
    ]
    val get_captured_actuals : + t Pulselib.PulseDomainInterface.AccessResult.t
    type call_kind = [
    1. | `Closure of (IR.Exp.t * IR.CapturedVar.t) list
    2. | `Var of IR.Ident.t
    3. | `ResolvedProcname
    ]
    val get_captured_actuals : IR.Procname.t -> Pulselib.PulseDomainInterface.PathContext.t -> IBase.Location.t -> - captured_formals:(IR.Pvar.t * IR.CapturedVar.capture_mode * IR.Typ.t) list -> + captured_formals:IR.CapturedVar.t list -> call_kind:call_kind -> actuals: ((Pulselib.PulseBasicInterface.AbstractValue.t diff --git a/website/static/odoc/next/infer/Pulselib/PulseTaintConfig/Kind/Set/index.html b/website/static/odoc/next/infer/Pulselib/PulseTaintConfig/Kind/Set/index.html index 564392191dd..747cc40a114 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseTaintConfig/Kind/Set/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseTaintConfig/Kind/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Pulselib.PulseTaintConfig.Kind.Set)

    Module Kind.Set

    include IStdlib.IStd.Caml.Set.S with type elt = t
    type elt = t
    type t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    include IStdlib.PrettyPrintable.PrintableType with type t := t
    val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
    +Set (infer.Pulselib.PulseTaintConfig.Kind.Set)

    Module Kind.Set

    include IStdlib.IStd.Caml.Set.S with type elt = t
    type elt = t
    type t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    include IStdlib.PrettyPrintable.PrintableType with type t := t
    val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/Pulselib/PulseTaintConfig/SinkPolicy/index.html b/website/static/odoc/next/infer/Pulselib/PulseTaintConfig/SinkPolicy/index.html index dc5f392f86a..b77d8569593 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseTaintConfig/SinkPolicy/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseTaintConfig/SinkPolicy/index.html @@ -1,2 +1,2 @@ -SinkPolicy (infer.Pulselib.PulseTaintConfig.SinkPolicy)

    Module PulseTaintConfig.SinkPolicy

    type t = {
    1. source_kinds : Kind.t list;
    2. sanitizer_kinds : Kind.t list;
    3. description : string;
    4. policy_id : int;
    5. privacy_effect : string option;
    6. exclude_in : string list option;
    7. exclude_matching : IStdlib.IStd.Str.regexp list option;
    }
    include Ppx_compare_lib.Equal.S with type t := t
    val equal : t Base__Ppx_compare_lib.equal
    val sink_policies : (Kind.t, t list) Base.Hashtbl.t
    +SinkPolicy (infer.Pulselib.PulseTaintConfig.SinkPolicy)

    Module PulseTaintConfig.SinkPolicy

    type t = {
    1. source_kinds : Kind.t list;
    2. sanitizer_kinds : Kind.t list;
    3. description : string;
    4. policy_id : int;
    5. privacy_effect : string option;
    6. exclude_in : string list option;
    7. exclude_matching : IStdlib.IStd.Str.regexp list option;
    8. report_as_issue_type : string option;
    9. report_as_category : string option;
    }
    include Ppx_compare_lib.Equal.S with type t := t
    val equal : t Base__Ppx_compare_lib.equal
    val sink_policies : (Kind.t, t list) Base.Hashtbl.t
    diff --git a/website/static/odoc/next/infer/Pulselib/PulseTrace/Set/index.html b/website/static/odoc/next/infer/Pulselib/PulseTrace/Set/index.html index 6cdc7da0fd1..3e90eccddf3 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseTrace/Set/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseTrace/Set/index.html @@ -1,2 +1,2 @@ -Set (infer.Pulselib.PulseTrace.Set)

    Module PulseTrace.Set

    include IStdlib.PrettyPrintable.PPSet with type elt = t
    include IStdlib.IStd.Caml.Set.S with type elt = t
    type elt = t
    type t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    include IStdlib.PrettyPrintable.PrintableType with type t := t
    val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
    val map_callee : CallEvent.t -> IBase.Location.t -> t -> t
    +Set (infer.Pulselib.PulseTrace.Set)

    Module PulseTrace.Set

    include IStdlib.PrettyPrintable.PPSet with type elt = t
    include IStdlib.IStd.Caml.Set.S with type elt = t
    type elt = t
    type t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    include IStdlib.PrettyPrintable.PrintableType with type t := t
    val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
    val map_callee : CallEvent.t -> IBase.Location.t -> t -> t
    diff --git a/website/static/odoc/next/infer/Pulselib/PulseTrace/index.html b/website/static/odoc/next/infer/Pulselib/PulseTrace/index.html index ed7895adffc..f9b8f7e911f 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseTrace/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseTrace/index.html @@ -17,4 +17,4 @@ pp_immediate:(F.formatter -> unit) -> t list -> Absint.Errlog.loc_trace_elem list -> - Absint.Errlog.loc_trace_elem list

    synchronous_add_to_errlog adds a list of the traces to the errlog in the given order while grouping traces that take place at the same location to reduce deduplication and ensure events happening together are identifiable as such. E.g. if two traces start with a ViaCall and they happen at the same location, then that call will only appear once and the rest of those traces will then be added synchronously as well

    val find_map_last_main : t -> f:(ValueHistory.event -> 'a option) -> 'a option

    find_map applied to history events in reverse order; does not look into contextual events

    val exists_main : t -> f:(ValueHistory.event -> bool) -> bool

    whether the trace contains an event satisfying f; does not look into contextual events

    val get_trace_until : t -> f:(ValueHistory.event -> bool) -> t option

    build a sub-trace leading to the first element of the trace satisfying f

    + Absint.Errlog.loc_trace_elem list

    synchronous_add_to_errlog adds a list of the traces to the errlog in the given order while grouping traces that take place at the same location to reduce deduplication and ensure events happening together are identifiable as such. E.g. if two traces start with a ViaCall and they happen at the same location, then that call will only appear once and the rest of those traces will then be added synchronously as well

    val find_map_last_main : t -> f:(ValueHistory.event -> 'a option) -> 'a option

    find_map applied to history events in reverse order; does not look into contextual events

    val exists_main : t -> f:(ValueHistory.event -> bool) -> bool

    whether the trace contains an event satisfying f; does not look into contextual events

    val exists_call : t -> f:(CallEvent.t -> bool) -> bool
    val get_trace_until : t -> f:(ValueHistory.event -> bool) -> t option

    build a sub-trace leading to the first element of the trace satisfying f

    diff --git a/website/static/odoc/next/infer/Pulselib/PulseTransitiveInfo/MissedCaptures/index.html b/website/static/odoc/next/infer/Pulselib/PulseTransitiveInfo/MissedCaptures/index.html index 90c4bcafd4c..ded2a6bdb99 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseTransitiveInfo/MissedCaptures/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseTransitiveInfo/MissedCaptures/index.html @@ -1,2 +1,2 @@ -MissedCaptures (infer.Pulselib.PulseTransitiveInfo.MissedCaptures)

    Module PulseTransitiveInfo.MissedCaptures

    include IStdlib.PrettyPrintable.PPSet with type t = IR.Typ.Name.Set.t
    include IStdlib.IStd.Caml.Set.S with type t = IR.Typ.Name.Set.t
    type elt
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    include IStdlib.PrettyPrintable.PrintableType with type t := t
    val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
    include Absint.AbstractDomain.WithBottom with type t := t
    include Absint.AbstractDomain.S with type t := t
    include Absint.AbstractDomain.Comparable with type t := t
    include IStdlib.PrettyPrintable.PrintableType with type t := t
    val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val leq : lhs:t -> rhs:t -> bool

    the implication relation: lhs <= rhs means lhs |- rhs

    val join : t -> t -> t
    val widen : prev:t -> next:t -> num_iters:int -> t
    val bottom : t

    The bottom value of the domain.

    val is_bottom : t -> bool

    Return true if this is the bottom value

    +MissedCaptures (infer.Pulselib.PulseTransitiveInfo.MissedCaptures)

    Module PulseTransitiveInfo.MissedCaptures

    include IStdlib.PrettyPrintable.PPSet with type t = IR.Typ.Name.Set.t
    include IStdlib.IStd.Caml.Set.S with type t = IR.Typ.Name.Set.t
    type elt
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    include IStdlib.PrettyPrintable.PrintableType with type t := t
    val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
    include Absint.AbstractDomain.WithBottom with type t := t
    include Absint.AbstractDomain.S with type t := t
    include Absint.AbstractDomain.Comparable with type t := t
    include IStdlib.PrettyPrintable.PrintableType with type t := t
    val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val leq : lhs:t -> rhs:t -> bool

    the implication relation: lhs <= rhs means lhs |- rhs

    val join : t -> t -> t
    val widen : prev:t -> next:t -> num_iters:int -> t
    val bottom : t

    The bottom value of the domain.

    val is_bottom : t -> bool

    Return true if this is the bottom value

    diff --git a/website/static/odoc/next/infer/Pulselib/PulseValueOrigin/index.html b/website/static/odoc/next/infer/Pulselib/PulseValueOrigin/index.html index 88f8e51265f..9901b45f537 100644 --- a/website/static/odoc/next/infer/Pulselib/PulseValueOrigin/index.html +++ b/website/static/odoc/next/infer/Pulselib/PulseValueOrigin/index.html @@ -1,5 +1,5 @@ -PulseValueOrigin (infer.Pulselib.PulseValueOrigin)

    Module Pulselib.PulseValueOrigin

    module AbstractValue = PulseAbstractValue
    module ValueHistory = PulseValueHistory
    module Access = PulseAccess
    type t =
    1. | InMemory of {
      1. src : AbstractValue.t * ValueHistory.t;
      2. access : Access.t;
      3. dest : AbstractValue.t * ValueHistory.t;
      }
    2. | OnStack of {
      1. var : IR.Var.t;
      2. addr_hist : AbstractValue.t * ValueHistory.t;
      }
    3. | Unknown of AbstractValue.t * ValueHistory.t
      (*

      Values without a known origin such as those containing constant values.

      *)

    Describes a (value, history) pair with path/origin when available.

    Useful when one needs to overwrite a history of a particular value in the abstract state.

    val unknown : (AbstractValue.t * ValueHistory.t) -> t
    val addr_hist : t -> AbstractValue.t * ValueHistory.t
    val addr_hist_args : +PulseValueOrigin (infer.Pulselib.PulseValueOrigin)

    Module Pulselib.PulseValueOrigin

    module F = Stdlib.Format
    module AbstractValue = PulseAbstractValue
    module Access = PulseAccess
    module ValueHistory = PulseValueHistory
    type 'value t_ =
    1. | InMemory of {
      1. src : 'value * ValueHistory.t;
      2. access : 'value Access.access;
      3. dest : 'value * ValueHistory.t;
      }
    2. | OnStack of {
      1. var : IR.Var.t;
      2. addr_hist : 'value * ValueHistory.t;
      }
    3. | Unknown of 'value * ValueHistory.t
      (*

      Values without a known origin such as those containing constant values.

      *)

    Describes a (value, history) pair with path/origin when available.

    Useful when one needs to overwrite a history of a particular value in the abstract state.

    include Ppx_compare_lib.Comparable.S with type t := t
    val compare : t Base__Ppx_compare_lib.compare
    include Ppx_compare_lib.Equal.S with type t := t
    val equal : t Base__Ppx_compare_lib.equal
    val yojson_of_t : t -> Ppx_yojson_conv_lib.Yojson.Safe.t
    val pp : F.formatter -> t -> unit
    val unknown : ('value * ValueHistory.t) -> 'value t_
    val with_value : AbstractValue.t -> t -> t
    val with_hist : ValueHistory.t -> t -> t
    val map_value : 'value t_ -> f:('value -> 'value') -> 'value' t_
    val addr_hist : 'value t_ -> 'value * ValueHistory.t
    val value : t -> AbstractValue.t
    + list
    val value : 'value t_ -> 'value
    val hist : _ t_ -> ValueHistory.t
    diff --git a/website/static/odoc/next/infer/TestDeterminators.html b/website/static/odoc/next/infer/TestDeterminators.html deleted file mode 100644 index 0e9fca16629..00000000000 --- a/website/static/odoc/next/infer/TestDeterminators.html +++ /dev/null @@ -1,2 +0,0 @@ - -TestDeterminators (infer.TestDeterminators)

    Test Determinators

    Call graph analyses that can be used to determine which tests to run in a given project as a result of a code change.

    All modules: TestDeterminators

    diff --git a/website/static/odoc/next/infer/TestDeterminators/JProcname/JNI/VISIBLE_FOR_TESTING_DO_NOT_USE_DIRECTLY/index.html b/website/static/odoc/next/infer/TestDeterminators/JProcname/JNI/VISIBLE_FOR_TESTING_DO_NOT_USE_DIRECTLY/index.html deleted file mode 100644 index 99cb6d632a8..00000000000 --- a/website/static/odoc/next/infer/TestDeterminators/JProcname/JNI/VISIBLE_FOR_TESTING_DO_NOT_USE_DIRECTLY/index.html +++ /dev/null @@ -1,2 +0,0 @@ - -VISIBLE_FOR_TESTING_DO_NOT_USE_DIRECTLY (infer.TestDeterminators.JProcname.JNI.VISIBLE_FOR_TESTING_DO_NOT_USE_DIRECTLY)

    Module JNI.VISIBLE_FOR_TESTING_DO_NOT_USE_DIRECTLY

    type t =
    1. | Boolean
    2. | Byte
    3. | Char
    4. | Short
    5. | Int
    6. | Long
    7. | Float
    8. | Double
    9. | Void
    10. | FullyQualifiedClass of string * string
    11. | Array of t
    12. | Method of t list * t
    include Ppx_compare_lib.Comparable.S with type t := t
    val compare : t Base__Ppx_compare_lib.compare
    val equal : t -> t -> bool
    val parse_str : string -> t list
    val parse_method_str : string -> t list * t
    val pp : Stdlib.Format.formatter -> t -> unit
    diff --git a/website/static/odoc/next/infer/TestDeterminators/JProcname/JNI/index.html b/website/static/odoc/next/infer/TestDeterminators/JProcname/JNI/index.html deleted file mode 100644 index 5eb2dd56cf3..00000000000 --- a/website/static/odoc/next/infer/TestDeterminators/JProcname/JNI/index.html +++ /dev/null @@ -1,2 +0,0 @@ - -JNI (infer.TestDeterminators.JProcname.JNI)

    Module JProcname.JNI

    val void_method_with_no_arguments : string
    diff --git a/website/static/odoc/next/infer/TestDeterminators/JProcname/index.html b/website/static/odoc/next/infer/TestDeterminators/JProcname/index.html deleted file mode 100644 index 3e19b435a39..00000000000 --- a/website/static/odoc/next/infer/TestDeterminators/JProcname/index.html +++ /dev/null @@ -1,7 +0,0 @@ - -JProcname (infer.TestDeterminators.JProcname)

    Module TestDeterminators.JProcname

    module JNI : sig ... end
    val create_procname : - classname:string -> - methodname:string -> - signature:string -> - use_signature:bool -> - IR.Procname.t
    diff --git a/website/static/odoc/next/infer/TestDeterminators/JavaProfilerSamples/index.html b/website/static/odoc/next/infer/TestDeterminators/JavaProfilerSamples/index.html deleted file mode 100644 index 3091f792e9f..00000000000 --- a/website/static/odoc/next/infer/TestDeterminators/JavaProfilerSamples/index.html +++ /dev/null @@ -1,14 +0,0 @@ - -JavaProfilerSamples (infer.TestDeterminators.JavaProfilerSamples)

    Module TestDeterminators.JavaProfilerSamples

    type labeled_profiler_sample = string * IR.Procname.Set.t
    val compare_labeled_profiler_sample : - labeled_profiler_sample -> - labeled_profiler_sample -> - int
    val equal_labeled_profiler_sample : - labeled_profiler_sample -> - labeled_profiler_sample -> - bool
    val from_json_string : - string -> - use_signature:bool -> - labeled_profiler_sample list
    val from_json_file : - string -> - use_signature:bool -> - labeled_profiler_sample list
    diff --git a/website/static/odoc/next/infer/TestDeterminators/TestDeterminator/index.html b/website/static/odoc/next/infer/TestDeterminators/TestDeterminator/index.html deleted file mode 100644 index 20d63088601..00000000000 --- a/website/static/odoc/next/infer/TestDeterminators/TestDeterminator/index.html +++ /dev/null @@ -1,13 +0,0 @@ - -TestDeterminator (infer.TestDeterminators.TestDeterminator)

    Module TestDeterminators.TestDeterminator

    val compute_and_emit_test_to_run : - ?clang_range_map: - ((IBase.Location.t * IBase.Location.t) * IBase.ClangProc.t option) - IR.Procname.Map.t -> - ?source_file:IBase.SourceFile.t -> - unit -> - unit
    val compute_and_emit_relevant_methods : - clang_range_map: - ((IBase.Location.t * IBase.Location.t) * IBase.ClangProc.t option) - IR.Procname.Map.t -> - source_file:IBase.SourceFile.t -> - unit
    val merge_changed_functions_results : unit -> unit
    val merge_test_determinator_results : unit -> unit
    diff --git a/website/static/odoc/next/infer/TestDeterminators/index.html b/website/static/odoc/next/infer/TestDeterminators/index.html deleted file mode 100644 index e89af439ff3..00000000000 --- a/website/static/odoc/next/infer/TestDeterminators/index.html +++ /dev/null @@ -1,2 +0,0 @@ - -TestDeterminators (infer.TestDeterminators)

    Module TestDeterminators

    module JProcname : sig ... end
    module JavaProfilerSamples : sig ... end
    module TestDeterminator : sig ... end
    diff --git a/website/static/odoc/next/infer/UnitTests/AbstractInterpreterTests/ExceptionalTestInterpreter/AI_RPO/T/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/AbstractInterpreterTests/ExceptionalTestInterpreter/AI_RPO/T/CFG/Node/IdSet/index.html index f1d9e2ae0bd..8b03f4da98c 100644 --- a/website/static/odoc/next/infer/UnitTests/AbstractInterpreterTests/ExceptionalTestInterpreter/AI_RPO/T/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/AbstractInterpreterTests/ExceptionalTestInterpreter/AI_RPO/T/CFG/Node/IdSet/index.html @@ -1,3 +1,3 @@ IdSet (infer.UnitTests.AbstractInterpreterTests.ExceptionalTestInterpreter.AI_RPO.T.CFG.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    + Absint.AbstractInterpreter.MakeRPO(PathCountTransferFunctions(Absint.ProcCfg.Exceptional)).TransferFunctions.CFG.Node.IdSet.t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/AbstractInterpreterTests/ExceptionalTestInterpreter/AI_WTO/T/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/AbstractInterpreterTests/ExceptionalTestInterpreter/AI_WTO/T/CFG/Node/IdSet/index.html index 9065dea7835..67148d5d6e7 100644 --- a/website/static/odoc/next/infer/UnitTests/AbstractInterpreterTests/ExceptionalTestInterpreter/AI_WTO/T/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/AbstractInterpreterTests/ExceptionalTestInterpreter/AI_WTO/T/CFG/Node/IdSet/index.html @@ -1,3 +1,3 @@ IdSet (infer.UnitTests.AbstractInterpreterTests.ExceptionalTestInterpreter.AI_WTO.T.CFG.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    + Absint.AbstractInterpreter.MakeWTO(PathCountTransferFunctions(Absint.ProcCfg.Exceptional)).TransferFunctions.CFG.Node.IdSet.t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/AbstractInterpreterTests/NormalTestInterpreter/AI_RPO/T/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/AbstractInterpreterTests/NormalTestInterpreter/AI_RPO/T/CFG/Node/IdSet/index.html index a74872b8a5a..4a6177efa72 100644 --- a/website/static/odoc/next/infer/UnitTests/AbstractInterpreterTests/NormalTestInterpreter/AI_RPO/T/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/AbstractInterpreterTests/NormalTestInterpreter/AI_RPO/T/CFG/Node/IdSet/index.html @@ -1,3 +1,3 @@ IdSet (infer.UnitTests.AbstractInterpreterTests.NormalTestInterpreter.AI_RPO.T.CFG.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    + Absint.AbstractInterpreter.MakeRPO(PathCountTransferFunctions(Absint.ProcCfg.Normal)).TransferFunctions.CFG.Node.IdSet.t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/AbstractInterpreterTests/NormalTestInterpreter/AI_WTO/T/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/AbstractInterpreterTests/NormalTestInterpreter/AI_WTO/T/CFG/Node/IdSet/index.html index ab7475b67ef..06c4600c2b5 100644 --- a/website/static/odoc/next/infer/UnitTests/AbstractInterpreterTests/NormalTestInterpreter/AI_WTO/T/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/AbstractInterpreterTests/NormalTestInterpreter/AI_WTO/T/CFG/Node/IdSet/index.html @@ -1,3 +1,3 @@ IdSet (infer.UnitTests.AbstractInterpreterTests.NormalTestInterpreter.AI_WTO.T.CFG.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    + Absint.AbstractInterpreter.MakeWTO(PathCountTransferFunctions(Absint.ProcCfg.Normal)).TransferFunctions.CFG.Node.IdSet.t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/AbstractInterpreterTests/PathCountTransferFunctions/argument-1-CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/AbstractInterpreterTests/PathCountTransferFunctions/argument-1-CFG/Node/IdSet/index.html index 6d05f977392..94509b05256 100644 --- a/website/static/odoc/next/infer/UnitTests/AbstractInterpreterTests/PathCountTransferFunctions/argument-1-CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/AbstractInterpreterTests/PathCountTransferFunctions/argument-1-CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.UnitTests.AbstractInterpreterTests.PathCountTransferFunctions.CFG.Node.IdSet)

    Module Node.IdSet

    include IStdlib.IStd.Caml.Set.S with type elt = id
    type elt = id
    type t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    include IStdlib.PrettyPrintable.PrintableType with type t := t
    val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
    +IdSet (infer.UnitTests.AbstractInterpreterTests.PathCountTransferFunctions.CFG.Node.IdSet)

    Module Node.IdSet

    include IStdlib.IStd.Caml.Set.S with type elt = id
    type elt = id
    type t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    include IStdlib.PrettyPrintable.PrintableType with type t := t
    val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/AccessTreeTests/MockTraceDomain/index.html b/website/static/odoc/next/infer/UnitTests/AccessTreeTests/MockTraceDomain/index.html index c24a08551ad..dbd26f95103 100644 --- a/website/static/odoc/next/infer/UnitTests/AccessTreeTests/MockTraceDomain/index.html +++ b/website/static/odoc/next/infer/UnitTests/AccessTreeTests/MockTraceDomain/index.html @@ -1,2 +1,2 @@ -MockTraceDomain (infer.UnitTests.AccessTreeTests.MockTraceDomain)

    Module AccessTreeTests.MockTraceDomain

    include sig ... end
    type elt = string
    type t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    val leq : lhs:t -> rhs:t -> bool
    val join : t -> t -> t
    val bottom : t
    val is_bottom : t -> bool
    val top_str : string
    val top : t
    val singleton : IStdlib.IStd.String.t -> t
    val widen : prev:t -> next:t -> num_iters:'a -> t
    val pp : F.formatter -> t -> unit
    +MockTraceDomain (infer.UnitTests.AccessTreeTests.MockTraceDomain)

    Module AccessTreeTests.MockTraceDomain

    include sig ... end
    type elt = string
    type t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    val leq : lhs:t -> rhs:t -> bool
    val join : t -> t -> t
    val bottom : t
    val is_bottom : t -> bool
    val top_str : string
    val top : t
    val singleton : IStdlib.IStd.String.t -> t
    val widen : prev:t -> next:t -> num_iters:'a -> t
    val pp : F.formatter -> t -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/AddressTakenTests/TestInterpreter/AI_RPO/T/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/AddressTakenTests/TestInterpreter/AI_RPO/T/CFG/Node/IdSet/index.html index d10ae6a138c..607a4b4b599 100644 --- a/website/static/odoc/next/infer/UnitTests/AddressTakenTests/TestInterpreter/AI_RPO/T/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/AddressTakenTests/TestInterpreter/AI_RPO/T/CFG/Node/IdSet/index.html @@ -1,3 +1,3 @@ IdSet (infer.UnitTests.AddressTakenTests.TestInterpreter.AI_RPO.T.CFG.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    + Absint.AbstractInterpreter.MakeRPO(Checkers.AddressTaken.TransferFunctions(Absint.ProcCfg.Exceptional)).TransferFunctions.CFG.Node.IdSet.t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/AddressTakenTests/TestInterpreter/AI_WTO/T/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/AddressTakenTests/TestInterpreter/AI_WTO/T/CFG/Node/IdSet/index.html index 41c6fa10a21..4f5924e7724 100644 --- a/website/static/odoc/next/infer/UnitTests/AddressTakenTests/TestInterpreter/AI_WTO/T/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/AddressTakenTests/TestInterpreter/AI_WTO/T/CFG/Node/IdSet/index.html @@ -1,3 +1,3 @@ IdSet (infer.UnitTests.AddressTakenTests.TestInterpreter.AI_WTO.T.CFG.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    + Absint.AbstractInterpreter.MakeWTO(Checkers.AddressTaken.TransferFunctions(Absint.ProcCfg.Exceptional)).TransferFunctions.CFG.Node.IdSet.t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/AnalyzerTester/Make/AI_RPO/T/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/AnalyzerTester/Make/AI_RPO/T/CFG/Node/IdSet/index.html index 11432d38f15..a6f8cd8b93b 100644 --- a/website/static/odoc/next/infer/UnitTests/AnalyzerTester/Make/AI_RPO/T/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/AnalyzerTester/Make/AI_RPO/T/CFG/Node/IdSet/index.html @@ -1,3 +1,3 @@ IdSet (infer.UnitTests.AnalyzerTester.Make.AI_RPO.T.CFG.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    + Absint.AbstractInterpreter.MakeRPO(T).TransferFunctions.CFG.Node.IdSet.t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/AnalyzerTester/Make/AI_WTO/T/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/AnalyzerTester/Make/AI_WTO/T/CFG/Node/IdSet/index.html index ede117ee0e4..8cc227e1dbb 100644 --- a/website/static/odoc/next/infer/UnitTests/AnalyzerTester/Make/AI_WTO/T/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/AnalyzerTester/Make/AI_WTO/T/CFG/Node/IdSet/index.html @@ -1,3 +1,3 @@ IdSet (infer.UnitTests.AnalyzerTester.Make.AI_WTO.T.CFG.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    + Absint.AbstractInterpreter.MakeWTO(T).TransferFunctions.CFG.Node.IdSet.t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/AnalyzerTester/Make/argument-1-T/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/AnalyzerTester/Make/argument-1-T/CFG/Node/IdSet/index.html index dad17dabadb..c51788747b2 100644 --- a/website/static/odoc/next/infer/UnitTests/AnalyzerTester/Make/argument-1-T/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/AnalyzerTester/Make/argument-1-T/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.UnitTests.AnalyzerTester.Make.T.CFG.Node.IdSet)

    Module Node.IdSet

    include IStdlib.IStd.Caml.Set.S with type elt = id
    type elt = id
    type t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    include IStdlib.PrettyPrintable.PrintableType with type t := t
    val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
    +IdSet (infer.UnitTests.AnalyzerTester.Make.T.CFG.Node.IdSet)

    Module Node.IdSet

    include IStdlib.IStd.Caml.Set.S with type elt = id
    type elt = id
    type t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    include IStdlib.PrettyPrintable.PrintableType with type t := t
    val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeBackwardExceptional/AI_RPO/T/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeBackwardExceptional/AI_RPO/T/CFG/Node/IdSet/index.html index 52632c4c7b0..5257acae468 100644 --- a/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeBackwardExceptional/AI_RPO/T/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeBackwardExceptional/AI_RPO/T/CFG/Node/IdSet/index.html @@ -1,3 +1,3 @@ IdSet (infer.UnitTests.AnalyzerTester.MakeBackwardExceptional.AI_RPO.T.CFG.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    + Absint.AbstractInterpreter.MakeBackwardRPO(T).TransferFunctions.CFG.Node.IdSet.t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeBackwardExceptional/AI_WTO/T/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeBackwardExceptional/AI_WTO/T/CFG/Node/IdSet/index.html index 52f6de2d236..1c40af8b205 100644 --- a/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeBackwardExceptional/AI_WTO/T/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeBackwardExceptional/AI_WTO/T/CFG/Node/IdSet/index.html @@ -1,3 +1,3 @@ IdSet (infer.UnitTests.AnalyzerTester.MakeBackwardExceptional.AI_WTO.T.CFG.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    + Absint.AbstractInterpreter.MakeBackwardWTO(T).TransferFunctions.CFG.Node.IdSet.t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeBackwardExceptional/argument-1-T/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeBackwardExceptional/argument-1-T/CFG/Node/IdSet/index.html index 6650da5607e..2fc10ca9746 100644 --- a/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeBackwardExceptional/argument-1-T/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeBackwardExceptional/argument-1-T/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.UnitTests.AnalyzerTester.MakeBackwardExceptional.T.CFG.Node.IdSet)

    Module Node.IdSet

    include IStdlib.IStd.Caml.Set.S with type elt = id
    type elt = id
    type t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    include IStdlib.PrettyPrintable.PrintableType with type t := t
    val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
    +IdSet (infer.UnitTests.AnalyzerTester.MakeBackwardExceptional.T.CFG.Node.IdSet)

    Module Node.IdSet

    include IStdlib.IStd.Caml.Set.S with type elt = id
    type elt = id
    type t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    include IStdlib.PrettyPrintable.PrintableType with type t := t
    val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeTester/argument-1-I/TransferFunctions/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeTester/argument-1-I/TransferFunctions/CFG/Node/IdSet/index.html index 3c233d0e0a1..d17858b7b80 100644 --- a/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeTester/argument-1-I/TransferFunctions/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeTester/argument-1-I/TransferFunctions/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.UnitTests.AnalyzerTester.MakeTester.I.TransferFunctions.CFG.Node.IdSet)

    Module Node.IdSet

    include IStdlib.IStd.Caml.Set.S with type elt = id
    type elt = id
    type t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    include IStdlib.PrettyPrintable.PrintableType with type t := t
    val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
    +IdSet (infer.UnitTests.AnalyzerTester.MakeTester.I.TransferFunctions.CFG.Node.IdSet)

    Module Node.IdSet

    include IStdlib.IStd.Caml.Set.S with type elt = id
    type elt = id
    type t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    include IStdlib.PrettyPrintable.PrintableType with type t := t
    val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeTesters/AI_RPO/T/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeTesters/AI_RPO/T/CFG/Node/IdSet/index.html index 2836968a7ec..8da785e229a 100644 --- a/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeTesters/AI_RPO/T/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeTesters/AI_RPO/T/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.UnitTests.AnalyzerTester.MakeTesters.AI_RPO.T.CFG.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    +IdSet (infer.UnitTests.AnalyzerTester.MakeTesters.AI_RPO.T.CFG.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeTesters/AI_WTO/T/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeTesters/AI_WTO/T/CFG/Node/IdSet/index.html index 3c98c3299e5..49efd851f89 100644 --- a/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeTesters/AI_WTO/T/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeTesters/AI_WTO/T/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.UnitTests.AnalyzerTester.MakeTesters.AI_WTO.T.CFG.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    +IdSet (infer.UnitTests.AnalyzerTester.MakeTesters.AI_WTO.T.CFG.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeTesters/argument-1-RPO/TransferFunctions/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeTesters/argument-1-RPO/TransferFunctions/CFG/Node/IdSet/index.html index 77b95564435..236b5b0b0c0 100644 --- a/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeTesters/argument-1-RPO/TransferFunctions/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/AnalyzerTester/MakeTesters/argument-1-RPO/TransferFunctions/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.UnitTests.AnalyzerTester.MakeTesters.RPO.TransferFunctions.CFG.Node.IdSet)

    Module Node.IdSet

    include IStdlib.IStd.Caml.Set.S with type elt = id
    type elt = id
    type t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    include IStdlib.PrettyPrintable.PrintableType with type t := t
    val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
    +IdSet (infer.UnitTests.AnalyzerTester.MakeTesters.RPO.TransferFunctions.CFG.Node.IdSet)

    Module Node.IdSet

    include IStdlib.IStd.Caml.Set.S with type elt = id
    type elt = id
    type t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    include IStdlib.PrettyPrintable.PrintableType with type t := t
    val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib.PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib.PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/CStubsTests/index.html b/website/static/odoc/next/infer/UnitTests/CStubsTests/index.html deleted file mode 100644 index 0661d119201..00000000000 --- a/website/static/odoc/next/infer/UnitTests/CStubsTests/index.html +++ /dev/null @@ -1,5 +0,0 @@ - -CStubsTests (infer.UnitTests.CStubsTests)

    Module UnitTests.CStubsTests

    val pp_diff_of_hashed_value : - Stdlib.Format.formatter -> - (string * string) -> - unit
    val test_fnv64_hash_function : OUnit2.test list
    val tests : OUnit2.test
    diff --git a/website/static/odoc/next/infer/UnitTests/JavaProfilerSamplesTest/index.html b/website/static/odoc/next/infer/UnitTests/JavaProfilerSamplesTest/index.html deleted file mode 100644 index 6751f5b4617..00000000000 --- a/website/static/odoc/next/infer/UnitTests/JavaProfilerSamplesTest/index.html +++ /dev/null @@ -1,3 +0,0 @@ - -JavaProfilerSamplesTest (infer.UnitTests.JavaProfilerSamplesTest)

    Module UnitTests.JavaProfilerSamplesTest

    val test_jni_pp : OUnit2.test list
    val test_jni_parse_method_str_with_invalid_input : OUnit2.test list
    val test_jni_parse_str_with_valid_input : OUnit2.test list
    val test_jni_parse_str_with_invalid_input : OUnit2.test list
    val test_from_json_string_with_valid_input : OUnit2.test list
    val test_from_json_string_with_invalid_input : OUnit2.test list
    val tests : OUnit2.test
    diff --git a/website/static/odoc/next/infer/UnitTests/LivenessTests/TestInterpreter/AI_RPO/T/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/LivenessTests/TestInterpreter/AI_RPO/T/CFG/Node/IdSet/index.html index f38c825b366..f06cf715183 100644 --- a/website/static/odoc/next/infer/UnitTests/LivenessTests/TestInterpreter/AI_RPO/T/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/LivenessTests/TestInterpreter/AI_RPO/T/CFG/Node/IdSet/index.html @@ -1,3 +1,3 @@ IdSet (infer.UnitTests.LivenessTests.TestInterpreter.AI_RPO.T.CFG.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    + Absint.AbstractInterpreter.MakeBackwardRPO(Checkers.Liveness.PreAnalysisTransferFunctions(Absint.ProcCfg.Backward(Absint.ProcCfg.Exceptional))).TransferFunctions.CFG.Node.IdSet.t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/LivenessTests/TestInterpreter/AI_WTO/T/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/LivenessTests/TestInterpreter/AI_WTO/T/CFG/Node/IdSet/index.html index 29f9dc8b765..6493859ceb3 100644 --- a/website/static/odoc/next/infer/UnitTests/LivenessTests/TestInterpreter/AI_WTO/T/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/LivenessTests/TestInterpreter/AI_WTO/T/CFG/Node/IdSet/index.html @@ -1,3 +1,3 @@ IdSet (infer.UnitTests.LivenessTests.TestInterpreter.AI_WTO.T.CFG.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    + Absint.AbstractInterpreter.MakeBackwardWTO(Checkers.Liveness.PreAnalysisTransferFunctions(Absint.ProcCfg.Backward(Absint.ProcCfg.Exceptional))).TransferFunctions.CFG.Node.IdSet.t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/ProcCfgTests/BackwardCfg/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/ProcCfgTests/BackwardCfg/Node/IdSet/index.html index c3ba16686e9..ece329df2c8 100644 --- a/website/static/odoc/next/infer/UnitTests/ProcCfgTests/BackwardCfg/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/ProcCfgTests/BackwardCfg/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.UnitTests.ProcCfgTests.BackwardCfg.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    +IdSet (infer.UnitTests.ProcCfgTests.BackwardCfg.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/ProcCfgTests/BackwardInstrCfg/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/ProcCfgTests/BackwardInstrCfg/Node/IdSet/index.html index 6451335768e..8ed99dfe709 100644 --- a/website/static/odoc/next/infer/UnitTests/ProcCfgTests/BackwardInstrCfg/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/ProcCfgTests/BackwardInstrCfg/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.UnitTests.ProcCfgTests.BackwardInstrCfg.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    +IdSet (infer.UnitTests.ProcCfgTests.BackwardInstrCfg.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/ProcCfgTests/InstrCfg/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/ProcCfgTests/InstrCfg/Node/IdSet/index.html index 3454eb91cf9..62e8c8826dd 100644 --- a/website/static/odoc/next/infer/UnitTests/ProcCfgTests/InstrCfg/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/ProcCfgTests/InstrCfg/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.UnitTests.ProcCfgTests.InstrCfg.Node.IdSet)

    Module Node.IdSet

    type elt = id
    type t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    +IdSet (infer.UnitTests.ProcCfgTests.InstrCfg.Node.IdSet)

    Module Node.IdSet

    type elt = id
    type t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/SchedulerTests/MockNode/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/SchedulerTests/MockNode/IdSet/index.html index 2a480d7cbcb..4074f42a769 100644 --- a/website/static/odoc/next/infer/UnitTests/SchedulerTests/MockNode/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/SchedulerTests/MockNode/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.UnitTests.SchedulerTests.MockNode.IdSet)

    Module MockNode.IdSet

    type elt = OrderedId.t
    type t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    +IdSet (infer.UnitTests.SchedulerTests.MockNode.IdSet)

    Module MockNode.IdSet

    type elt = OrderedId.t
    type t
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/SchedulerTests/S/CFG/Node/IdSet/index.html b/website/static/odoc/next/infer/UnitTests/SchedulerTests/S/CFG/Node/IdSet/index.html index 3a7533a12ae..af69d99cda5 100644 --- a/website/static/odoc/next/infer/UnitTests/SchedulerTests/S/CFG/Node/IdSet/index.html +++ b/website/static/odoc/next/infer/UnitTests/SchedulerTests/S/CFG/Node/IdSet/index.html @@ -1,2 +1,2 @@ -IdSet (infer.UnitTests.SchedulerTests.S.CFG.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    +IdSet (infer.UnitTests.SchedulerTests.S.CFG.Node.IdSet)

    Module Node.IdSet

    type elt = id
    val empty : t
    val is_empty : t -> bool
    val mem : elt -> t -> bool
    val add : elt -> t -> t
    val singleton : elt -> t
    val remove : elt -> t -> t
    val union : t -> t -> t
    val inter : t -> t -> t
    val disjoint : t -> t -> bool
    val diff : t -> t -> t
    val compare : t -> t -> int
    val equal : t -> t -> bool
    val subset : t -> t -> bool
    val iter : (elt -> unit) -> t -> unit
    val map : (elt -> elt) -> t -> t
    val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
    val for_all : (elt -> bool) -> t -> bool
    val exists : (elt -> bool) -> t -> bool
    val filter : (elt -> bool) -> t -> t
    val filter_map : (elt -> elt option) -> t -> t
    val partition : (elt -> bool) -> t -> t * t
    val cardinal : t -> int
    val elements : t -> elt list
    val min_elt : t -> elt
    val min_elt_opt : t -> elt option
    val max_elt : t -> elt
    val max_elt_opt : t -> elt option
    val choose : t -> elt
    val choose_opt : t -> elt option
    val split : elt -> t -> t * bool * t
    val find : elt -> t -> elt
    val find_opt : elt -> t -> elt option
    val find_first : (elt -> bool) -> t -> elt
    val find_first_opt : (elt -> bool) -> t -> elt option
    val find_last : (elt -> bool) -> t -> elt
    val find_last_opt : (elt -> bool) -> t -> elt option
    val of_list : elt list -> t
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t
    val to_seq : t -> elt Stdlib.Seq.t
    val to_rev_seq : t -> elt Stdlib.Seq.t
    val add_seq : elt Stdlib.Seq.t -> t -> t
    val of_seq : elt Stdlib.Seq.t -> t
    val is_singleton_or_more : t -> elt IStdlib.IContainer.singleton_or_more
    val pp : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_hov : IStdlib__PrettyPrintable.F.formatter -> t -> unit
    val pp_element : IStdlib__PrettyPrintable.F.formatter -> elt -> unit
    diff --git a/website/static/odoc/next/infer/UnitTests/index.html b/website/static/odoc/next/infer/UnitTests/index.html index 8e6557ee8d8..7d938ed1116 100644 --- a/website/static/odoc/next/infer/UnitTests/index.html +++ b/website/static/odoc/next/infer/UnitTests/index.html @@ -1,2 +1,2 @@ -UnitTests (infer.UnitTests)

    Module UnitTests

    module AbstractInterpreterTests : sig ... end
    module AccessPathTestUtils : sig ... end
    module AccessTreeTests : sig ... end
    module AddressTakenTests : sig ... end
    module AnalyzerTester : sig ... end
    module CStubsTests : sig ... end
    module DifferentialFiltersTests : sig ... end
    module DifferentialTests : sig ... end
    module DifferentialTestsUtils : sig ... end
    module FileDiffTests : sig ... end
    module GradleTests : sig ... end
    module HilExpTests : sig ... end
    module IListTests : sig ... end
    module JavaClassNameTests : sig ... end
    module JavaProfilerSamplesTest : sig ... end
    module LRUHashtblTests : sig ... end
    module LivenessTests : sig ... end
    module ProcCfgTests : sig ... end
    module RestartSchedulerTests : sig ... end
    module SchedulerTests : sig ... end
    module SeverityTests : sig ... end
    module WeakTopologicalOrderTests : sig ... end
    +UnitTests (infer.UnitTests)

    Module UnitTests

    module AbstractInterpreterTests : sig ... end
    module AccessPathTestUtils : sig ... end
    module AccessTreeTests : sig ... end
    module AddressTakenTests : sig ... end
    module AnalyzerTester : sig ... end
    module DifferentialFiltersTests : sig ... end
    module DifferentialTests : sig ... end
    module DifferentialTestsUtils : sig ... end
    module FileDiffTests : sig ... end
    module GradleTests : sig ... end
    module HilExpTests : sig ... end
    module IListTests : sig ... end
    module JavaClassNameTests : sig ... end
    module LRUHashtblTests : sig ... end
    module LivenessTests : sig ... end
    module ProcCfgTests : sig ... end
    module RestartSchedulerTests : sig ... end
    module SchedulerTests : sig ... end
    module SeverityTests : sig ... end
    module WeakTopologicalOrderTests : sig ... end
    diff --git a/website/static/odoc/next/infer/index.html b/website/static/odoc/next/infer/index.html index a0b47ad3832..2c434b30b09 100644 --- a/website/static/odoc/next/infer/index.html +++ b/website/static/odoc/next/infer/index.html @@ -1,2 +1,2 @@ -index (infer.index)

    infer index

    Library infer.ATDGenerated

    The entry point of this library is the module: ATDGenerated.

    Library infer.Absint

    The entry point of this library is the module: Absint.

    Library infer.BO

    The entry point of this library is the module: BO.

    Library infer.Backend

    The entry point of this library is the module: Backend.

    Library infer.Biabduction

    The entry point of this library is the module: Biabduction.

    Library infer.CStubs

    The entry point of this library is the module: CStubs.

    Library infer.Checkers

    The entry point of this library is the module: Checkers.

    Library infer.ClangFrontend

    The entry point of this library is the module: ClangFrontend.

    Library infer.ClangUnitTests

    The entry point of this library is the module: ClangUnitTests.

    Library infer.Concurrency

    The entry point of this library is the module: Concurrency.

    Library infer.Costlib

    The entry point of this library is the module: Costlib.

    Library infer.ErlangFrontend

    The entry point of this library is the module: ErlangFrontend.

    Library infer.IBase

    The entry point of this library is the module: IBase.

    Library infer.IR

    The entry point of this library is the module: IR.

    Library infer.IStdlib

    The entry point of this library is the module: IStdlib.

    Library infer.Integration

    The entry point of this library is the module: Integration.

    Library infer.JavaFrontend

    The entry point of this library is the module: JavaFrontend.

    Library infer.Labs

    The entry point of this library is the module: Labs.

    Library infer.OpenSource

    The entry point of this library is the module: OpenSource.

    Library infer.Pulselib

    The entry point of this library is the module: Pulselib.

    Library infer.PythonFrontend

    The entry point of this library is the module: PythonFrontend.

    Library infer.TestDeterminators

    The entry point of this library is the module: TestDeterminators.

    Library infer.Textuallib

    The entry point of this library is the module: Textuallib.

    Library infer.Topllib

    The entry point of this library is the module: Topllib.

    Library infer.UnitTests

    The entry point of this library is the module: UnitTests.

    +index (infer.index)

    infer index

    Library infer.ATDGenerated

    The entry point of this library is the module: ATDGenerated.

    Library infer.Absint

    The entry point of this library is the module: Absint.

    Library infer.BO

    The entry point of this library is the module: BO.

    Library infer.Backend

    The entry point of this library is the module: Backend.

    Library infer.Biabduction

    The entry point of this library is the module: Biabduction.

    Library infer.Checkers

    The entry point of this library is the module: Checkers.

    Library infer.ClangFrontend

    The entry point of this library is the module: ClangFrontend.

    Library infer.ClangUnitTests

    The entry point of this library is the module: ClangUnitTests.

    Library infer.Concurrency

    The entry point of this library is the module: Concurrency.

    Library infer.Costlib

    The entry point of this library is the module: Costlib.

    Library infer.ErlangFrontend

    The entry point of this library is the module: ErlangFrontend.

    Library infer.IBase

    The entry point of this library is the module: IBase.

    Library infer.IR

    The entry point of this library is the module: IR.

    Library infer.IStdlib

    The entry point of this library is the module: IStdlib.

    Library infer.Integration

    The entry point of this library is the module: Integration.

    Library infer.JavaFrontend

    The entry point of this library is the module: JavaFrontend.

    Library infer.Labs

    The entry point of this library is the module: Labs.

    Library infer.OpenSource

    The entry point of this library is the module: OpenSource.

    Library infer.Pulselib

    The entry point of this library is the module: Pulselib.

    Library infer.PythonFrontend

    The entry point of this library is the module: PythonFrontend.

    Library infer.Textuallib

    The entry point of this library is the module: Textuallib.

    Library infer.Topllib

    The entry point of this library is the module: Topllib.

    Library infer.UnitTests

    The entry point of this library is the module: UnitTests.

    diff --git a/website/static/odoc/next/infer/infer.html b/website/static/odoc/next/infer/infer.html index b287676a482..9c54e73458e 100644 --- a/website/static/odoc/next/infer/infer.html +++ b/website/static/odoc/next/infer/infer.html @@ -1,2 +1,2 @@ -infer (infer.infer)

    Infer

    Backend

    Want to write your own analysis? You probably want the Absint library. Backend is in charge of orchestrating the various analyses on a collection of procedures.

    Some of the simplest analyses can be found in the Checkers library.

    Frontends

    The frontends translate the source code to analyze into Infer's intermediate representation (see IR) to be analyzed by the backend.

    There are two frontends:

    See also TestDeterminators, which operate right after the frontends.

    Utilities

    IStdlib groups non-Infer-specific modules, and IBase contains more Infer-specific modules that other Infer libraries need, usually depending on the IBase.Config module. Some datatypes and their accompanying utilities are defined in the ATDGenerated library.

    Integrations and Infer executables

    Integration ties the frontends and backend together, and deals with build system integrations.

    You'll find the source code for the infer command-line interface and others in the infer/src/ directory.

    Index

    List of all libraries.

    +infer (infer.infer)

    Infer

    Backend

    Want to write your own analysis? You probably want the Absint library. Backend is in charge of orchestrating the various analyses on a collection of procedures.

    Some of the simplest analyses can be found in the Checkers library.

    Frontends

    The frontends translate the source code to analyze into Infer's intermediate representation (see IR) to be analyzed by the backend.

    There are two frontends:

    Utilities

    IStdlib groups non-Infer-specific modules, and IBase contains more Infer-specific modules that other Infer libraries need, usually depending on the IBase.Config module. Some datatypes and their accompanying utilities are defined in the ATDGenerated library.

    Integrations and Infer executables

    Integration ties the frontends and backend together, and deals with build system integrations.

    You'll find the source code for the infer command-line interface and others in the infer/src/ directory.

    Index

    List of all libraries.