optimistic-json 0.1.1 → 0.1.3

data/sorbet/rbi/gems/tsort@0.2.0.rbi

@@ -0,0 +1,387 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `tsort` gem.
+# Please instead update this file by running `bin/tapioca gem tsort`.
+
+
+# TSort implements topological sorting using Tarjan's algorithm for
+# strongly connected components.
+#
+# TSort is designed to be able to be used with any object which can be
+# interpreted as a directed graph.
+#
+# TSort requires two methods to interpret an object as a graph,
+# tsort_each_node and tsort_each_child.
+#
+# * tsort_each_node is used to iterate for all nodes over a graph.
+# * tsort_each_child is used to iterate for child nodes of a given node.
+#
+# The equality of nodes are defined by eql? and hash since
+# TSort uses Hash internally.
+#
+# == A Simple Example
+#
+# The following example demonstrates how to mix the TSort module into an
+# existing class (in this case, Hash). Here, we're treating each key in
+# the hash as a node in the graph, and so we simply alias the required
+# #tsort_each_node method to Hash's #each_key method. For each key in the
+# hash, the associated value is an array of the node's child nodes. This
+# choice in turn leads to our implementation of the required #tsort_each_child
+# method, which fetches the array of child nodes and then iterates over that
+# array using the user-supplied block.
+#
+#   require 'tsort'
+#
+#   class Hash
+#     include TSort
+#     alias tsort_each_node each_key
+#     def tsort_each_child(node, &block)
+#       fetch(node).each(&block)
+#     end
+#   end
+#
+#   {1=>[2, 3], 2=>[3], 3=>[], 4=>[]}.tsort
+#   #=> [3, 2, 1, 4]
+#
+#   {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}.strongly_connected_components
+#   #=> [[4], [2, 3], [1]]
+#
+# == A More Realistic Example
+#
+# A very simple `make' like tool can be implemented as follows:
+#
+#   require 'tsort'
+#
+#   class Make
+#     def initialize
+#       @dep = {}
+#       @dep.default = []
+#     end
+#
+#     def rule(outputs, inputs=[], &block)
+#       triple = [outputs, inputs, block]
+#       outputs.each {|f| @dep[f] = [triple]}
+#       @dep[triple] = inputs
+#     end
+#
+#     def build(target)
+#       each_strongly_connected_component_from(target) {|ns|
+#         if ns.length != 1
+#           fs = ns.delete_if {|n| Array === n}
+#           raise TSort::Cyclic.new("cyclic dependencies: #{fs.join ', '}")
+#         end
+#         n = ns.first
+#         if Array === n
+#           outputs, inputs, block = n
+#           inputs_time = inputs.map {|f| File.mtime f}.max
+#           begin
+#             outputs_time = outputs.map {|f| File.mtime f}.min
+#           rescue Errno::ENOENT
+#             outputs_time = nil
+#           end
+#           if outputs_time == nil ||
+#              inputs_time != nil && outputs_time <= inputs_time
+#             sleep 1 if inputs_time != nil && inputs_time.to_i == Time.now.to_i
+#             block.call
+#           end
+#         end
+#       }
+#     end
+#
+#     def tsort_each_child(node, &block)
+#       @dep[node].each(&block)
+#     end
+#     include TSort
+#   end
+#
+#   def command(arg)
+#     print arg, "\n"
+#     system arg
+#   end
+#
+#   m = Make.new
+#   m.rule(%w[t1]) { command 'date > t1' }
+#   m.rule(%w[t2]) { command 'date > t2' }
+#   m.rule(%w[t3]) { command 'date > t3' }
+#   m.rule(%w[t4], %w[t1 t3]) { command 'cat t1 t3 > t4' }
+#   m.rule(%w[t5], %w[t4 t2]) { command 'cat t4 t2 > t5' }
+#   m.build('t5')
+#
+# == Bugs
+#
+# * 'tsort.rb' is wrong name because this library uses
+#   Tarjan's algorithm for strongly connected components.
+#   Although 'strongly_connected_components.rb' is correct but too long.
+#
+# == References
+#
+# R. E. Tarjan, "Depth First Search and Linear Graph Algorithms",
+# <em>SIAM Journal on Computing</em>, Vol. 1, No. 2, pp. 146-160, June 1972.
+module TSort
+  # The iterator version of the #strongly_connected_components method.
+  # <tt><em>obj</em>.each_strongly_connected_component</tt> is similar to
+  # <tt><em>obj</em>.strongly_connected_components.each</tt>, but
+  # modification of _obj_ during the iteration may lead to unexpected results.
+  #
+  # #each_strongly_connected_component returns +nil+.
+  #
+  #   class G
+  #     include TSort
+  #     def initialize(g)
+  #       @g = g
+  #     end
+  #     def tsort_each_child(n, &b) @g[n].each(&b) end
+  #     def tsort_each_node(&b) @g.each_key(&b) end
+  #   end
+  #
+  #   graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]})
+  #   graph.each_strongly_connected_component {|scc| p scc }
+  #   #=> [4]
+  #   #   [2]
+  #   #   [3]
+  #   #   [1]
+  #
+  #   graph = G.new({1=>[2], 2=>[3, 4], 3=>[2], 4=>[]})
+  #   graph.each_strongly_connected_component {|scc| p scc }
+  #   #=> [4]
+  #   #   [2, 3]
+  #   #   [1]
+  #
+  # pkg:gem/tsort#tsort.rb:316
+  def each_strongly_connected_component(&block); end
+
+  # Iterates over strongly connected component in the subgraph reachable from
+  # _node_.
+  #
+  # Return value is unspecified.
+  #
+  # #each_strongly_connected_component_from doesn't call #tsort_each_node.
+  #
+  #   class G
+  #     include TSort
+  #     def initialize(g)
+  #       @g = g
+  #     end
+  #     def tsort_each_child(n, &b) @g[n].each(&b) end
+  #     def tsort_each_node(&b) @g.each_key(&b) end
+  #   end
+  #
+  #   graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]})
+  #   graph.each_strongly_connected_component_from(2) {|scc| p scc }
+  #   #=> [4]
+  #   #   [2]
+  #
+  #   graph = G.new({1=>[2], 2=>[3, 4], 3=>[2], 4=>[]})
+  #   graph.each_strongly_connected_component_from(2) {|scc| p scc }
+  #   #=> [4]
+  #   #   [2, 3]
+  #
+  # pkg:gem/tsort#tsort.rb:386
+  def each_strongly_connected_component_from(node, id_map = T.unsafe(nil), stack = T.unsafe(nil), &block); end
+
+  # Returns strongly connected components as an array of arrays of nodes.
+  # The array is sorted from children to parents.
+  # Each elements of the array represents a strongly connected component.
+  #
+  #   class G
+  #     include TSort
+  #     def initialize(g)
+  #       @g = g
+  #     end
+  #     def tsort_each_child(n, &b) @g[n].each(&b) end
+  #     def tsort_each_node(&b) @g.each_key(&b) end
+  #   end
+  #
+  #   graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]})
+  #   p graph.strongly_connected_components #=> [[4], [2], [3], [1]]
+  #
+  #   graph = G.new({1=>[2], 2=>[3, 4], 3=>[2], 4=>[]})
+  #   p graph.strongly_connected_components #=> [[4], [2, 3], [1]]
+  #
+  # pkg:gem/tsort#tsort.rb:257
+  def strongly_connected_components; end
+
+  # Returns a topologically sorted array of nodes.
+  # The array is sorted from children to parents, i.e.
+  # the first element has no child and the last node has no parent.
+  #
+  # If there is a cycle, TSort::Cyclic is raised.
+  #
+  #   class G
+  #     include TSort
+  #     def initialize(g)
+  #       @g = g
+  #     end
+  #     def tsort_each_child(n, &b) @g[n].each(&b) end
+  #     def tsort_each_node(&b) @g.each_key(&b) end
+  #   end
+  #
+  #   graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]})
+  #   p graph.tsort #=> [4, 2, 3, 1]
+  #
+  #   graph = G.new({1=>[2], 2=>[3, 4], 3=>[2], 4=>[]})
+  #   p graph.tsort # raises TSort::Cyclic
+  #
+  # pkg:gem/tsort#tsort.rb:152
+  def tsort; end
+
+  # The iterator version of the #tsort method.
+  # <tt><em>obj</em>.tsort_each</tt> is similar to <tt><em>obj</em>.tsort.each</tt>, but
+  # modification of _obj_ during the iteration may lead to unexpected results.
+  #
+  # #tsort_each returns +nil+.
+  # If there is a cycle, TSort::Cyclic is raised.
+  #
+  #   class G
+  #     include TSort
+  #     def initialize(g)
+  #       @g = g
+  #     end
+  #     def tsort_each_child(n, &b) @g[n].each(&b) end
+  #     def tsort_each_node(&b) @g.each_key(&b) end
+  #   end
+  #
+  #   graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]})
+  #   graph.tsort_each {|n| p n }
+  #   #=> 4
+  #   #   2
+  #   #   3
+  #   #   1
+  #
+  # pkg:gem/tsort#tsort.rb:205
+  def tsort_each(&block); end
+
+  # Should be implemented by a extended class.
+  #
+  # #tsort_each_child is used to iterate for child nodes of _node_.
+  #
+  # pkg:gem/tsort#tsort.rb:452
+  def tsort_each_child(node); end
+
+  # Should be implemented by a extended class.
+  #
+  # #tsort_each_node is used to iterate for all nodes over a graph.
+  #
+  # pkg:gem/tsort#tsort.rb:444
+  def tsort_each_node; end
+
+  class << self
+    # The iterator version of the TSort.strongly_connected_components method.
+    #
+    # The graph is represented by _each_node_ and _each_child_.
+    # _each_node_ should have +call+ method which yields for each node in the graph.
+    # _each_child_ should have +call+ method which takes a node argument and yields for each child node.
+    #
+    #   g = {1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}
+    #   each_node = lambda {|&b| g.each_key(&b) }
+    #   each_child = lambda {|n, &b| g[n].each(&b) }
+    #   TSort.each_strongly_connected_component(each_node, each_child) {|scc| p scc }
+    #   #=> [4]
+    #   #   [2]
+    #   #   [3]
+    #   #   [1]
+    #
+    #   g = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}
+    #   each_node = lambda {|&b| g.each_key(&b) }
+    #   each_child = lambda {|n, &b| g[n].each(&b) }
+    #   TSort.each_strongly_connected_component(each_node, each_child) {|scc| p scc }
+    #   #=> [4]
+    #   #   [2, 3]
+    #   #   [1]
+    #
+    # pkg:gem/tsort#tsort.rb:345
+    def each_strongly_connected_component(each_node, each_child); end
+
+    # Iterates over strongly connected components in a graph.
+    # The graph is represented by _node_ and _each_child_.
+    #
+    # _node_ is the first node.
+    # _each_child_ should have +call+ method which takes a node argument
+    # and yields for each child node.
+    #
+    # Return value is unspecified.
+    #
+    # #TSort.each_strongly_connected_component_from is a class method and
+    # it doesn't need a class to represent a graph which includes TSort.
+    #
+    #   graph = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}
+    #   each_child = lambda {|n, &b| graph[n].each(&b) }
+    #   TSort.each_strongly_connected_component_from(1, each_child) {|scc|
+    #     p scc
+    #   }
+    #   #=> [4]
+    #   #   [2, 3]
+    #   #   [1]
+    #
+    # pkg:gem/tsort#tsort.rb:411
+    def each_strongly_connected_component_from(node, each_child, id_map = T.unsafe(nil), stack = T.unsafe(nil)); end
+
+    # Returns strongly connected components as an array of arrays of nodes.
+    # The array is sorted from children to parents.
+    # Each elements of the array represents a strongly connected component.
+    #
+    # The graph is represented by _each_node_ and _each_child_.
+    # _each_node_ should have +call+ method which yields for each node in the graph.
+    # _each_child_ should have +call+ method which takes a node argument and yields for each child node.
+    #
+    #   g = {1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}
+    #   each_node = lambda {|&b| g.each_key(&b) }
+    #   each_child = lambda {|n, &b| g[n].each(&b) }
+    #   p TSort.strongly_connected_components(each_node, each_child)
+    #   #=> [[4], [2], [3], [1]]
+    #
+    #   g = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}
+    #   each_node = lambda {|&b| g.each_key(&b) }
+    #   each_child = lambda {|n, &b| g[n].each(&b) }
+    #   p TSort.strongly_connected_components(each_node, each_child)
+    #   #=> [[4], [2, 3], [1]]
+    #
+    # pkg:gem/tsort#tsort.rb:283
+    def strongly_connected_components(each_node, each_child); end
+
+    # Returns a topologically sorted array of nodes.
+    # The array is sorted from children to parents, i.e.
+    # the first element has no child and the last node has no parent.
+    #
+    # The graph is represented by _each_node_ and _each_child_.
+    # _each_node_ should have +call+ method which yields for each node in the graph.
+    # _each_child_ should have +call+ method which takes a node argument and yields for each child node.
+    #
+    # If there is a cycle, TSort::Cyclic is raised.
+    #
+    #   g = {1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}
+    #   each_node = lambda {|&b| g.each_key(&b) }
+    #   each_child = lambda {|n, &b| g[n].each(&b) }
+    #   p TSort.tsort(each_node, each_child) #=> [4, 2, 3, 1]
+    #
+    #   g = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}
+    #   each_node = lambda {|&b| g.each_key(&b) }
+    #   each_child = lambda {|n, &b| g[n].each(&b) }
+    #   p TSort.tsort(each_node, each_child) # raises TSort::Cyclic
+    #
+    # pkg:gem/tsort#tsort.rb:178
+    def tsort(each_node, each_child); end
+
+    # The iterator version of the TSort.tsort method.
+    #
+    # The graph is represented by _each_node_ and _each_child_.
+    # _each_node_ should have +call+ method which yields for each node in the graph.
+    # _each_child_ should have +call+ method which takes a node argument and yields for each child node.
+    #
+    #   g = {1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}
+    #   each_node = lambda {|&b| g.each_key(&b) }
+    #   each_child = lambda {|n, &b| g[n].each(&b) }
+    #   TSort.tsort_each(each_node, each_child) {|n| p n }
+    #   #=> 4
+    #   #   2
+    #   #   3
+    #   #   1
+    #
+    # pkg:gem/tsort#tsort.rb:226
+    def tsort_each(each_node, each_child); end
+  end
+end
+
+# pkg:gem/tsort#tsort.rb:126
+TSort::VERSION = T.let(T.unsafe(nil), String)

data/sorbet/rbi/gems/unicode-display_width@2.5.0.rbi

@@ -0,0 +1,64 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `unicode-display_width` gem.
+# Please instead update this file by running `bin/tapioca gem unicode-display_width`.
+
+
+# pkg:gem/unicode-display_width#lib/unicode/display_width/constants.rb:3
+module Unicode; end
+
+# pkg:gem/unicode-display_width#lib/unicode/display_width/constants.rb:4
+class Unicode::DisplayWidth
+  # pkg:gem/unicode-display_width#lib/unicode/display_width.rb:104
+  def initialize(ambiguous: T.unsafe(nil), overwrite: T.unsafe(nil), emoji: T.unsafe(nil)); end
+
+  # pkg:gem/unicode-display_width#lib/unicode/display_width.rb:110
+  def get_config(**kwargs); end
+
+  # pkg:gem/unicode-display_width#lib/unicode/display_width.rb:118
+  def of(string, **kwargs); end
+
+  class << self
+    # pkg:gem/unicode-display_width#lib/unicode/display_width/index.rb:14
+    def decompress_index(index, level); end
+
+    # pkg:gem/unicode-display_width#lib/unicode/display_width.rb:86
+    def emoji_extra_width_of(string, ambiguous = T.unsafe(nil), overwrite = T.unsafe(nil), _ = T.unsafe(nil)); end
+
+    # pkg:gem/unicode-display_width#lib/unicode/display_width.rb:12
+    def of(string, ambiguous = T.unsafe(nil), overwrite = T.unsafe(nil), options = T.unsafe(nil)); end
+
+    # Same as .width_no_overwrite - but with applying overwrites for each char
+    #
+    # pkg:gem/unicode-display_width#lib/unicode/display_width.rb:57
+    def width_all_features(string, ambiguous, overwrite, options); end
+
+    # pkg:gem/unicode-display_width#lib/unicode/display_width.rb:30
+    def width_no_overwrite(string, ambiguous, options = T.unsafe(nil)); end
+  end
+end
+
+# pkg:gem/unicode-display_width#lib/unicode/display_width.rb:9
+Unicode::DisplayWidth::ASCII_NON_ZERO_REGEX = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/unicode-display_width#lib/unicode/display_width/constants.rb:7
+Unicode::DisplayWidth::DATA_DIRECTORY = T.let(T.unsafe(nil), String)
+
+# pkg:gem/unicode-display_width#lib/unicode/display_width.rb:10
+Unicode::DisplayWidth::FIRST_4096 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/unicode-display_width#lib/unicode/display_width/index.rb:11
+Unicode::DisplayWidth::INDEX = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/unicode-display_width#lib/unicode/display_width/constants.rb:8
+Unicode::DisplayWidth::INDEX_FILENAME = T.let(T.unsafe(nil), String)
+
+# pkg:gem/unicode-display_width#lib/unicode/display_width.rb:8
+Unicode::DisplayWidth::INITIAL_DEPTH = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/unicode-display_width#lib/unicode/display_width/constants.rb:6
+Unicode::DisplayWidth::UNICODE_VERSION = T.let(T.unsafe(nil), String)
+
+# pkg:gem/unicode-display_width#lib/unicode/display_width/constants.rb:5
+Unicode::DisplayWidth::VERSION = T.let(T.unsafe(nil), String)

data/sorbet/tapioca/config.yml

@@ -0,0 +1,13 @@
+gem:
+  # Add your `gem` command parameters here:
+  #
+  # exclude:
+  # - gem_name
+  # doc: true
+  # workers: 5
+dsl:
+  # Add your `dsl` command parameters here:
+  #
+  # exclude:
+  # - SomeGeneratorName
+  # workers: 5

data/sorbet/tapioca/require.rb

@@ -0,0 +1,4 @@
+# typed: true
+# frozen_string_literal: true
+
+# Add your extra requires here (`bin/tapioca require` can be used to bootstrap this list)

metadata

@@ -1,14 +1,13 @@
 --- !ruby/object:Gem::Specification
 name: optimistic-json
 version: !ruby/object:Gem::Version
-  version: 0.1.1
+  version: 0.1.3
 platform: ruby
 authors:
 - Charles C. Lee
-autorequire:
 bindir: exe
 cert_chain: []
-date: 2023-12-04 00:00:00.000000000 Z
+date: 2026-05-11 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: logger
@@ -38,20 +37,6 @@ dependencies:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '1.0'
-- !ruby/object:Gem::Dependency
-  name: sorbet-runtime
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: '0'
-  type: :runtime
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: '0'
 - !ruby/object:Gem::Dependency
   name: debug
   requirement: !ruby/object:Gem::Requirement
@@ -164,16 +149,17 @@ dependencies:
     - - ">="
       - !ruby/object:Gem::Version
         version: '0'
-description: Heavily inspired by [`best-effort-json-parser`](https://github.com/beenotung/best-effort-json-parser)
+description: Ruby implementation of [`best-effort-json-parser`](https://github.com/beenotung/best-effort-json-parser)
   to parse potentially incomplete JSON in a best effort manner.
 email:
-- charleschanlee@gmail.com
+- contact@charleschanlee.com
 executables: []
 extensions: []
 extra_rdoc_files: []
 files:
 - ".rspec"
 - ".rubocop.yml"
+- ".ruby-version"
 - CHANGELOG.md
 - CODE_OF_CONDUCT.md
 - LICENSE.txt
@@ -182,7 +168,55 @@ files:
 - lib/optimistic/json.rb
 - lib/optimistic/json/parser.rb
 - lib/optimistic/json/version.rb
-- sig/optimistic/json.rbs
+- sorbet/config
+- sorbet/rbi/annotations/.gitattributes
+- sorbet/rbi/annotations/rainbow.rbi
+- sorbet/rbi/gems/.gitattributes
+- sorbet/rbi/gems/ast@2.4.2.rbi
+- sorbet/rbi/gems/benchmark@0.5.0.rbi
+- sorbet/rbi/gems/diff-lcs@1.5.0.rbi
+- sorbet/rbi/gems/erubi@1.13.1.rbi
+- sorbet/rbi/gems/gem-release@2.2.2.rbi
+- sorbet/rbi/gems/io-console@0.6.0.rbi
+- sorbet/rbi/gems/json@2.7.0.rbi
+- sorbet/rbi/gems/language_server-protocol@3.17.0.3.rbi
+- sorbet/rbi/gems/logger@1.6.0.rbi
+- sorbet/rbi/gems/multi_json@1.15.0.rbi
+- sorbet/rbi/gems/netrc@0.11.0.rbi
+- sorbet/rbi/gems/parallel@1.28.0.rbi
+- sorbet/rbi/gems/parser@3.2.2.4.rbi
+- sorbet/rbi/gems/prism@1.9.0.rbi
+- sorbet/rbi/gems/psych@5.1.1.1.rbi
+- sorbet/rbi/gems/racc@1.7.3.rbi
+- sorbet/rbi/gems/rainbow@3.1.1.rbi
+- sorbet/rbi/gems/rake@13.1.0.rbi
+- sorbet/rbi/gems/rbi@0.3.11.rbi
+- sorbet/rbi/gems/rbs@4.0.2.rbi
+- sorbet/rbi/gems/rdoc@6.6.0.rbi
+- sorbet/rbi/gems/regexp_parser@2.8.2.rbi
+- sorbet/rbi/gems/reline@0.4.1.rbi
+- sorbet/rbi/gems/require-hooks@0.4.0.rbi
+- sorbet/rbi/gems/rexml@3.2.6.rbi
+- sorbet/rbi/gems/rspec-core@3.12.2.rbi
+- sorbet/rbi/gems/rspec-expectations@3.12.3.rbi
+- sorbet/rbi/gems/rspec-mocks@3.12.6.rbi
+- sorbet/rbi/gems/rspec-support@3.12.1.rbi
+- sorbet/rbi/gems/rspec@3.12.0.rbi
+- sorbet/rbi/gems/rubocop-ast@1.30.0.rbi
+- sorbet/rbi/gems/rubocop-capybara@2.19.0.rbi
+- sorbet/rbi/gems/rubocop-factory_bot@2.24.0.rbi
+- sorbet/rbi/gems/rubocop-rspec@2.25.0.rbi
+- sorbet/rbi/gems/rubocop@1.58.0.rbi
+- sorbet/rbi/gems/ruby-progressbar@1.13.0.rbi
+- sorbet/rbi/gems/rubydex@0.2.3.rbi
+- sorbet/rbi/gems/spoom@1.7.14.rbi
+- sorbet/rbi/gems/stringio@3.1.0.rbi
+- sorbet/rbi/gems/tapioca@0.19.1.rbi
+- sorbet/rbi/gems/thor@1.5.0.rbi
+- sorbet/rbi/gems/tsort@0.2.0.rbi
+- sorbet/rbi/gems/unicode-display_width@2.5.0.rbi
+- sorbet/tapioca/config.yml
+- sorbet/tapioca/require.rb
 homepage: https://github.com/ChanChar/optimistic-json
 licenses:
 - MIT
@@ -190,7 +224,6 @@ metadata:
   homepage_uri: https://github.com/ChanChar/optimistic-json
   source_code_uri: https://github.com/ChanChar/optimistic-json
   changelog_uri: https://github.com/ChanChar/optimistic-json/CHANGELOG.md
-post_install_message:
 rdoc_options: []
 require_paths:
 - lib
@@ -205,8 +238,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.4.20
-signing_key:
+rubygems_version: 3.6.2
 specification_version: 4
 summary: Parse potentially incomplete JSON in a best effort manner.
 test_files: []

data/sig/optimistic/json.rbs

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