Uses of Package
pascal.taie.util
Package
Description
Provides the classes to represent and manage context-sensitive elements
used in pointer analysis, including context-sensitive pointers, objects,
call sites, and methods.
Provide model for heap objects.
Implementation of various points-to sets used in pointer analysis.
Provide classes related to intermediate representation of method bodies.
Provides functionality related to management of classes (class loading,
class members, class hierarchy, etc.) in the program being analyzed.
In this package, we offer a generics model for Java.
-
-
-
-
ClassDescriptionAn indexer assigns each object a unique index, so that the objects can be stored in efficient data structures.
-
ClassDescriptionThe instances of the classes that implement this interface can provide a unique non-negative index, so that they can be stored in efficient data structures (e.g., bit set).An indexer assigns each object a unique index, so that the objects can be stored in efficient data structures.
-
ClassDescriptionMap-based implementation for
ResultHolder
.An indexer assigns each object a unique index, so that the objects can be stored in efficient data structures.The holder object of analysis results. -
ClassDescriptionThe instances of the classes that implement this interface can provide a unique non-negative index, so that they can be stored in efficient data structures (e.g., bit set).An indexer assigns each object a unique index, so that the objects can be stored in efficient data structures.
-
ClassDescriptionThe instances of the classes that implement this interface can provide a unique non-negative index, so that they can be stored in efficient data structures (e.g., bit set).An indexer assigns each object a unique index, so that the objects can be stored in efficient data structures.
-
ClassDescriptionRepresents an operation that accepts three input arguments and returns no result.
-
-
ClassDescriptionMap-based implementation for
ResultHolder
.An indexer assigns each object a unique index, so that the objects can be stored in efficient data structures.The holder object of analysis results. -
ClassDescriptionThe instances of the classes that implement this interface can provide a unique non-negative index, so that they can be stored in efficient data structures (e.g., bit set).
-
-
ClassDescriptionThe instances of the classes that implement this interface can provide a unique non-negative index, so that they can be stored in efficient data structures (e.g., bit set).
-
ClassDescriptionMap-based implementation for
ResultHolder
.Indicates that a feature is experimental.The instances of the classes that implement this interface can provide a unique non-negative index, so that they can be stored in efficient data structures (e.g., bit set).An indexer assigns each object a unique index, so that the objects can be stored in efficient data structures.Marker annotation.The holder object of analysis results. -
-
ClassDescriptionAn indexer assigns each object a unique index, so that the objects can be stored in efficient data structures.The holder object of analysis results.
-
ClassDescriptionThe instances of the classes that implement this interface can provide a unique non-negative index, so that they can be stored in efficient data structures (e.g., bit set).An indexer assigns each object a unique index, so that the objects can be stored in efficient data structures.Represents an operation that accepts three input arguments and returns no result.Represents a function that accepts three arguments and produces a result.
-
ClassDescriptionAn indexer assigns each object a unique index, so that the objects can be stored in efficient data structures.