Unimatrix CLI

Generates file contents for UnionBank's eCrediting enrollment and transaction files.

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.

Union Find is an algorithm that uses a disjoint-set data structure. It allows us to efficiently connect any items of a given list and to efficiently check whether two items of this list are connected (any degree of separation) or not.

This is a union_find_tree library. It is used for connecting and grouping items. you can connect any object

An unofficial simple unionpay_app gem

Ruby wapper for Unionpay's Open API.

UPOP and UPMP SDK

An unofficial unionpay gem

Allows easy creation of immutable union values, a.k.a. sum-types. Example: APICallResult = UnionValue.new(:success, :failure, :timeout) APICallResult.failure.is_failure? #=> true APICallResult.timeout.is_success? #=> false APICallResult.success(12345).data #=> 12345

Simple and straightforward config & cli options parser library

Universal parser, you must only describe a page wit nokogiri

A command-line tool for managing Unity packages

Generate a unique, random token for ActiveRecord models.

Like uniq -c for ruby arrays

UNIQ systems CI reporter

A distributed unique ID generator inspired by Twitter's Snowflake.

Adds entries to a logfile, only if they don't already exist. The logfile can be on a remote server

Add to your models an easily way to generate uniq numbers

Generate a unique, random token for Active Record.