mirror of
https://github.com/luau-lang/luau.git
synced 2025-04-04 10:50:54 +01:00
259e509038
# What's changed?
### New Type Solver
- Unification of two fresh types no longer binds them together.
- Replaced uses of raw `emplace` with `emplaceType` to catch cyclic
bound types when they are created.
- `SetIndexerConstraint` is blocked until the indexer result type is not
blocked.
- Fix a case where a blocked type got past the constraint solver.
- Searching for free types should no longer traverse into `ClassType`s.
- Fix a corner case that could result in the non-testable type `~{}`.
- Fix incorrect flagging when `any` was a parameter of some checked
function in nonstrict type checker.
- `IterableConstraint` now consider tables without `__iter` to be
iterables.
### Native Code Generation
- Improve register type info lookup by program counter.
- Generate type information for locals and upvalues
---
### Internal Contributors
Co-authored-by: Aaron Weiss <aaronweiss@roblox.com>
Co-authored-by: Alexander McCord <amccord@roblox.com>
Co-authored-by: Andy Friesen <afriesen@roblox.com>
Co-authored-by: James McNellis <jmcnellis@roblox.com>
Co-authored-by: Vighnesh Vijay <vvijay@roblox.com>
Co-authored-by: Vyacheslav Egorov <vegorov@roblox.com>
---------
Co-authored-by: Aaron Weiss <aaronweiss@roblox.com>
Co-authored-by: Andy Friesen <afriesen@roblox.com>
Co-authored-by: Vighnesh <vvijay@roblox.com>
Co-authored-by: Aviral Goel <agoel@roblox.com>
Co-authored-by: David Cope <dcope@roblox.com>
Co-authored-by: Lily Brown <lbrown@roblox.com>
Co-authored-by: Vyacheslav Egorov <vegorov@roblox.com>
64 lines
1.5 KiB
C++
64 lines
1.5 KiB
C++
// This file is part of the Luau programming language and is licensed under MIT License; see LICENSE.txt for details
|
|
|
|
#include "Luau/Constraint.h"
|
|
#include "Luau/VisitType.h"
|
|
|
|
namespace Luau
|
|
{
|
|
|
|
Constraint::Constraint(NotNull<Scope> scope, const Location& location, ConstraintV&& c)
|
|
: scope(scope)
|
|
, location(location)
|
|
, c(std::move(c))
|
|
{
|
|
}
|
|
|
|
struct FreeTypeCollector : TypeOnceVisitor
|
|
{
|
|
|
|
DenseHashSet<TypeId>* result;
|
|
|
|
FreeTypeCollector(DenseHashSet<TypeId>* result)
|
|
: result(result)
|
|
{
|
|
}
|
|
|
|
bool visit(TypeId ty, const FreeType&) override
|
|
{
|
|
result->insert(ty);
|
|
return false;
|
|
}
|
|
|
|
bool visit(TypeId ty, const ClassType&) override
|
|
{
|
|
// ClassTypes never contain free types.
|
|
return false;
|
|
}
|
|
};
|
|
|
|
DenseHashSet<TypeId> Constraint::getFreeTypes() const
|
|
{
|
|
DenseHashSet<TypeId> types{{}};
|
|
FreeTypeCollector ftc{&types};
|
|
|
|
if (auto sc = get<SubtypeConstraint>(*this))
|
|
{
|
|
ftc.traverse(sc->subType);
|
|
ftc.traverse(sc->superType);
|
|
}
|
|
else if (auto psc = get<PackSubtypeConstraint>(*this))
|
|
{
|
|
ftc.traverse(psc->subPack);
|
|
ftc.traverse(psc->superPack);
|
|
}
|
|
else if (auto ptc = get<PrimitiveTypeConstraint>(*this))
|
|
{
|
|
// we need to take into account primitive type constraints to prevent type families from reducing on
|
|
// primitive whose types we have not yet selected to be singleton or not.
|
|
ftc.traverse(ptc->freeType);
|
|
}
|
|
|
|
return types;
|
|
}
|
|
|
|
} // namespace Luau
|