mirror of
https://github.com/luau-lang/luau.git
synced 2024-12-12 21:10:37 +00:00
b23d43496b
### What's new * Light update this week, mostly fast flag cleanups. ### New Solver * Rename flag to enable new solver from `DebugLuauDeferredConstraintResolution` to `LuauSolverV2` * Added support for magic functions for the new type checker (as opposed to the type inference component) * Improved handling of `string.format` with magic function improvements * Cleaning up some of the reported errors by the new type checker * Minor refactoring of `TypeChecker2.cpp` that happens to make the diff very hard to read. --- ### Internal Contributors Co-authored-by: Aaron Weiss <aaronweiss@roblox.com> Co-authored-by: Andy Friesen <afriesen@roblox.com> Co-authored-by: Vighnesh Vijay <vvijay@roblox.com> Co-authored-by: Vyacheslav Egorov <vegorov@roblox.com> --------- Co-authored-by: Alexander McCord <amccord@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> Co-authored-by: Junseo Yoo <jyoo@roblox.com>
72 lines
1.7 KiB
C++
72 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
|
|
|
|
#include "Fixture.h"
|
|
|
|
#include "Luau/RecursionCounter.h"
|
|
|
|
#include "doctest.h"
|
|
|
|
using namespace Luau;
|
|
|
|
LUAU_FASTINT(LuauVisitRecursionLimit);
|
|
LUAU_FASTFLAG(LuauSolverV2)
|
|
|
|
TEST_SUITE_BEGIN("VisitType");
|
|
|
|
TEST_CASE_FIXTURE(Fixture, "throw_when_limit_is_exceeded")
|
|
{
|
|
if (FFlag::LuauSolverV2)
|
|
{
|
|
CheckResult result = check(R"(
|
|
local t : {a: {b: {c: {d: {e: boolean}}}}}
|
|
)");
|
|
ScopedFastInt sfi{FInt::LuauVisitRecursionLimit, 3};
|
|
TypeId tType = requireType("t");
|
|
|
|
CHECK_THROWS_AS(toString(tType), RecursionLimitException);
|
|
}
|
|
else
|
|
{
|
|
ScopedFastInt sfi{FInt::LuauVisitRecursionLimit, 3};
|
|
|
|
CheckResult result = check(R"(
|
|
local t : {a: {b: {c: {d: {e: boolean}}}}}
|
|
)");
|
|
|
|
TypeId tType = requireType("t");
|
|
|
|
CHECK_THROWS_AS(toString(tType), RecursionLimitException);
|
|
}
|
|
}
|
|
|
|
TEST_CASE_FIXTURE(Fixture, "dont_throw_when_limit_is_high_enough")
|
|
{
|
|
ScopedFastInt sfi{FInt::LuauVisitRecursionLimit, 8};
|
|
|
|
CheckResult result = check(R"(
|
|
local t : {a: {b: {c: {d: {e: boolean}}}}}
|
|
)");
|
|
|
|
TypeId tType = requireType("t");
|
|
|
|
(void)toString(tType);
|
|
}
|
|
|
|
TEST_CASE_FIXTURE(Fixture, "some_free_types_do_not_have_bounds")
|
|
{
|
|
Type t{FreeType{TypeLevel{}}};
|
|
|
|
(void)toString(&t);
|
|
}
|
|
|
|
TEST_CASE_FIXTURE(Fixture, "some_free_types_have_bounds")
|
|
{
|
|
ScopedFastFlag sff{FFlag::LuauSolverV2, true};
|
|
|
|
Scope scope{builtinTypes->anyTypePack};
|
|
Type t{FreeType{&scope, builtinTypes->neverType, builtinTypes->numberType}};
|
|
|
|
CHECK("('a <: number)" == toString(&t));
|
|
}
|
|
|
|
TEST_SUITE_END();
|