rdf-kv 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: deb27dba84f5646d65c33ad83bd4ac842724ed0458f943194c572ef06b9ab679
+  data.tar.gz: 150094cd1b73702b87ada062070d66752bab1c28be502aaad8ca754fa7d51815
+SHA512:
+  metadata.gz: 49fdd4acc90ca6089385473885b8fc49a9160e7d628eaf53242ab209f9b9858941d533df9966f7a77b853b20e4b203791ac43e58b566443ebab66e4196b18cfc
+  data.tar.gz: 58f9571d7c07fadbe58ca1e171382ea0a00ed43e86b02236dbba8e496be078a9ec62b29b03ce2d927b6ac609817318320adfa52d0f0049c62755f463ee20fe83

data/.gitignore

@@ -0,0 +1,14 @@
+/.bundle/
+/.yardoc
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+Gemfile.lock
+
+# rspec failure tracking
+.rspec_status
+.\#*
+\#*\#

data/.rspec

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

data/.travis.yml

@@ -0,0 +1,6 @@
+---
+language: ruby
+cache: bundler
+rvm:
+  - 2.5.5
+before_install: gem install bundler -v 2.1.2

data/Gemfile

@@ -0,0 +1,7 @@
+source "https://rubygems.org"
+
+# Specify your gem's dependencies in rdf-kv.gemspec
+gemspec
+
+gem "rake", "~> 12.0"
+gem "rspec", "~> 3.0"

data/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

data/README.md

@@ -0,0 +1,47 @@
+# RDF::KV — Turn Key-Value Pairs into an RDF::Changeset
+
+This module is an implementation of the
+[RDF-KV](https://doriantaylor.com/rdf-kv) protocol. This protocol
+defines a method for embedding instructions for constructing a
+[changeset](https://rubydoc.info/gems/rdf/RDF/Changeset) from ordinary
+key-value pairs.
+
+```ruby
+# initialize the processor
+kv = RDF::KV.new subject: my_url, graph: graph_url
+
+# use it to generate a changeset, e.g. from web form POST data
+cs = kv.process rack.POST
+
+# now apply it to your RDF::Repository
+cs.apply repo
+```
+
+## Protocol Documentation
+
+See [the very tentative spec](https://doriantaylor.com/rdf-kv).
+
+## API Documentation
+
+API documentation, for what it's worth at the moment, can be found [in
+the usual place](https://rubydoc.info/github/doriantaylor/rb-rdf-kv/master).
+
+## Installation
+
+You know how to do this:
+
+    $ gem install rdf-kv
+
+Or, [download it off rubygems.org](https://rubygems.org/gems/rdf-kv).
+
+## Contributing
+
+Bug reports and pull requests are welcome at
+[the GitHub repository](https://github.com/doriantaylor/rb-rdf-kv).
+
+## Copyright & License
+
+©2019 [Dorian Taylor](https://doriantaylor.com/)
+
+This software is provided under
+the [Apache License, 2.0](https://www.apache.org/licenses/LICENSE-2.0).

data/Rakefile

@@ -0,0 +1,6 @@
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+
+RSpec::Core::RakeTask.new(:spec)
+
+task :default => :spec

data/bin/console

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

data/bin/setup

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

data/lib/rdf/kv.rb

@@ -0,0 +1,421 @@
+require 'rdf/kv/version'
+
+require 'rdf'
+require 'uri'
+require 'uuidtools'
+require 'uuid-ncname'
+
+class RDF::KV
+  private
+
+  # some xml grammar
+  NCNSCHAR = 'A-Za-z_\\u00c0-\\u00d6\\u00d8-\\u00f6\\u00f8-\\u02ff' \
+    '\\u0370-\\u037d\\u037f-\\u1fff\\u200c-\\u200d\\u2070-\\u218f' \
+    '\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd' \
+    '\\u{10000}-\\u{effff}'.freeze
+  NSCHAR     = "[:#{NCNSCHAR}]".freeze
+  NCNAMECHAR = "-.0-9#{NCNSCHAR}\\u00b7\\u0300-\\u036f\\u203f-\\u2040".freeze
+  NCNAME     = "[#{NCNSCHAR}][#{NCNAMECHAR}]*".freeze
+
+  # the actual rdf-kv grammar
+  MODIFIER     = '(?:[!=+-]|[+-]!|![+-])'.freeze
+  PREFIX       = "(?:#{NCNAME}|[A-Za-z][0-9A-Za-z.+-]*)".freeze
+  TERM         = "(?:#{PREFIX}:\\S*)".freeze
+  RFC5646      = '(?:[A-Za-z]+(?:-[0-9A-Za-z]+)*)'.freeze
+  DESIGNATOR   = "(?:[:_']|@#{RFC5646}|\\^#{TERM})".freeze
+  DECLARATION  = "^\\s*\\$\\s+(#{NCNAME})(?:\\s+(\\$))?\s*$".freeze
+  MACRO        = "(?:\\$\\{(#{NCNAME})\\}|\\$(#{NCNAME}))".freeze
+  NOT_MACRO    = "(?:(?!\\$#{NCNAME}|\\$\\{#{NCNAME}\\}).)*".freeze
+  MACROS       = "(#{NOT_MACRO})(?:#{MACRO})?(#{NOT_MACRO})".freeze
+  PARTIAL_STMT = "^\\s*(?:(#{MODIFIER})\\s+)?" \
+    "(?:(#{TERM})(?:\\s+(#{TERM}))?(?:\\s+(#{DESIGNATOR}))?|" \
+    "(#{TERM})\\s+(#{DESIGNATOR})\\s+(#{TERM})|" \
+    "(#{TERM})\\s+(#{TERM})(?:\\s+(#{DESIGNATOR}))?\\s(#{TERM}))" \
+    "(?:\\s+(\\$))?\\s*$".freeze
+
+  GRAMMAR = /#{PARTIAL_STMT}/o
+  MAP     = %i[modifier term1 term2 designator term1 designator graph
+             term1 term2 designator graph deref]
+
+  # these should be instance_exec'd
+  SPECIALS = {
+    SUBJECT: -> val {
+      @subject = resolve_term val[-1] unless val.empty? },
+    GRAPH:   -> val {
+      @graph = resolve_term val[-1] unless val.empty? },
+    PREFIX:  -> val {
+      val.each do |v, _|
+        next unless m = /^\s*(#{NCNAME}):\s+(.*)$/o.match(v)
+        prefix, uri = m.captures
+        @namespaces[prefix.to_sym] = RDF::Vocabulary.new uri
+      end
+    },
+  }
+
+  # macros are initially represented as a pair: the macro value and a
+  # flag denoting whether or not the macro itself contains macros and to
+  # try to dereference it.
+  GENERATED = {
+    NEW_UUID:     [[-> { UUIDTools::UUID.random_create.to_s   }, false]],
+    NEW_UUID_URN: [[-> { UUIDTools::UUID.random_create.to_uri }, false]],
+    NEW_BNODE:    [[-> { "_:#{UUID::NCName.to_ncname_64(
+          UUIDTools::UUID.random_create.to_s, version: 1) }" }, false]],
+  }
+
+  # just the classics
+  DEFAULT_NS = {
+    rdf:  RDF::RDFV,
+    rdfs: RDF::RDFS,
+    owl:  RDF::OWL,
+    xsd:  RDF::XSD,
+  }.freeze
+
+  def deref_content strings, macros
+    strings = [strings] unless strings.is_a? Array
+    # bail out early if there is nothing to do
+    return strings unless strings.any? { |s| /#{MACRO}/o.match s }
+    out = []
+    strings.each do |s|
+      # sometimes these are arrays of arrays
+      #s = s.first if s.is_a? Array
+
+      # chunks are parallel output; each element is a value
+      chunks = []
+      s.scan(/\G#{MACROS}/o) do |m|
+        pre   = m.first
+        macro = m[1] || m[2]
+        post  = m[3]
+
+        # skip if there was no macro
+        unless macro
+          # nothing to do
+          next if pre + post == ""
+          chunks = chunks.empty? ? [pre, post] : chunks.map do |x|
+            "#{x}#{pre}#{post}"
+          end
+          next
+        end
+
+        # dereference the macro (or noop if unbound)
+        macro = macro.to_sym
+        x = if macros[macro]
+              macros[macro].map do |m|
+                '%s%s%s' % [pre, m.respond_to?(:call) ? m.call : m, post]
+              end
+            else
+              # this is a noop
+              ["#{pre}$#{macro}#{post}"]
+            end
+
+        # initialize chunks
+        if chunks.empty?
+          chunks = x
+          next
+        elsif !x.empty?
+          # replace chunks with the product of itself and x
+          y = []
+          chunks.each { |c| x.each { |d| y << "#{c}#{d}" } }
+          chunks = y
+        end
+      end
+
+      out.concat chunks
+    end
+
+    out
+  end
+
+  def massage_macros macros
+    seen = {}
+    done = GENERATED.transform_values { |v| v.map { |w| w.first } }
+    pending = macros.reject { |k, _| GENERATED.key? k }
+    queue   = pending.keys.slice 0..0 # take a zero-or-one-element slice
+
+    until queue.empty?
+      k = queue.shift
+      seen[k] = true
+
+      vals = macros[k]
+
+      # done and pending macros within the macros
+      dm = {}
+      pm = {}
+
+      vals.each do |pair|
+        val, deref = pair
+
+        next unless deref
+
+        if deref.is_a? Array
+          deref.each do |m|
+            done[m] ? dm[m] = true : pm[m] = true
+          end
+        else
+          m = {}
+          val.scan(/#{MACRO}/o).compact.each do |x|
+            x = x.to_sym
+            next unless macros[x]
+            raise "Self-reference found: #{x}" if x == k
+
+            m[x] = true
+
+            done[m] ? dm[m] = true : pm[m] = true
+          end
+          # push the deref
+          pair[1] = m.empty? ? false : m.keys.sort
+        end
+      end
+
+      # macro values have pending matches
+      if !pm.empty?
+        q = []
+        pm.keys.each do |m|
+          raise "Cycle detected between #{k} and #{m}" if seen[m]
+          q << m
+        end
+
+        queue = q + [k] + queue
+        next
+      end
+
+      unless dm.empty?
+        done[k] = deref_content vals, done
+      else
+        done[k] = vals.map(&:first)
+      end
+
+      # remember to remove this guy or we'll loop forever
+      pending.delete k
+
+      # replenish the queue with another pending object
+      queue << pending.keys.first if queue.empty? and !pending.keys.empty?
+    end
+
+    done
+  end
+
+  # unconditionally return a uri or bnode
+  def resolve_term term
+    return term if term.is_a? RDF::Term
+    term = term.to_s
+
+    # bnode ahoy
+    return RDF::Node.new term.delete_prefix '_:' if term.start_with? '_:'
+
+    # ugh now we gotta do urls
+    if m = /^(#{NCNAME}):(\S*)$/o.match(term)
+      prefix, slug = m.captures
+      if !slug.start_with?(?/) and vocab = namespaces[prefix.to_sym]
+        return vocab[slug]
+      end
+    end
+
+    # now resolve against base
+    RDF::URI((URI(subject.to_s) + term).to_s)
+  end
+
+  # may accept and respond with nil
+  def coerce_term token, hint = nil, langdt = nil
+    return unless token
+    return token if token.is_a? RDF::Term
+    hint ||= ?:
+    term = nil
+    if [?:, ?_].include? hint
+      return if token.empty?
+      token = '_:' + token if hint == ?_ and !token.start_with? '_:'
+      term = resolve_term token
+    elsif hint == ?@
+      term = RDF::Literal(token, language: langdt.to_s.to_sym)
+    elsif hint == ?^
+      raise 'datatype must be an RDF::Resource' unless
+        langdt.is_a? RDF::Resource
+      term = RDF::Literal(token, datatype: langdt)
+    elsif hint == ?'
+      term = RDF::Literal(token)
+    else
+      raise ArgumentError, "Unrecognized hint (#{hint})"
+    end
+
+    # call the callback if we have one
+    term = callback.call term if callback
+      
+    term
+  end
+
+  public
+
+  attr_reader :subject, :graph, :namespaces, :callback
+
+  # Initialize the processor.
+  #
+  # @param subject    [RDF::URI] The default subject. Required.
+  # @param graph      [RDF::URI] The default context. Optional.
+  # @param namespaces [Hash]     Namespace/prefix mappings. Optional.
+  # @param callback   [#call]    A callback that expects and returns a term.
+  #  Optional.
+  #
+  def initialize subject: nil, graph: nil, namespaces: {}, callback: nil
+    # look at all of our pretty assertions
+    raise ArgumentError, 'subject must be an RDF::Resource' unless
+      subject.is_a? RDF::Resource
+    raise ArgumentError, 'graph must be an RDF::Resource' unless
+      graph.nil? or graph.is_a? RDF::Resource
+    raise ArgumentError, 'namespaces must be hashable' unless
+      namespaces.respond_to? :to_h
+    rase ArgumentError, 'callback must be callable' unless
+      callback.nil? or callback.respond_to? :call
+
+    @subject    = subject
+    @graph      = graph
+    @callback   = callback
+    @namespaces = DEFAULT_NS.merge(namespaces.to_h.map do |k, v|
+      k = k.to_s.to_sym    unless k.is_a? Symbol
+      # coerce to uri
+      v = RDF::URI(v.to_s) unless v.is_a? RDF::Resource
+      # now coerce to vocabulary
+      v = RDF::Vocabulary.new v unless v.is_a? RDF::Vocabulary
+      [k, v]
+    end.to_h)
+  end
+
+  # Process a hash of form input.
+
+  # @note This operation may change the state of the processor, so
+  #  while this object can be reused for multiple hashes, it is unwise
+  #  to reuse it across requests.
+  #
+  # @param data [Hash] The data coming, e.g., from the Web form.
+  # @return [RDF::Changeset] A changeset containing the results.
+  #
+  def process data
+    raise ArgumentError, 'data must be a hash' unless data.is_a? Hash
+    macros  = GENERATED.dup
+    maybe   = {} # candidates
+    neither = {} # discard pile
+
+    data.each do |k, *v|
+      # step 0: get the values to a homogeneous list
+      k = k.to_s
+      v = v.flatten.map(&:to_s)
+      # step 1: pull out all the macro declarations
+      if (m = /#{DECLARATION}/o.match k)
+        name  = m[1].to_sym
+        sigil = !!(m[2] && !m[2].empty?)
+        # skip over generated macros
+        next if GENERATED.key? name
+        # step 1.0.1: create [content, deref flag] pairs
+        (macros[name] ||= []).concat v.map { |x| [x, sigil] }
+      elsif (m = /(?:^\s*\S+\s+\S+.*?$|[:\$])/.match k)
+        (maybe[k] ||= []).concat v
+      else
+        (neither[k] ||= []).concat v
+      end
+    end
+
+    # step 2: dereference all the macros (that asked to be dereferenced)
+    begin
+      macros = massage_macros macros
+    rescue e
+      # XXX we should do something more here
+      raise e
+    end
+
+    # step 3: apply special control macros (which modify self)
+    begin
+      SPECIALS.each do |k, macro|
+        instance_exec macros[k], &macro if macros[k]
+      end
+    rescue Exception => e
+      # again this should be nicer
+      raise e
+    end
+
+    # this will be our output
+    patch = RDF::Changeset.new
+
+    maybe.each do |k, v|
+      # this will return an array now
+      k = deref_content(k, macros).compact
+      v = v.compact.map(&:strip).uniq
+
+      # this is only this way because of macros
+      k.each do |template|
+        tokens = GRAMMAR.match(template) or next
+        tokens = tokens.captures
+
+        raise 'INTERNAL ERROR: Regexp captures do not match template' unless
+          tokens.length == MAP.length
+
+        # i had something much cleverer here but of course it didn't DWIW
+        contents = {}
+        MAP.each_index { |i| contents[MAP[i]] ||= tokens[i] }
+        contents.compact!
+
+        contents[:modifier] = (contents[:modifier] || '').chars.map do |c|
+          [c, true]
+        end.to_h
+
+        if contents[:designator]
+          sigil, symbol = contents[:designator].split '', 2
+          symbol = resolve_term symbol if sigil == ?^
+          contents[:designator] = symbol.to_s.empty? ? [sigil] : [sigil, symbol]
+        else
+          contents[:designator] = [contents[:modifier][?!] ? ?: : ?']
+        end
+
+        %i[term1 term2 graph].filter { |t| contents[t] }.each do |which|
+          contents[which] = resolve_term contents[which]
+        end
+
+        # these are the values we actually use; ensure they are duplicated
+        values = (contents[:deref] ? deref_content(v, macros) : v).dup
+
+        g = coerce_term(contents[:graph]) || graph
+        # initialize the triple
+        s, p, o = nil
+
+        # shorthand for reverse
+        if reverse = !!contents[:modifier][?!]
+          # literals make no sense on reverse statements
+          # (XXX this is a candidate for diagnostics)
+          next unless [?_, ?:].include? contents[:designator].first
+          # these terms have already been resolved/coerced
+          p = contents[:term1]
+          o = contents[:term2] || subject
+        else
+          s, p = (contents[:term2] ? contents.values_at(:term1, :term2) :
+                  [subject, contents[:term1]]).map { |t| resolve_term t }
+        end
+
+        # the operation depends on whether the `-` modifier is present
+        op = contents[:modifier][?-] ? :delete : :insert
+
+        # if we're deleting triples and the values contain an empty
+        # string then we're deleting a wildcard, same if we `=` overwrite
+        if !reverse and op == :delete && values.include?('') ||
+            contents[:modifier][?=]
+          # i can't remember why we don't do this in reverse, probably
+          # because it is too easy to shoot yourself in the foot
+          patch.delete RDF::Statement(s, p, nil, graph_name: g)
+
+          # nuke these since it will be pointless to evaluate further
+          values.clear if op == :delete
+        end
+
+        # otherwise the code is basically the same
+        values.each do |x|
+          # get what should be guaranteed to be an RDF term or nil
+          x = coerce_term(x, *contents[:designator]) or next
+
+          # now we assign the appropriate direction
+          reverse ? s = x : o = x
+
+          # this will be either insert or delete
+          patch.send op, RDF::Statement(s, p, o, graph_name: g)
+        end
+      end
+    end
+
+    patch
+  end
+end

data/lib/rdf/kv/version.rb

@@ -0,0 +1,5 @@
+module RDF
+  class KV
+    VERSION = "0.1.0"
+  end
+end

data/rdf-kv.gemspec

@@ -0,0 +1,44 @@
+# -*- mode: enh-ruby -*-
+require_relative 'lib/rdf/kv/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = 'rdf-kv'
+  spec.version       = RDF::KV::VERSION
+  spec.authors       = ['Dorian Taylor']
+  spec.email         = ['code@doriantaylor.com']
+  spec.license       = 'Apache-2.0'
+  spec.homepage      = 'https://github.com/doriantaylor/rb-rdf-kv'
+  spec.summary       = 'Ruby implementation of the RDF-KV protocol'
+  spec.description   = <<-DESC
+This module implements https://doriantaylor.com/rdf-kv, taking
+key-value input (e.g. from a Web form) and converting it into an
+RDF::Changeset.
+  DESC
+
+  spec.metadata['homepage_uri'] = spec.homepage
+
+  # Specify which files should be added to the gem when it is
+  # released. The `git ls-files -z` loads the files in the RubyGem
+  # that have been added into git.
+  spec.files         = Dir.chdir(File.expand_path('..', __FILE__)) do
+    `git ls-files -z`.split("\x0").reject do |f|
+      f.match(%r{^(test|spec|features)/})
+    end
+  end
+  spec.bindir        = 'exe'
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ['lib']
+
+  spec.required_ruby_version = Gem::Requirement.new('>= 2.3.0')
+  # dev/test dependencies
+  spec.add_development_dependency 'bundler',   '~> 2'
+  spec.add_development_dependency 'rdf-vocab', '~> 3.1'
+
+  # stuff we use
+  spec.add_runtime_dependency 'rdf',       '>= 3.1.1' # include my changes
+  spec.add_runtime_dependency 'uuidtools', '~> 2'
+
+  # stuff i wrote
+  spec.add_runtime_dependency 'uuid-ncname', '>= 0.2.5'
+
+end

metadata

@@ -0,0 +1,129 @@
+--- !ruby/object:Gem::Specification
+name: rdf-kv
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Dorian Taylor
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2020-01-09 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2'
+- !ruby/object:Gem::Dependency
+  name: rdf-vocab
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.1'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.1'
+- !ruby/object:Gem::Dependency
+  name: rdf
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 3.1.1
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 3.1.1
+- !ruby/object:Gem::Dependency
+  name: uuidtools
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2'
+- !ruby/object:Gem::Dependency
+  name: uuid-ncname
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 0.2.5
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 0.2.5
+description: |
+  This module implements https://doriantaylor.com/rdf-kv, taking
+  key-value input (e.g. from a Web form) and converting it into an
+  RDF::Changeset.
+email:
+- code@doriantaylor.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- ".travis.yml"
+- Gemfile
+- LICENSE
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- lib/rdf/kv.rb
+- lib/rdf/kv/version.rb
+- rdf-kv.gemspec
+homepage: https://github.com/doriantaylor/rb-rdf-kv
+licenses:
+- Apache-2.0
+metadata:
+  homepage_uri: https://github.com/doriantaylor/rb-rdf-kv
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 2.3.0
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.1.2
+signing_key: 
+specification_version: 4
+summary: Ruby implementation of the RDF-KV protocol
+test_files: []