A wrapper package that uses `useInsertionEffect` or a fallback for it
A thing that is a lot like ES6 `Map`, but without iterators, for use in environments where `for..of` syntax and `Map` are not available.
A cache object that deletes the least-recently-used items.
Content insertion plugin for @atlaskit/editor-core
A data structure that combines a hash and an array for fast dictionary lookup and traversal by complex keys.
High-performance 3D spatial index for cuboids (based on R*-tree with bulk loading and bulk insertion algorithms)
Insert missing semicolons, remove unneeded ones.
High-performance (binary) tree and sorted map implementation (AVL, Splay, Radix, Red-Black)
Infer a likely cable insertion center for USB connector footprints from `CircuitJson` PCB geometry.
A JavaScript text diff implementation.
A Node-RED node to connect to a MySQL or a MariaDB database, using TLS (SSL) and compatible with "Caching SHA2 password" authentication method (MySQL >= 8).
Fast and tiny fuzzy-search utility
Returns a copy of an object with its keys sorted
Double-linked lists with comprehensive set of operations (incl. optional self-organizing behaviors)
Media Insert plugin for @atlaskit/editor-core
Parses JavaScript objects into XML
npm package for https://github.com/google/diff-match-patch
No description provided.
Rule plugin for @atlaskit/editor-core
Date plugin for @atlaskit/editor-core
Allow integrators to extend the UI of Planning Center products
Non-dom-event way to catch DOM insertions. Works in IE10+ and filters by selectors.
Set a function's length property
A helper to optimistically set Symbol.toStringTag, when possible.
Uses Postgres's powerful COPY command to upsert large sets of data into ActiveRecord tables
A subclass of Array that offers event hooks for pre-insert/pre-set/pre-delete, insert/set/delete. ::HookedArray offers implicit reference to a configuration instance.
Rangeable is a language-neutral, generic, integer-coordinate closed-interval set container. It pairs hashable elements with their merged disjoint integer ranges and answers three queries: by-element ranges, by-position active set, and by-range transition events. The Ruby reference implementation follows the Rangeable RFC normatively, including idempotent containment fast-path, lazy boundary-event indexing, and first-insert deterministic ordering.
ActiveSeed Gives the ability to seed data by inserting it via activerecord. Also allows you to manage sets of data and seed based on the current environment.
An implementation of Array that permits chaining, where children inherit changes to parent and where parent settings can be overridden in children, and that retains sorted order, ensuring inserted values are unique.
An implementation of Array that permits chaining, where children inherit changes to parent and where parent settings can be overridden in children, and that retains sorted order, ensuring inserted values are unique.
An implementation of Array that permits chaining, where children inherit changes to parent and where parent settings can be overridden in children, and that retains sorted order, ensuring inserted values are unique.
An implementation of Array that permits chaining, where children inherit changes to parent and where parent settings can be overridden in children, and that retains sorted order, ensuring inserted values are unique.
Calculates algorithms and data structures for sorting and searching. Selects best one to use for particular data set. Currently supports: Bubble Sort, Insertion Sort, Selection Sort, Merge Sort, Quick Sort, Heap Sort, Stack, Queue, Linked List, Binary Search Tree
Insert body_id within your application layout's <body> tag. Pages#Index becomes "#page-index" You can overwrite the generated ID with a custom ID from within your controller's action by set @body_id to your desired ID
Class for creating delayed jobs that can be de-duped with existing delayed jobs already in the delayed jobs table. You just specify some additional columns on your delayed_jobs table and set them to have uniqueness constraints. Then specify these column values when you create a UniqueDelayedJob and if a duplicate key is raised on insert, then the insert will just be ignored. There are factory methods for creating a delayed job in the following ways: * with a delayed job handler class (one that responds to perform()) * with an object, method and method arguments * with a code string to be evaled NOTE: you must have delayed_job installed as a gem or plugin
VebTree is a production-quality Van Emde Boas tree implementation providing O(log log U) time complexity for insert, delete, search, successor, and predecessor operations on integer sets. The core algorithm is implemented in C++17 for maximum performance with an idiomatic Ruby API. Perfect for applications requiring fast integer set operations, range queries, and successor/predecessor lookups within a bounded universe.
No description provided.
No description provided.
No description provided.
No description provided.