sorted_containers 0.0.1
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +7 -0
- data/.rspec +3 -0
- data/.rubocop.yml +16 -0
- data/CHANGELOG.md +5 -0
- data/CODE_OF_CONDUCT.md +84 -0
- data/LICENSE.txt +21 -0
- data/README.md +39 -0
- data/Rakefile +12 -0
- data/lib/sorted_containers/sorted_list.rb +174 -0
- data/lib/sorted_containers/sorted_set.rb +65 -0
- data/lib/sorted_containers/version.rb +5 -0
- data/lib/sorted_containers.rb +9 -0
- data/sig/sorted_containers.rbs +4 -0
- metadata +61 -0
checksums.yaml
ADDED
@@ -0,0 +1,7 @@
|
|
1
|
+
---
|
2
|
+
SHA256:
|
3
|
+
metadata.gz: fd886e24f8bbfd92da63127cbd797e35b6df9b0329544c124bcf905cb982c571
|
4
|
+
data.tar.gz: d2dd2c22556f3c68574a98b3d2d48d1e1737631f366ae402f46ac209ed15803b
|
5
|
+
SHA512:
|
6
|
+
metadata.gz: 797036401292e34536feef71b1f16b120f6e06554d64f0a979e738a28c911cc45f819449cb9e87ac6751c92eab3fbfce662a97bb24c8ce45129188b346b6bd96
|
7
|
+
data.tar.gz: 36a7f3a4ebf748e04b33923013b079e21f1b4bdeee41ca57930202f8361cc8a195be8c4f1b4b3580d3ac345a7819e520b92aee57a85bacab239e461e79bd4a49
|
data/.rspec
ADDED
data/.rubocop.yml
ADDED
@@ -0,0 +1,16 @@
|
|
1
|
+
AllCops:
|
2
|
+
TargetRubyVersion: 3.0
|
3
|
+
NewCops: enable
|
4
|
+
|
5
|
+
Metrics/MethodLength:
|
6
|
+
Max: 15
|
7
|
+
|
8
|
+
Metrics/BlockLength:
|
9
|
+
Exclude:
|
10
|
+
- "**/*_spec.rb"
|
11
|
+
|
12
|
+
Style/StringLiterals:
|
13
|
+
EnforcedStyle: double_quotes
|
14
|
+
|
15
|
+
Style/StringLiteralsInInterpolation:
|
16
|
+
EnforcedStyle: double_quotes
|
data/CHANGELOG.md
ADDED
data/CODE_OF_CONDUCT.md
ADDED
@@ -0,0 +1,84 @@
|
|
1
|
+
# Contributor Covenant Code of Conduct
|
2
|
+
|
3
|
+
## Our Pledge
|
4
|
+
|
5
|
+
We as members, contributors, and leaders pledge to make participation in our community a harassment-free experience for everyone, regardless of age, body size, visible or invisible disability, ethnicity, sex characteristics, gender identity and expression, level of experience, education, socio-economic status, nationality, personal appearance, race, religion, or sexual identity and orientation.
|
6
|
+
|
7
|
+
We pledge to act and interact in ways that contribute to an open, welcoming, diverse, inclusive, and healthy community.
|
8
|
+
|
9
|
+
## Our Standards
|
10
|
+
|
11
|
+
Examples of behavior that contributes to a positive environment for our community include:
|
12
|
+
|
13
|
+
* Demonstrating empathy and kindness toward other people
|
14
|
+
* Being respectful of differing opinions, viewpoints, and experiences
|
15
|
+
* Giving and gracefully accepting constructive feedback
|
16
|
+
* Accepting responsibility and apologizing to those affected by our mistakes, and learning from the experience
|
17
|
+
* Focusing on what is best not just for us as individuals, but for the overall community
|
18
|
+
|
19
|
+
Examples of unacceptable behavior include:
|
20
|
+
|
21
|
+
* The use of sexualized language or imagery, and sexual attention or
|
22
|
+
advances of any kind
|
23
|
+
* Trolling, insulting or derogatory comments, and personal or political attacks
|
24
|
+
* Public or private harassment
|
25
|
+
* Publishing others' private information, such as a physical or email
|
26
|
+
address, without their explicit permission
|
27
|
+
* Other conduct which could reasonably be considered inappropriate in a
|
28
|
+
professional setting
|
29
|
+
|
30
|
+
## Enforcement Responsibilities
|
31
|
+
|
32
|
+
Community leaders are responsible for clarifying and enforcing our standards of acceptable behavior and will take appropriate and fair corrective action in response to any behavior that they deem inappropriate, threatening, offensive, or harmful.
|
33
|
+
|
34
|
+
Community leaders have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, and will communicate reasons for moderation decisions when appropriate.
|
35
|
+
|
36
|
+
## Scope
|
37
|
+
|
38
|
+
This Code of Conduct applies within all community spaces, and also applies when an individual is officially representing the community in public spaces. Examples of representing our community include using an official e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event.
|
39
|
+
|
40
|
+
## Enforcement
|
41
|
+
|
42
|
+
Instances of abusive, harassing, or otherwise unacceptable behavior may be reported to the community leaders responsible for enforcement at garrison.jensen@gmail.com. All complaints will be reviewed and investigated promptly and fairly.
|
43
|
+
|
44
|
+
All community leaders are obligated to respect the privacy and security of the reporter of any incident.
|
45
|
+
|
46
|
+
## Enforcement Guidelines
|
47
|
+
|
48
|
+
Community leaders will follow these Community Impact Guidelines in determining the consequences for any action they deem in violation of this Code of Conduct:
|
49
|
+
|
50
|
+
### 1. Correction
|
51
|
+
|
52
|
+
**Community Impact**: Use of inappropriate language or other behavior deemed unprofessional or unwelcome in the community.
|
53
|
+
|
54
|
+
**Consequence**: A private, written warning from community leaders, providing clarity around the nature of the violation and an explanation of why the behavior was inappropriate. A public apology may be requested.
|
55
|
+
|
56
|
+
### 2. Warning
|
57
|
+
|
58
|
+
**Community Impact**: A violation through a single incident or series of actions.
|
59
|
+
|
60
|
+
**Consequence**: A warning with consequences for continued behavior. No interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, for a specified period of time. This includes avoiding interactions in community spaces as well as external channels like social media. Violating these terms may lead to a temporary or permanent ban.
|
61
|
+
|
62
|
+
### 3. Temporary Ban
|
63
|
+
|
64
|
+
**Community Impact**: A serious violation of community standards, including sustained inappropriate behavior.
|
65
|
+
|
66
|
+
**Consequence**: A temporary ban from any sort of interaction or public communication with the community for a specified period of time. No public or private interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, is allowed during this period. Violating these terms may lead to a permanent ban.
|
67
|
+
|
68
|
+
### 4. Permanent Ban
|
69
|
+
|
70
|
+
**Community Impact**: Demonstrating a pattern of violation of community standards, including sustained inappropriate behavior, harassment of an individual, or aggression toward or disparagement of classes of individuals.
|
71
|
+
|
72
|
+
**Consequence**: A permanent ban from any sort of public interaction within the community.
|
73
|
+
|
74
|
+
## Attribution
|
75
|
+
|
76
|
+
This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 2.0,
|
77
|
+
available at https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
|
78
|
+
|
79
|
+
Community Impact Guidelines were inspired by [Mozilla's code of conduct enforcement ladder](https://github.com/mozilla/diversity).
|
80
|
+
|
81
|
+
[homepage]: https://www.contributor-covenant.org
|
82
|
+
|
83
|
+
For answers to common questions about this code of conduct, see the FAQ at
|
84
|
+
https://www.contributor-covenant.org/faq. Translations are available at https://www.contributor-covenant.org/translations.
|
data/LICENSE.txt
ADDED
@@ -0,0 +1,21 @@
|
|
1
|
+
The MIT License (MIT)
|
2
|
+
|
3
|
+
Copyright (c) 2024 Garrison Jensen
|
4
|
+
|
5
|
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
6
|
+
of this software and associated documentation files (the "Software"), to deal
|
7
|
+
in the Software without restriction, including without limitation the rights
|
8
|
+
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
9
|
+
copies of the Software, and to permit persons to whom the Software is
|
10
|
+
furnished to do so, subject to the following conditions:
|
11
|
+
|
12
|
+
The above copyright notice and this permission notice shall be included in
|
13
|
+
all copies or substantial portions of the Software.
|
14
|
+
|
15
|
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
16
|
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
17
|
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
18
|
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
19
|
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
20
|
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
21
|
+
THE SOFTWARE.
|
data/README.md
ADDED
@@ -0,0 +1,39 @@
|
|
1
|
+
# SortedContainers
|
2
|
+
|
3
|
+
TODO: Delete this and the text below, and describe your gem
|
4
|
+
|
5
|
+
Welcome to your new gem! In this directory, you'll find the files you need to be able to package up your Ruby library into a gem. Put your Ruby code in the file `lib/sorted_containers`. To experiment with that code, run `bin/console` for an interactive prompt.
|
6
|
+
|
7
|
+
## Installation
|
8
|
+
|
9
|
+
TODO: Replace `UPDATE_WITH_YOUR_GEM_NAME_IMMEDIATELY_AFTER_RELEASE_TO_RUBYGEMS_ORG` with your gem name right after releasing it to RubyGems.org. Please do not do it earlier due to security reasons. Alternatively, replace this section with instructions to install your gem from git if you don't plan to release to RubyGems.org.
|
10
|
+
|
11
|
+
Install the gem and add to the application's Gemfile by executing:
|
12
|
+
|
13
|
+
$ bundle add UPDATE_WITH_YOUR_GEM_NAME_IMMEDIATELY_AFTER_RELEASE_TO_RUBYGEMS_ORG
|
14
|
+
|
15
|
+
If bundler is not being used to manage dependencies, install the gem by executing:
|
16
|
+
|
17
|
+
$ gem install UPDATE_WITH_YOUR_GEM_NAME_IMMEDIATELY_AFTER_RELEASE_TO_RUBYGEMS_ORG
|
18
|
+
|
19
|
+
## Usage
|
20
|
+
|
21
|
+
TODO: Write usage instructions here
|
22
|
+
|
23
|
+
## Development
|
24
|
+
|
25
|
+
After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake spec` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
|
26
|
+
|
27
|
+
To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and the created tag, and push the `.gem` file to [rubygems.org](https://rubygems.org).
|
28
|
+
|
29
|
+
## Contributing
|
30
|
+
|
31
|
+
Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/sorted_containers. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [code of conduct](https://github.com/[USERNAME]/sorted_containers/blob/main/CODE_OF_CONDUCT.md).
|
32
|
+
|
33
|
+
## License
|
34
|
+
|
35
|
+
The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).
|
36
|
+
|
37
|
+
## Code of Conduct
|
38
|
+
|
39
|
+
Everyone interacting in the SortedContainers project's codebases, issue trackers, chat rooms and mailing lists is expected to follow the [code of conduct](https://github.com/[USERNAME]/sorted_containers/blob/main/CODE_OF_CONDUCT.md).
|
data/Rakefile
ADDED
@@ -0,0 +1,174 @@
|
|
1
|
+
# frozen_string_literal: true
|
2
|
+
|
3
|
+
# The SortedContainers module provides data structures for sorted collections.
|
4
|
+
module SortedContainers
|
5
|
+
class Error < StandardError; end
|
6
|
+
|
7
|
+
# The SortedList class is a sorted list implementation.
|
8
|
+
class SortedList
|
9
|
+
DEFAULT_LOAD_FACTOR = 1000
|
10
|
+
|
11
|
+
attr_reader :size
|
12
|
+
|
13
|
+
# Initializes a new SortedList object.
|
14
|
+
#
|
15
|
+
# @param iterable [Enumerable] An optional iterable object to initialize the list with.
|
16
|
+
def initialize(iterable = [])
|
17
|
+
@lists = []
|
18
|
+
@maxes = []
|
19
|
+
@load_factor = DEFAULT_LOAD_FACTOR
|
20
|
+
@size = 0
|
21
|
+
update(iterable)
|
22
|
+
end
|
23
|
+
|
24
|
+
# Adds a value to the sorted list.
|
25
|
+
#
|
26
|
+
# @param value [Object] The value to add.
|
27
|
+
def add(value)
|
28
|
+
i = bisect_right(@maxes, value)
|
29
|
+
if i == @maxes.size
|
30
|
+
@lists.push([value])
|
31
|
+
@maxes.push(value)
|
32
|
+
else
|
33
|
+
idx = bisect_right(@lists[i], value)
|
34
|
+
@lists[i].insert(idx, value)
|
35
|
+
@maxes[i] = @lists[i].last
|
36
|
+
expand(i) if @lists[i].size > (@load_factor * 2)
|
37
|
+
end
|
38
|
+
@size += 1
|
39
|
+
end
|
40
|
+
|
41
|
+
# Adds a value to the sorted list using the << operator.
|
42
|
+
#
|
43
|
+
# @param value [Object] The value to add.
|
44
|
+
def <<(value)
|
45
|
+
add(value)
|
46
|
+
end
|
47
|
+
|
48
|
+
def remove(value)
|
49
|
+
i = bisect_left(@maxes, value)
|
50
|
+
raise "Value not found: #{value}" if i == @maxes.size
|
51
|
+
|
52
|
+
idx = bisect_left(@lists[i], value)
|
53
|
+
raise "Value not found: #{value}" unless @lists[i][idx] == value
|
54
|
+
|
55
|
+
internal_delete(i, idx)
|
56
|
+
end
|
57
|
+
|
58
|
+
# Retrieves the value at the specified index.
|
59
|
+
#
|
60
|
+
# @param index [Integer] The index of the value to retrieve.
|
61
|
+
# @return [Object] The value at the specified index.
|
62
|
+
def [](index)
|
63
|
+
raise "Index out of range" if index.negative? || index >= @size
|
64
|
+
|
65
|
+
@lists.each do |sublist|
|
66
|
+
return sublist[index] if index < sublist.size
|
67
|
+
|
68
|
+
index -= sublist.size
|
69
|
+
end
|
70
|
+
end
|
71
|
+
|
72
|
+
# Deletes the value at the specified index.
|
73
|
+
#
|
74
|
+
# @param index [Integer] The index of the value to delete.
|
75
|
+
def delete_at(index)
|
76
|
+
raise "Index out of range" if index.negative? || index >= @size
|
77
|
+
|
78
|
+
deleted = false
|
79
|
+
@lists.each_with_index do |sublist, sublist_index|
|
80
|
+
if index < sublist.size
|
81
|
+
internal_delete(sublist_index, index)
|
82
|
+
deleted = true
|
83
|
+
break
|
84
|
+
else
|
85
|
+
index -= sublist.size
|
86
|
+
end
|
87
|
+
end
|
88
|
+
|
89
|
+
raise "Index out of range" unless deleted
|
90
|
+
end
|
91
|
+
|
92
|
+
# Clears the sorted list, removing all values.
|
93
|
+
def clear
|
94
|
+
@lists.clear
|
95
|
+
@maxes.clear
|
96
|
+
@size = 0
|
97
|
+
end
|
98
|
+
|
99
|
+
# Checks if the sorted list contains a value.
|
100
|
+
#
|
101
|
+
# @param value [Object] The value to check.
|
102
|
+
# @return [Boolean] True if the value is found, false otherwise.
|
103
|
+
def contains(value)
|
104
|
+
i = bisect_left(@maxes, value)
|
105
|
+
return false if i == @maxes.size
|
106
|
+
|
107
|
+
sublist = @lists[i]
|
108
|
+
idx = bisect_left(sublist, value)
|
109
|
+
idx < sublist.size && sublist[idx] == value
|
110
|
+
end
|
111
|
+
|
112
|
+
# Converts the sorted list to an array.
|
113
|
+
#
|
114
|
+
# @return [Array] An array representation of the sorted list.
|
115
|
+
def to_a
|
116
|
+
@lists.flatten
|
117
|
+
end
|
118
|
+
|
119
|
+
private
|
120
|
+
|
121
|
+
# Performs a left bisect on the array.
|
122
|
+
#
|
123
|
+
# @param array [Array] The array to bisect.
|
124
|
+
# @param value [Object] The value to bisect with.
|
125
|
+
# @return [Integer] The index where the value should be inserted.
|
126
|
+
def bisect_left(array, value)
|
127
|
+
array.bsearch_index { |x| x >= value } || array.size
|
128
|
+
end
|
129
|
+
|
130
|
+
# Performs a right bisect on the array.
|
131
|
+
#
|
132
|
+
# @param array [Array] The array to bisect.
|
133
|
+
# @param value [Object] The value to bisect with.
|
134
|
+
# @return [Integer] The index where the value should be inserted.
|
135
|
+
def bisect_right(array, value)
|
136
|
+
array.bsearch_index { |x| x > value } || array.size
|
137
|
+
end
|
138
|
+
|
139
|
+
# Expands a sublist if it exceeds the load factor.
|
140
|
+
#
|
141
|
+
# @param sublist_index [Integer] The index of the sublist to expand.
|
142
|
+
def expand(sublist_index)
|
143
|
+
sublist = @lists[sublist_index]
|
144
|
+
return unless sublist.size > (@load_factor * 2)
|
145
|
+
|
146
|
+
half = sublist.slice!(@load_factor, sublist.size - @load_factor)
|
147
|
+
@lists.insert(sublist_index + 1, half)
|
148
|
+
@maxes[sublist_index] = @lists[sublist_index].last
|
149
|
+
@maxes.insert(sublist_index + 1, half.last)
|
150
|
+
end
|
151
|
+
|
152
|
+
# Deletes a value from a sublist.
|
153
|
+
#
|
154
|
+
# @param sublist_index [Integer] The index of the sublist.
|
155
|
+
# @param idx [Integer] The index of the value to delete.
|
156
|
+
def internal_delete(sublist_index, idx)
|
157
|
+
@lists[sublist_index].delete_at(idx)
|
158
|
+
if @lists[sublist_index].empty?
|
159
|
+
@lists.delete_at(sublist_index)
|
160
|
+
@maxes.delete_at(sublist_index)
|
161
|
+
else
|
162
|
+
@maxes[sublist_index] = @lists[sublist_index].last
|
163
|
+
end
|
164
|
+
@size -= 1
|
165
|
+
end
|
166
|
+
|
167
|
+
# Updates the sorted list with values from an iterable object.
|
168
|
+
#
|
169
|
+
# @param iterable [Enumerable] The iterable object to update the list with.
|
170
|
+
def update(iterable)
|
171
|
+
iterable.each { |item| add(item) }
|
172
|
+
end
|
173
|
+
end
|
174
|
+
end
|
@@ -0,0 +1,65 @@
|
|
1
|
+
# frozen_string_literal: true
|
2
|
+
|
3
|
+
require "set"
|
4
|
+
require_relative "sorted_list"
|
5
|
+
|
6
|
+
# A module that provides sorted container data structures.
|
7
|
+
module SortedContainers
|
8
|
+
# The SortedSet class is a sorted set implementation.
|
9
|
+
class SortedSet
|
10
|
+
# Initializes a new instance of the SortedSet class.
|
11
|
+
def initialize
|
12
|
+
@set = Set.new
|
13
|
+
@list = SortedContainers::SortedList.new
|
14
|
+
end
|
15
|
+
|
16
|
+
# Adds an item to the sorted set.
|
17
|
+
#
|
18
|
+
# @param item [Object] The item to be added.
|
19
|
+
def add(item)
|
20
|
+
return if @set.include?(item)
|
21
|
+
|
22
|
+
@set.add(item)
|
23
|
+
@list.add(item)
|
24
|
+
end
|
25
|
+
|
26
|
+
# Adds an item to the sorted set using the `<<` operator.
|
27
|
+
#
|
28
|
+
# @param item [Object] The item to be added.
|
29
|
+
def <<(item)
|
30
|
+
add(item)
|
31
|
+
end
|
32
|
+
|
33
|
+
# Removes an item from the sorted set.
|
34
|
+
#
|
35
|
+
# @param item [Object] The item to be removed.
|
36
|
+
def delete(item)
|
37
|
+
return unless @set.include?(item)
|
38
|
+
|
39
|
+
@set.delete(item)
|
40
|
+
@list.remove(item)
|
41
|
+
end
|
42
|
+
|
43
|
+
# Returns the number of items in the sorted set.
|
44
|
+
#
|
45
|
+
# @return [Integer] The number of items.
|
46
|
+
def size
|
47
|
+
@list.size
|
48
|
+
end
|
49
|
+
|
50
|
+
# Checks if an item is included in the sorted set.
|
51
|
+
#
|
52
|
+
# @param item [Object] The item to be checked.
|
53
|
+
# @return [Boolean] `true` if the item is included, `false` otherwise.
|
54
|
+
def include?(item)
|
55
|
+
@set.include?(item)
|
56
|
+
end
|
57
|
+
|
58
|
+
# Iterates over each item in the sorted set.
|
59
|
+
#
|
60
|
+
# @yield [item] Gives each item to the block.
|
61
|
+
def each(&block)
|
62
|
+
@list.each(&block)
|
63
|
+
end
|
64
|
+
end
|
65
|
+
end
|
metadata
ADDED
@@ -0,0 +1,61 @@
|
|
1
|
+
--- !ruby/object:Gem::Specification
|
2
|
+
name: sorted_containers
|
3
|
+
version: !ruby/object:Gem::Version
|
4
|
+
version: 0.0.1
|
5
|
+
platform: ruby
|
6
|
+
authors:
|
7
|
+
- Garrison Jensen
|
8
|
+
autorequire:
|
9
|
+
bindir: exe
|
10
|
+
cert_chain: []
|
11
|
+
date: 2024-04-16 00:00:00.000000000 Z
|
12
|
+
dependencies: []
|
13
|
+
description: A collection of sorted containers including SortedList, SortedDict, and
|
14
|
+
SortedSet.
|
15
|
+
email:
|
16
|
+
- garrison.jensen@gmail.com
|
17
|
+
executables: []
|
18
|
+
extensions: []
|
19
|
+
extra_rdoc_files: []
|
20
|
+
files:
|
21
|
+
- ".rspec"
|
22
|
+
- ".rubocop.yml"
|
23
|
+
- CHANGELOG.md
|
24
|
+
- CODE_OF_CONDUCT.md
|
25
|
+
- LICENSE.txt
|
26
|
+
- README.md
|
27
|
+
- Rakefile
|
28
|
+
- lib/sorted_containers.rb
|
29
|
+
- lib/sorted_containers/sorted_list.rb
|
30
|
+
- lib/sorted_containers/sorted_set.rb
|
31
|
+
- lib/sorted_containers/version.rb
|
32
|
+
- sig/sorted_containers.rbs
|
33
|
+
homepage: https://www.github.com/GarrisonJ/sorted_containers
|
34
|
+
licenses:
|
35
|
+
- MIT
|
36
|
+
metadata:
|
37
|
+
allowed_push_host: https://rubygems.org
|
38
|
+
homepage_uri: https://www.github.com/GarrisonJ/sorted_containers
|
39
|
+
source_code_uri: https://www.github.com/GarrisonJ/sorted_containers
|
40
|
+
changelog_uri: https://www.github.com/GarrisonJ/sorted_containers/blob/main/CHANGELOG.md
|
41
|
+
rubygems_mfa_required: 'true'
|
42
|
+
post_install_message:
|
43
|
+
rdoc_options: []
|
44
|
+
require_paths:
|
45
|
+
- lib
|
46
|
+
required_ruby_version: !ruby/object:Gem::Requirement
|
47
|
+
requirements:
|
48
|
+
- - ">="
|
49
|
+
- !ruby/object:Gem::Version
|
50
|
+
version: 3.0.0
|
51
|
+
required_rubygems_version: !ruby/object:Gem::Requirement
|
52
|
+
requirements:
|
53
|
+
- - ">="
|
54
|
+
- !ruby/object:Gem::Version
|
55
|
+
version: '0'
|
56
|
+
requirements: []
|
57
|
+
rubygems_version: 3.5.7
|
58
|
+
signing_key:
|
59
|
+
specification_version: 4
|
60
|
+
summary: A collection of sorted containers including SortedList, SortedDict, and SortedSet.
|
61
|
+
test_files: []
|