Chained function calls
backend layer for i18next to chain backends
The fastest Node.js library for formatting terminal text with ANSI colors~!
A backwards-compatible way of streamlining chained function calls in a readable and functional manner
Easily add ANSI colors to your text and symbols in the terminal. A faster drop-in replacement for chalk, kleur and turbocolor (without the dependencies and rendering bugs).
caching layer backend for i18next using browsers localStorage
A tiny EventEmitter-like client and server side library
converts functions into middleware chained function
AWS credential provider that sources credentials from a Node.JS environment.
Ultra compact synchronized promise implementation.
Zero dependencies error that allows creating a chain of errors, preserving the original cause (with TypeScript support)
Simple chained selects. You can choose from two different versions. First version uses uses data attributes to decide content of child select. It does not make any external AJAX queries. Remote version makes external query and builds the child select from
Chained custom errors for Typescript and Javascript. ('Caused by' in error stack)
🌱 A delightful way to use factories in your code.
Simple XML builder for Node.js
a lightweight promise library for node
HDI client library for node.js
Stylish, intuitive and user-friendly prompt system. Fast and lightweight enough for small projects, powerful and extensible enough for the most advanced use cases.
Parses Emmet CSS abbreviation into AST tree
Audited & minimal 0-dependency JS implementation of SHA, RIPEMD, BLAKE, HMAC, HKDF, PBKDF & Scrypt
Hash data structure manipulation functions
An incremental implementation of MurmurHash3
caching layer backend for i18next using react native async storage
cypress plugin to locate react elements by component, props and state
A slice of functional programming to chain ruby services and blocks. Make them flow!
Use to execute function chains persisted in json
memoize function without alias method chain
The idea is to allow for a more functional way of organizing code within a module and being able to chain those methdos together, where the result of the first method serves as the first argument of the next method in the chain.
define DSP-like function chains for your lights
A gem for Ruby that extends send functionality to allow for formatted strings to execute chained sends.
This gem defines the Kernel method "it" that queue and defer method calls. This extends the Symbol#to_proc idiom to support chaining multiple methods. For example, items.collect(&it.to_s.capitalize). This also allows conditionals in case statements, such as: case ... when it > 3 then [etc.]. The method is also aliased as "its", for methods that describe possessives rather than actions, such as items.collect(&its.name.capitalize) [This gem is an extension of Jay Philips' "methodphitamine" gem, updated for ruby 1.9 and gemspec compatibility and adding the case statement functionality.]
A gem that provides logging functionality for ActiveRecord models, storing logs in a separate table with support for log chains, metadata, and different visibility levels.
markov-reloaded provides a simple interface to create markov chains. the system is based on hashes, but provides flexible methods to generate the chains based on any array, and to generate suitable arrays from strings. In addition, version 0.1.0 extends functionality, letting one input strings instead of arrays directly into the analyze method(treating each character as an element) As of version 0.2.0, the generate method gives the user the ability to supply a custom Method object to decide the starting point
Scoped search makes it easy to search your ActiveRecord-based models. It will create a named scope :search_for that can be called with a query string. It will build an SQL query using the provided query string and a definition that specifies on what fields to search. Because the functionality is built on named_scope, the result of the search_for call can be used like any other named_scope, so it can be chained with another scope or combined with will_paginate. Because it uses standard SQL, it does not require any setup, indexers or daemons. This makes scoped_search suitable to quickly add basic search functionality to your application with little hassle. On the other hand, it may not be the best choice if it is going to be used on very large datasets or by a large user base.
StepSequencer is a Ruby gem providing a lightweight, intuitive DSL for defining and orchestrating a sequence of operations, also known as a workflow. Inspired by the functionality of musical sequencers, StepSequencer allows developers to chain together a series of steps that are executed in order, with the capability to halt the sequence based on custom conditions. This gem is particularly useful for scenarios where a set of tasks must be performed in a specific sequence, and where each task might depend on the outcome of the previous one.
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.
No description provided.
No description provided.