| CASTLEVANIA2 BEL | |
| ---------------- | |
| 5 sample(s) captured. | |
| Sample #1 | |
| --------- | |
| HEX: |
| #ifndef WIZ_UNIQUE_PTR_H | |
| #define WIZ_UNIQUE_PTR_H | |
| #include <cstddef> | |
| #include <type_traits> | |
| #ifdef _MSC_VER | |
| #define WIZ_FORCE_INLINE __forceinline | |
| #elif defined(__clang__) || defined(__GNUC__) | |
| #define WIZ_FORCE_INLINE __attribute__((always_inline)) |
| // Linearly interpolate between two values using progress as weight between them. | |
| // | |
| // Arguments: | |
| // b = start (0 .. 255) | |
| // c = end (0 .. 255) | |
| // e = progress (0 .. 64), | |
| // 0 = 100% start, 0% end | |
| // 32 = 50% start, 50% end | |
| // 64 = 0% start; 100% end | |
| // |
| import "ram"; | |
| import "entity"; | |
| import "directions"; | |
| import "random"; | |
| namespace ai_wander { | |
| const direction_wait_base : [u8] = [60]; | |
| const direction_wait_random : [u8] = [60]; | |
| const wander_speed_lo : [u8] = [128]; | |
| const wander_speed_hi : [u8] = [0]; |
| #ifndef WIZ_UTILITY_INT128_H | |
| #define WIZ_UTILITY_INT128_H | |
| #include <cassert> | |
| #include <cstdint> | |
| #include <cstddef> | |
| #include <cstring> | |
| #include <cstdlib> | |
| #include <utility> | |
| #include <string> |
| #ifndef WIZ_UTILITY_VARIANT_H | |
| #define WIZ_UTILITY_VARIANT_H | |
| #include <cstddef> | |
| #include <cassert> | |
| #include <type_traits> | |
| #include <utility> | |
| namespace wiz { | |
| namespace detail { |
| -- This is a dumping ground for some ideas on how to implement compiler internals for wiz. | |
| -- Right now does various transformations + checks on statements and expression trees. | |
| -- It's mostly for me to prototype the type-checking and code-generation stuff. | |
| -- I want to dig myself out of a corner with the language, and writing this in a high-level declarative way is kinda nice. | |
| -- After I'm satisfied with how it roughly works, I want to port the implementation in C++ | |
| -- | |
| -- In particular, I wanted to know how to handle translating expression trees into | |
| -- accumulated/in-place operations on registers, and forbidding any expressions with temporaries. | |
| -- | |
| -- It turns out if an expression tree of left-associative operations branches only on the left side, |
| ; Variable Width Font Library | |
| ; | |
| ; by Andrew G. Crowell (@eggboycolor) | |
| ; | |
| ; -- | |
| ; | |
| ; Copyright (c) 2016 Andrew G. Crowell | |
| ; | |
| ; Permission is hereby granted, free of charge, to any person obtaining a copy of | |
| ; this software and associated documentation files (the "Software"), to deal in |
| #ifndef CLASS_REGISTRY_H | |
| #define CLASS_REGISTRY_H | |
| // Uses sajson: https://github.com/chadaustin/sajson | |
| #include "sajson.h" | |
| #include <unordered_map> | |
| #include <memory> | |
| #include <limits> | |
| #include <functional> |