kuma_lib 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 614ea5d2ef2b951d666ba80f3ee7477fa3ed8161689bd1bc80adc14534cac4e6
+  data.tar.gz: 48bf788636c879868d01f15d46905ed28157aa75b18810e45ff4c7f1f432b632
+SHA512:
+  metadata.gz: 562558c90b62b540d4d84bb98024aea7acd320ece7a3b090a296b9be3d74d95515c8b526112887905cb51f32b61332e8c492468198c6fc5a2bfe1fd8e1605276
+  data.tar.gz: 880d2215ed0883a905d7cc4c5ed669a81af53369fbe95ba2bf18b9927bb0651906689de526f2c7cea83e194b1a3ec91f03ff974e5ce7d92b645e5851de423acf

data/.github/workflows/main.yml

@@ -0,0 +1,18 @@
+name: Ruby
+
+on: [push,pull_request]
+
+jobs:
+  build:
+    runs-on: ubuntu-latest
+    steps:
+    - uses: actions/checkout@v2
+    - name: Set up Ruby
+      uses: ruby/setup-ruby@v1
+      with:
+        ruby-version: 2.7.2
+    - name: Run the default task
+      run: |
+        gem install bundler -v 2.2.15
+        bundle install
+        bundle exec rake

data/.gitignore

@@ -0,0 +1,19 @@
+/.bundle/
+/.yardoc
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+*.bundle
+*.so
+*.o
+*.a
+mkmf.log
+
+# rspec failure tracking
+.rspec_status
+
+Gemfile.lock
+.vscode

data/.rspec

@@ -0,0 +1,3 @@
+--format documentation
+--color
+--require spec_helper

data/.ruby-version

@@ -0,0 +1 @@
+2.7.2

data/CHANGELOG.md

@@ -0,0 +1,5 @@
+## [Unreleased]
+
+## [0.1.0] - 2021-03-29
+
+- Initial release

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,84 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+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.
+
+We pledge to act and interact in ways that contribute to an open, welcoming, diverse, inclusive, and healthy community.
+
+## Our Standards
+
+Examples of behavior that contributes to a positive environment for our community include:
+
+* Demonstrating empathy and kindness toward other people
+* Being respectful of differing opinions, viewpoints, and experiences
+* Giving and gracefully accepting constructive feedback
+* Accepting responsibility and apologizing to those affected by our mistakes, and learning from the experience
+* Focusing on what is best not just for us as individuals, but for the overall community
+
+Examples of unacceptable behavior include:
+
+* The use of sexualized language or imagery, and sexual attention or
+  advances of any kind
+* Trolling, insulting or derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or email
+  address, without their explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Enforcement Responsibilities
+
+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.
+
+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.
+
+## Scope
+
+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.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be reported to the community leaders responsible for enforcement at koshiro.kumagai.r7@dc.tohoku.ac.jp. All complaints will be reviewed and investigated promptly and fairly.
+
+All community leaders are obligated to respect the privacy and security of the reporter of any incident.
+
+## Enforcement Guidelines
+
+Community leaders will follow these Community Impact Guidelines in determining the consequences for any action they deem in violation of this Code of Conduct:
+
+### 1. Correction
+
+**Community Impact**: Use of inappropriate language or other behavior deemed unprofessional or unwelcome in the community.
+
+**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.
+
+### 2. Warning
+
+**Community Impact**: A violation through a single incident or series of actions.
+
+**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.
+
+### 3. Temporary Ban
+
+**Community Impact**: A serious violation of community standards, including sustained inappropriate behavior.
+
+**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.
+
+### 4. Permanent Ban
+
+**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.
+
+**Consequence**: A permanent ban from any sort of public interaction within the community.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 2.0,
+available at https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
+
+Community Impact Guidelines were inspired by [Mozilla's code of conduct enforcement ladder](https://github.com/mozilla/diversity).
+
+[homepage]: https://www.contributor-covenant.org
+
+For answers to common questions about this code of conduct, see the FAQ at
+https://www.contributor-covenant.org/faq. Translations are available at https://www.contributor-covenant.org/translations.

data/Gemfile

@@ -0,0 +1,12 @@
+# frozen_string_literal: true
+
+source "https://rubygems.org"
+
+# Specify your gem's dependencies in kuma_lib.gemspec
+gemspec
+
+gem "rake", "~> 13.0"
+
+gem "rake-compiler"
+
+gem "rspec", "~> 3.0"

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2021 Kumagai
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,43 @@
+# KumaLib
+
+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/kuma_lib`. To experiment with that code, run `bin/console` for an interactive prompt.
+
+TODO: Delete this and the text above, and describe your gem
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'kuma_lib'
+```
+
+And then execute:
+
+    $ bundle install
+
+Or install it yourself as:
+
+    $ gem install kuma_lib
+
+## Usage
+
+TODO: Write usage instructions here
+
+## Development
+
+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.
+
+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).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/kuma_lib. 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]/kuma_lib/blob/master/CODE_OF_CONDUCT.md).
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).
+
+## Code of Conduct
+
+Everyone interacting in the KumaLib project's codebases, issue trackers, chat rooms and mailing lists is expected to follow the [code of conduct](https://github.com/[USERNAME]/kuma_lib/blob/master/CODE_OF_CONDUCT.md).

data/Rakefile

@@ -0,0 +1,27 @@
+# frozen_string_literal: true
+
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+
+RSpec::Core::RakeTask.new(:spec)
+
+require "rake/extensiontask"
+
+task build: :compile
+
+Rake::ExtensionTask.new("kuma_lib") do |ext|
+  ext.ext_dir = "ext/kuma_lib"
+  ext.lib_dir = "lib/kuma_lib"
+end
+
+Rake::ExtensionTask.new("priority_queue") do |ext|
+  ext.ext_dir = "ext/priority_queue"
+  ext.lib_dir = "lib/kuma_lib"
+end
+
+Rake::ExtensionTask.new("kuma_set") do |ext|
+  ext.ext_dir = "ext/kuma_set"
+  ext.lib_dir = "lib/kuma_lib"
+end
+
+task default: %i[clobber compile spec]

data/bin/console

@@ -0,0 +1,15 @@
+#!/usr/bin/env ruby
+# frozen_string_literal: true
+
+require "bundler/setup"
+require "kuma_lib"
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+# require "pry"
+# Pry.start
+
+require "irb"
+IRB.start(__FILE__)

data/bin/setup

@@ -0,0 +1,8 @@
+#!/usr/bin/env bash
+set -euo pipefail
+IFS=$'\n\t'
+set -vx
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/docs/ja/kuma_set.md

@@ -0,0 +1,182 @@
+# KumaSet
+
+C++のSetのバインディングです．
+評価関数で整数値を返す任意のオブジェクトを格納できます．
+
+___
+## 特異メソッド
+___
+
+**new {|val| ...} -> KumaSet**
+```ruby
+x = Kumalib::KumaSet.new {|val| val}
+y = Kumalib::KumaSet.new {|val| val.to_i}
+```
+KumaSetのインスタンスを作成します．
+ブロックによってオブジェクトを評価し，その評価値によってオブジェクトが等しいかどうかを確認します．
+そのため，ブロックは必ず64ビット整数を返すようにしてください．
+___
+## インスタンスメソッド
+___
+
+**first -> Object | nil**
+
+**min -> Object | nil**
+```ruby
+x = Kumalib::KumaSet.new {|val| val}
+x << 100 << 0
+x.first # => 0
+```
+評価値最小の要素を返します．
+集合が空の場合は`nil`を返します．
+
+**計算量** `O(1)`
+___
+
+**last -> Object | nil**
+
+**max -> Object | nil**
+```ruby
+x = Kumalib::KumaSet.new {|val| val}
+x << 100 << 0
+x.last # => 100
+```
+評価値最大の要素を返します．
+集合が空の場合は`nil`を返します．
+
+**計算量** `O(1)`
+___
+
+**each -> Enumerator**
+
+**each {|val| ...} -> self**
+```ruby
+x = Kumalib::KumaSet.new {|val| val}
+x << 100 << 0
+i = 0
+x.each {|val| i += val}
+p i # => 100
+```
+各要素に対してブロックを実行します．
+`Enumerable`を`include`しているため，`map`や`to_a`など多くのメソッドがサポートされています．
+ただし次に示すものは再定義しています．
+* `find`
+* `first`
+* `max`
+* `member?`
+* `min`
+
+詳しくは[ルリマ](https://docs.ruby-lang.org/ja/latest/class/Enumerable.html)参照お願いします．
+___
+
+**empty? -> bool**
+```ruby
+x = Kumalib::KumaSet.new {|val| val}
+x.empty? # => true
+```
+集合が空かどうかを返します．
+
+**計算量** `O(1)`
+___
+
+**size -> Integer**
+```ruby
+x = Kumalib::KumaSet.new {|val| val}
+x.size # => 0
+```
+集合の大きさを返します．
+
+**計算量** `O(1)`
+___
+
+**clear -> nil** (破壊的)
+```ruby
+x = Kumalib::KumaSet.new {|val| val}
+x.insert(0)
+x.clear
+x.size # => 0
+```
+集合を空にします．
+
+**計算量** `O(n)` (`n`は集合のサイズ)
+___
+
+**insert(Object) -> bool** (破壊的)
+
+**push(Object, ...) -> nil** (破壊的)
+
+**<< Object -> self** (破壊的)
+```ruby
+x = Kumalib::KumaSet.new {|val| val}
+x.insert(0) # => true
+x.insert(0) # => false
+x.push(1, 2, 1, 3) # => nil
+x.size # => 4
+x << 5 << 0 # => x
+x.szie # => 5
+```
+集合に要素を追加します．
+`insert`は既に同じ評価値のオブジェクトがあれば`false`を，ない場合は`true`を返します．
+
+**計算量** 要素1つ追加するのに`O(log n)` (`n`は集合のサイズ)
+___
+
+**erase(Object) -> bool** (破壊的)
+```ruby
+x = KumaLib::KumaSet.new {|val| val}
+x.push(*(0..3))
+x.erase(0)
+x.to_a # => [1, 2, 3]
+```
+引数と同じ評価値の要素を削除します．
+削除した場合に`true`を，削除しなかった場合に`false`を返します．
+
+**計算量** `O(log n)` (`n`は集合のサイズ)
+___
+
+**include?(Object) -> bool**
+
+**member?(Object) -> bool**
+```ruby
+x = KumaLib::KumaSet.new {|val| val}
+x << 0
+x.include?(0) # => true
+```
+引数と同じ評価値のものが集合に含まれているかどうかを返します．
+
+**計算量** `O(log n)` (`n`は集合のサイズ)
+___
+
+**find(Object) -> Object | nil**
+```ruby
+x = KumaLib::KumaSet.new {|val| val % 2}
+x.push(0, 1)
+x.find(3) # => 1
+```
+引数と同じ評価値の要素を返します．ない場合は`nil`を返します．
+
+**計算量** `O(log n)` (`n`は集合のサイズ)
+___
+
+**lower_bound(Object) -> Object | nil**
+```ruby
+x = KumaLib::KumaSet.new {|val| val}
+x.push(*(0..100))
+x.lower_find(44) # => 44
+```
+引数の評価値以上の評価値最小の要素を返します．
+ない場合は`nil`を返します．
+
+**計算量** `O(log n)` (`n`は集合のサイズ)
+___
+
+**upper_bound(Object) -> Object | nil**
+```ruby
+x = KumaLib::KumaSet.new {|val| val}
+x.push(*(0..100))
+x.upper_bound(44) # => 45
+```
+引数の評価値よりも大きい評価値最小の要素を返します．
+ない場合は`nil`を返します．
+
+**計算量** `O(log n)` (`n`は集合のサイズ)

data/docs/ja/priority_queue.md

@@ -0,0 +1,107 @@
+# Priority_Queue
+
+優先度付きキューです．
+
+___
+## クラスメソッド
+___
+
+**new {|val| ...} -> Priority_Queue**
+```ruby
+x = Kumalib::Priority_Queue.new {|val| val}
+y = Kumalib::Priority_Queue.new {|val| val.to_i}
+```
+Priority_Queueのインスタンスを作成します．
+ブロックによってオブジェクトを評価し，その評価値によってオブジェクト並べます．
+そのため，ブロックは必ず64ビット整数を返すようにしてください．
+___
+## インスタンスメソッド
+___
+**empty? -> bool**
+```ruby
+x = Kumalib::Priority_Queue.new {|val| val}
+x.empty? # => true
+```
+キューが空かどうかを返します．
+
+**計算量** `O(1)`
+___
+
+**size -> Integer**
+```ruby
+x = Kumalib::Priority_Queue.new {|val| val}
+x.size # => 0
+```
+キューのサイズを返します．
+
+**計算量** `O(1)`
+___
+
+**top -> Object | nil**
+```ruby
+x = Kumalib::Priority_Queue.new {|val| val}
+x << 1
+x.top # => 1
+```
+
+キューに含まれる評価値最大のオブジェクトを返します．
+キューが空の場合は`nil`を返します．
+この時キューからの削除は行われません．
+
+**計算量** `O(1)`
+___
+
+**<< Object -> self**
+
+**push(Object, ...) -> nil**
+```ruby
+x = Kumalib::Priority_Queue.new {|val| val}
+x << 1 << 2
+x.push(2, 3, 4)
+x.size # => 5
+```
+
+キューにオブジェクトを追加します．
+
+**計算量** 1つ追加するのに`O(log n)` (`n`はキューのサイズ)
+___
+
+**pop -> nil**
+```ruby
+x = Kumalib::Priority_Queue.new {|val| val}
+x.push(1, 2, 3)
+x.pop
+x.size # => 2
+```
+
+キューに含まれる評価値最大のオブジェクトを削除します．
+
+**計算量** `O(log n)` (`n`はキューのサイズ)
+___
+
+**shift -> Object | nil**
+```ruby
+x = Kumalib::Priority_Queue.new {|val| val}
+x.push(1, 2, 3)
+x.shift # => 3
+x.size # => 2
+```
+
+キューに含まれる評価値最大のオブジェクトを削除して返します．
+キューが空の場合は`nil`を返します．
+つまり，`top`と`pop`を同時に行います．
+
+**計算量** `O(log n)` (`n`はキューのサイズ)
+___
+
+**clear -> nil**
+```ruby
+x = Kumalib::Priority_Queue.new {|val| val}
+x.push(*(0...100))
+x.clear
+x.empty? # => true
+```
+
+キューを空にします．
+
+**計算量** `O(n)` (`n`はキューのサイズ)

data/ext/kuma_lib/extconf.rb

@@ -0,0 +1,6 @@
+# frozen_string_literal: true
+
+require "mkmf"
+
+$CXXFLAGS += " -std=c++17"
+create_makefile("kuma_lib/kuma_lib")

data/ext/kuma_lib/kuma_lib.c

@@ -0,0 +1,9 @@
+#include "kuma_lib.h"
+
+VALUE rb_mKumaLib;
+
+void
+Init_kuma_lib(void)
+{
+  rb_mKumaLib = rb_define_module("KumaLib");
+}

data/ext/kuma_lib/kuma_lib.h

@@ -0,0 +1,6 @@
+#ifndef KUMA_LIB_H
+#define KUMA_LIB_H 1
+
+#include "ruby.h"
+
+#endif /* KUMA_LIB_H */

data/ext/kuma_set/extconf.rb

@@ -0,0 +1,6 @@
+# frozen_string_literal: true
+
+require "mkmf"
+
+$CXXFLAGS += " -std=c++17"
+create_makefile("kuma_set/kuma_set")

data/ext/kuma_set/kuma_set.cpp

@@ -0,0 +1,190 @@
+#include <ruby.h>
+
+#include <set>
+#include <functional>
+
+using ll = long long int;
+using data_t = std::pair<void *, ll>;
+using fn_t = std::function<bool(const data_t&, const data_t&)>;
+using set_t = std::set<data_t, fn_t>;
+
+struct KumaSet : public set_t {
+  private:
+    VALUE _block;
+    inline ll eval(VALUE val) {return NUM2LL(rb_funcall(_block, rb_intern("call"), 1, val));}
+    inline data_t make_data(VALUE val) {return {(void *)val, eval(val)};}
+
+  public:
+    KumaSet(fn_t f, VALUE block) : set_t(f), _block(block) {}
+    VALUE b() {return _block;}
+
+    std::pair<KumaSet::iterator, bool> insert(VALUE val) {return set_t::insert(make_data(val));}
+    int erase(VALUE val) {return set_t::erase(make_data(val));}
+    bool count(VALUE val) {return set_t::count(make_data(val));}
+    KumaSet::iterator find(VALUE val) {return set_t::find(make_data(val));}
+    KumaSet::iterator lower_bound(VALUE val) {return set_t::lower_bound(make_data(val));}
+    KumaSet::iterator upper_bound(VALUE val) {return set_t::upper_bound(make_data(val));}
+};
+
+VALUE rb_mKumaLib, rb_cKumaSet;
+
+fn_t cmp = [](const data_t& d1, const data_t& d2) {
+    return d1.second < d2.second;
+};
+
+struct WrapKumaSet {
+    KumaSet *ks;
+};
+
+////////////////////////////////////////////////////////////////////////////////////////////////////
+
+static void mark_kuma_set(void *ptr) {
+    KumaSet *ks = ((WrapKumaSet *)ptr)->ks;
+    rb_gc_mark(ks->b());
+    for (const data_t& e : *ks) rb_gc_mark(VALUE(e.first));
+}
+
+static void free_kuma_set(void *ptr) {
+    WrapKumaSet *wks = (WrapKumaSet *)ptr;
+    if (wks->ks) delete wks->ks;
+    xfree(ptr);
+}
+
+static size_t memsize_kuma_set(const void *ptr) {
+    return ((WrapKumaSet *)ptr)->ks->size() * sizeof(data_t);
+}
+
+static const rb_data_type_t kuma_set_type {
+    "KumaSet",
+    {mark_kuma_set, free_kuma_set, memsize_kuma_set,},
+    0, 0,
+    0,
+};
+
+////////////////////////////////////////////////////////////////////////////////////////////////////
+
+#define GetWrapKumaSet(obj, wks) \
+    WrapKumaSet *(wks); \
+    TypedData_Get_Struct((obj), WrapKumaSet, &kuma_set_type, (wks))
+
+static VALUE alloc_kuma_set(VALUE klass) {
+    WrapKumaSet *wks;
+    return TypedData_Make_Struct(klass, WrapKumaSet, &kuma_set_type, wks);
+}
+
+static VALUE init_kuma_set(VALUE self) {
+    GetWrapKumaSet(self, wks);
+    VALUE block = rb_block_proc();
+    wks->ks = new KumaSet(cmp, block);
+    return Qnil;
+}
+
+static VALUE first_kuma_set(VALUE self) {
+    GetWrapKumaSet(self, wks);
+    KumaSet::iterator itr = wks->ks->begin();
+    return itr == wks->ks->end() ? Qnil : VALUE(itr->first);
+}
+
+static VALUE last_kuma_set(VALUE self) {
+    GetWrapKumaSet(self, wks);
+    return VALUE(wks->ks->rbegin()->first);
+}
+
+static VALUE each_kuma_set(VALUE self) {
+    RETURN_ENUMERATOR(self, 0, 0);
+    GetWrapKumaSet(self, wks);
+    KumaSet *ks = wks->ks;
+    for (KumaSet::iterator itr = ks->begin(); itr != ks->end(); itr++) rb_yield(VALUE(itr->first));
+    return self;
+}
+
+static VALUE empty_kuma_set(VALUE self) {
+    GetWrapKumaSet(self, wks);
+    return wks->ks->empty() ? Qtrue : Qfalse;
+}
+
+static VALUE size_kuma_set(VALUE self) {
+    GetWrapKumaSet(self, wks);
+    return LL2NUM(wks->ks->size());
+}
+
+static VALUE clear_kuma_set(VALUE self) {
+    GetWrapKumaSet(self, wks);
+    wks->ks->clear();
+    return Qnil;
+}
+
+static VALUE insert_kuma_set(VALUE self, VALUE val) {
+    GetWrapKumaSet(self, wks);
+    return wks->ks->insert(val).second ? Qtrue : Qfalse;
+}
+
+static VALUE push_kuma_set(VALUE self, VALUE val) {
+    GetWrapKumaSet(self, wks);
+    wks->ks->insert(val);
+    return self;
+}
+
+static VALUE push_some_kuma_set(int argc, VALUE *argv, VALUE self) {
+    GetWrapKumaSet(self, wks);
+    for (int i = 0; i < argc; i++) wks->ks->insert(argv[i]);
+    return Qnil;
+}
+
+static VALUE erase_kuma_set(VALUE self, VALUE val) {
+    GetWrapKumaSet(self, wks);
+    return wks->ks->erase(val) ? Qtrue : Qfalse;
+}
+
+static VALUE include_kuma_set(VALUE self, VALUE val) {
+    GetWrapKumaSet(self, wks);
+    return wks->ks->count(val) ? Qtrue : Qfalse;
+}
+
+static VALUE find_kuma_set(VALUE self, VALUE val) {
+    GetWrapKumaSet(self, wks);
+    KumaSet::iterator itr = wks->ks->find(val);
+    return itr == wks->ks->end() ? Qnil : VALUE(itr->first);
+}
+
+static VALUE lower_bound_kuma_set(VALUE self, VALUE val) {
+    GetWrapKumaSet(self, wks);
+    KumaSet::iterator itr = wks->ks->lower_bound(val);
+    return itr == wks->ks->end() ? Qnil : VALUE(itr->first);
+}
+
+static VALUE upper_bound_kuma_set(VALUE self, VALUE val) {
+    GetWrapKumaSet(self, wks);
+    KumaSet::iterator itr = wks->ks->upper_bound(val);
+    return itr == wks->ks->end() ? Qnil : VALUE(itr->first);
+}
+
+////////////////////////////////////////////////////////////////////////////////////////////////////
+
+extern "C" void Init_kuma_set(void) {
+    rb_mKumaLib = rb_define_module("KumaLib");
+    rb_cKumaSet = rb_define_class_under(rb_mKumaLib, "KumaSet", rb_cObject);
+    rb_include_module(rb_cKumaSet, rb_mEnumerable);
+
+    rb_undef_alloc_func(rb_cKumaSet);
+    rb_define_alloc_func(rb_cKumaSet, alloc_kuma_set);
+
+    rb_define_method(rb_cKumaSet, "initialize", init_kuma_set, 0);
+    rb_define_method(rb_cKumaSet, "first", first_kuma_set, 0);
+    rb_define_alias(rb_cKumaSet, "min", "first");
+    rb_define_method(rb_cKumaSet, "last", last_kuma_set, 0);
+    rb_define_alias(rb_cKumaSet, "max", "last");
+    rb_define_method(rb_cKumaSet, "each", each_kuma_set, 0);
+    rb_define_method(rb_cKumaSet, "empty?", empty_kuma_set, 0);
+    rb_define_method(rb_cKumaSet, "size", size_kuma_set, 0);
+    rb_define_method(rb_cKumaSet, "clear", clear_kuma_set, 0);
+    rb_define_method(rb_cKumaSet, "insert", insert_kuma_set, 1);
+    rb_define_method(rb_cKumaSet, "<<", push_kuma_set, 1);
+    rb_define_method(rb_cKumaSet, "push", push_some_kuma_set, -1);
+    rb_define_method(rb_cKumaSet, "erase", erase_kuma_set, 1);
+    rb_define_method(rb_cKumaSet, "include?", include_kuma_set, 1);
+    rb_define_alias(rb_cKumaSet, "member?", "include?");
+    rb_define_method(rb_cKumaSet, "find", find_kuma_set, 1);
+    rb_define_method(rb_cKumaSet, "lower_bound", lower_bound_kuma_set, 1);
+    rb_define_method(rb_cKumaSet, "upper_bound", upper_bound_kuma_set, 1);
+}

data/ext/priority_queue/extconf.rb

@@ -0,0 +1,6 @@
+# frozen_string_literal: true
+
+require "mkmf"
+
+$CXXFLAGS += " -std=c++17"
+create_makefile("priority_queue/priority_queue")

data/ext/priority_queue/priority_queue.cpp

@@ -0,0 +1,149 @@
+#include <ruby.h>
+
+#include <queue>
+#include <functional>
+
+using ll = long long int;
+using data_t = std::pair<void *, ll>;
+using fn_t = std::function<bool(const data_t&, const data_t&)>;
+using pq_t = std::priority_queue<data_t, std::vector<data_t>, fn_t>;
+
+struct PrioQueue : public pq_t {
+  private:
+    VALUE _block;
+    inline ll eval(VALUE val) const {return NUM2LL(rb_funcall(_block, rb_intern("call"), 1, val));}
+
+  public:
+    PrioQueue(fn_t f, VALUE block) : pq_t(f), _block(block) {}
+
+    void mark(void) const {
+        rb_gc_mark(_block);
+        for (const data_t& e : c) rb_gc_mark(VALUE(e.first));
+    }
+
+    void push(VALUE val) {
+        pq_t::push({(void *)val, eval(val)});
+    }
+
+    void clear() {
+        c.clear();
+    }
+};
+
+VALUE rb_mKumaLib, rb_cPrioQueue;
+
+fn_t cmp = [](const data_t& d1, const data_t& d2) {
+    return d1.second < d2.second;
+};
+
+struct WrapPrioQueue {
+    PrioQueue *pq;
+};
+
+////////////////////////////////////////////////////////////////////////////////////////////////////
+
+static void mark_prio_queue(void *ptr) {
+    ((WrapPrioQueue *)ptr)->pq->mark();
+}
+
+static void free_prio_queue(void *ptr) {
+    WrapPrioQueue *wpq = (WrapPrioQueue *)ptr;
+    if (wpq->pq) delete wpq->pq;
+    xfree(ptr);
+}
+
+static size_t memsize_prio_que(const void *ptr) {
+    return ((WrapPrioQueue *)ptr)->pq->size() * sizeof(data_t);
+}
+
+static const rb_data_type_t prio_queue_type {
+    "PriorityQueue",
+    {mark_prio_queue, free_prio_queue, memsize_prio_que,},
+    0, 0,
+    0,
+};
+
+////////////////////////////////////////////////////////////////////////////////////////////////////
+
+#define GetWrapPrioQueue(obj, wpq) \
+    WrapPrioQueue *(wpq); \
+    TypedData_Get_Struct((obj), WrapPrioQueue, &prio_queue_type, (wpq));
+
+static VALUE alloc_prio_queue(VALUE klass) {
+    WrapPrioQueue *wpq = nullptr;
+    return TypedData_Make_Struct(klass, WrapPrioQueue, &prio_queue_type, wpq);
+}
+
+static VALUE init_prio_queue(VALUE self) {
+    VALUE block = rb_block_proc();
+    GetWrapPrioQueue(self, wpq)
+    wpq->pq = new PrioQueue(cmp, block);
+    return Qnil;
+}
+
+static VALUE empty_prio_queue(VALUE self) {
+    GetWrapPrioQueue(self, wpq)
+    return wpq->pq->empty() ? Qtrue : Qfalse;
+}
+
+static VALUE size_prio_queue(VALUE self) {
+    GetWrapPrioQueue(self, wpq)
+    return LL2NUM(wpq->pq->size());
+}
+
+static VALUE top_prio_queue(VALUE self) {
+    GetWrapPrioQueue(self, wpq)
+    return wpq->pq->empty() ? Qnil : VALUE(wpq->pq->top().first);
+}
+
+static VALUE push_prio_queue(VALUE self, VALUE val) {
+    GetWrapPrioQueue(self, wpq)
+    wpq->pq->push(val);
+    return self;
+}
+
+static VALUE push_some_prio_que(int argc, VALUE *argv, VALUE self) {
+    GetWrapPrioQueue(self, wpq);
+    for (int i = 0; i < argc; i++) wpq->pq->push(argv[i]);
+    return Qnil;
+}
+
+static VALUE pop_prio_queue(VALUE self) {
+    GetWrapPrioQueue(self, wpq)
+    wpq->pq->pop();
+    return Qnil;
+}
+
+static VALUE shift_prio_queue(VALUE self) {
+    GetWrapPrioQueue(self, wpq)
+    if (wpq->pq->empty()) return Qnil;
+    VALUE r = VALUE(wpq->pq->top().first);
+    wpq->pq->pop();
+    return r;
+}
+
+static VALUE clear_prio_queue(VALUE self) {
+    GetWrapPrioQueue(self, wpq)
+    wpq->pq->clear();
+    return Qnil;
+}
+
+////////////////////////////////////////////////////////////////////////////////////////////////////
+
+extern "C" void Init_priority_queue(void) {
+    rb_mKumaLib = rb_define_module("KumaLib");
+    rb_cPrioQueue = rb_define_class_under(rb_mKumaLib, "PriorityQueue", rb_cObject);
+
+    rb_undef_alloc_func(rb_cPrioQueue);
+    rb_define_alloc_func(rb_cPrioQueue, alloc_prio_queue);
+
+    rb_define_method(rb_cPrioQueue, "initialize", init_prio_queue, 0);
+    rb_define_method(rb_cPrioQueue, "empty?", empty_prio_queue, 0);
+    rb_define_method(rb_cPrioQueue, "size", size_prio_queue, 0);
+    rb_define_method(rb_cPrioQueue, "top", top_prio_queue, 0);
+    rb_define_method(rb_cPrioQueue, "<<", push_prio_queue, 1);
+    rb_define_method(rb_cPrioQueue, "push", push_some_prio_que, -1);
+    rb_define_method(rb_cPrioQueue, "pop", pop_prio_queue, 0);
+    rb_define_method(rb_cPrioQueue, "shift", shift_prio_queue, 0);
+    rb_define_method(rb_cPrioQueue, "clear", clear_prio_queue, 0);
+}

data/kuma_lib.gemspec

@@ -0,0 +1,42 @@
+# frozen_string_literal: true
+
+require_relative "lib/kuma_lib/version"
+
+Gem::Specification.new do |spec|
+  spec.name          = "kuma_lib"
+  spec.version       = KumaLib::VERSION
+  spec.authors       = ["kumakumarb"]
+  spec.email         = ["rinngo0119@gmail.com"]
+
+  spec.summary       = "atcoder library."
+  # spec.description   = "TODO: Write a longer description or delete this line."
+  spec.homepage      = "https://github.com/kumakumarb/kuma_lib.git"
+  spec.license       = "MIT"
+  spec.required_ruby_version = Gem::Requirement.new(">= 2.4.0")
+
+  # spec.metadata["allowed_push_host"] = "TODO: Set to 'http://mygemserver.com'"
+
+  spec.metadata["homepage_uri"] = spec.homepage
+  spec.metadata["source_code_uri"] = "https://github.com/kumakumarb/kuma_lib.git"
+  spec.metadata["changelog_uri"] = "https://github.com/kumakumarb/kuma_lib.git"
+
+  # Specify which files should be added to the gem when it is released.
+  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
+  spec.files = Dir.chdir(File.expand_path(__dir__)) do
+    `git ls-files -z`.split("\x0").reject { |f| f.match(%r{\A(?:test|spec|features)/}) }
+  end
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{\Aexe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+  spec.extensions    = %w[
+    ext/kuma_lib/extconf.rb
+    ext/priority_queue/extconf.rb
+    ext/kuma_set/extconf.rb
+  ]
+
+  # Uncomment to register a new dependency of your gem
+  # spec.add_dependency "example-gem", "~> 1.0"
+
+  # For more information and examples about making a new gem, checkout our
+  # guide at: https://bundler.io/guides/creating_gem.html
+end

data/lib/kuma_lib.rb

@@ -0,0 +1,11 @@
+# frozen_string_literal: true
+
+require_relative "kuma_lib/version"
+require_relative "kuma_lib/kuma_lib"
+require_relative "kuma_lib/priority_queue"
+require_relative "kuma_lib/kuma_set"
+
+module KumaLib
+  class KumaError < StandardError; end
+  # Your code goes here...
+end

data/lib/kuma_lib/version.rb

@@ -0,0 +1,5 @@
+# frozen_string_literal: true
+
+module KumaLib
+  VERSION = "0.1.0"
+end

metadata

@@ -0,0 +1,73 @@
+--- !ruby/object:Gem::Specification
+name: kuma_lib
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- kumakumarb
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2021-04-02 00:00:00.000000000 Z
+dependencies: []
+description: 
+email:
+- rinngo0119@gmail.com
+executables: []
+extensions:
+- ext/kuma_lib/extconf.rb
+- ext/priority_queue/extconf.rb
+- ext/kuma_set/extconf.rb
+extra_rdoc_files: []
+files:
+- ".github/workflows/main.yml"
+- ".gitignore"
+- ".rspec"
+- ".ruby-version"
+- CHANGELOG.md
+- CODE_OF_CONDUCT.md
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- docs/ja/kuma_set.md
+- docs/ja/priority_queue.md
+- ext/kuma_lib/extconf.rb
+- ext/kuma_lib/kuma_lib.c
+- ext/kuma_lib/kuma_lib.h
+- ext/kuma_set/extconf.rb
+- ext/kuma_set/kuma_set.cpp
+- ext/priority_queue/extconf.rb
+- ext/priority_queue/priority_queue.cpp
+- kuma_lib.gemspec
+- lib/kuma_lib.rb
+- lib/kuma_lib/version.rb
+homepage: https://github.com/kumakumarb/kuma_lib.git
+licenses:
+- MIT
+metadata:
+  homepage_uri: https://github.com/kumakumarb/kuma_lib.git
+  source_code_uri: https://github.com/kumakumarb/kuma_lib.git
+  changelog_uri: https://github.com/kumakumarb/kuma_lib.git
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 2.4.0
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.1.4
+signing_key: 
+specification_version: 4
+summary: atcoder library.
+test_files: []