data_structures_rmolinari 0.2.0 → 0.2.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: ea5f3d2fed60234fefe18577985f1e8ae967ecec92ef0812ccaeff0fb81ca392
-  data.tar.gz: e3e59746e8d7e881209a2c3a0e78ea186aa0562d138d7e2b6ed261943f6cb45f
+  metadata.gz: 3765b8df91fcc62eb885e32ff5ad4b0b4678bba6f322cb5c8282657052aed8c6
+  data.tar.gz: 845bea3649dc51dab697927132c0fc2f62dcacf5c25e1c717b99e57819b52286
 SHA512:
-  metadata.gz: e480ccee258f97479f1768b8f94b65a1c13f3b1e8f15e843c4240adeac555574383ef7de3928a057fd0b6707823cb4eeddee2128a49175c2f671e1526f887c2e
-  data.tar.gz: 30ac4bf22fe37bdfbf4eeccdcdfc2feba23278703957eebf5f9be6c30bb3e68024ccd49ef63c892d78c1fd58b54336a762c86cb107f9f27937222e9baf252ef4
+  metadata.gz: 23687561ec6ddb12369ca5e75db33ffd710295097cd0c91b72fb278fea3b11b23152867bb4aea6a4fd17b2f95184fb5433c9ff009db92a5c4bab78686ae472de
+  data.tar.gz: d930a674f85aa0a57030ed59f2b39979c7dbb8d8f74e0a9718d44112c1efe05657e0d55773b623c3724f040054e2fedf453de30b72d5631404642081455406f9

data/lib/data_structures_rmolinari/disjoint_union.rb

@@ -0,0 +1,77 @@
+# A "disjoint set union" that represents a set of elements that belonging to _disjoint_ subsets. Alternatively, this expresses a
+# partion of a fixed set.
+#
+# The data structure provides efficient actions to merge two disjoint subsets, i.e., replace them by their union, and determine if
+# two elements are in the same subset.
+#
+# The elements of the set must be 0, 1, ..., n-1, where n is the size of the universe. Client code can map its data to these
+# representatives.
+#
+# See https://en.wikipedia.org/wiki/Disjoint-set_data_structure for a good introduction.
+#
+# The code uses several ideas from Tarjan and van Leeuwen for efficiency. We use "union by rank" in +unite+ and path-halving in
+# +find+. Together, these make the amortized cost for each of n such operations effectively constant.
+#
+# - Tarjan, Robert E., van Leeuwen, Jan (1984). "Worst-case analysis of set union algorithms". Journal of the ACM. 31 (2): 245–281.
+#
+# @todo
+#   - allow caller to expand the size of the universe. This operation is called "make set".
+#     - All we need to do is increase the size of @d, set the parent pointers, define the new ranks (zero), and update @size.
+class DataStructuresRMolinari::DisjointUnion
+  # The number of subsets in the partition.
+  attr_reader :subset_count
+
+  # @param size the size of the universe, which must be known at the time of construction. The elements 0, 1, ..., size - 1 start
+  #   out in disjoint singleton subsets.
+  def initialize(size)
+    @size = size
+    # Initialize to
+    @d = (0...size).to_a
+    @rank = [0] * size
+
+    @subset_count = size
+  end
+
+  # Declare that e and f are equivalent, i.e., in the same subset. If they are already in the same subset this is a no-op.
+  #
+  # Each argument must be one of 0, 1, ..., size-1.
+  def unite(e, f)
+    check_value(e)
+    check_value(f)
+    raise 'Uniting an element with itself is meaningless' if e == f
+
+    e_root = find(e)
+    f_root = find(f)
+    return if e_root == f_root
+
+    @subset_count -= 1
+    link(e_root, f_root)
+  end
+
+  # The canonical representative of the subset containing e. Two elements d and e are in the same subset exactly when find(d) ==
+  # find(e).
+  # @param e must be one of 0, 1, ..., size-1.
+  # @return (Integer) one of 0, 1, ..., size-1.
+  def find(e)
+    # We implement find with "halving" to shrink the length of paths to the root. See Tarjan and van Leeuwin p 252.
+    x = e
+    x = @d[x] = @d[@d[x]] while @d[@d[x]] != @d[x]
+    @d[x]
+  end
+
+  private def check_value(v)
+    raise "Value must be given and be in (0..#{@size - 1})" unless v && v.between?(0, @size - 1)
+  end
+
+  private def link(e, f)
+    # Choose which way around to do the linking using the element "ranks". See Tarjan and van Leeuwen, p 250.
+    if @rank[e] > @rank[f]
+      @d[f] = e
+    elsif @rank[e] == @rank[f]
+      @d[f] = e
+      @rank[e] += 1
+    else
+      @d[e] = f
+    end
+  end
+end

data/lib/data_structures_rmolinari/{generic_segment_tree_internal.rb → generic_segment_tree.rb}

@@ -8,45 +8,33 @@ require_relative 'shared'
 # called an "interval tree."
 #
 # For more details (and some close-to-metal analysis of run time, especially for large datasets) see
-# https://en.algorithmica.org/hpc/data-structures/segment-trees/. In particular, this shows how to do a bottom-up
-# implementation, which is faster, at least for large datasets and cache-relevant compiled code.
+# https://en.algorithmica.org/hpc/data-structures/segment-trees/. In particular, this shows how to do a bottom-up implementation,
+# which is faster, at least for large datasets and cache-relevant compiled code. These issues don't really apply to code written in
+# Ruby.
 #
-# This is a generic implementation.
+# This is a generic implementation, intended to allow easy configuration for concrete instances. See the parameters to the
+# initializer and the defintiaons concrete realisations like MaxValSegmentTree.
 #
 # We do O(n) work to build the internal data structure at initialization. Then we answer queries in O(log n) time.
-#
-# @todo
-#   - provide a data-update operation like update_val_at(idx, val)
-#     - this is O(log n)
-#     - note that this may need some rework. Consider something like IndexOfMaxVal: @merge needs to know about the underlying data
-#       in that case. Hmmm. Maybe the lambda can close over the data in a way that makes it possible to change the data "from the
-#       outside". Yes:
-#         a = [1,2,3]
-#         foo = ->() { a.max }
-#         foo.call # 3
-#         a = [1,2,4]
-#         foo.call # 4
-#   - Offer an optional parameter base_case_value_extractor (<-- need better name) to be used in #determine_val in the case that
-#     left == tree_l && right == tree_r instead of simply returning @tree[tree_idx]
-#     - Use case: https://cp-algorithms.com/data_structures/segment_tree.html#saving-the-entire-subarrays-in-each-vertex, such as
-#       finding the least element in a subarray l..r no smaller than a given value x. In this case we store a sorted version the
-#       entire subarray at each node and use a binary search on it.
-#     - the default value would simply be the identity function.
-#     - NOTE that in this case, we have different "combine" functions in #determine_val and #build. In #build we would combine
-#       sorted lists into a larger sorted list. In #determine_val we combine results via #min.
-#     - Think about the interface before doing this.
-class GenericSegmentTreeInternal
+class DataStructuresRMolinari::GenericSegmentTree
   include Shared::BinaryTreeArithmetic
 
   # Construct a concrete instance of a Segment Tree. See details at the links above for the underlying concepts here.
   # @param combine a lambda that takes two values and munges them into a combined value.
   #   - For example, if we are calculating sums over subintervals, combine.call(a, b) = a + b, while if we are doing maxima we will
-  #     return max(a, b)
+  #     return max(a, b).
+  #   - Things get more complicated when we are calculating, say, the _index_ of the maximal value in a subinterval. Now it is not
+  #     enough simple to store that index at each tree node, because to combine the indices from two child nodes we need to know
+  #     both the index of the maximal element in each child node's interval, but also the maximal values themselves, so we know
+  #     which one "wins" for the parent node. This affects the sort of work we need to do when combining and the value provided by
+  #     the +single_cell_array_val+ lambda.
   # @param single_cell_array_val a lambda that takes an index i and returns the value we need to store in the #build
-  #     operation for the subinterval i..i. This is often simply be the value data[i], but in some cases - like "index of max val" -
-  #     it will be something else.
+  #     operation for the subinterval i..i.
+  #     - This is often simply be the value data[i], but in some cases it will be something else. For example, when we are
+  #       calculating the index of the maximal value on each subinterval we will retern the pair [i, data[i]] here.
+  #     - If +update_at+ is called later, this lambda must close over the underlying data in a way that captures the updated value.
   # @param size the size of the underlying data array, used in certain internal arithmetic.
-  # @param identity is the value to return when we are querying on an empty interval
+  # @param identity the value to return when we are querying on an empty interval
   #   - for sums, this will be zero; for maxima, this will be -Infinity, etc
   def initialize(combine:, single_cell_array_val:, size:, identity:)
     @combine = combine
@@ -62,15 +50,28 @@ class GenericSegmentTreeInternal
   # @param left the left end of the subinterval.
   # @param right the right end (inclusive) of the subinterval.
   #
-  # The type of the return value depends on the concrete instance of the segment tree.
+  # The type of the return value depends on the concrete instance of the segment tree. We return the _identity_ element provided at
+  # construction time if the interval is empty.
   def query_on(left, right)
-    raise "Bad query interval #{left}..#{right}" if left.negative? || right >= @size
+    raise DataError, "Bad query interval #{left}..#{right}" if left.negative? || right >= @size
 
     return @identity if left > right # empty interval
 
     determine_val(root, left, right, 0, @size - 1)
   end
 
+  # Update the value in the underlying array at the given idx
+  #
+  # @param idx an index in the underlying data array.
+  #
+  # Note that we don't need the updated value itself. We get that by calling the lambda +single_cell_array_val+ supplied at
+  # construction.
+  def update_at(idx)
+    raise DataError, 'Cannot update an index outside the initial range of the underlying data' unless (0...@size).cover?(idx)
+
+    update_val_at(idx, root, 0, @size - 1)
+  end
+
   private def determine_val(tree_idx, left, right, tree_l, tree_r)
     # Does the current tree node exactly serve up the interval we're interested in?
     return @tree[tree_idx] if left == tree_l && right == tree_r
@@ -92,6 +93,26 @@ class GenericSegmentTreeInternal
     end
   end
 
+  private def update_val_at(idx, tree_idx, tree_l, tree_r)
+    if tree_l == tree_r
+      # We have found the spot!
+      raise LogicError, 'tree_l == tree_r, but they do not agree with the idx holding the updated value' unless tree_l == idx
+
+      @tree[tree_idx] = @single_cell_array_val.call(tree_l)
+    else
+      # Recursively update the appropriate subtree
+      mid = midpoint(tree_l, tree_r)
+      left = left(tree_idx)
+      right = right(tree_idx)
+      if mid >= idx
+        update_val_at(idx, left(tree_idx), tree_l, mid)
+      else
+        update_val_at(idx, right(tree_idx), mid + 1, tree_r)
+      end
+      @tree[tree_idx] = @combine.call(@tree[left], @tree[right])
+    end
+  end
+
   # Build the internal data structure.
   #
   # - tree_idx is the index into @tree

data/lib/data_structures_rmolinari/{heap_internal.rb → heap.rb}

@@ -36,10 +36,18 @@ require_relative 'shared'
 #   DOI 10.1007/s00224-017-9760-2
 #
 # @todo
+#   - allow for priorities comparable only via +<=>+, like arrays
+#     - this requires different handling for max-heaps, as we can't just negate the priorities and use min-heap logic
 #   - relax the requirement that priorities must be comparable vai +<+ and respond to negation. Instead, allow comparison via +<=>+
 #     and handle max-heaps differently.
 #     - this will allow priorities to be arrays for tie-breakers and similar.
-class HeapInternal
+#   - offer a non-addressable version that doesn't support +update+
+#     - configure through the initializer
+#     - other operations will be a little quicker, and we can add the same item more than once. The paper by Chen et al. referenced
+#       in the Wikipedia article for Pairing Heaps suggests that using such a priority queue for Dijkstra's algorithm and inserting
+#       multiple copies of a key rather than updating its priority is faster in practice than other approaches that have better
+#       theoretical performance.
+class DataStructuresRMolinari::Heap
   include Shared::BinaryTreeArithmetic
 
   attr_reader :size
@@ -61,7 +69,7 @@ class HeapInternal
     @size.zero?
   end
 
-  # Insert a new element into the heap with the given property.
+  # Insert a new element into the heap with the given priority.
   # @param value the item to be inserted. It is an error to insert an item that is already present in the heap, though we don't
   #   check for this.
   # @param priority the priority to use for new item. The values used as priorities ust be totally ordered via +<+ and, if +self+ is

data/lib/data_structures_rmolinari/{max_priority_search_tree_internal.rb → max_priority_search_tree.rb}

@@ -40,14 +40,18 @@ require_relative 'shared'
 # * E.M. McCreight, _Priority search trees_, SIAM J. Comput., 14(2):257-276, 1985.  Later, De,
 # * M. De, A. Maheshwari, S. C. Nandy, M. Smid, _An In-Place Priority Search Tree_, 23rd Canadian Conference on Computational
 #   Geometry, 2011
-class MaxPrioritySearchTreeInternal
+class DataStructuresRMolinari::MaxPrioritySearchTree
   include Shared
   include BinaryTreeArithmetic
 
   # Construct a MaxPST from the collection of points in +data+.
   #
-  # @param data [Array] the set P of points presented as an array. The tree is built in the array in-place without cloning. Each
-  #        element of the array must respond to +#x+ and +#y+ (though this is not currently checked).
+  # @param data [Array] the set P of points presented as an array. The tree is built in the array in-place without cloning.
+  #   - Each element of the array must respond to +#x+ and +#y+.
+  #     - This is not checked explicitly but a missing method exception will be thrown when we try to call one of them.
+  #   - The +x+ values must be distinct, as must the +y+ values. We raise a +Shared::DataError+ if this isn't the case.
+  #     - This is a restriction that simplifies some of the algorithm code. It can be removed as the cost of some extra work. Issue
+  #       #9.
   #
   # @param verify [Boolean] when truthy, check that the properties of a PST are satisified after construction, raising an exception
   #        if not.
@@ -69,7 +73,7 @@ class MaxPrioritySearchTreeInternal
   # Let Q = [x0, infty) X [y0, infty) be the northeast quadrant defined by the point (x0, y0) and let P be the points in this data
   # structure. Define p* as
   #
-  # - (infty, -infty) f Q \intersect P is empty and
+  # - (infty, -infty) if Q \intersect P is empty and
   # - the highest (max-x) point in Q \intersect P otherwise.
   #
   # This method returns p* in O(log n) time and O(1) extra space.
@@ -82,7 +86,7 @@ class MaxPrioritySearchTreeInternal
   # Let Q = (-infty, x0] X [y0, infty) be the northwest quadrant defined by the point (x0, y0) and let P be the points in this data
   # structure. Define p* as
   #
-  # - (-infty, -infty) f Q \intersect P is empty and
+  # - (-infty, -infty) if Q \intersect P is empty and
   # - the highest (max-y) point in Q \intersect P otherwise.
   #
   # This method returns p* in O(log n) time and O(1) extra space.
@@ -186,7 +190,7 @@ class MaxPrioritySearchTreeInternal
   # Let Q = [x0, infty) X [y0, infty) be the northeast quadrant defined by the point (x0, y0) and let P be the points in this data
   # structure. Define p* as
   #
-  # - (infty, infty) f Q \intersect P is empty and
+  # - (infty, infty) if Q \intersect P is empty and
   # - the leftmost (min-x) point in Q \intersect P otherwise.
   #
   # This method returns p* in O(log n) time and O(1) extra space.
@@ -994,9 +998,14 @@ class MaxPrioritySearchTreeInternal
   # Build the initial stucture
 
   private def construct_pst
-    # We follow the algorithm in the paper by De, Maheshwari et al. Note that indexing is from 1 there. For now we pretend that that
-    # is the case here, too.
+    raise DataError, 'Duplicate x values are not supported' if contains_duplicates?(@data, by: :x)
+    raise DataError, 'Duplicate y values are not supported' if contains_duplicates?(@data, by: :y)
+
+    # We follow the algorithm in the paper by De, Maheshwari et al.
 
+    # Since we are building an implicit binary tree, things are simpler if the array is 1-based. This probably requires a malloc and
+    # data copy, which isn't great, but it's in the C layer so cheap compared to the O(n log^2 n) work we need to do for
+    # construction. In fact, we are probably doing O(n^2) work because of all the calls to #index_with_largest_y_in.
     @data.unshift nil
 
     h = Math.log2(@size).floor
@@ -1106,13 +1115,11 @@ class MaxPrioritySearchTreeInternal
     (l..r).max_by { |idx| @data[idx].y }
   end
 
-  # Sort the subarray @data[l..r]. This is much faster than a Ruby-layer heapsort because it is mostly happening in C.
+  # Sort the subarray @data[l..r].
   private def sort_subarray(l, r)
-    # heapsort_subarray(l, r)
     return if l == r # 1-array already sorted!
 
-    #l -= 1
-    #r -= 1
+    # This slice-replacement is much faster than a Ruby-layer heapsort because it is mostly happening in C.
     @data[l..r] = @data[l..r].sort_by(&:x)
   end
 

data/lib/data_structures_rmolinari/{minmax_priority_search_tree_internal.rb → minmax_priority_search_tree.rb}

@@ -40,7 +40,7 @@ require_relative 'shared'
 # [2] De, Maheshwari, Nandy, Smid, _An in-place priority search tree_, 23rd Annual Canadian Conference on Computational Geometry.
 # [3] De, Maheshwari, Nandy, Smid, _An in-place min-max priority search tree_, Computational Geometry, v46 (2013), pp 310-327.
 # [4] Atkinson, Sack, Santoro, Strothotte, _Min-max heaps and generalized priority queues_, Commun. ACM 29 (10) (1986), pp 996-1000.
-class MinmaxPrioritySearchTreeInternal
+class DataStructuresRMolinari::MinmaxPrioritySearchTree
   include Shared
 
   # The array of pairs is turned into a minmax PST in-place without cloning. So clone before passing it in, if you care.

data/lib/data_structures_rmolinari/shared.rb

@@ -6,6 +6,7 @@ module Shared
 
   # @private
   class LogicError < StandardError; end
+  class DataError < StandardError; end
 
   # @private
   #
@@ -61,4 +62,22 @@ module Shared
       (i & 1).zero?
     end
   end
+
+  # Simple O(n) check for duplicates in an enumerable.
+  #
+  # It may be worse than O(n), depending on how close to constant set insertion is.
+  #
+  # @param enum the enumerable to check for duplicates
+  # @param by a method to call on each element of enum before checking. The results of these methods are checked for
+  #        duplication. When nil we don't call anything and just use the elements themselves.
+  def contains_duplicates?(enum, by: nil)
+    seen = Set.new
+    enum.each do |v|
+      v = v.send(by) if by
+      return true if seen.include? v
+
+      seen << v
+    end
+    false
+  end
 end

data/lib/data_structures_rmolinari.rb

@@ -1,35 +1,31 @@
 require_relative 'data_structures_rmolinari/shared'
-require_relative 'data_structures_rmolinari/generic_segment_tree_internal'
-require_relative 'data_structures_rmolinari/heap_internal'
-require_relative 'data_structures_rmolinari/max_priority_search_tree_internal'
-require_relative 'data_structures_rmolinari/minmax_priority_search_tree_internal'
 
 module DataStructuresRMolinari
   Pair = Shared::Pair
+end
 
-  ########################################
-  # Priority Search Trees
-  #
-  # Note that MinmaxPrioritySearchTree is only a fragment of what we need
-  MaxPrioritySearchTree = MaxPrioritySearchTreeInternal
-  MinmaxPrioritySearchTree = MinmaxPrioritySearchTreeInternal
+# These define classes inside module DataStructuresRMolinari
+require_relative 'data_structures_rmolinari/disjoint_union'
+require_relative 'data_structures_rmolinari/generic_segment_tree'
+require_relative 'data_structures_rmolinari/heap'
+require_relative 'data_structures_rmolinari/max_priority_search_tree'
+require_relative 'data_structures_rmolinari/minmax_priority_search_tree'
 
+module DataStructuresRMolinari
   ########################################
-  # Segment Trees
-
-  GenericSegmentTree = GenericSegmentTreeInternal
-
-  # Takes an array A[0...n] and tells us what the maximum value is on a subinterval i..j in O(log n) time.
+  # Concrete instances of Segment Tree
   #
-  # TODO:
-  # - allow min val too
-  #   - add a flag to the initializer
-  #   - call it ExtremalValSegment tree or something similar
+  # @todo consider moving these into generic_segment_tree.rb
+
+  # Takes an array A(0...n) and tells us what the maximum value is on a subinterval A(i..j) in O(log n) time.
   class MaxValSegmentTree
     extend Forwardable
 
-    def_delegator :@structure, :query_on, :max_on
+    # Tell the tree that the value at idx has changed
+    def_delegator :@structure, :update_at
 
+    # @param data an object that contains values at integer indices based at 0, via +data[i]+.
+    #   - The usual use case will be an Array, but it could also be a hash or a proc of some sort.
     def initialize(data)
       @structure = GenericSegmentTree.new(
         combine:               ->(a, b) { [a, b].max },
@@ -38,9 +34,43 @@ module DataStructuresRMolinari
         identity:              -Float::INFINITY
       )
     end
+
+    # The maximum value in A(i..j)
+    #
+    # The arguments must be integers in 0...(A.size)
+    # @return the largest value in A(i..j).
+    #   - Return +nil+ if i > j
+    def max_on(i, j)
+      @structure.query_on(i, j)
+    end
   end
 
-  ########################################
-  # Heap
-  Heap = HeapInternal
+  # A segment tree that for an array A(0...n) efficiently answers questions of the form "what is the index of the maximal value in
+  # a subinterval A(i..j) in O(log n) time.
+  class IndexOfMaxValSegmentTree
+    extend Forwardable
+
+    # Tell the tree that the value at idx has changed
+    def_delegator :@structure, :update_at
+
+    # @param (see MaxValSegmentTree#initialize)
+    def initialize(data)
+      @structure = GenericSegmentTree.new(
+        combine:               ->(p1, p2) { p1[1] >= p2[1] ? p1 : p2 },
+        single_cell_array_val: ->(i) { [i, data[i]] },
+        size:                  data.size,
+        identity:              nil
+      )
+    end
+
+    # The index of the maximum value in A(i..j)
+    #
+    # The arguments must be integers in 0...(A.size)
+    # @return (Integer, nil) the index of the largest value in A(i..j).
+    #   - If there is more than one entry with that value, return one the indices. There is no guarantee as to which one.
+    #   - Return +nil+ if i > j
+    def index_of_max_val_on(i, j)
+      @structure.query_on(i, j)&.first # discard the value part of the pair
+    end
+  end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: data_structures_rmolinari
 version: !ruby/object:Gem::Version
-  version: 0.2.0
+  version: 0.2.2
 platform: ruby
 authors:
 - Rory Molinari
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2023-01-05 00:00:00.000000000 Z
+date: 2023-01-06 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: must_be
@@ -67,21 +67,25 @@ dependencies:
       - !ruby/object:Gem::Version
         version: 0.22.0
 description: |
-  This small gem contains several data structures that I have implemented to learn how they work.
+  This small gem contains several data structures that I have implemented in Ruby to learn how they work.
 
   Sometimes it is not enough to read the description of a data structure and accompanying pseudo-code.
-  Actually implementing the structure is often helpful in understanding what is going on. It is also
+  Actually implementing it is often helpful in understanding what is going on. It is also
   usually fun.
-email: rorymolinari+rubygems@gmail.com
+
+  The gem contains basic implementions of Disjoint Union, Heap, Priority Search Tree, and Segment Tree.
+  See the homepage for more details.
+email: rorymolinari@gmail.com
 executables: []
 extensions: []
 extra_rdoc_files: []
 files:
 - lib/data_structures_rmolinari.rb
-- lib/data_structures_rmolinari/generic_segment_tree_internal.rb
-- lib/data_structures_rmolinari/heap_internal.rb
-- lib/data_structures_rmolinari/max_priority_search_tree_internal.rb
-- lib/data_structures_rmolinari/minmax_priority_search_tree_internal.rb
+- lib/data_structures_rmolinari/disjoint_union.rb
+- lib/data_structures_rmolinari/generic_segment_tree.rb
+- lib/data_structures_rmolinari/heap.rb
+- lib/data_structures_rmolinari/max_priority_search_tree.rb
+- lib/data_structures_rmolinari/minmax_priority_search_tree.rb
 - lib/data_structures_rmolinari/shared.rb
 homepage: https://github.com/rmolinari/data_structures
 licenses: