mirror of
https://github.com/luau-lang/luau.git
synced 2025-08-26 11:27:08 +01:00
We have lots of new changes for you! # What's Changed ## General - We updated Luau's license year to 2025! - We fixed a bug where large amounts of errors were being printed when deep intersections of unions error. ## Require-by-String This release introduces the `Luau.Require` library, which exposes the runtime semantics of require-by-string, including support for the new `@self` alias described in [this RFC](https://github.com/luau-lang/rfcs/pull/109). The library operates on a virtualized filesystem, allowing consumers to specify navigation rules without assuming a filesystem context. Documentation in `Require.h` explains how to enable the library, and the `setupState` function in Repl.cpp demonstrates how we've integrated it into the luau CLI tool. Note that the interface in `Require.h` is written in C, which enables any application written in a language with a C foreign-function interface to link against this library and enable require-by-string. This makes it straightforward for any application embedding Luau to support require-by-string, provided that it defines or operates within an environment resembling a virtual filesystem. The core navigation semantics of require-by-string have additionally been pulled into the `Luau.RequireNavigator` library. While `Luau.Require` internally depends on `Luau.RequireNavigator`, the latter does not depend on the Luau VM. This library provides an interface for inspecting require-by-string's navigation behavior and therefore serves as a useful dependency for static tooling. Documentation for `Luau.RequireNavigator` is available in `RequireNavigator.h`. ## Autocomplete - We fixed a memory leak in fragment autocomplete! ## New Solver And Old Solver - We've found a infinite iteration error over a type pack. We added a way to detect this error and throw an `InternalCompileError` instead. - We fix `table.freeze` not accounting for the first argument not getting type stated. We fall back to regular inference instead. - We fix a crash in the old solver with `length_error`. - We fix a crash in the new solver stemming from generalization reentrancy. Now we correctly generalize interior free types that do not appear in a function signature. - We fix a nil refinement. (Fixes https://github.com/luau-lang/luau/issues/1687 and https://github.com/luau-lang/luau/issues/1451) ### Internal Contributors Co-authored-by: Andy Friesen <afriesen@roblox.com> Co-authored-by: Hunter Goldstein <hgoldstein@roblox.com> Co-authored-by: Talha Pathan <tpathan@roblox.com> Co-authored-by: Varun Saini <vsaini@roblox.com> Co-authored-by: Vighnesh Vijay <vvijay@roblox.com> Co-authored-by: Vyacheslav Egorov <vegorov@roblox.com> Full Changelog: https://github.com/luau-lang/luau/compare/0.668...0.669 --------- Co-authored-by: Hunter Goldstein <hgoldstein@roblox.com> Co-authored-by: Varun Saini <61795485+vrn-sn@users.noreply.github.com> Co-authored-by: Alexander Youngblood <ayoungblood@roblox.com> Co-authored-by: Aviral Goel <agoel@roblox.com> Co-authored-by: Vighnesh <vvijay@roblox.com> Co-authored-by: Vyacheslav Egorov <vegorov@roblox.com> Co-authored-by: Ariel Weiss <aaronweiss@roblox.com>
62 lines
1.7 KiB
C++
62 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 "Luau/Def.h"
|
|
|
|
#include "Luau/Common.h"
|
|
|
|
#include <algorithm>
|
|
|
|
namespace Luau
|
|
{
|
|
|
|
bool containsSubscriptedDefinition(DefId def)
|
|
{
|
|
if (auto cell = get<Cell>(def))
|
|
return cell->subscripted;
|
|
else if (auto phi = get<Phi>(def))
|
|
return std::any_of(phi->operands.begin(), phi->operands.end(), containsSubscriptedDefinition);
|
|
else
|
|
return false;
|
|
}
|
|
|
|
void collectOperands(DefId def, std::vector<DefId>* operands)
|
|
{
|
|
LUAU_ASSERT(operands);
|
|
if (std::find(operands->begin(), operands->end(), def) != operands->end())
|
|
return;
|
|
else if (get<Cell>(def))
|
|
operands->push_back(def);
|
|
else if (auto phi = get<Phi>(def))
|
|
{
|
|
// A trivial phi node has no operands to populate, so we push this definition in directly.
|
|
if (phi->operands.empty())
|
|
return operands->push_back(def);
|
|
|
|
for (const Def* operand : phi->operands)
|
|
collectOperands(NotNull{operand}, operands);
|
|
}
|
|
}
|
|
|
|
DefId DefArena::freshCell(Symbol sym, Location location, bool subscripted)
|
|
{
|
|
return NotNull{allocator.allocate(Def{Cell{subscripted}, sym, location})};
|
|
}
|
|
|
|
DefId DefArena::phi(DefId a, DefId b)
|
|
{
|
|
return phi({a, b});
|
|
}
|
|
|
|
DefId DefArena::phi(const std::vector<DefId>& defs)
|
|
{
|
|
std::vector<DefId> operands;
|
|
for (DefId operand : defs)
|
|
collectOperands(operand, &operands);
|
|
|
|
// There's no need to allocate a Phi node for a singleton set.
|
|
if (operands.size() == 1)
|
|
return operands[0];
|
|
else
|
|
return NotNull{allocator.allocate(Def{Phi{std::move(operands)}})};
|
|
}
|
|
|
|
} // namespace Luau
|