bluebird VS frozen

0 upto n and 0 thru n. I think I saw it in Bluebird first and really liked it.

Instead of the classic visitor pattern, I found it easier to create a class that basically wraps a big switch statement that switches on an enum representing the kind of expression. You pass it an expression, and based on the enum returned by its kind() function you downcast the expression into the subclass you need. The code is here for reference. My AST code is here.

I am working some again on my Ada-like language bluebird. I am making another attempt to use MLIR as an intermediate IR between the AST and LLVM IR (I made a brief attempt a few months ago just to look into it).

I fworked some more towards adding pointers on my Ada-like programming language bluebird. I've finished adding pointer types and variables (as well as the operators for dereferencing/getting the address of objects), but I still need to add the ability to dereference and assign.

I started to experiment with using MLIR to write a high-level IR for my language bluebird, which will hopefully reduce the work of implementing features I want to add such as generics and ranges, as well as allowing me to eventually write some optimizations. I am also considering rewriting my AST as an MLIR dialect, since MLIR provides a bunch of type-checking/error printing/support infrastructure.

I continued implementing support for references (a restricted form of pointers) in my Ada-like language bluebird. I also am working on adding a cleanup pass between my parser/typechecker to handle stuff like type resolution of literals and constant folding.

I didn’t add too many new features to my Ada-like language bluebird this month because of lots of projects/school stuff.

Here is a link to my optimizer pass setup for reference. This is just a simple optimization pipeline (I think clang has a setup where optimization stages are re-run multiple times to take advantage of inlining making more optimizations possible).

I made some more progress on bluebird, my Ada-like language.

I continued to make progress on the compiler for my Ada-inspired language bluebird. I will have less time to spend on it as classes began earlier last month, but I still hope to continue working on it. Things are getting to the point where adding a new feature isn’t as difficult as it was when doing so often meant writing the supporting code from nothing.

I found this extension that implements "frozen" versions of some C++ containers, but I was wondering if there is a good solution available in the standard library.

A library exists that can produce constexpr hash table based containers.

I use the Frozen library for that. Since the conversions should be known at compile time you can make constexpr hash tables for lookups.

The constexpr dependency of note here is frozen.

In C++, a drop-in replacement for your DSA can provide significant improvements over the standard library. Particularly the standard unordered_map class can be improved by 50% to 100% (e.g. https://github.com/greg7mdp/parallel-hashmap, or for static maps https://github.com/serge-sans-paille/frozen). Of course, recognize that creating a DS/A from scratch is an entire project, and you shouldn't roll your own for an independent codebase.

Technologies (for curious folks): C++17, SFML, Entt, Frozen, Protobuf, spdlog, GoogleTest, GoogleBenchmark, CMake and Dear ImGui for debug purpose.

In the language, I added anonymous array literals. I did some cleanup in the compiler and updated to LLVM 12 from 10 (which was pretty trivial, surprisingly). I also added frozen, a C++ perfect-hashing library, as a dependency to speed up the lookup of keywords in my lexer. The library exploits C++’s constexpr features to generate a perfect hash at compile-time without any separate build step, which is great, and it also provides a drop-in replacement for std::unordered_map that uses the hash.

This is where I plug Frozen :-] https://github.com/serge-sans-paille/frozen

I’ve no idea how hard it is to implement, but return type polymorphism would be nice. Especially returning different things based on the constexpress of the result. And then add Frozen eqivalents of associative containers to the STL, so that, for example constexpr auto set = std::make_set(...) would be frozen::set, and auto set = std::make_set(...) would be std::set.

In which case, I believe the answer your question would be yes: the frozen map.