super lightweight responsive grid mixin
eslint plugin for rgl components (.rgl files)
React-grid-layout by react-dnd
Refer to https://www.npmjs.com/package/react-grid-layout
regularjs`s text-template compress loader module for webpack
A draggable and resizable grid layout with responsive breakpoints, for React.
regular模板去注释、空格、换行等
A complete and compact Quai library, for dapps, wallets and any other tools.
regular-loader to minimize the space
Regularjs bindings for Redux
WHIP and WHEP clients
A draggable and resizable grid layout with responsive breakpoints, for React.
A draggable and resizable grid layout with responsive breakpoints, for React.
This template provides a minimal setup to get React working in Vite with HMR and some ESLint rules.
regularjs template loader for webpack
No description provided.
Workspace-only MCP server for structural code discovery, symbol lookup, impact analysis, and downstream flow tracing before reading or modifying code.
A draggable and resizable grid layout with responsive breakpoints, for React.
A draggable and resizable grid layout with responsive breakpoints, for React. Includes Flexbox layout support and cross-layout drag and drop.
A draggable and resizable grid layout with responsive breakpoints, for React.
No description provided.
A draggable and resizable grid layout with responsive breakpoints, for React. Modified with enhanced collision handling.
A row based draggable and resizable grid layout with responsive breakpoints, for React.
A draggable and resizable grid layout with responsive breakpoints, for React.
Safe thin wrapper for OpenGL using the gl-rs crate
Core layout engine: compaction, collisions, and layout validation
Dioxus 0.7 bindings for hadrone grid layout engine
Extra adapters and storage helpers for hadrone
Leptos bindings for hadrone grid layout engine
WASM bindings for hadrone engine (JS interop)
Yew bindings for hadrone grid layout engine
A rust front-end framework built on typed-html and dodrio. Use trait objects to decouple view/mutation behaviour and data model.
down into the white wind flow’rs
Command line argument combinator library
Turn a struct into arguments for a `Command`
Macro for the `argley` crate
RGL is a framework for graph data structures and algorithms
This library is based on GRATR and RGL. Graph algorithms currently provided are: * Topological Sort * Strongly Connected Components * Transitive Closure * Rural Chinese Postman * Biconnected
# Introduction Rglpk is a package providing a Ruby wrapper to the [GNU GLPK](http://www.gnu.org/software/glpk/) library. The GLPK (GNU Linear Programming Kit) package is intended for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems. Rglpk (pronounced as "wriggle-pick") is currently in alpha status and the API should be considered subject to change. Rglpk uses [Swig](http://www.swig.org/) to initially wrap the C GLPK library (using a Swig wrapper originally developed by Nigel Galloway) and then a pure Ruby library to wrap the Swig code in a more friendly OO-style.
Gemified RubyEncoder loaders.
libQGLViewer clone using glut
GRATR is a framework for graph data structures and algorithms. This library is a fork of RGL. This version utilizes Ruby blocks and duck typing to greatly simplfy the code. It also supports export to DOT format for display as graphics. GRATR currently contains a core set of algorithm patterns: * Breadth First Search * Depth First Search * A* Search * Floyd-Warshall * Best First Search * Djikstra's Algorithm * Lexicographic Search The algorithm patterns by themselves do not compute any meaningful quantities over graphs, they are merely building blocks for constructing graph algorithms. The graph algorithms in GRATR currently include: * Topological Sort * Strongly Connected Components * Transitive Closure * Rural Chinese Postman * Biconnected
GRATR is a framework for graph data structures and algorithms. This library is a fork of RGL. This version utilizes Ruby blocks and duck typing to greatly simplfy the code. It also supports export to DOT format for display as graphics. GRATR currently contains a core set of algorithm patterns: * Breadth First Search * Depth First Search * A* Search * Floyd-Warshall * Best First Search * Djikstra's Algorithm * Lexicographic Search The algorithm patterns by themselves do not compute any meaningful quantities over graphs, they are merely building blocks for constructing graph algorithms. The graph algorithms in GRATR currently include: * Topological Sort * Strongly Connected Components * Transitive Closure * Rural Chinese Postman * Biconnected
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.