How this analysis was created: This summary and feature list were written by an AI model that read the project's README and public documentation pages. Each feature links to the documentation it came from; stars, license and language come straight from the GitHub API. The model does not read the source code, and the analysis is refreshed when the project is re-analysed. Learn more on our About page.
Now even your pet rock can parse JSON.
The main features of cheery/json-algorithm are: Machine Learning and Vision, System Programming, System Utilities.
Open-source alternatives to cheery/json-algorithm include: infaaa/build-your-own-x-vibe-coding — Master programming by recreating your favorite technologies from scratch with vibe coding. kevmo314/codec-from-scratch — Build a simple video encoder from scratch. emilhernvall/dnsguide — dnsguide is a software implementation of the DNS protocol designed to handle queries and responses between clients and… g-plane/tiny-package-manager — Learn how npm or Yarn v1 works. jamesroutley/write-a-hash-table — This project is a pedagogical implementation of a hash table in C, built from scratch using open addressing and linear… kezhenxu94/cache-lite — An extremely lite-weight cache framework in Kotlin, demonstrating how cache works.
Master programming by recreating your favorite technologies from scratch with vibe coding.
dnsguide is a software implementation of the DNS protocol designed to handle queries and responses between clients and nameservers. It functions as a recursive DNS server and network service tool for managing the resolution of domain names within local or wide area networks. The project provides a framework for building a custom DNS server, incorporating recursive resolution logic and stub resolver integration to translate hostnames into IP addresses. It is designed for implementing the DNS protocol from scratch to facilitate network protocol learning and custom name resolution. The implemen
This project is a pedagogical implementation of a hash table in C, built from scratch using open addressing and linear probing for collision resolution. It serves as a computer science algorithm demo, demonstrating how to construct a fundamental key-value store at a low level. The implementation covers the core operations of an associative array: inserting a key-value pair, looking up a value by its key, and deleting a pair. It uses a hash function to compute storage locations, maps hash values to array indices with the modulo operator, and resolves collisions by scanning sequentially through
