-
Notifications
You must be signed in to change notification settings - Fork 393
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
* Added luau-compile executable target to build/test compilation without having full REPL included. In our new typechecker: * Fixed the order in which constraints are checked to get more deterministic errors in different environments * Fixed `isNumber`/`isString` checks to fix false positive errors in binary comparisons * CannotCallNonFunction error is reported when calling an intersection type of non-functions In our native code generation (jit): * Outlined X64 return instruction code to improve code size * Improved performance of return instruction on A64 * Added construction of a dominator tree for future optimizations
- Loading branch information
1 parent
febebde
commit 3ecd3a8
Showing
42 changed files
with
1,488 additions
and
278 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,134 @@ | ||
| // This file is part of the Luau programming language and is licensed under MIT License; see LICENSE.txt for details | ||
| #pragma once | ||
|
|
||
| #include "Luau/Common.h" | ||
|
|
||
| #include <unordered_map> | ||
| #include <vector> | ||
| #include <type_traits> | ||
| #include <iterator> | ||
|
|
||
| namespace Luau | ||
| { | ||
|
|
||
| template<typename K, typename V> | ||
| struct InsertionOrderedMap | ||
| { | ||
| static_assert(std::is_trivially_copyable_v<K>, "key must be trivially copyable"); | ||
|
|
||
| private: | ||
| using vec = std::vector<std::pair<K, V>>; | ||
|
|
||
| public: | ||
| using iterator = typename vec::iterator; | ||
| using const_iterator = typename vec::const_iterator; | ||
|
|
||
| void insert(K k, V v) | ||
| { | ||
| if (indices.count(k) != 0) | ||
| return; | ||
|
|
||
| pairs.push_back(std::make_pair(k, std::move(v))); | ||
| indices[k] = pairs.size() - 1; | ||
| } | ||
|
|
||
| void clear() | ||
| { | ||
| pairs.clear(); | ||
| indices.clear(); | ||
| } | ||
|
|
||
| size_t size() const | ||
| { | ||
| LUAU_ASSERT(pairs.size() == indices.size()); | ||
| return pairs.size(); | ||
| } | ||
|
|
||
| bool contains(const K& k) const | ||
| { | ||
| return indices.count(k) > 0; | ||
| } | ||
|
|
||
| const V* get(const K& k) const | ||
| { | ||
| auto it = indices.find(k); | ||
| if (it == indices.end()) | ||
| return nullptr; | ||
| else | ||
| return &pairs.at(it->second).second; | ||
| } | ||
|
|
||
| V* get(const K& k) | ||
| { | ||
| auto it = indices.find(k); | ||
| if (it == indices.end()) | ||
| return nullptr; | ||
| else | ||
| return &pairs.at(it->second).second; | ||
| } | ||
|
|
||
| const_iterator begin() const | ||
| { | ||
| return pairs.begin(); | ||
| } | ||
|
|
||
| const_iterator end() const | ||
| { | ||
| return pairs.end(); | ||
| } | ||
|
|
||
| iterator begin() | ||
| { | ||
| return pairs.begin(); | ||
| } | ||
|
|
||
| iterator end() | ||
| { | ||
| return pairs.end(); | ||
| } | ||
|
|
||
| const_iterator find(K k) const | ||
| { | ||
| auto indicesIt = indices.find(k); | ||
| if (indicesIt == indices.end()) | ||
| return end(); | ||
| else | ||
| return begin() + indicesIt->second; | ||
| } | ||
|
|
||
| iterator find(K k) | ||
| { | ||
| auto indicesIt = indices.find(k); | ||
| if (indicesIt == indices.end()) | ||
| return end(); | ||
| else | ||
| return begin() + indicesIt->second; | ||
| } | ||
|
|
||
| void erase(iterator it) | ||
| { | ||
| if (it == pairs.end()) | ||
| return; | ||
|
|
||
| K k = it->first; | ||
| auto indexIt = indices.find(k); | ||
| if (indexIt == indices.end()) | ||
| return; | ||
|
|
||
| size_t removed = indexIt->second; | ||
| indices.erase(indexIt); | ||
| pairs.erase(it); | ||
|
|
||
| for (auto& [_, index] : indices) | ||
| { | ||
| if (index > removed) | ||
| --index; | ||
| } | ||
| } | ||
|
|
||
| private: | ||
| vec pairs; | ||
| std::unordered_map<K, size_t> indices; | ||
| }; | ||
|
|
||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.