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 ...

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

Union types for Ruby

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

Universal parser, you must only describe a page wit nokogiri

Unipass client API

Command line interface to the Unipept (http://unipept.ugent.be) web services (pept2lca, taxa2lca, pept2taxa, pept2prot and taxonomy) and some utility commands for handling proteins using the command line.

A command-line tool for managing Unity packages

Generate a unique, random token for ActiveRecord models.

Like uniq -c for ruby arrays

Find first uniq character in a string

UNIQ systems CI reporter

Simple utility to manage UNIQ Systems corporate gem repository, makes it easier to upload gems to the local gem repository.

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

Add an uniq identifier on your models