36 Repos
Use of loops and conditional directives to produce repetitive code structures during compilation.
Distinct from Compile-Time Code Generation: Distinct from general code generation: focuses on the use of control flow within macros to generate repetitive code.
Explore 36 awesome GitHub repositories matching software engineering & architecture · Iterative Code Generation. Refine with filters or upvote what's useful.
This project is a curated reference guide and cheatsheet for modern JavaScript development. It provides a collection of syntax and patterns covering ECMAScript standards, specifically focusing on contemporary language features from ES6 and later. The resource offers specialized guides on asynchronous JavaScript, functional programming patterns, and object-oriented design. It details the use of promises and async/await syntax for non-blocking operations, as well as the application of map, filter, and reduce for data transformation. The guide covers a broad range of language fundamentals, incl
Covers the implementation of generators for creating sequences that can pause and resume execution.
Crystal is a statically typed, compiled programming language designed for high performance and memory safety. It leverages an LLVM-based compiler to translate source code into optimized machine-executable binaries, while its type-inference-based static analysis enforces strict safety rules during the build process. The language distinguishes itself through a fiber-based concurrent runtime that manages lightweight execution units for asynchronous input and output without blocking the main process. It also features a powerful compile-time macro system that allows for the inspection and transfor
Iterates through blocks of code repeatedly based on truthy conditions to automate task repetition.
Nim is a statically typed, compiled systems programming language designed for high performance and cross-platform development. It translates high-level source code into C, C++, or JavaScript, allowing developers to produce efficient native binaries or web-compatible scripts from a single codebase. The language emphasizes a clean, indentation-based syntax that simplifies code hierarchy while maintaining the power of a full-featured systems language. What distinguishes Nim is its robust metaprogramming framework, which allows developers to inspect, modify, and generate code structures during th
Provides standard counting constructs and custom iterators for repeating code blocks.
This project is a mathematics programming pattern library and translation guide designed to map academic mathematical symbols and formulas into programmable logic. It serves as a reference for converting complex notations into software implementations. The resource provides mapping guides for translating calculus, linear algebra, and set theory into iterative loops, functional code, and boolean expressions. It includes specific patterns for implementing piecewise functions, matrix operations, and standard mathematical operators using conditional logic and built-in language functions. The lib
Transforms calculus notations such as summations and products into programmable iterative loops.
Sass is a stylesheet compilation engine and CSS preprocessor that extends standard CSS with variables, nested rules, mixins, and functions. It functions as a comprehensive design system tool, enabling developers to organize complex stylesheets into modular, reusable components while automating the transformation of advanced syntax into browser-compatible CSS. The project distinguishes itself through its sophisticated build automation and language-level extensibility. It provides robust support for programmatic style generation, including conditional logic, iterative loops, and unit-aware math
Implements iterative loop constructs to programmatically generate repetitive CSS structures and design patterns.
Lombok is a Java annotation processor and boilerplate reduction library designed to automatically generate repetitive source code. It intercepts the compilation process to inject methods and fields directly into Java classes, acting as a source code generator that eliminates the need to manually write common class patterns. The project distinguishes itself through deep integration with the Java compiler and various integrated development environments. It provides IDE plugins that allow editors to recognize and navigate generated methods, preventing false compilation errors and maintaining syn
Automatically generates standard getters, setters, equals, and hashCode methods to eliminate repetitive coding.
This is a comprehensive tutorial for learning TypeScript, designed for JavaScript programmers who want to understand the language's type system and modern features. The resource covers TypeScript's core identity, including its structural type compatibility, compile-time type erasure, declaration file merging, and the discriminated union pattern for precise type narrowing. The tutorial distinguishes itself by providing a progressive learning path from basic JavaScript concepts to advanced TypeScript patterns. It covers generic type parameter constraints, tuple types with fixed-length positions
Teaches using iterators and generators for custom iteration behavior.
Jackson is a Java data binding framework and multi-format data serializer used to translate data structures into native language objects. It functions as a JSON data binding library and a streaming parser that reads and writes data as discrete tokens to process large datasets with minimal memory. The project distinguishes itself through a bytecode serialization accelerator that replaces standard reflection with generated bytecode to increase data binding speed. It employs a module-based extensibility model to support a wide range of formats beyond JSON, including XML, YAML, CSV, TOML, and bin
Accelerates the reading and writing of object fields by replacing standard reflection with generated bytecode.
R.swift is a resource generator and build tool plugin for Swift projects that creates type-safe accessors for bundle resources. It maps images, colors, localized strings, and bundle files to autocompleted Swift constants, replacing hardcoded string identifiers with strongly typed wrappers to ensure compile-time validation. The system functions as an asset wrapper that integrates into the build process to synchronize resource identifiers with source code. It utilizes static resource analysis to transform project configuration settings, entitlement values, and asset catalogs into a structured A
Creates a type-safe interface for accessing assets to provide autocompletion and prevent runtime crashes.
This is a collection of classic computer science algorithms and data structures implemented from scratch in JavaScript. The project provides reference implementations of fundamental concepts including sorting algorithms, binary search, linked lists, and binary search trees, all built as standalone pure functions with no external dependencies. The implementations cover a range of data structures, including singly-linked, doubly-linked, and circular linked lists with full traversal and mutation operations, as well as binary search trees supporting insertion, deletion, and search. Sorting algori
Uses JavaScript generator functions to provide iterable interfaces for custom data structures.
Traceur is a JavaScript syntax transpiler that transforms modern and next-generation language features into compatible versions for older runtime environments. It functions as a compiler that translates proposed language standards and upcoming syntax into current versions to maintain cross-engine compatibility. The project operates as an asynchronous code transformer, converting async functions and generators into promise-based state machines. It includes a functional tail-call optimizer that wraps recursive functions in trampolines to prevent stack overflows and an ECMAScript polyfill engine
Converts complex iteration and generator logic into simple data traversal patterns compatible with older runtimes.
100 Go Mistakes is a reference book and code review companion that catalogues frequent Go programming anti-patterns and provides corrected implementations for each one. It covers a wide range of common pitfalls, from range loop variable capture and interface nil handling to error wrapping and map iteration randomization, helping developers recognize and avoid these issues in their own code. The project distinguishes itself by offering a structured, example-driven approach to learning idiomatic Go. It covers core design decisions such as when to use pointer versus value receivers, how to apply
Documents the single-evaluation semantics of range expressions in Go loops.
This project is a collection of POSIX-compliant shell functions and polyfills designed to replace external binaries with portable, built-in utility implementations. It serves as a compatibility library and utility kit for shell scripting, providing shell-native alternatives to common command line utilities. The library focuses on removing dependencies on external processes by implementing tasks directly within the shell. This includes the use of shell-native sequences for terminal user interface design, such as text coloring and cursor movement, and the use of built-in pattern matching for te
Implements built-in shell constructs for looping through numeric sequences and file system globs.
Entitas is a data-oriented Entity Component System framework for Unity. It is designed to separate game state into components and logic into systems, utilizing a data-oriented design to optimize CPU cache usage, memory usage, and processing speed. The framework includes a C# source code generator that automatically produces boilerplate classes, entity accessors, and context singletons to reduce manual coding. It also provides a Unity editor debugging tool for real-time runtime state visualization, system performance monitoring, and visual entity inspection. The system manages entity lifecycl
Generates simplified interfaces for manipulating entity components based on field configurations to reduce boilerplate.
Execa is a promise-based process execution library that serves as a wrapper for the Node.js child process module. It functions as a shell command runner and subprocess management tool, simplifying the execution of external commands and binaries. The library distinguishes itself through automatic argument escaping to prevent shell injection and the use of abort signals for graceful process termination. It also provides an inter-process communication wrapper for exchanging structured JSON data and messages between parent and child processes. Its capabilities cover a broad range of process I/O
Uses async generators to filter or modify input and output data streams in real time.
This project is a comprehensive Python coding guide and software engineering resource focused on professional development practices. It provides a detailed collection of idiomatic techniques, design patterns, and architectural strategies to improve code quality and maintainability. The guide emphasizes advanced design patterns such as dependency injection, data-driven design, and the application of SOLID principles for object-oriented design. It distinguishes itself by covering sophisticated structural strategies, including class-based decorators, the separation of interfaces from implementat
Demonstrates the use of the yield keyword to create lazy iterables and reduce iterator boilerplate.
Cleverhans ist eine TensorFlow-Bibliothek für Adversarial Machine Learning, die als Angriffs-Framework, Robustheits-Benchmark und Verteidigungsbibliothek dient. Sie bietet eine Sammlung von Tools zur Generierung von Adversarial Examples, zum Testen der Sicherheit neuronaler Netze und zur Implementierung von Schutzmechanismen, um die Widerstandsfähigkeit von Modellen gegen bösartige Eingaben zu erhöhen. Das Projekt konzentriert sich auf die Erstellung von gestörten Eingaben, die darauf ausgelegt sind, Machine-Learning-Modelle zu falschen Vorhersagen zu verleiten. Es ermöglicht die Bewertung der Stabilität und Genauigkeit von Deep-Learning-Modellen unter Adversarial-Noise und bietet Referenzimplementierungen bekannter Angriffsmethoden zur Identifizierung von Sicherheitslücken. Das Toolkit deckt die Generierung von Adversarial Examples, die Verteidigung von Machine-Learning-Modellen und das Benchmarking der Robustheit neuronaler Netze ab. Es nutzt eine modellagnostische Schnittstelle und differenzierbare Angriffsimplementierungen, um gradientenbasierte Störungen und iterative Optimierungsschleifen auszuführen.
Provides iterative optimization loops to refine adversarial noise within a defined perturbation budget.
From Java To Kotlin - Your Cheat Sheet For Java To Kotlin
Compares Java for-loops with Kotlin's range expressions, downTo, until, and step modifiers.
Swift Algorithms is a library of sequence and collection algorithms for Swift, providing operations for splitting, cycling, combining, and sampling collections with lazy evaluation. It extends Swift's standard library with algorithms that work across all types conforming to Sequence and Collection protocols, enabling efficient data processing without intermediate storage. The library specializes in combinatorial enumeration, generating all possible permutations, combinations, and product sequences from collections for testing and exploration. It also includes utilities for splitting collectio
Implements combinatorial algorithms as stateful iterators that yield elements one at a time.
TecoGAN ist ein Generative Adversarial Network (GAN), das für Video-Super-Resolution entwickelt wurde. Es fungiert als spatio-temporaler Video-Upscaler, der die Auflösung von Videosequenzen erhöht und gleichzeitig qualitativ hochwertige Bilder aus niedrig aufgelösten Eingaben rekonstruiert. Das System nutzt ein Framework für zeitliche Kohärenz, um visuelle Stabilität zu gewährleisten und Flimmern in generierten Frames zu reduzieren. Dies wird durch den Einsatz spatio-temporaler Diskriminatoren erreicht, die sowohl die Qualität einzelner Frames als auch die Bewegungskonsistenz bewerten. Das Projekt deckt das Training und die Optimierung von Generative Adversarial Networks ab, mit besonderem Fokus auf hochauflösende Videorekonstruktion und die Aufrechterhaltung zeitlicher Kohärenz über Frames hinweg.
Utilizes a minimax optimization loop to iteratively train the generator and discriminator to reach a Nash equilibrium.