2022-04-08 04:53:47 +08:00
|
|
|
// This file is part of the Luau programming language and is licensed under MIT License; see LICENSE.txt for details
|
|
|
|
#pragma once
|
|
|
|
|
|
|
|
#include "Luau/TypeVar.h"
|
|
|
|
|
|
|
|
#include <unordered_map>
|
|
|
|
|
|
|
|
namespace Luau
|
|
|
|
{
|
|
|
|
|
|
|
|
// Only exposed so they can be unit tested.
|
|
|
|
using SeenTypes = std::unordered_map<TypeId, TypeId>;
|
|
|
|
using SeenTypePacks = std::unordered_map<TypePackId, TypePackId>;
|
|
|
|
|
|
|
|
struct CloneState
|
|
|
|
{
|
2022-04-15 05:57:15 +08:00
|
|
|
SeenTypes seenTypes;
|
|
|
|
SeenTypePacks seenTypePacks;
|
|
|
|
|
2022-04-08 04:53:47 +08:00
|
|
|
int recursionCount = 0;
|
2022-04-22 05:04:22 +08:00
|
|
|
bool encounteredFreeType = false; // TODO: Remove with LuauLosslessClone.
|
2022-04-08 04:53:47 +08:00
|
|
|
};
|
|
|
|
|
2022-04-15 05:57:15 +08:00
|
|
|
TypePackId clone(TypePackId tp, TypeArena& dest, CloneState& cloneState);
|
|
|
|
TypeId clone(TypeId tp, TypeArena& dest, CloneState& cloneState);
|
|
|
|
TypeFun clone(const TypeFun& typeFun, TypeArena& dest, CloneState& cloneState);
|
2022-04-08 04:53:47 +08:00
|
|
|
|
|
|
|
} // namespace Luau
|