[github pages](https://zehuichan.github.io/element-components/)
Definitions of Element components
Plugin for integrating Lit-Element components in Piral.
React bindings for the FloPay SDK. Provides a context provider, drop-in checkout form components, individual element components, and hooks.
SRC core includes the theme, Styled properties, and Element components.
Vue3 Nice element components
Connect XState machines with Lit Element components. Similar to `@xstate/react`'s useSelector hook.
Definitions of Element components
Common element components for vue applications.
Documentation and code generation utility for element components.
yzh element-components.
This is a collection of React form element components.
tom-element-components
AI element components for chat interfaces
Context for lit-element components
DCC Character Builder Custom Element Components
andy-element-components
Components is a microframework meant to mount code on top of a DOM element. Components encourage lazyloading of all modules by utilizating events to load the components. However, you are not locked into this behaivor.
Single element components that map to your stylesheet
#### introduce UI element components for Vue 3
Single element components that map to your stylesheet
bs-element-components
table element components ele-components
utils for element components
Virtual-list component to hide off-screen list elements
A Rails Guilded component that will disable form elements once the submit button has been used.
Page object library with an emphasis on simplified navigation and reusable code. It has features geared towards supporting web components (www.webcomponents.org) or any recurring feature in your application. UI automation components that you define are extensions of the DOM and are fully interopable with standard DOM elements and other components.
A way to generate Phlex components from a custom element manifest
A Rails Guilded (http://github.com/midas/guilded/tree/master) component that will disable form elements once the submit button has been used.
An elemental UI component library for Rails, guided by the principle of simplicity.
Pugin is a component-based pattern design library that holds all of the reusable partials, styles and scripts for elements of UK Parliament microservices.
An internal component of the NCS Navigator suite, this gem provides a common view onto shared configuration elements.
In computer science, a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that keeps track of a set of elements partitioned into a number of disjoint (non-overlapping) subsets. It provides near-constant-time operations (bounded by the inverse Ackermann function) to add new sets, to merge existing sets, and to determine whether elements are in the same set. In addition to many other uses (see the Applications section), disjoint-sets play a key role in Kruskal's algorithm for finding the minimum spanning tree of a graph. A disjoint-set forest consists of a number of elements each of which stores an id, a parent pointer, and, in efficient algorithms, a value called the "rank". The parent pointers of elements are arranged to form one or more trees, each representing a set. If an element's parent pointer points to no other element, then the element is the root of a tree and is the representative member of its set. A set may consist of only a single element. However, if the element has a parent, the element is part of whatever set is identified by following the chain of parents upwards until a representative element (one without a parent) is reached at the root of the tree. Forests can be represented compactly in memory as arrays in which parents are indicated by their array index. Disjoint-set data structures model the partitioning of a set, for example to keep track of the connected components of an undirected graph. This model can then be used to determine whether two vertices belong to the same component, or whether adding an edge between them would result in a cycle. The Union–Find algorithm is used in high-performance implementations of unification. This data structure is used by the Boost Graph Library to implement its Incremental Connected Components functionality. It is also a key component in implementing Kruskal's algorithm to find the minimum spanning tree of a graph. Note that the implementation as disjoint-set forests doesn't allow the deletion of edges, even without path compression or the rank heuristic. Sharir and Agarwal report connections between the worst-case behavior of disjoint-sets and the length of Davenport–Schinzel sequences, a combinatorial structure from computational geometry.
The latex-tools gem is a collection of classes that facilitate the writing of various elements of Latex code. It is not designed for authoring entire Latex files, merely their component parts. Right now, it only consists of one such 'tool', LatexTable, which provides an easy and convenient way of outputting Latex code for tables from data in a ruby script.
Pinmark adds a dev-only floating overlay to any Rails app. Click a component or any element on the page, leave a comment, and Claude Code consumes the queue via MCP — closing the loop between visual feedback and source edits. Works with Phlex, ViewComponent, and ERB partials.
scoped_css provides automatic CSS scoping for Rails templates and ViewComponents. It ensures styles are isolated to specific components or templates, preventing CSS conflicts and enabling modular styling. The gem works by automatically adding unique scope identifiers to CSS rules and corresponding HTML elements, making it easy to maintain clean, conflict-free stylesheets in large applications. No CSS preprocessors or postprocessors are required.
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.