Insert a path into another path
insert implicit module globals into a module-deps stream
insert a string of css into the <head>
smart-buffer is a Buffer wrapper that adds automatic read & write offset tracking, string operations, data insertions, and more.
Format for representing rich text documents and changes.
Append or Prepend a string with gulp
Cross-browser lib for inserting text at selection in a textarea / input
No description provided.
Access deep object properties using a path
GeoJSON implementation of RBush
An implementation of the Fibonacci heap data structure
GeoJSON implementation of RBush
Node module for inserting lines to an existing file
OT type for rich text
Tools for working with PGlite databases
JSON OT type
Find the index to insert an element in array keeping the sort order.
🐊Putout plugin helps with plugins development
binary heap priority queue
TypeScript definitions for insert-text-at-cursor
string mutation plugin for Rollup
Exponentially Weighted Moving Average
A fully persistent balanced binary search tree
Provides functions for generating ordering strings
Inserts an HTML comment at the beggining and ending of html partials with the path to the partial, so that "view vource" can tell you exactly what partial is responsible for the piece of HTML you're looking at. Limited to files ending with .html,.haml,.erb, and .rhtml and Rails 3.0.x ONLY. See https://github.com/gwshaw/noisy_partials for a 3.1 compatibile version
This is a Rails plugin to insert the path name of a rendered partial view as HTML comment in development environment
Use OrderTree when you need both insertion order access and nested hash path style access
This gem leverages Guard's watch ability to insert files inline within another file. When the parser incounters a //= path/to/file, it then gets the content of that file and then inserts the content replacing the comment. Optionally that file can then be passed through Uglifier. Files with no insertions will just be copied over.
This is a fibonacci-heap priority-queue implementation. That means insert: O(1) decrease_priority: Amortized O(1) delete_min: Amortized O(log n) This project is different from K. Kodamas PQueue in that it allows a decrease key operation. That makes PriorityQueue usable for algorithms like dijkstras shortest path algorithm, while PQueue is more suitable for Heapsort and the like.
Rails engine that tracks ActiveRecord create, update, and destroy events as structured JSON records. Ships a mountable web dashboard, whodunnit actor context, batch inserts via insert_all!, async writes via ActiveJob, time-travel reconstruction, RSpec matchers, Minitest assertions, and a migration path from PaperTrail.
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.
Diff and patch tables
Diff and patch tables
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.