ot-rb 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: ff6ebc3c63eb7cddc35d2a2e974d08e27328e88615a23c3c102f4165a1ea1a80
+  data.tar.gz: ffd46651184fe4c2d3c6e1894900965a17ac896bdd0a591caca93f3592dcfccd
+SHA512:
+  metadata.gz: f696afed273698e5a949149bb75b30dc547469cda8e4f6339346ec6168c80eee01b78c3778ace6b1756980b17f328635ef17d267c9b4b0acd5d5ace13ea6c1e5
+  data.tar.gz: 12e643d93c95accba36293795c8461499c97f4ab62474b750a2031929ec2717d295f19dfa5b1c792af576ecd695eb41804329ba18aed35841422b040caa682d4

data/.rspec

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

data/.rubocop.yml

@@ -0,0 +1,45 @@
+AllCops:
+  TargetRubyVersion: 3.0
+
+Style/Documentation:
+  Enabled: false
+
+Style/NumericPredicate:
+  Exclude:
+    - 'lib/ot/text_operation.rb'
+
+Style/SelfAssignment:
+  Exclude:
+    - 'lib/ot/text_operation.rb'
+
+Style/StringLiterals:
+  Enabled: true
+  EnforcedStyle: double_quotes
+
+Style/StringLiteralsInInterpolation:
+  Enabled: true
+  EnforcedStyle: double_quotes
+
+Style/IfUnlessModifier:
+  Exclude:
+    - 'lib/ot/text_operation.rb'
+
+Layout/LineLength:
+  Enabled: false
+
+Lint/MissingCopEnableDirective:
+  Exclude:
+    - 'lib/ot/text_operation.rb'
+
+Metrics:
+  Enabled: false
+
+Naming:
+  Exclude:
+    - 'lib/ot/text_operation.rb'
+
+Naming/FileName:
+  AllowedAcronyms:
+    - OT
+  Exclude:
+    - 'lib/ot-rb.rb'

data/CHANGELOG.md

@@ -0,0 +1,5 @@
+## [Unreleased]
+
+## [0.1.0] - 2023-07-11
+
+- 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 tomo.asleep@gmail.com. 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,14 @@
+# frozen_string_literal: true
+
+source "https://rubygems.org"
+
+# Specify your gem's dependencies in ot-rb.gemspec
+gemspec
+
+gem "rake", "~> 13.0"
+gem "rspec", "~> 3.0"
+gem "rubocop", "~> 1.21"
+
+gem "bump", "~> 0.10.0"
+gem "debug", "~> 1.8"
+gem "rspec-debug"

data/LICENSE.md

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2023 Tomoya Chiba
+
+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,60 @@
+# ot-rb
+
+ot-rb is a port of [ot.js](https://github.com/Operational-Transformation/ot.js) for Ruby.
+
+TODO: Delete this and the text below, and describe your gem
+
+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/ot/rb`. To experiment with that code, run `bin/console` for an interactive prompt.
+
+## Installation
+
+TODO: Replace `UPDATE_WITH_YOUR_GEM_NAME_PRIOR_TO_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.
+
+Install the gem and add to the application's Gemfile by executing:
+
+    $ bundle add ot-rb
+
+If bundler is not being used to manage dependencies, install the gem by executing:
+
+    $ gem install ot-rb
+
+## Usage
+
+```ruby
+require 'ot'
+
+operation1 = OT::TextOperation.new
+operation1.retain(1)
+operation1.delete("o")
+operation1.insert("i")
+operation1.retain(2)
+
+operation1.apply("hoge") # => "hige"
+
+operation2 = OT::TextOperation.new
+operation2.delete("ho")
+operation2.insert("mayu")
+operation2.retain(2)
+
+operation1t, operation2t = OT::TextOperation.transform(operation1, operation2)
+
+operation2t.apply(operation1.apply("hoge")) # => "mayuige"
+operation1t.apply(operation2.apply("hoge")) # => "mayuige"
+
+operation1.compose(operation2t).apply("hoge") # => "mayuige"
+operation2.compose(operation1t).apply("hoge") # => "mayuige"
+```
+
+## 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/tomoasleep/ot-rb. 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/tomoasleep/ot-rb/blob/main/CODE_OF_CONDUCT.md).
+
+## Code of Conduct
+
+Everyone interacting in the Ot::Rb project's codebases, issue trackers, chat rooms and mailing lists is expected to follow the [code of conduct](https://github.com/tomoasleep/ot-rb/blob/main/CODE_OF_CONDUCT.md).

data/Rakefile

@@ -0,0 +1,13 @@
+# frozen_string_literal: true
+
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+require "bump/tasks"
+
+RSpec::Core::RakeTask.new(:spec)
+
+require "rubocop/rake_task"
+
+RuboCop::RakeTask.new
+
+task default: %i[spec rubocop]

data/lib/ot/text_operation/build_dsl.rb

@@ -0,0 +1,33 @@
+# frozen_string_literal: true
+
+module OT
+  class TextOperation
+    module Builder
+      module_function
+
+      # @param base [String]
+      # @param from [Integer]
+      # @param delete [Integer, String, nil]
+      # @param insert [String, nil]
+      # @return [TextOperation]
+      def replace(base, from:, delete: nil, insert: nil)
+        delete_length = delete.is_a?(String) ? delete.length : delete || 0
+        insert_length = insert.is_a?(String) ? insert.length : insert || 0
+
+        to = TextOperation.new
+
+        to.retain(from) if from.positive?
+
+        to.delete(delete_length) if delete_length.positive?
+
+        to.insert(insert) if insert_length.positive?
+
+        remain = base.length - from - delete_length
+
+        to.retain(remain) if remain.positive?
+
+        to
+      end
+    end
+  end
+end

data/lib/ot/text_operation/iterator.rb

@@ -0,0 +1,32 @@
+# frozen_string_literal: true
+
+module OT
+  class TextOperation
+    # Simplify iteration of ops in QiitaTeam::OT::TextOperation.
+    #
+    # This class is not a part of original ot.js but is used to port ot.js to Ruby.
+    class Iterator
+      # @return [QiitaTeam::OT::TextOperation]
+      attr_reader :text_operation
+
+      # @param [QiitaTeam::OT::TextOperation] text_operation
+      def initialize(text_operation)
+        @text_operation = text_operation
+      end
+
+      # @return [String, Integer, nil]
+      def next
+        enumerator.next
+      rescue StopIteration
+        nil
+      end
+
+      private
+
+      # @return [Enumerator<String, Integer>]
+      def enumerator
+        @enumerator ||= text_operation.ops.to_enum
+      end
+    end
+  end
+end

data/lib/ot/text_operation.rb

@@ -0,0 +1,382 @@
+# frozen_string_literal: true
+
+# This is a port of ot.js to Ruby.
+# https://github.com/Operational-Transformation/ot.js/blob/v0.0.15/lib/text-operation.js
+
+# Copyright (c) 2012-2014 Tim Baumann, http://timbaumann.info
+# Released under the MIT license
+# https://opensource.org/licenses/mit-license.php
+
+module OT
+  class TextOperation
+    # @return [Array<String, Integer>]
+    attr_reader :ops
+
+    # @return [Integer]
+    attr_reader :base_length
+
+    # @return [Integer]
+    attr_reader :target_length
+
+    def initialize
+      @ops = []
+      @base_length = 0
+      @target_length = 0
+    end
+
+    class << self
+      # @param op [Integer, String]
+      def retain?(op)
+        op.is_a?(Integer) && op > 0
+      end
+
+      # @param op [Integer, String]
+      def insert?(op)
+        op.is_a?(String)
+      end
+
+      # @param op [Integer, String]
+      def delete?(op)
+        op.is_a?(Integer) && op < 0
+      end
+    end
+
+    # @param n [Integer]
+    # @return [TextOperation]
+    def retain(n)
+      raise ArgumentError, "retain expects an integer" unless n.is_a?(Integer)
+      return self if n == 0
+
+      @base_length += n
+      @target_length += n
+
+      if self.class.retain?(ops.last)
+        ops[-1] += n
+      else
+        ops.push(n)
+      end
+
+      self
+    end
+
+    # @param str [String]
+    # @return [TextOperation]
+    def insert(str)
+      raise ArgumentError, "insert expects a string" unless str.is_a?(String)
+      return self if str.empty?
+
+      @target_length += str.length
+
+      if self.class.insert?(ops[-1])
+        ops[-1] += str
+      elsif self.class.delete?(ops[-1])
+        # It doesn't matter when an operation is applied whether the operation
+        # is delete(3), insert("something") or insert("something"), delete(3).
+        # Here we enforce that in this case, the insert op always comes first.
+        # This makes all operations that have the same effect when applied to
+        # a document of the right length equal in respect to the `equals` method.
+        if self.class.insert?(ops[-2])
+          ops[-2] += str
+        else
+          ops.push(ops[-1])
+          ops[-2] = str
+        end
+      else
+        ops.push(str)
+      end
+
+      self
+    end
+
+    # @param n [Integer, String]
+    # @return [TextOperation]
+    def delete(n)
+      n = n.length if n.is_a?(String)
+      raise ArgumentError, "delete expects an integer or a string" unless n.is_a?(Integer)
+      return self if n == 0
+
+      n = -n if n > 0
+      @base_length -= n
+
+      if self.class.delete?(ops[-1])
+        ops[-1] += n
+      else
+        ops.push(n)
+      end
+
+      self
+    end
+
+    def noop?
+      ops.empty? || (ops.length == 1 && self.class.retain?(ops[0]))
+    end
+
+    # @return [String]
+    def to_s
+      ops.map do |op|
+        if self.class.retain?(op)
+          "retain #{op}"
+        elsif self.class.insert?(op)
+          "insert '#{op}'"
+        else
+          "delete #{-op}"
+        end
+      end.join(", ")
+    end
+
+    # Apply an operation to a string, returning a new string. Throws an error if
+    # there's a mismatch between the input string and the operation.
+    #
+    # @param text [String]
+    # @return [String]
+    def apply(text)
+      if text.length != base_length
+        raise ArgumentError, "The operation's base length must be equal to the string's length."
+      end
+
+      new_text = []
+      pos = 0
+
+      ops.each do |op|
+        if self.class.retain?(op)
+          new_text.push(text[pos...(pos + op)])
+          pos += op
+        elsif self.class.insert?(op)
+          new_text.push(op)
+        else
+          pos -= op
+        end
+      end
+
+      raise ArgumentError, "The operation didn't operate on the whole string." if pos != text.length
+
+      new_text.join
+    end
+
+    # Compose merges two consecutive operations into one operation, that
+    # preserves the changes of both. Or, in other words, for each input string S
+    # and a pair of consecutive operations A and B,
+    # apply(apply(S, A), B) = apply(S, compose(A, B)) must hold.
+    #
+    # @param operation2 [TextOperation]
+    # @return [TextOperation]
+    def compose(operation2)
+      operation1 = self
+      raise ArgumentError, "The base length of the second operation has to be the target length of the first operation" if operation1.target_length != operation2.base_length
+
+      operation = TextOperation.new
+
+      ops1 = TextOperation::Iterator.new(operation1)
+      ops2 = TextOperation::Iterator.new(operation2)
+
+      op1 = ops1.next
+      op2 = ops2.next
+
+      loop do
+        # Dispatch on the type of op1 and op2
+        if op1.nil? && op2.nil?
+          # end condition: both ops1 and ops2 have been processed
+          break
+        end
+
+        if self.class.delete?(op1)
+          operation.delete(op1)
+          op1 = ops1.next
+          next
+        end
+        if self.class.insert?(op2)
+          operation.insert(op2)
+          op2 = ops2.next
+          next
+        end
+
+        raise "Cannot compose operations: first operation is too short." if op1.nil?
+        raise "Cannot compose operations: first operation is too long." if op2.nil?
+
+        if self.class.retain?(op1) && self.class.retain?(op2)
+          if op1 > op2
+            operation.retain(op2)
+            op1 = op1 - op2
+            op2 = ops2.next
+          elsif op1 == op2
+            operation.retain(op1)
+            op1 = ops1.next
+            op2 = ops2.next
+          else
+            operation.retain(op1)
+            op2 = op2 - op1
+            op1 = ops1.next
+          end
+        elsif self.class.insert?(op1) && self.class.delete?(op2)
+          if op1.length > -op2
+            op1 = op1.slice(-op2..)
+            op2 = ops2.next
+          elsif op1.length == -op2
+            op1 = ops1.next
+            op2 = ops2.next
+          else
+            op2 = op2 + op1.length
+            op1 = ops1.next
+          end
+        elsif self.class.insert?(op1) && self.class.retain?(op2)
+          if op1.length > op2
+            operation.insert(op1.slice(0..(op2 - 1)))
+            op1 = op1.slice(op2..)
+            op2 = ops2.next
+          elsif op1.length == op2
+            operation.insert(op1)
+            op1 = ops1.next
+            op2 = ops2.next
+          else
+            operation.insert(op1)
+            op2 = op2 - op1.length
+            op1 = ops1.next
+          end
+        elsif self.class.retain?(op1) && self.class.delete?(op2)
+          if op1 > -op2
+            operation.delete(op2)
+            op1 = op1 + op2
+            op2 = ops2.next
+          elsif op1 == -op2
+            operation.delete(op2)
+            op1 = ops1.next
+            op2 = ops2.next
+          else
+            operation.delete(op1)
+            op2 = op2 + op1
+            op1 = ops1.next
+          end
+        else
+          raise "This shouldn't happen: op1: #{op1.inspect}, op2: #{op2.inspect}"
+        end
+      end
+
+      operation
+    end
+
+    # Transform takes two operations A and B that happened concurrently and
+    # produces two operations A' and B' (in an array) such that
+    # `apply(apply(S, A), B') = apply(apply(S, B), A')`. This function is the
+    # heart of OT.
+    #
+    # @param operation1 [TextOperation]
+    # @param operation2 [TextOperation]
+    # @return [(TextOperation, TextOperation))]
+    def self.transform(operation1, operation2)
+      raise ArgumentError, "Both operations have to have the same base length." if operation1.base_length != operation2.base_length
+
+      operation1_prime = TextOperation.new
+      operation2_prime = TextOperation.new
+
+      ops1 = TextOperation::Iterator.new(operation1)
+      ops2 = TextOperation::Iterator.new(operation2)
+
+      op1 = ops1.next
+      op2 = ops2.next
+
+      loop do
+        # At every iteration of the loop, the imaginary cursor that both
+        # operation1 and operation2 have that operates on the input string must
+        # have the same position in the input string.
+
+        if op1.nil? && op2.nil?
+          # end condition: both ops1 and ops2 have been processed
+          break
+        end
+
+        # next two cases: one or both ops are insert ops
+        # => insert the string in the corresponding prime operation, skip it in
+        # the other one. If both op1 and op2 are insert ops, prefer op1.
+        if insert?(op1)
+          operation1_prime.insert(op1)
+          operation2_prime.retain(op1.length)
+
+          op1 = ops1.next
+          next
+        end
+        if insert?(op2)
+          operation1_prime.retain(op2.length)
+          operation2_prime.insert(op2)
+
+          op2 = ops2.next
+          next
+        end
+
+        raise "Cannot compose operations: first operation is too short." if op1.nil?
+        raise "Cannot compose operations: first operation is too long." if op2.nil?
+
+        minl = nil
+        if retain?(op1) && retain?(op2)
+          # Simple case: retain/retain
+          if op1 > op2
+            minl = op2
+            op1 = op1 - op2
+            op2 = ops2.next
+          elsif op1 == op2
+            minl = op2
+            op1 = ops1.next
+            op2 = ops2.next
+          else
+            minl = op1
+            op2 = op2 - op1
+            op1 = ops1.next
+          end
+          operation1_prime.retain(minl)
+          operation2_prime.retain(minl)
+        elsif delete?(op1) && delete?(op2)
+          # Both operations delete the same string at the same position. We don't
+          # need to produce any operations, we just skip over the delete ops and
+          # handle the case that one operation deletes more than the other.
+          if -op1 > -op2
+            op1 = op1 - op2
+            op2 = ops2.next
+          elsif op1 == op2
+            op1 = ops1.next
+            op2 = ops2.next
+          else
+            op2 = op2 - op1
+            op1 = ops1.next
+          end
+          # next two cases: delete/retain and retain/delete
+        elsif delete?(op1) && retain?(op2)
+          if -op1 > op2
+            minl = op2
+            op1 = op1 + op2
+            op2 = ops2.next
+          elsif -op1 == op2
+            minl = op2
+            op1 = ops1.next
+            op2 = ops2.next
+          else
+            minl = -op1
+            op2 = op2 + op1
+            op1 = ops1.next
+          end
+          operation1_prime.delete(minl)
+        elsif retain?(op1) && delete?(op2)
+          if op1 > -op2
+            minl = -op2
+            op1 = op1 + op2
+            op2 = ops2.next
+          elsif op1 == -op2
+            minl = op1
+            op1 = ops1.next
+            op2 = ops2.next
+          else
+            minl = op1
+            op2 = op2 + op1
+            op1 = ops1.next
+          end
+          operation2_prime.delete(minl)
+        else
+          raise "The two operations aren't compatible"
+        end
+      end
+
+      [operation1_prime, operation2_prime]
+    end
+  end
+end
+
+require_relative "text_operation/build_dsl"
+require_relative "text_operation/iterator"

data/lib/ot/version.rb

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

data/lib/ot-rb.rb

@@ -0,0 +1,3 @@
+# frozen_string_literal: true
+
+require_relative "ot"

data/lib/ot.rb

@@ -0,0 +1,7 @@
+# frozen_string_literal: true
+
+module OT
+end
+
+require_relative "ot/version"
+require_relative "ot/text_operation"

data/sig/ot/rb.rbs

@@ -0,0 +1,4 @@
+module OT
+  VERSION: String
+  # See the writing guide of rbs: https://github.com/ruby/rbs#guides
+end

metadata

@@ -0,0 +1,60 @@
+--- !ruby/object:Gem::Specification
+name: ot-rb
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Tomoya Chiba
+autorequire:
+bindir: exe
+cert_chain: []
+date: 2023-07-11 00:00:00.000000000 Z
+dependencies: []
+description: The ruby port of ot.js
+email:
+- tomo.asleep@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".rspec"
+- ".rubocop.yml"
+- CHANGELOG.md
+- CODE_OF_CONDUCT.md
+- Gemfile
+- LICENSE.md
+- README.md
+- Rakefile
+- lib/ot-rb.rb
+- lib/ot.rb
+- lib/ot/text_operation.rb
+- lib/ot/text_operation/build_dsl.rb
+- lib/ot/text_operation/iterator.rb
+- lib/ot/version.rb
+- sig/ot/rb.rbs
+homepage: https://github.com/tomoasleep/ot-rb
+licenses: []
+metadata:
+  homepage_uri: https://github.com/tomoasleep/ot-rb
+  source_code_uri: https://github.com/tomoasleep/ot-rb
+  changelog_uri: https://github.com/tomoasleep/ot-rb/blob/master/CHANGELOG.md
+post_install_message:
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 3.0.0
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.4.10
+signing_key:
+specification_version: 4
+summary: The ruby port of ot.js
+test_files: []