fa 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 4b7eae1d9e0955a9ef22ede62cdf480030dbf27f
+  data.tar.gz: 2cb62222893579c9b18c61a550d90722417583f6
+SHA512:
+  metadata.gz: 6b4644001fd36dac35f6f0c033a510e8b14e448ae615ec0bb3d74094277c3ed025b95ae6226fca3687611f31631e644a1e95b925fe91d6e46ddde83e014ae9fb
+  data.tar.gz: 0aa3a9e2338f14cb695d39a0873075c49a84f4adb05c6d749159c1869c679c8ffd83d5d457beb3f083061833cf887debda4cf7b8fbc8971c213ebcbca06d91da

data/.gitignore

@@ -0,0 +1,9 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/

data/.travis.yml

@@ -0,0 +1,5 @@
+sudo: false
+language: ruby
+rvm:
+  - 2.3.1
+before_install: gem install bundler -v 1.14.6

data/AUTHORS

@@ -0,0 +1,3 @@
+Written by:
+
+  David Lutterkort <lutter@watzmann.net>

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in fa.gemspec
+gemspec

data/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2017 David Lutterkort
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

data/README.md

@@ -0,0 +1,36 @@
+# Fa
+
+Welcome to your new gem! In this directory, you'll find the files you need to be able to package up your Ruby library into a gem. Put your Ruby code in the file `lib/fa`. To experiment with that code, run `bin/console` for an interactive prompt.
+
+TODO: Delete this and the text above, and describe your gem
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'fa'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install fa
+
+## Usage
+
+TODO: Write usage instructions here
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake test` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/fa.
+

data/Rakefile

@@ -0,0 +1,10 @@
+require "bundler/gem_tasks"
+require "rake/testtask"
+
+Rake::TestTask.new(:test) do |t|
+  t.libs << "test"
+  t.libs << "lib"
+  t.test_files = FileList['test/**/*_test.rb']
+end
+
+task :default => :test

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "fa"
+
+# 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/fa.gemspec

@@ -0,0 +1,38 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'fa/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "fa"
+  spec.version       = Fa::VERSION
+  spec.authors       = ["David Lutterkort\n"]
+  spec.email         = ["lutter@watzmann.net"]
+  spec.licenses      = ["MIT"]
+
+  spec.summary       = %q{Bindings for libfa, a library for computing with regular expressions.}
+  spec.description   = <<EOS
+Bindings for libfa, a library to manipulate finite automata. Automata are
+constructed from regular expressions, using extended POSIX syntax, and make
+it possible to compute interesting things like the intersection of two
+regular expressions (all strings matched by both), or the complement of a
+regular expression (all strings _not_ matched by the regular
+expression). It is possible to convert from regular expression (compile) to
+finite automaton, and from finite automaton to regular expression
+(as_regexp)
+EOS
+  spec.homepage      = "https://github.com/lutter/ruby-fa"
+
+  spec.files         = `git ls-files -z`.split("\x0").reject do |f|
+    f.match(%r{^(test|spec|features)/})
+  end
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+
+  spec.add_dependency "ffi"
+
+  spec.add_development_dependency "bundler", "~> 1.14"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "minitest", "~> 5.0"
+end

data/lib/fa.rb

@@ -0,0 +1,117 @@
+require "fa/version"
+require "fa/ffi"
+
+module Fa
+  class Error < StandardError; end
+
+  class OutOfMemoryError < Error; end
+
+  class Automaton < ::FFI::AutoPointer
+    attr_reader :faptr
+
+    def initialize(faptr)
+      @faptr = faptr
+    end
+
+    def minimize
+      r = FFI::minimize(faptr)
+      raise Error if r < 0
+      self
+    end
+
+    def concat(other)
+      from_ptr( FFI::concat(faptr, other.faptr) )
+    end
+
+    def union(other)
+      from_ptr( FFI::union(faptr, other.faptr) )
+    end
+
+    def iter(min, max)
+      from_ptr( FFI::iter(faptr, min, max) )
+    end
+
+    def star
+      iter(0, -1)
+    end
+
+    def plus
+      iter(1, -1)
+    end
+
+    def maybe
+      iter(0, 1)
+    end
+
+    def intersect(other)
+      from_ptr( FFI::intersect(faptr, other.faptr) )
+    end
+
+    def minus(other)
+      from_ptr( FFI::minus(faptr, other.faptr) )
+    end
+
+    def complement
+      from_ptr( FFI::complement(faptr) )
+    end
+
+    def equals(other)
+      r = FFI::equals(faptr, other.faptr)
+      raise Error if r < 0
+      return r == 1
+    end
+
+    def contains(other)
+      # The C function works like fa1 <= fa2, and not how the
+      # Ruby nomenclature would suggest it, so swap the arguments
+      r = FFI::contains(other.faptr, faptr)
+      raise Error if r < 0
+      return r == 1
+    end
+
+    def is_basic(basic)
+      # FFI::is_basic checks if the automaton is structurally the same as
+      # +basic+; we just want to check here if they accept the same
+      # language. If is_basic fails, we therefore check for equality
+      r = FFI::is_basic(faptr, basic)
+      return true if r == 1
+      return equals(Fa::make_basic(basic))
+    end
+
+    def empty?; is_basic(:empty); end
+    def epsilon?; is_basic(:epsilon); end
+    def total?; is_basic(:total); end
+
+    def as_regexp
+      rx = ::FFI::MemoryPointer.new :string
+      rx_len = ::FFI::MemoryPointer.new :size_t
+      r = FFI::as_regexp(faptr, rx, rx_len)
+      raise OutOfMemoryError if r < 0
+      str_ptr = rx.read_pointer()
+      return str_ptr.null? ? nil : str_ptr.read_string()
+    end
+
+    def self.release(faptr)
+      FFI::free(faptr)
+    end
+
+    :private
+    def from_ptr(ptr)
+      raise OutOfMemoryError if ptr.nil?
+      Automaton.new(ptr)
+    end
+  end
+
+  def self.compile(rx)
+    faptr = ::FFI::MemoryPointer.new :pointer
+    r = FFI::compile(rx, rx.size, faptr)
+    raise Error if r < 0
+    Automaton.new(faptr.get_pointer(0))
+  end
+
+  def self.make_basic(kind)
+    faptr = FFI::make_basic(kind)
+    raise OutOfMemoryError if faptr.nil?
+    Automaton.new(faptr)
+  end
+end

data/lib/fa/ffi.rb

@@ -0,0 +1,42 @@
+require 'ffi'
+
+module Fa::FFI
+  extend FFI::Library
+
+  ffi_lib 'fa'
+
+  enum :basic, [ :empty, :epsilon, :total ]
+
+  attach_function :compile, :fa_compile, [ :string, :size_t, :pointer ], :int
+  attach_function :make_basic, :fa_make_basic, [ :basic ], :pointer
+
+  attach_function :minimize, :fa_minimize, [ :pointer ], :int
+
+  attach_function :concat, :fa_concat, [ :pointer, :pointer ], :pointer
+  attach_function :union, :fa_union, [ :pointer, :pointer ], :pointer
+  attach_function :intersect, :fa_intersect, [ :pointer, :pointer ], :pointer
+  attach_function :complement, :fa_complement, [ :pointer ], :pointer
+  attach_function :minus, :fa_minus, [ :pointer, :pointer ], :pointer
+  attach_function :iter, :fa_iter, [ :pointer, :int, :int ], :pointer
+
+  attach_function :contains, :fa_contains, [ :pointer, :pointer ], :int
+  attach_function :equals, :fa_equals, [ :pointer, :pointer ], :int
+  attach_function :is_basic, :fa_is_basic, [ :pointer, :basic ], :int
+
+  attach_function :as_regexp, :fa_as_regexp,
+                  [ :pointer, :pointer, :pointer ], :int
+  attach_function :free, :fa_free, [ :pointer ], :void
+
+  # Missing bindings:
+  #   fa_dot
+  #   fa_overlap
+  #   fa_example
+  #   fa_ambig_example
+  #   fa_as_regexp
+  #   fa_restrict_alphabet
+  #   fa_expand_char_ranges
+  #   fa_nocase
+  #   fa_is_nocase
+  #   fa_expand_nocase
+  #   fa_enumerate
+end

data/lib/fa/version.rb

@@ -0,0 +1,3 @@
+module Fa
+  VERSION = "0.1.0"
+end

metadata

@@ -0,0 +1,123 @@
+--- !ruby/object:Gem::Specification
+name: fa
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- 'David Lutterkort
+
+'
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2017-09-17 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: ffi
+  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: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.14'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.14'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '5.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '5.0'
+description: |
+  Bindings for libfa, a library to manipulate finite automata. Automata are
+  constructed from regular expressions, using extended POSIX syntax, and make
+  it possible to compute interesting things like the intersection of two
+  regular expressions (all strings matched by both), or the complement of a
+  regular expression (all strings _not_ matched by the regular
+  expression). It is possible to convert from regular expression (compile) to
+  finite automaton, and from finite automaton to regular expression
+  (as_regexp)
+email:
+- lutter@watzmann.net
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".travis.yml"
+- AUTHORS
+- Gemfile
+- LICENSE
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- fa.gemspec
+- lib/fa.rb
+- lib/fa/ffi.rb
+- lib/fa/version.rb
+homepage: https://github.com/lutter/ruby-fa
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.5.1
+signing_key: 
+specification_version: 4
+summary: Bindings for libfa, a library for computing with regular expressions.
+test_files: []