mirror of
https://github.com/luau-lang/luau.git
synced 2025-04-02 01:40:54 +01:00
de9f5d6eb6
As always, a weekly Luau update! This week we have further improvements to new type solver, fixing a few of the popular issues reported. The fragment autocomplete is even more stable and we believe it's ready for broader use. Aside from that we have a few general fixes/improvements: * Fixed data race when multi-threaded typechecking is used, appearing as a random crash at the end of typechecking * AST data is now available from `Luau::Module` ## New Type Solver * Fixed type refinements made by function calls which could attach `nil` as an option of a type before (Fixes #1528) * Improved bidirectional typechecking in tables (Fixes #1596) * Fixed normalization of negated types * `getmetatable()` on `any` type should no longer report an error ## Fragment Autocomplete * Fixed auto-complete suggestions being provided inside multiline comments * Fixed an assertion failure that could happen when old type solver was used * Fixed issues with missing suggestions when multiple statements are on the same line * Fixed memory safety issues ## Internal Contributors Co-authored-by: Andy Friesen <afriesen@roblox.com> Co-authored-by: Hunter Goldstein <hgoldstein@roblox.com> Co-authored-by: Vighnesh Vijay <vvijay@roblox.com> Co-authored-by: Vyacheslav Egorov <vegorov@roblox.com>
79 lines
1.7 KiB
C++
79 lines
1.7 KiB
C++
// This file is part of the Luau programming language and is licensed under MIT License; see LICENSE.txt for details
|
|
#pragma once
|
|
|
|
#include "Luau/NotNull.h"
|
|
#include "Luau/TypedAllocator.h"
|
|
#include "Luau/Variant.h"
|
|
#include "Luau/TypeFwd.h"
|
|
|
|
namespace Luau
|
|
{
|
|
|
|
struct RefinementKey;
|
|
using DefId = NotNull<const struct Def>;
|
|
|
|
struct Variadic;
|
|
struct Negation;
|
|
struct Conjunction;
|
|
struct Disjunction;
|
|
struct Equivalence;
|
|
struct Proposition;
|
|
using Refinement = Variant<Variadic, Negation, Conjunction, Disjunction, Equivalence, Proposition>;
|
|
using RefinementId = Refinement*; // Can and most likely is nullptr.
|
|
|
|
struct Variadic
|
|
{
|
|
std::vector<RefinementId> refinements;
|
|
};
|
|
|
|
struct Negation
|
|
{
|
|
RefinementId refinement;
|
|
};
|
|
|
|
struct Conjunction
|
|
{
|
|
RefinementId lhs;
|
|
RefinementId rhs;
|
|
};
|
|
|
|
struct Disjunction
|
|
{
|
|
RefinementId lhs;
|
|
RefinementId rhs;
|
|
};
|
|
|
|
struct Equivalence
|
|
{
|
|
RefinementId lhs;
|
|
RefinementId rhs;
|
|
};
|
|
|
|
struct Proposition
|
|
{
|
|
const RefinementKey* key;
|
|
TypeId discriminantTy;
|
|
bool implicitFromCall;
|
|
};
|
|
|
|
template<typename T>
|
|
const T* get(RefinementId refinement)
|
|
{
|
|
return get_if<T>(refinement);
|
|
}
|
|
|
|
struct RefinementArena
|
|
{
|
|
RefinementId variadic(const std::vector<RefinementId>& refis);
|
|
RefinementId negation(RefinementId refinement);
|
|
RefinementId conjunction(RefinementId lhs, RefinementId rhs);
|
|
RefinementId disjunction(RefinementId lhs, RefinementId rhs);
|
|
RefinementId equivalence(RefinementId lhs, RefinementId rhs);
|
|
RefinementId proposition(const RefinementKey* key, TypeId discriminantTy);
|
|
RefinementId implicitProposition(const RefinementKey* key, TypeId discriminantTy);
|
|
|
|
private:
|
|
TypedAllocator<Refinement> allocator;
|
|
};
|
|
|
|
} // namespace Luau
|