10 个仓库
Methods for counting bits, rotating, swapping bytes, and endian conversion on integer types.
Distinct from Integer Bit Analyzers: Distinct from Integer Bit Analyzers: covers a broader set of bit manipulation operations (rotation, byte swapping, endian conversion) beyond just analysis.
Explore 10 awesome GitHub repositories matching software engineering & architecture · Bit-Level Integer Operations. Refine with filters or upvote what's useful.
Boost is a collection of portable, high-performance source libraries that extend the C++ standard library. It provides a wide range of reusable components, data structures, and algorithms designed to add capabilities to the base language across different platforms. The project is distinguished by its extensive focus on compile-time template metaprogramming and generic programming. It implements advanced architectural patterns such as policy-based design, concept-based type validation, and the use of SFINAE for conditional template resolution to minimize runtime overhead. The library covers a
Generates bit masks for bits or groups of bits using compile-time variables.
The Rust RFCs repository is the formal home for the Rust language evolution process, housing the structured design documents and community review mechanisms that govern changes to the Rust programming language, its compiler, and its standard library. It defines the complete lifecycle for proposing, discussing, and implementing substantial changes through RFC documents, from initial submission and community feedback through final comment periods and sub-team sign-offs. The repository codifies the governance and collaboration processes that shape Rust's development, including mechanisms for com
Defines the standard bit-level operations on integer types used throughout Rust's standard library.
This project is a comprehensive collection of C++ libraries and toolkits providing reference implementations for data structures, graph algorithms, and bitwise logic. It serves as a C++ algorithm reference containing over 180 solved coding problems and a specialized toolkit for competitive programming. The repository distinguishes itself through extensive low-level bit manipulation libraries for parity checks, endianness detection, and XOR-based logic. It also provides a wide array of reference solutions for complex algorithmic challenges involving backtracking, graph theory, and dynamic prog
Provides a comprehensive library of fundamental bitwise operations, masks, and shift-based primitives.
Magic Enum is a C++ library that provides compile-time reflection for enumerations, enabling conversion between enum values and their string names, iteration over enum members, and validation of enum values without relying on macros or external code generation. It uses template metaprogramming and constexpr functions to extract enum information directly from the compiler's internal representation, making the entire reflection process static and free of runtime overhead. The library distinguishes itself through its comprehensive set of compile-time enum utilities, including the ability to coun
Implements enum fusion by encoding two enum indices into a single integer for multi-level switches.
H3 is an open-source library that provides a hierarchical hexagonal grid system for geospatial indexing. It projects the Earth onto an icosahedron and tiles each face with hexagons to minimize distortion, then encodes each hexagon as a 64-bit integer that stores its resolution and position in the hierarchy. This integer encoding enables fast bitwise operations for grid navigation and spatial analysis. The library offers a comprehensive set of grid topology algorithms for computing neighbor relationships, distances, and paths between cells directly on the hexagonal grid without geographic coor
Represents each hexagon as a 64-bit integer encoding its resolution and position for fast bitwise operations.
Algodeck is an open-source collection of flash cards designed for reviewing algorithms, data structures, and system design concepts, specifically curated for technical interview preparation. The project organizes knowledge into atomic question-and-answer pairs and incorporates spaced repetition scheduling to optimize long-term memory retention. The flash card catalog covers a broad range of computer science topics, including classic sorting algorithms like quicksort and mergesort, data structure operations for arrays, trees, heaps, tries, and graphs, as well as bit manipulation techniques for
Ships a collection of bit manipulation functions using masks and shifts for interview preparation.
Rhai is an embedded scripting engine and dynamically typed language designed for integration into Rust applications. It functions as an abstract syntax tree compiler and native interop layer, allowing developers to map Rust types and functions into a scripting environment for bidirectional communication. The project serves as a framework for creating customizable domain-specific languages. It allows for the definition of custom operators, syntax, and restricted execution environments, enabling the creation of specialized languages with tailored functional sets. The engine covers a broad rang
Enables the extraction and modification of individual bits within an integer using intuitive indexing syntax.
me_cleaner 是一组专门的工具,用于解析闪存描述符、剥离固件二进制大对象(blob)以及配置用于管理和执行引擎的硬件级关机。它提供了分析 BIOS 内存转储、提取特定固件区域以及删除非必要二进制模块以减少系统交互面的实用程序。 该项目专门针对 Intel 管理引擎(Management Engine)和可信执行引擎(Trusted Execution Engine)固件映像的清理。这涉及删除二进制 blob 并修改配置位,以强制这些子系统在硬件初始化过程后自动关闭。 该工具集涵盖了固件修改功能,例如从工厂分区中删除压缩块、删除非基础分区以及重新计算分区表以保持映像完整性。
Sets specific hardware flags to force the firmware to shut down after the initial boot process.
Magspoof 是一个硬件卡模拟器和支付终端欺骗工具,旨在无线传输模拟的磁条数据。它作为一个磁条模拟器,产生电磁场来模仿物理卡的模式,从而在没有物理卡的情况下触发标准读卡器。 该项目包含一个服务代码修改器,能够更改磁信号中的特定位。这允许系统禁用支付终端上的芯片和 PIN 要求,强制从芯片回退到刷卡。 该系统支持跨轨道 1、2 和 3 的多轨道数据传输,并利用波形合成将数字数据转换为电磁脉冲。这些功能用于支付终端测试以及关于酒店房卡和门禁系统的访问控制研究。
Modifies specific data bits in the emulated signal to trick payment terminals into ignoring chip requirements.
This repository is a curated guide and implementation library of coding patterns used to solve data structures and algorithms problems. It serves as a technical interview study resource, providing a comprehensive set of strategies and computational logic examples for optimizing time and space complexity. The project focuses on standardized algorithmic patterns, including sliding windows, two pointers, and dynamic programming. It features specific implementations for a wide range of challenges, such as LeetCode problem solutions and specialized techniques like cyclic sort and bitwise XOR opera
Implements binary complement calculation using XOR operations and bitmasks.