mirror of
https://github.com/luau-lang/luau.git
synced 2025-08-26 11:27:08 +01:00
# What's Changed? This week includes many changes to bring the behaviours of the Old and New Luau Type Solver more in line. * The old solver now stringifies tables identically to the new solver. Sealed tables are stringified as `{ ... }` and unsealed tables are represented by `{| ... |}`, regardless of your choice of solver. ## New Type Solver * Miscellaneous fixes to make the Luau Frontend able to dynamically toggle which solve is used. * Small fixes to reduce instances of nondeterminism of the New Type Solver. * Issue an error when a function that has multiple non-viable overloads is used. * Subtyping now returns more information about the generics for type inference to consume. * Stop stuck type-functions from blocking type inference. This should lead to fewer instances of 'type inference failed to complete'. ## Fragment Autocomplete * Fixed a bug where incremental autocomplete wouldn't be able to provide results directly on a required module script. `require(script.Module).{request completions here}` will now recommend the properties returned by the required object. --- Co-authored-by: Andy Friesen <afriesen@roblox.com> Co-authored-by: Hunter Goldstein <hgoldstein@roblox.com> Co-authored-by: Sora Kanosue <skanosue@roblox.com> Co-authored-by: Talha Pathan <tpathan@roblox.com> Co-authored-by: Vighnesh Vijay <vvijay@roblox.com>
68 lines
No EOL
1.2 KiB
C++
68 lines
No EOL
1.2 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 <vector>
|
|
#include "Luau/DenseHash.h"
|
|
|
|
namespace Luau
|
|
{
|
|
|
|
template<typename T>
|
|
struct OrderedSet
|
|
{
|
|
using iterator = typename std::vector<T>::iterator;
|
|
using const_iterator = typename std::vector<T>::const_iterator;
|
|
|
|
bool empty() const
|
|
{
|
|
return elements.empty();
|
|
}
|
|
|
|
size_t size() const
|
|
{
|
|
return elements.size();
|
|
}
|
|
|
|
void insert(T t)
|
|
{
|
|
if (!elementSet.contains(t))
|
|
{
|
|
elementSet.insert(t);
|
|
elements.push_back(t);
|
|
}
|
|
}
|
|
|
|
iterator begin()
|
|
{
|
|
return elements.begin();
|
|
}
|
|
|
|
const_iterator begin() const
|
|
{
|
|
return elements.begin();
|
|
}
|
|
|
|
iterator end()
|
|
{
|
|
return elements.end();
|
|
}
|
|
|
|
const_iterator end() const
|
|
{
|
|
return elements.end();
|
|
}
|
|
|
|
/// Move the underlying vector out of the OrderedSet.
|
|
std::vector<T> takeVector()
|
|
{
|
|
elementSet.clear();
|
|
return std::move(elements);
|
|
}
|
|
|
|
private:
|
|
std::vector<T> elements;
|
|
DenseHashSet<T> elementSet{nullptr};
|
|
};
|
|
|
|
} |