Project
Reverse Dependencies for rake
The projects listed here declare rake as a runtime or development dependency
0.0
Some deployment-tool-specific tasks to accompany unidad.
2021
2022
2023
2024
2025
2026
0.0
A simple ORM for Rocket's UniData database
2021
2022
2023
2024
2025
2026
0.0
Unidom Common RSpec is a RSpec-based Shared Example for the Unidom Common-based models. Unidom Common RSpec 是为 Unidom Common 设计的基于 RSpec 的共享测试用例。
2021
2022
2023
2024
2025
2026
0.0
Unity Editor installer
2021
2022
2023
2024
2025
2026
0.0
A rubocop configuration gem for UniFa Coding Style Guide.
2021
2022
2023
2024
2025
2026
0.0
A gem for parsign unified diff files into usable Ruby objects
2021
2022
2023
2024
2025
2026
0.0
Unified stateless cross-application CSRF prevention implementation for Rails
2021
2022
2023
2024
2025
2026
0.0
unified hyphen
2021
2022
2023
2024
2025
2026
0.0
iap order veify service for googleplay and amazon and ios
2021
2022
2023
2024
2025
2026
0.0
A Ruby gem that provides a unified interface for integrating with KAMONEY (PIX payments) and NOWPAYMENTS (cryptocurrency payments) APIs
2021
2022
2023
2024
2025
2026
0.0
A Ruby interface to UniFi Controller API.
2021
2022
2023
2024
2025
2026
0.0
Send SMS messages using Unifonic Api.
2021
2022
2023
2024
2025
2026
0.0
Wrap external services in a uniform package.
2021
2022
2023
2024
2025
2026
0.0
A gem to detect and differentiate between Traditional Chinese, Simplified Chinese based on Unihan data.
2021
2022
2023
2024
2025
2026
0.0
Unimatrix CLI
2021
2022
2023
2024
2025
2026
0.0
The union library provides an analog to a C/C++ union for Ruby.
In this implementation a union is a kind of struct where multiple
members may be defined, but only one member ever contains a non-nil
value at any given time.
2021
2022
2023
2024
2025
2026
0.0
Generates file contents for UnionBank's eCrediting enrollment and transaction files.
2021
2022
2023
2024
2025
2026
0.0
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 ...
2021
2022
2023
2024
2025
2026
0.0
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.
2021
2022
2023
2024
2025
2026