1
Fork 0
mirror of https://github.com/RGBCube/serenity synced 2025-07-28 04:37:44 +00:00

Everywhere: Fix spelling mistakes

This commit is contained in:
mjz19910 2022-01-07 05:04:05 -07:00 committed by Linus Groh
parent 168063819d
commit 10ec98dd38
56 changed files with 90 additions and 90 deletions

View file

@ -293,7 +293,7 @@ if (BUILD_LAGOM)
# ELF
file(GLOB LIBELF_SOURCES CONFIGURE_DEPENDS "../../Userland/Libraries/LibELF/*.cpp")
# There's no way we can reliably make the dymamic loading classes cross platform
# There's no way we can reliably make the dynamic loading classes cross platform
list(FILTER LIBELF_SOURCES EXCLUDE REGEX ".*Dynamic.*.cpp$")
lagom_lib(ELF elf
SOURCES ${LIBELF_SOURCES}
@ -316,9 +316,9 @@ if (BUILD_LAGOM)
# GL
file(GLOB LIBGL_SOURCES CONFIGURE_DEPENDS "../../Userland/Libraries/LibGL/*.cpp")
file(GLOB LIBGL_TEX_SCOURCES CONFIGURE_DEPENDS "../../Userland/Libraries/LibGL/Tex/*.cpp")
file(GLOB LIBGL_TEX_SOURCES CONFIGURE_DEPENDS "../../Userland/Libraries/LibGL/Tex/*.cpp")
lagom_lib(GL gl
SOURCES ${LIBGL_SOURCES} ${LIBGL_TEX_SCOURCES}
SOURCES ${LIBGL_SOURCES} ${LIBGL_TEX_SOURCES}
LIBS m LagomGfx LagomSoftGPU)
# GUI-GML

View file

@ -14,7 +14,7 @@ Lagom can be used to fuzz parts of SerenityOS's code base. Fuzzers can be run lo
### Fuzzing locally
Lagom can be used to fuzz parts of SerenityOS's code base. This requires buildling with `clang`, so it's convenient to use a different build directory for that. Fuzzers work best with Address Sanitizer enabled. Run CMake like this:
Lagom can be used to fuzz parts of SerenityOS's code base. This requires building with `clang`, so it's convenient to use a different build directory for that. Fuzzers work best with Address Sanitizer enabled. Run CMake like this:
# From the root of the SerenityOS checkout:
cmake -GNinja -S Meta/Lagom -B Build/lagom-fuzzers \

View file

@ -53,7 +53,7 @@ public:
IndexType ensure(StorageType value)
{
// We maintain a set of unique values in two structures: a vector which stores the values in
// the order they are added, and a hash map which maps that value to its index in the vetor.
// the order they are added, and a hash map which maps that value to its index in the vector.
// The vector is to ensure the values are generated in an easily known order, and the map is
// to allow quickly deciding if a value is actually unique (otherwise, we'd have to linearly
// search the vector for each value).