trait MatchOptimizer extends OptimizedCodegen with SwitchEmission with CommonSubconditionElimination
- Alphabetic
- By Inheritance
- MatchOptimizer
- CommonSubconditionElimination
- MatchApproximator
- TreesAndTypesDomain
- CheckableTreeAndTypeAnalysis
- PropositionalLogic
- SwitchEmission
- TreeMakers
- OptimizedCodegen
- TypedSubstitution
- CodegenCore
- MatchMonadInterface
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Type Members
- class Substitution extends AnyRef
- Definition Classes
- TypedSubstitution
- trait AbsVar extends AnyRef
- Definition Classes
- PropositionalLogic
- final case class And(ops: LogicLinkedHashSet[Prop]) extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
- final case class AtMostOne(ops: List[Sym]) extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
- final case class Eq(p: Var, q: Const) extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
- final case class Not(a: Prop) extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
- final case class Or(ops: LogicLinkedHashSet[Prop]) extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
- sealed abstract class Prop extends AnyRef
- Definition Classes
- PropositionalLogic
- trait PropMap extends AnyRef
- Definition Classes
- PropositionalLogic
- trait PropTraverser extends AnyRef
- Definition Classes
- PropositionalLogic
- final case class Solution(model: Model, unassigned: List[Sym]) extends Product with Serializable
- Definition Classes
- PropositionalLogic
- final class Sym extends Prop
- Definition Classes
- PropositionalLogic
- trait TypeConstExtractor extends AnyRef
- Definition Classes
- PropositionalLogic
- trait ValueConstExtractor extends AnyRef
- Definition Classes
- PropositionalLogic
- trait VarExtractor extends AnyRef
- Definition Classes
- PropositionalLogic
- case class Test(prop: MatchApproximator.Prop, treeMaker: MatchApproximator.TreeMaker) extends Product with Serializable
- Definition Classes
- MatchApproximator
- class TreeMakersToProps extends AnyRef
- Definition Classes
- MatchApproximator
- trait AbsCodegen extends AnyRef
- Definition Classes
- CodegenCore
- trait Casegen extends AbsCodegen
- Definition Classes
- CodegenCore
- abstract class CommonCodegen extends AbsCodegen
- Definition Classes
- CodegenCore
- class ReusedCondTreeMaker extends TreeMaker
- Definition Classes
- CommonSubconditionElimination
- case class ReusingCondTreeMaker(sharedPrefix: List[CommonSubconditionElimination.Test], reusesTest: (CommonSubconditionElimination.Test) => Option[CommonSubconditionElimination.Test], toReused: (CommonSubconditionElimination.TreeMaker) => CommonSubconditionElimination.TreeMaker) extends TreeMaker with Product with Serializable
- Definition Classes
- CommonSubconditionElimination
- type Model = Map[Sym, Boolean]
- Definition Classes
- PropositionalLogic
- abstract type Solvable
- Definition Classes
- PropositionalLogic
- type Tree = Global.Tree
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
- type Type = Global.Type
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
- class RegularSwitchMaker extends SwitchMaker
- Definition Classes
- SwitchEmission
- abstract class SwitchMaker extends AnyRef
- Definition Classes
- SwitchEmission
- case class AlternativesTreeMaker(prevBinder: Global.Symbol, altss: List[List[TreeMaker]], pos: Global.Position) extends TreeMaker with NoNewBinders with Product with Serializable
- Definition Classes
- TreeMakers
- case class BodyTreeMaker(body: Global.Tree, matchPt: Global.Type) extends TreeMaker with NoNewBinders with Product with Serializable
- Definition Classes
- TreeMakers
- sealed abstract class CondTreeMaker extends FunTreeMaker
- Definition Classes
- TreeMakers
- case class EqualityTestTreeMaker(prevBinder: Global.Symbol, patTree: Global.Tree, pos: Global.Position) extends CondTreeMaker with Product with Serializable
- Definition Classes
- TreeMakers
- case class ExtractorTreeMaker(extractor: Global.Tree, extraCond: Option[Global.Tree], nextBinder: Global.Symbol)(subPatBinders: List[Global.Symbol], subPatRefs: List[Global.Tree], potentiallyMutableBinders: Set[Global.Symbol], extractorReturnsBoolean: Boolean, checkedLength: Option[Int], prevBinder: Global.Symbol, ignoredSubPatBinders: Set[Global.Symbol]) extends FunTreeMaker with PreserveSubPatBinders with Product with Serializable
Make a TreeMaker that will result in an extractor call specified by
extractorthe next TreeMaker (here, we don't know which it'll be) is chained after this one by flatMap'ing a function with bindernextBinderover our extractor's result the function's body is determined by the next TreeMaker (furthermore, the interpretation offlatMapdepends on the codegen instance we're using).Make a TreeMaker that will result in an extractor call specified by
extractorthe next TreeMaker (here, we don't know which it'll be) is chained after this one by flatMap'ing a function with bindernextBinderover our extractor's result the function's body is determined by the next TreeMaker (furthermore, the interpretation offlatMapdepends on the codegen instance we're using).The values for the subpatterns, as computed by the extractor call in
extractor, are stored in local variables that re-use the symbols insubPatBinders. This makes extractor patterns more debuggable (scala/bug#5739).- Definition Classes
- TreeMakers
- sealed abstract class FunTreeMaker extends TreeMaker
- Definition Classes
- TreeMakers
- case class GuardTreeMaker(guardTree: Global.Tree) extends TreeMaker with NoNewBinders with Product with Serializable
- Definition Classes
- TreeMakers
- sealed trait NoNewBinders extends TreeMaker
- Definition Classes
- TreeMakers
- case class NonNullTestTreeMaker(prevBinder: Global.Symbol, expectedTp: Global.Type, pos: Global.Position) extends FunTreeMaker with Product with Serializable
Make a TreeMaker that performs null check.
Make a TreeMaker that performs null check. This is called prior to extractor call.
- Definition Classes
- TreeMakers
- sealed trait PreserveSubPatBinders extends TreeMaker
- Definition Classes
- TreeMakers
- case class ProductExtractorTreeMaker(prevBinder: Global.Symbol, extraCond: Option[Global.Tree])(subPatBinders: List[Global.Symbol], subPatRefs: List[Global.Tree], mutableBinders: List[Global.Symbol], ignoredSubPatBinders: Set[Global.Symbol]) extends FunTreeMaker with PreserveSubPatBinders with Product with Serializable
An optimized version of ExtractorTreeMaker for Products.
An optimized version of ExtractorTreeMaker for Products. For now, this is hard-coded to case classes, and we simply extract the case class fields.
The values for the subpatterns, as specified by the case class fields at the time of extraction, are stored in local variables that re-use the symbols in
subPatBinders. This makes extractor patterns more debuggable (scala/bug#5739) as well as avoiding mutation after the pattern has been matched (scala/bug#5158, scala/bug#6070)TODO: make this user-definable as follows When a companion object defines a method
def unapply_1(x: T): U_1, but nodef unapplyordef unapplySeq, the extractor is considered to match any non-null value of type T the pattern is expected to have as many sub-patterns as there aredef unapply_I(x: T): U_Imethods, and the type of the I'th sub-pattern isU_I. The same exception for Seq patterns applies: if the last extractor is of typeSeq[U_N], the pattern must have at least N arguments (exactly N if the last argument is annotated with: _*). The arguments starting at N (and beyond) are taken from the sequence returned by apply_N, and it is checked that that sequence has enough elements to provide values for all expected sub-patterns.For a case class C, the implementation is assumed to be
def unapply_I(x: C) = x._I, and the extractor call is inlined under that assumption.- Definition Classes
- TreeMakers
- case class SubstOnlyTreeMaker(prevBinder: Global.Symbol, nextBinder: Global.Symbol) extends TreeMaker with Product with Serializable
- Definition Classes
- TreeMakers
- abstract class TreeMaker extends AnyRef
- Definition Classes
- TreeMakers
- case class TrivialTreeMaker(tree: Global.Tree) extends TreeMaker with NoNewBinders with Product with Serializable
- Definition Classes
- TreeMakers
- case class TypeTestTreeMaker(prevBinder: Global.Symbol, testedBinder: Global.Symbol, expectedTp: Global.Type, nextBinderTp: Global.Type)(pos: Global.Position, extractorArgTypeTest: Boolean = false) extends CondTreeMaker with Product with Serializable
implements the run-time aspects of (§8.2) (typedPattern has already done the necessary type transformations)
implements the run-time aspects of (§8.2) (typedPattern has already done the necessary type transformations)
Type patterns consist of types, type variables, and wildcards. A type pattern T is of one of the following forms:
- A reference to a class C, p.C, or T#C. This type pattern matches any non-null instance of the given class. Note that the prefix of the class, if it is given, is relevant for determining class instances. For instance, the pattern p.C matches only instances of classes C which were created with the path p as prefix. The bottom types scala.Nothing and scala.Null cannot be used as type patterns, because they would match nothing in any case.
- A singleton type p.type. This type pattern matches only the value denoted by the path p (that is, a pattern match involved a comparison of the matched value with p using method eq in class AnyRef). // TODO: the actual pattern matcher uses ==, so that's what I'm using for now // https://github.com/scala/bug/issues/4577 "pattern matcher, still disappointing us at equality time"
- A compound type pattern T1 with ... with Tn where each Ti is a type pat- tern. This type pattern matches all values that are matched by each of the type patterns Ti.
- A parameterized type pattern T[a1,...,an], where the ai are type variable patterns or wildcards _. This type pattern matches all values which match T for some arbitrary instantiation of the type variables and wildcards. The bounds or alias type of these type variable are determined as described in (§8.3).
- A parameterized type pattern scala.Array[T1], where T1 is a type pattern. // TODO This type pattern matches any non-null instance of type scala.Array[U1], where U1 is a type matched by T1.
- Definition Classes
- TreeMakers
- sealed abstract class Const extends AnyRef
- Definition Classes
- TreesAndTypesDomain
- sealed class TypeConst extends Const
- Definition Classes
- TreesAndTypesDomain
- sealed class ValueConst extends Const
- Definition Classes
- TreesAndTypesDomain
- class Var extends AbsVar
- Definition Classes
- TreesAndTypesDomain
Abstract Value Members
- abstract val EmptyModel: Model
- Definition Classes
- PropositionalLogic
- abstract val NoModel: Model
- Definition Classes
- PropositionalLogic
- abstract def analyzeCases(prevBinder: Global.Symbol, cases: List[List[TreeMaker]], pt: Global.Type, suppression: MatchOptimization.Suppression): Unit
- Definition Classes
- TreeMakers
- abstract def eqFreePropToSolvable(f: Prop): Solvable
- Definition Classes
- PropositionalLogic
- abstract def findAllModelsFor(solvable: Solvable, sym: Global.Symbol = NoSymbol): List[Solution]
- Definition Classes
- PropositionalLogic
- abstract def hasModel(solvable: Solvable): Boolean
- Definition Classes
- PropositionalLogic
- abstract def reportWarning(message: String): Unit
- Definition Classes
- PropositionalLogic
- abstract val typer: (analyzer)#Typer
- Definition Classes
- CheckableTreeAndTypeAnalysis
- abstract def uncheckedWarning(pos: Global.Position, msg: String, site: Global.Symbol): Unit
- Definition Classes
- PropositionalLogic
Concrete Value Members
- object EmptySubstitution extends Substitution
- Definition Classes
- TypedSubstitution
- object Substitution
- Definition Classes
- TypedSubstitution
- object AnalysisBudget
- Definition Classes
- PropositionalLogic
- object And extends java.io.Serializable
- Definition Classes
- PropositionalLogic
- case object False extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
- object Or extends java.io.Serializable
- Definition Classes
- PropositionalLogic
- object Sym
- Definition Classes
- PropositionalLogic
- case object True extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
- object Test extends java.io.Serializable
- Definition Classes
- MatchApproximator
- object optimizedCodegen extends CommonCodegen
- Definition Classes
- OptimizedCodegen
- object ReusedCondTreeMaker
- Definition Classes
- CommonSubconditionElimination
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- Implicit
- This member is added by an implicit conversion from MatchOptimizer toany2stringadd[MatchOptimizer] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
- def ->[B](y: B): (MatchOptimizer, B)
- Implicit
- This member is added by an implicit conversion from MatchOptimizer toArrowAssoc[MatchOptimizer] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
- def /\(props: Iterable[Prop]): Prop
- Definition Classes
- PropositionalLogic
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def \/(props: Iterable[Prop]): Prop
- Definition Classes
- PropositionalLogic
- def approximateMatchConservative(root: Global.Symbol, cases: List[List[TreeMaker]]): List[List[Test]]
- Definition Classes
- MatchApproximator
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- final def caseWithoutBodyToProp(tests: List[Test]): Prop
- Attributes
- protected
- Definition Classes
- MatchApproximator
- def checkableType(tp: Global.Type): Global.Type
- Definition Classes
- CheckableTreeAndTypeAnalysis
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def codegen: AbsCodegen
- Definition Classes
- OptimizedCodegen → CodegenCore
- def combineCases(scrut: Global.Tree, scrutSym: Global.Symbol, cases: List[List[TreeMaker]], pt: Global.Type, selectorPos: Global.Position, owner: Global.Symbol, matchFailGenOverride: Option[(Global.Tree) => Global.Tree], suppression: MatchOptimization.Suppression): Global.Tree
- Definition Classes
- TreeMakers
- def combineExtractors(treeMakers: List[TreeMaker])(casegen: Casegen): Global.Tree
- Definition Classes
- TreeMakers
- val debugInfoEmitVars: Boolean
- Attributes
- protected
- Definition Classes
- TreeMakers
- def doCSE(prevBinder: Global.Symbol, cases: List[List[TreeMaker]], pt: Type, selectorPos: Global.Position): List[List[TreeMaker]]
a flow-sensitive, generalised, common sub-expression elimination reuse knowledge from performed tests the only sub-expressions we consider are the conditions and results of the three tests (type, type&equality, equality) when a sub-expression is shared, it is stored in a mutable variable the variable is floated up so that its scope includes all of the program that shares it we generalize sharing to implication, where b reuses a if a => b and priors(a) => priors(b) (the priors of a sub expression form the path through the decision tree)
a flow-sensitive, generalised, common sub-expression elimination reuse knowledge from performed tests the only sub-expressions we consider are the conditions and results of the three tests (type, type&equality, equality) when a sub-expression is shared, it is stored in a mutable variable the variable is floated up so that its scope includes all of the program that shares it we generalize sharing to implication, where b reuses a if a => b and priors(a) => priors(b) (the priors of a sub expression form the path through the decision tree)
- Definition Classes
- CommonSubconditionElimination
- def emitSwitch(scrut: Global.Tree, scrutSym: Global.Symbol, cases: List[List[TreeMaker]], pt: Global.Type, matchFailGenOverride: Option[(Global.Tree) => Global.Tree], unchecked: Boolean): Option[Global.Tree]
- Definition Classes
- SwitchEmission → TreeMakers
- def emitTypeSwitch(bindersAndCases: List[(Global.Symbol, List[TreeMaker])], pt: Global.Type): Option[List[Global.CaseDef]]
- Definition Classes
- SwitchEmission → TreeMakers
- def ensuring(cond: (MatchOptimizer) => Boolean, msg: => Any): MatchOptimizer
- Implicit
- This member is added by an implicit conversion from MatchOptimizer toEnsuring[MatchOptimizer] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: (MatchOptimizer) => Boolean): MatchOptimizer
- Implicit
- This member is added by an implicit conversion from MatchOptimizer toEnsuring[MatchOptimizer] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean, msg: => Any): MatchOptimizer
- Implicit
- This member is added by an implicit conversion from MatchOptimizer toEnsuring[MatchOptimizer] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean): MatchOptimizer
- Implicit
- This member is added by an implicit conversion from MatchOptimizer toEnsuring[MatchOptimizer] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def enumerateSubtypes(tp: Global.Type, grouped: Boolean): List[List[Global.Type]]
- Definition Classes
- CheckableTreeAndTypeAnalysis
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def fixerUpper(origOwner: Global.Symbol, pos: Global.Position): Global.InternalTraverser
- Attributes
- protected
- Definition Classes
- TreeMakers
- def freshName(prefix: String): Global.TermName
- Definition Classes
- CodegenCore
- def freshSym(pos: Global.Position, tp: Global.Type = NoType, prefix: String = "x"): Global.TermSymbol
- Definition Classes
- CodegenCore
- def gatherSymbols(p: Prop): Set[Sym]
- Definition Classes
- PropositionalLogic
- def gatherVariables(p: Prop): Set[Var]
- Definition Classes
- PropositionalLogic
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def getSuppression(scrut: Global.Tree): MatchOptimization.Suppression
- Definition Classes
- TreeMakers
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- val matchOwner: Global.Symbol
- Definition Classes
- MatchMonadInterface
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newSynthCaseLabel(name: String): Global.MethodSymbol
- Definition Classes
- CodegenCore
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def optimizeCases(prevBinder: Global.Symbol, cases: List[List[TreeMaker]], pt: Type, selectorPos: Global.Position): (List[List[TreeMaker]], List[Tree])
- Definition Classes
- MatchOptimizer → TreeMakers
- def prepareNewAnalysis(): Unit
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
- def propToSolvable(p: Prop): Solvable
- Definition Classes
- PropositionalLogic
- def propagateSubstitution(treeMakers: List[TreeMaker], initial: Substitution): List[TreeMaker]
- Definition Classes
- TreeMakers
- def removeDummy(makers: List[TreeMaker]): collection.immutable.List[TreeMaker]
- Definition Classes
- TreeMakers
- def removeSubstOnly(makers: List[TreeMaker]): collection.immutable.List[TreeMaker]
- Definition Classes
- TreeMakers
- def removeVarEq(props: List[Prop], modelNull: Boolean = false): (Prop, List[Prop])
- Definition Classes
- PropositionalLogic
- def reportMissingCases(pos: Global.Position, counterExamples: List[String]): Unit
- Definition Classes
- MatchMonadInterface
- def reportUnreachable(pos: Global.Position): Unit
- Definition Classes
- MatchMonadInterface
- def requiresSwitch(scrut: Global.Tree, cases: List[List[TreeMaker]]): Boolean
- Definition Classes
- TreeMakers
- def showTreeMakers(cases: List[List[TreeMaker]]): Unit
- Definition Classes
- MatchApproximator
- def simplify(f: Prop): Prop
Simplifies propositional formula according to the following rules: - eliminate double negation (avoids unnecessary Tseitin variables) - flatten trees of same connectives (avoids unnecessary Tseitin variables) - removes constants and connectives that are in fact constant because of their operands - eliminates duplicate operands - convert formula into NNF: all sub-expressions have a positive polarity which makes them amenable for the subsequent Plaisted transformation and increases chances to figure out that the formula is already in CNF
Simplifies propositional formula according to the following rules: - eliminate double negation (avoids unnecessary Tseitin variables) - flatten trees of same connectives (avoids unnecessary Tseitin variables) - removes constants and connectives that are in fact constant because of their operands - eliminates duplicate operands - convert formula into NNF: all sub-expressions have a positive polarity which makes them amenable for the subsequent Plaisted transformation and increases chances to figure out that the formula is already in CNF
Complexity: DFS over formula tree
See https://www.decision-procedures.org/slides/propositional_logic-2x3.pdf
- Definition Classes
- PropositionalLogic
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- def uncheckableType(tp: Global.Type): Boolean
- Definition Classes
- CheckableTreeAndTypeAnalysis
- def unreachableTypeSwitchCase(cases: List[Global.CaseDef]): Option[Global.CaseDef]
- Definition Classes
- SwitchEmission → TreeMakers
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- case object DummyTreeMaker extends TreeMaker with NoNewBinders with Product with Serializable
A dummy tree maker used to mark wildcard patterns.
A dummy tree maker used to mark wildcard patterns. This is later used to back off from exhaustivity checking.
- Definition Classes
- TreeMakers
- object TypeTestTreeMaker extends java.io.Serializable
- Definition Classes
- TreeMakers
- object Const
- Definition Classes
- TreesAndTypesDomain
- case object NullConst extends Const with Product with Serializable
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
- object TypeConst extends TypeConstExtractor
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
- object ValueConst extends ValueConstExtractor
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
- object Var extends VarExtractor
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
Deprecated Value Members
- def formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from MatchOptimizer toStringFormat[MatchOptimizer] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.12.16) Use
formatString.format(value)instead ofvalue.formatted(formatString), or use thef""string interpolator. In Java 15 and later,formattedresolves to the new method in String which has reversed parameters.
- def →[B](y: B): (MatchOptimizer, B)
- Implicit
- This member is added by an implicit conversion from MatchOptimizer toArrowAssoc[MatchOptimizer] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use
->instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.
The Scala compiler and reflection APIs.