paper_trail_diff 0.11.0 → 0.13.0

data/sig/generated/paper_trail_diff/timeline_range.rbs

@@ -5,16 +5,20 @@ module PaperTrailDiff
   class TimelineRange
     BOUNDARY_SYMBOLS: untyped
 
+    # `:last` once named the last version, whose recorded state is the one
+    # *before* the latest change, so a range ending there silently dropped it.
+    LAST_REMOVED: ::String
+
     attr_reader from: untyped
 
     attr_reader to: untyped
 
     attr_reader time_range: TimeRange?
 
-    # : (untyped, from: untyped, to: untyped, within: untyped, ?versions: Array[untyped]?, ?version_scope: untyped, ?plan: RootVersionPlan?, ?live_endpoint: untyped) -> void
-    def initialize: (untyped, from: untyped, to: untyped, within: untyped, ?versions: Array[untyped]?, ?version_scope: untyped, ?plan: RootVersionPlan?, ?live_endpoint: untyped) -> void
+    # : (untyped, from: untyped, to: untyped, within: untyped, ?version_scope: untyped, ?plan: RootVersionPlan?, ?live_endpoint: untyped) -> void
+    def initialize: (untyped, from: untyped, to: untyped, within: untyped, ?version_scope: untyped, ?plan: RootVersionPlan?, ?live_endpoint: untyped) -> void
 
-    # A record with no versions has no first or last boundary to resolve, which
+    # A record with no versions has no first boundary to resolve, which
     # is an empty history rather than a bad request.
     # : () -> bool
     def unresolved?: () -> bool
@@ -26,9 +30,6 @@ module PaperTrailDiff
     # : (?context_required: bool) -> RootVersionPlan
     def select_plan: (?context_required: bool) -> RootVersionPlan
 
-    # : (?context_required: bool) -> Array[untyped]
-    def select: (?context_required: bool) -> Array[untyped]
-
     # : () -> bool
     def time?: () -> bool
 
@@ -56,15 +57,13 @@ module PaperTrailDiff
 
     @version_scope: untyped
 
-    @versions: Array[untyped]?
-
-    # : () -> Array[untyped]
-    def empty_versions: () -> Array[untyped]
+    # : () -> RootVersionPlan
+    def explicit_plan: () -> RootVersionPlan
 
     # : (untyped) -> bool
     def symbolic?: (untyped) -> bool
 
-    # Resolving `:first` and `:last` here keeps callers from depending on the
+    # Resolving `:first` here keeps callers from depending on the
     # order PaperTrail happens to give its versions association, which a caller
     # is also free to reorder.
     # : (untyped) -> untyped
@@ -73,9 +72,6 @@ module PaperTrailDiff
     # : () -> untyped
     def ordered_versions: () -> untyped
 
-    # : () -> untyped
-    def versions_relation: () -> untyped
-
     # : (untyped) -> TimeRange?
     def build_time_range: (untyped) -> TimeRange?
 

data/sig/generated/paper_trail_diff/timeline_snapshot_provider.rbs

@@ -21,6 +21,8 @@ module PaperTrailDiff
 
     @live_snapshotter: untyped
 
+    @snapshots: Hash[Array[untyped], RecordSnapshot?]
+
     @store: HistoricalSnapshotStore
   end
 end

data/sig/generated/paper_trail_diff/value_objects.rbs

@@ -14,6 +14,51 @@ module PaperTrailDiff
     def to_h: () -> Hash[Symbol, untyped]
   end
 
+  # A change to an array inside a value the database stores whole, reported by
+  # membership rather than by position.
+  #
+  # Position would be the obvious thing to report and the wrong one: elements
+  # here carry no identity, so inserting at the front makes every later index
+  # look changed, and one insertion is described as several edits. Membership is
+  # answerable without claiming any pairing -- "gained \"saturn v\"" is true
+  # whether the array is a set, a queue, or a ranked list.
+  #
+  # That leaves one case membership cannot see, so it is named rather than
+  # hidden: the same elements in a different order. `reordered?` says so.
+  #
+  # An element that is itself a Hash or Array is reported whole. Saying which
+  # field of which object changed would require pairing before-elements with
+  # after-elements, and nothing in the value licenses that pairing.
+  class ArrayChange
+    attr_reader from: Array[untyped]
+
+    attr_reader to: Array[untyped]
+
+    attr_reader added: Array[untyped]
+
+    attr_reader removed: Array[untyped]
+
+    # : (from: Array[untyped], to: Array[untyped]) -> void
+    def initialize: (from: Array[untyped], to: Array[untyped]) -> void
+
+    # Elements of `left` with no counterpart left in `right`, matching by value
+    # and respecting duplicates, so ["a", "a"] -> ["a"] reports one removal
+    # rather than none.
+    # : (Array[untyped], Array[untyped]) -> Array[untyped]
+    def self.surplus: (Array[untyped], Array[untyped]) -> Array[untyped]
+
+    # Same elements, different sequence. Only meaningful for a change that was
+    # recorded at all, which this only is when the two sides differ.
+    # : () -> bool
+    def reordered?: () -> bool
+
+    # : () -> bool
+    def empty?: () -> bool
+
+    # : () -> Hash[Symbol, untyped]
+    def to_h: () -> Hash[Symbol, untyped]
+  end
+
   # Attribute and nested-association changes for a record whose identity did not change.
   class RecordChange
     attr_reader record: RecordReference

data/sig/generated/paper_trail_diff/version_boundary.rbs

@@ -0,0 +1,23 @@
+# Generated from lib/paper_trail_diff/version_boundary.rb with RBS::Inline
+
+module PaperTrailDiff
+  # Places one version relative to another on the recorded timeline.
+  module VersionBoundary
+    # Whether `candidate` was recorded at or after `boundary`. Versions sharing
+    # a timestamp are ordered by id, which reflects insertion order only for
+    # sequential ids in one version table; any other tie cannot be ordered, and
+    # guessing would place a change on an arbitrary side of the boundary. A
+    # bare instant has no position among same-time versions, so it keeps them.
+    # : (untyped, untyped) -> bool
+    def self?.at_or_after?: (untyped, untyped) -> bool
+
+    # : (untyped) -> bool
+    def self?.version_record?: (untyped) -> bool
+
+    # : (untyped, untyped) -> bool
+    def self?.same_version?: (untyped, untyped) -> bool
+
+    # : (untyped, untyped) -> bool
+    def self?.orderable_tie?: (untyped, untyped) -> bool
+  end
+end

data/sig/generated/paper_trail_diff/version_query.rbs

@@ -0,0 +1,15 @@
+# Generated from lib/paper_trail_diff/version_query.rb with RBS::Inline
+
+module PaperTrailDiff
+  # Arel conditions shared by the version queries that need one row per item.
+  module VersionQuery
+    # Keeps each item's earliest version among those the block also accepts:
+    # no other version of the same item that the block accepts is earlier. A
+    # correlated NOT EXISTS stays portable where window functions are not.
+    # : (untyped) ?{ (untyped) -> untyped } -> untyped
+    def self?.no_earlier_version: (untyped) ?{ (untyped) -> untyped } -> untyped
+
+    # : (untyped, untyped) ?{ (untyped) -> untyped } -> untyped
+    def self?.earlier_version: (untyped, untyped) ?{ (untyped) -> untyped } -> untyped
+  end
+end

data/sig/generated/paper_trail_diff/version_range.rbs

@@ -6,18 +6,15 @@ module PaperTrailDiff
     # : (untyped, from: untyped, to: untyped, ?version_scope: untyped) -> void
     def initialize: (untyped, from: untyped, to: untyped, ?version_scope: untyped) -> void
 
-    # Same selection as `select`, but keeping the step pairs a filter implies.
+    # Keep both reconstruction boundaries and the step pairs a filter implies.
     # : () -> RootVersionPlan
     def select_plan_for_range: () -> RootVersionPlan
 
     # : () -> untyped
     def validated_relation: () -> untyped
 
-    # : () -> Array[untyped]
-    def select: () -> Array[untyped]
-
-    # : () -> Array[untyped]
-    def select_through_latest: () -> Array[untyped]
+    # : (untyped) -> RootVersionPlan
+    def select_plan_through_current: (untyped) -> RootVersionPlan
 
     private
 
@@ -29,14 +26,8 @@ module PaperTrailDiff
 
     @version_scope: untyped
 
-    # : () -> untyped
-    def versions_relation: () -> untyped
-
-    # : (untyped, ?through: untyped) -> Array[untyped]
-    def select_relation: (untyped, ?through: untyped) -> Array[untyped]
-
-    # : (untyped, ?through: untyped) -> RootVersionPlan
-    def select_plan: (untyped, ?through: untyped) -> RootVersionPlan
+    # : (untyped, ?through: untyped, ?live_endpoint: untyped) -> RootVersionPlan
+    def select_plan: (untyped, ?through: untyped, ?live_endpoint: untyped) -> RootVersionPlan
 
     # : (Array[untyped]) -> Array[untyped]
     def ordered: (Array[untyped]) -> Array[untyped]

data/sig/generated/paper_trail_diff.rbs

@@ -13,42 +13,39 @@ module PaperTrailDiff
   def self.compare: (untyped, untyped, ?associations: Array[String | Symbol], ?ignore: ignore_option, ?reload_live_endpoints: bool) -> Diff
 
   # Compares many independent endpoint pairs while batching current-record loading.
-  # : (Array[comparison_input], ?associations: Array[String | Symbol], ?ignore: ignore_option, ?reload_live_endpoints: bool) -> comparison_results
-  def self.compare_many: (Array[comparison_input], ?associations: Array[String | Symbol], ?ignore: ignore_option, ?reload_live_endpoints: bool) -> comparison_results
+  # : (Array[comparison_input], ?associations: Array[String | Symbol], ?ignore: ignore_option, ?reload_live_endpoints: bool, ?allow_expensive: bool) -> comparison_results
+  def self.compare_many: (Array[comparison_input], ?associations: Array[String | Symbol], ?ignore: ignore_option, ?reload_live_endpoints: bool, ?allow_expensive: bool) -> comparison_results
 
-  # Compares every adjacent reconstructed state in an inclusive version range.
+  # Compares every adjacent reconstructed state in an inclusive version range,
+  # by default the record's whole history through its current state.
   # : (untyped, ?from: untyped, ?to: untyped, ?within: untyped, ?associations: Array[String | Symbol], ?ignore: ignore_option, ?version_scope: untyped, ?close_on: Symbol?) -> Array[Step]
   def self.timeline: (untyped, ?from: untyped, ?to: untyped, ?within: untyped, ?associations: Array[String | Symbol], ?ignore: ignore_option, ?version_scope: untyped, ?close_on: Symbol?) -> Array[Step]
 
   # Compares adjacent root and selected-descendant activity boundaries.
-  # `reload_live_endpoints:` applies only when `to:` is a current record; the
-  # other range forms never read live state.
-  # : (untyped, ?from: untyped, ?to: untyped, ?within: untyped, ?associations: Array[String | Symbol], ?ignore: ignore_option, ?reload_live_endpoints: bool, ?version_scope: untyped, ?close_on: Symbol?, ?snapshots: bool) -> Array[ActivityStep]
-  def self.activity_timeline: (untyped, ?from: untyped, ?to: untyped, ?within: untyped, ?associations: Array[String | Symbol], ?ignore: ignore_option, ?reload_live_endpoints: bool, ?version_scope: untyped, ?close_on: Symbol?, ?snapshots: bool) -> Array[ActivityStep]
+  # `reload_live_endpoints:` applies whenever the range ends at the current
+  # record: an explicit `to:` record, the default range, or a window with no
+  # later version.
+  # : (untyped, ?from: untyped, ?to: untyped, ?within: untyped, ?associations: Array[String | Symbol], ?ignore: ignore_option, ?reload_live_endpoints: bool, ?version_scope: untyped, ?close_on: Symbol?, ?snapshots: bool, ?group: Symbol?) -> Array[ActivityStep]
+  def self.activity_timeline: (untyped, ?from: untyped, ?to: untyped, ?within: untyped, ?associations: Array[String | Symbol], ?ignore: ignore_option, ?reload_live_endpoints: bool, ?version_scope: untyped, ?close_on: Symbol?, ?snapshots: bool, ?group: Symbol?) -> Array[ActivityStep]
 
   # Builds an endpoint diff and root-checkpoint timeline while normalizing each version once.
   # : (untyped, ?from: untyped, ?to: untyped, ?within: untyped, ?associations: Array[String | Symbol], ?ignore: ignore_option, ?activity: bool, ?version_scope: untyped, ?close_on: Symbol?, ?snapshots: bool, ?group: Symbol?) -> Analysis
   def self.analyze: (untyped, ?from: untyped, ?to: untyped, ?within: untyped, ?associations: Array[String | Symbol], ?ignore: ignore_option, ?activity: bool, ?version_scope: untyped, ?close_on: Symbol?, ?snapshots: bool, ?group: Symbol?) -> Analysis
 
-  # Analyzes many roots over one shared time window, preparing their selected
-  # history once for the batch instead of once per record. Roots with no
-  # versions in the window return an empty `Analysis`.
-  #
-  # Pass `records` to analyze a list you assembled, which returns a Hash keyed
-  # by identity. Pass `scope:` with a `limit:` to have the roots selected for
-  # you from a relation, which returns a `ScopedAnalysis` -- the same Hash,
-  # plus the roots the relation could not reach. See `analyze_scope` for why
-  # that second collection exists.
-  # : (?Array[untyped]?, ?scope: untyped, ?limit: Integer?, ?within: untyped, ?associations: Array[String | Symbol], ?ignore: ignore_option, ?activity: bool, ?version_scope: untyped, ?close_on: Symbol?) -> (Hash[identity, Analysis] | ScopedAnalysis)
-  def self.analyze_many: (?Array[untyped]?, ?scope: untyped, ?limit: Integer?, ?within: untyped, ?associations: Array[String | Symbol], ?ignore: ignore_option, ?activity: bool, ?version_scope: untyped, ?close_on: Symbol?) -> (Hash[identity, Analysis] | ScopedAnalysis)
+  # Analyzes an array of records over one shared range, preparing their
+  # selected history once for the batch instead of once per record, and
+  # returns a frozen Hash keyed by identity. Roots with nothing to report in
+  # the window return an empty `Analysis`. To let a relation choose the
+  # records, use `analyze_scope`.
+  # : (Array[untyped], ?within: untyped, ?associations: Array[String | Symbol], ?ignore: ignore_option, ?activity: bool, ?version_scope: untyped, ?close_on: Symbol?, ?snapshots: bool, ?group: Symbol?, ?allow_expensive: bool) -> Hash[identity, Analysis]
+  def self.analyze_many: (Array[untyped], ?within: untyped, ?associations: Array[String | Symbol], ?ignore: ignore_option, ?activity: bool, ?version_scope: untyped, ?close_on: Symbol?, ?snapshots: bool, ?group: Symbol?, ?allow_expensive: bool) -> Hash[identity, Analysis]
 
   # Analyzes every root the relation reaches whose history moved inside the
-  # window, selecting them in a fixed number of queries rather than making the
-  # caller rediscover them.
+  # window. Joined duplicates are read in bounded pages and analyzed once.
   #
   # `limit:` is required and exceeding it raises. Selection moves into the gem
-  # here, so the bound on how much work a page can ask for has to move with
-  # it, and a truncated audit report is worse than a refused one.
+  # here. The relation's own limit/offset select the live page; this separate
+  # ceiling rejects too many unique roots rather than truncating that page.
   #
   # Returns a `ScopedAnalysis`, which destructures:
   #
@@ -57,7 +54,8 @@ module PaperTrailDiff
   #   )
   #
   # `unreachable` names roots that changed in the window but have no live row
-  # left. A relation's conditions are evaluated against the live table, so a
+  # left, independently of the live page's pagination and safety ceiling.
+  # A relation's conditions are evaluated against the live table, so a
   # destroyed root cannot be tested against them at all -- its history is
   # intact and the state it held at destruction may well have matched. Those
   # roots are reported rather than dropped so that a page auditing deletions
@@ -66,8 +64,14 @@ module PaperTrailDiff
   # Note also that a relation selects on current state, not on state during
   # the window: `where(status: 'published')` means published *now*, which is a
   # different set from what was published while the window was open.
-  # : (untyped, limit: Integer?, ?within: untyped, ?associations: Array[String | Symbol], ?ignore: ignore_option, ?activity: bool, ?version_scope: untyped, ?close_on: Symbol?) -> ScopedAnalysis
-  def self.analyze_scope: (untyped, limit: Integer?, ?within: untyped, ?associations: Array[String | Symbol], ?ignore: ignore_option, ?activity: bool, ?version_scope: untyped, ?close_on: Symbol?) -> ScopedAnalysis
+  # : (untyped, limit: Integer?, ?within: untyped, ?associations: Array[String | Symbol], ?ignore: ignore_option, ?activity: bool, ?version_scope: untyped, ?close_on: Symbol?, ?snapshots: bool, ?group: Symbol?, ?historical_filter: untyped, ?max_filter_versions: Integer, ?include_deleted: bool, ?allow_expensive: bool) -> ScopedAnalysis
+  def self.analyze_scope: (untyped, limit: Integer?, ?within: untyped, ?associations: Array[String | Symbol], ?ignore: ignore_option, ?activity: bool, ?version_scope: untyped, ?close_on: Symbol?, ?snapshots: bool, ?group: Symbol?, ?historical_filter: untyped, ?max_filter_versions: Integer, ?include_deleted: bool, ?allow_expensive: bool) -> ScopedAnalysis
+
+  # Recent root and selected-child activity through the current saved state.
+  # Historical windows remain explicit on analyze_scope; this entry point is
+  # deliberately named for a report through now rather than an as-of query.
+  # : (untyped, since: untyped, limit: Integer, ?associations: Array[String | Symbol], ?ignore: ignore_option, ?snapshots: bool, ?group: Symbol?, ?include_deleted: bool, ?historical_filter: untyped, ?max_filter_versions: Integer, ?allow_expensive: bool) -> ScopedAnalysis
+  def self.report: (untyped, since: untyped, limit: Integer, ?associations: Array[String | Symbol], ?ignore: ignore_option, ?snapshots: bool, ?group: Symbol?, ?include_deleted: bool, ?historical_filter: untyped, ?max_filter_versions: Integer, ?allow_expensive: bool) -> ScopedAnalysis
 
   # Returns the association macros this release can normalize.
   # : () -> Array[Symbol]
@@ -99,8 +103,8 @@ module PaperTrailDiff
   # list that merely shifted would otherwise look changed throughout. A key
   # that was absent reads as `NestedComparator::ABSENT` rather than nil, which
   # JSON uses for a present null.
-  # : (untyped, ?untyped) -> Hash[Array[String], ValueChange]
-  def self.nested_changes: (untyped, ?untyped) -> Hash[Array[String], ValueChange]
+  # : (untyped, ?untyped) -> nested_changes
+  def self.nested_changes: (untyped, ?untyped) -> nested_changes
 end
 
 module PaperTrailDiff
@@ -114,6 +118,10 @@ module PaperTrailDiff
 
   type association_diffs = Hash[String, association_diff]
 
+  type nested_change = ValueChange | ArrayChange
+
+  type nested_changes = Hash[Array[String], nested_change]
+
   type association_snapshots = Hash[String, AssociationSnapshot]
 
   type identity = Array[untyped]
@@ -122,6 +130,8 @@ module PaperTrailDiff
 
   type comparison_results = Hash[identity, Diff]
 
+  type report_options = { within: untyped, activity: bool, version_scope: untyped, close_on: Symbol?, snapshots: bool, group: Symbol? }
+
   type ignore_option = Array[String | Symbol] | Hash[String | Symbol, untyped]
 
   type reference_key = :type | :id | "type" | "id"

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: paper_trail_diff
 version: !ruby/object:Gem::Version
-  version: 0.11.0
+  version: 0.13.0
 platform: ruby
 authors:
 - Alex Williams
@@ -42,6 +42,10 @@ files:
 - LICENSE
 - QUICKSTART.md
 - README.md
+- docs/architecture.md
+- docs/performance.md
+- docs/reference.md
+- docs/testing.md
 - lib/paper_trail_diff.rb
 - lib/paper_trail_diff/activity_belongs_to_event_applier.rb
 - lib/paper_trail_diff/activity_boundary.rb
@@ -72,6 +76,7 @@ files:
 - lib/paper_trail_diff/association_discovery.rb
 - lib/paper_trail_diff/association_traversal.rb
 - lib/paper_trail_diff/batch_boundary_resolver.rb
+- lib/paper_trail_diff/batch_safety.rb
 - lib/paper_trail_diff/batched_root_analyzer.rb
 - lib/paper_trail_diff/batched_root_versions.rb
 - lib/paper_trail_diff/branch_snapshot_refresher.rb
@@ -80,11 +85,14 @@ files:
 - lib/paper_trail_diff/collection_transition.rb
 - lib/paper_trail_diff/comparison_batch.rb
 - lib/paper_trail_diff/configuration.rb
+- lib/paper_trail_diff/deleted_analysis_batch.rb
 - lib/paper_trail_diff/diagnostics.rb
+- lib/paper_trail_diff/direct_record_state_loader.rb
 - lib/paper_trail_diff/endpoint.rb
 - lib/paper_trail_diff/engine.rb
 - lib/paper_trail_diff/errors.rb
 - lib/paper_trail_diff/historical_association_reifier.rb
+- lib/paper_trail_diff/historical_filter.rb
 - lib/paper_trail_diff/historical_snapshot_store.rb
 - lib/paper_trail_diff/instrumentation.rb
 - lib/paper_trail_diff/live_association_reader.rb
@@ -94,19 +102,24 @@ files:
 - lib/paper_trail_diff/nested_comparator.rb
 - lib/paper_trail_diff/paper_trail_adapter.rb
 - lib/paper_trail_diff/preloaded_endpoint_batch_loader.rb
+- lib/paper_trail_diff/prepared_activity_index.rb
 - lib/paper_trail_diff/prepared_association_reifier.rb
 - lib/paper_trail_diff/prepared_edge_loader.rb
 - lib/paper_trail_diff/prepared_history.rb
 - lib/paper_trail_diff/prepared_history_loader.rb
 - lib/paper_trail_diff/prepared_record_index.rb
+- lib/paper_trail_diff/prepared_snapshot_builder.rb
+- lib/paper_trail_diff/prepared_state_association_reader.rb
 - lib/paper_trail_diff/root_version_plan.rb
 - lib/paper_trail_diff/root_version_selection.rb
 - lib/paper_trail_diff/scoped_analysis.rb
+- lib/paper_trail_diff/scoped_analysis_builder.rb
 - lib/paper_trail_diff/scoped_root_selection.rb
 - lib/paper_trail_diff/snapshot.rb
 - lib/paper_trail_diff/snapshot_normalizer.rb
 - lib/paper_trail_diff/snapshot_traversal.rb
 - lib/paper_trail_diff/step.rb
+- lib/paper_trail_diff/stored_time_precision.rb
 - lib/paper_trail_diff/support.rb
 - lib/paper_trail_diff/time_activity_timeline_builder.rb
 - lib/paper_trail_diff/time_range.rb
@@ -121,6 +134,8 @@ files:
 - lib/paper_trail_diff/value_objects.rb
 - lib/paper_trail_diff/version.rb
 - lib/paper_trail_diff/version_association_candidate_scope.rb
+- lib/paper_trail_diff/version_boundary.rb
+- lib/paper_trail_diff/version_query.rb
 - lib/paper_trail_diff/version_range.rb
 - lib/paper_trail_diff/version_scope_filter.rb
 - lib/paper_trail_diff/version_sequence_diagnostics.rb
@@ -154,6 +169,7 @@ files:
 - sig/generated/paper_trail_diff/association_discovery.rbs
 - sig/generated/paper_trail_diff/association_traversal.rbs
 - sig/generated/paper_trail_diff/batch_boundary_resolver.rbs
+- sig/generated/paper_trail_diff/batch_safety.rbs
 - sig/generated/paper_trail_diff/batched_root_analyzer.rbs
 - sig/generated/paper_trail_diff/batched_root_versions.rbs
 - sig/generated/paper_trail_diff/branch_snapshot_refresher.rbs
@@ -162,11 +178,14 @@ files:
 - sig/generated/paper_trail_diff/collection_transition.rbs
 - sig/generated/paper_trail_diff/comparison_batch.rbs
 - sig/generated/paper_trail_diff/configuration.rbs
+- sig/generated/paper_trail_diff/deleted_analysis_batch.rbs
 - sig/generated/paper_trail_diff/diagnostics.rbs
+- sig/generated/paper_trail_diff/direct_record_state_loader.rbs
 - sig/generated/paper_trail_diff/endpoint.rbs
 - sig/generated/paper_trail_diff/engine.rbs
 - sig/generated/paper_trail_diff/errors.rbs
 - sig/generated/paper_trail_diff/historical_association_reifier.rbs
+- sig/generated/paper_trail_diff/historical_filter.rbs
 - sig/generated/paper_trail_diff/historical_snapshot_store.rbs
 - sig/generated/paper_trail_diff/instrumentation.rbs
 - sig/generated/paper_trail_diff/live_association_reader.rbs
@@ -176,19 +195,24 @@ files:
 - sig/generated/paper_trail_diff/nested_comparator.rbs
 - sig/generated/paper_trail_diff/paper_trail_adapter.rbs
 - sig/generated/paper_trail_diff/preloaded_endpoint_batch_loader.rbs
+- sig/generated/paper_trail_diff/prepared_activity_index.rbs
 - sig/generated/paper_trail_diff/prepared_association_reifier.rbs
 - sig/generated/paper_trail_diff/prepared_edge_loader.rbs
 - sig/generated/paper_trail_diff/prepared_history.rbs
 - sig/generated/paper_trail_diff/prepared_history_loader.rbs
 - sig/generated/paper_trail_diff/prepared_record_index.rbs
+- sig/generated/paper_trail_diff/prepared_snapshot_builder.rbs
+- sig/generated/paper_trail_diff/prepared_state_association_reader.rbs
 - sig/generated/paper_trail_diff/root_version_plan.rbs
 - sig/generated/paper_trail_diff/root_version_selection.rbs
 - sig/generated/paper_trail_diff/scoped_analysis.rbs
+- sig/generated/paper_trail_diff/scoped_analysis_builder.rbs
 - sig/generated/paper_trail_diff/scoped_root_selection.rbs
 - sig/generated/paper_trail_diff/snapshot.rbs
 - sig/generated/paper_trail_diff/snapshot_normalizer.rbs
 - sig/generated/paper_trail_diff/snapshot_traversal.rbs
 - sig/generated/paper_trail_diff/step.rbs
+- sig/generated/paper_trail_diff/stored_time_precision.rbs
 - sig/generated/paper_trail_diff/support.rbs
 - sig/generated/paper_trail_diff/time_activity_timeline_builder.rbs
 - sig/generated/paper_trail_diff/time_range.rbs
@@ -203,6 +227,8 @@ files:
 - sig/generated/paper_trail_diff/value_objects.rbs
 - sig/generated/paper_trail_diff/version.rbs
 - sig/generated/paper_trail_diff/version_association_candidate_scope.rbs
+- sig/generated/paper_trail_diff/version_boundary.rbs
+- sig/generated/paper_trail_diff/version_query.rbs
 - sig/generated/paper_trail_diff/version_range.rbs
 - sig/generated/paper_trail_diff/version_scope_filter.rbs
 - sig/generated/paper_trail_diff/version_sequence_diagnostics.rbs
@@ -212,11 +238,11 @@ licenses:
 metadata:
   allowed_push_host: https://rubygems.org
   bug_tracker_uri: https://github.com/aheathwilliams/paper_trail_diff/issues
-  changelog_uri: https://github.com/aheathwilliams/paper_trail_diff/blob/v0.11.0/CHANGELOG.md
-  documentation_uri: https://github.com/aheathwilliams/paper_trail_diff/blob/v0.11.0/README.md
+  changelog_uri: https://github.com/aheathwilliams/paper_trail_diff/blob/v0.13.0/CHANGELOG.md
+  documentation_uri: https://github.com/aheathwilliams/paper_trail_diff/blob/v0.13.0/README.md
   homepage_uri: https://github.com/aheathwilliams/paper_trail_diff
   rubygems_mfa_required: 'true'
-  source_code_uri: https://github.com/aheathwilliams/paper_trail_diff/tree/v0.11.0
+  source_code_uri: https://github.com/aheathwilliams/paper_trail_diff/tree/v0.13.0
 rdoc_options: []
 require_paths:
 - lib
@@ -231,7 +257,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 4.0.16
+rubygems_version: 4.0.20
 specification_version: 4
 summary: Structured endpoint and activity diffs for PaperTrail
 test_files: []