Project

Reverse Dependencies for bundler

The projects listed here declare bundler as a runtime or development dependency

0.0
No commit activity in last 3 years
No release in over 3 years
Mainly useful for aggregating the logs of all the rails applications in your organization at one place. All the rails app connect to a restful logger where the logs are stored in the database.
2020
2021
2022
2023
2024
2025
0.0
Repository is gone
No release in over 3 years
Unifies many queue implementations under the single interface. Includes both single queue libraries and multiple queue libraries.
2020
2021
2022
2023
2024
2025
0.0
No commit activity in last 3 years
No release in over 3 years
An unified redis interface for redis-rb and em-redis.
2020
2021
2022
2023
2024
2025
0.0
Repository is archived
No commit activity in last 3 years
No release in over 3 years
Send SMS messages using Unifonic Api.
2020
2021
2022
2023
2024
2025
0.0
No release in over 3 years
Low commit activity in last 3 years
Wrap external services in a uniform package.
2020
2021
2022
2023
2024
2025
0.0
Repository is gone
No release in over 3 years
`uniform_resource_identifier` splits URIs according to RFC 3986 using regexp, attempts to check the public suffix using `public_suffix`, and serializes the query string using `active_support` and `addressable`
2020
2021
2022
2023
2024
2025
0.0
The project is in a healthy, maintained state
A gem to detect and differentiate between Traditional Chinese, Simplified Chinese based on Unihan data.
2020
2021
2022
2023
2024
2025
0.0
Low commit activity in last 3 years
No release in over a year
Generates file contents for UnionBank's eCrediting enrollment and transaction files.
2020
2021
2022
2023
2024
2025
0.0
Repository is archived
No commit activity in last 3 years
No release in over 3 years
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 ...
2020
2021
2022
2023
2024
2025
0.0
Repository is gone
No release in over 3 years
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.
2020
2021
2022
2023
2024
2025
0.0
No commit activity in last 3 years
No release in over 3 years
This is a union_find_tree library. It is used for connecting and grouping items. you can connect any object
2020
2021
2022
2023
2024
2025
0.0
No commit activity in last 3 years
No release in over 3 years
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
2020
2021
2022
2023
2024
2025
0.0
Low commit activity in last 3 years
No release in over a year
Simple and straightforward config & cli options parser library
2020
2021
2022
2023
2024
2025
0.0
No release in over 3 years
Universal parser, you must only describe a page wit nokogiri
2020
2021
2022
2023
2024
2025
0.0
No release in over 3 years
Low commit activity in last 3 years
Generate a unique, random token for ActiveRecord models.
2020
2021
2022
2023
2024
2025
0.0
No commit activity in last 3 years
No release in over 3 years
Like uniq -c for ruby arrays
2020
2021
2022
2023
2024
2025