multi_string_replace 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 212107102a63c46a717026fbc8c853da01204b73cfda68fa7ff58909d72cade7
+  data.tar.gz: 59cafa3a2e9c934e4824a61f87372524b765ba52c4ddadda1283b42f52d4860a
+SHA512:
+  metadata.gz: '073753252667508ac0006fe6b6b9d88d5890aaea4a102a94622dcc1e8d12dee9f3760fa1c98ca8ee343b289b474e6e0a89e8cd81379aa618b11d9096154d50e5'
+  data.tar.gz: c18f648b5a010e926f8d79b219fc67ccd96dd76fe213003988e265c16279e24d0117678f12526be5c54021065da175101546d5fccc88e3f84a3a2dbeee6f7d15

data/.gitignore

@@ -0,0 +1,19 @@
+/.bundle/
+/.yardoc
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+*.bundle
+*.o
+*.log
+*.so
+
+extconf.h
+Makefile
+
+# rspec failure tracking
+.rspec_status
+

data/.rspec

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

data/.travis.yml

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

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,74 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+In the interest of fostering an open and welcoming environment, we as
+contributors and maintainers pledge to making participation in our project and
+our community a harassment-free experience for everyone, regardless of age, body
+size, disability, ethnicity, gender identity and expression, level of experience,
+nationality, personal appearance, race, religion, or sexual identity and
+orientation.
+
+## Our Standards
+
+Examples of behavior that contributes to creating a positive environment
+include:
+
+* Using welcoming and inclusive language
+* Being respectful of differing viewpoints and experiences
+* Gracefully accepting constructive criticism
+* Focusing on what is best for the community
+* Showing empathy towards other community members
+
+Examples of unacceptable behavior by participants include:
+
+* The use of sexualized language or imagery and unwelcome sexual attention or
+advances
+* Trolling, insulting/derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or electronic
+  address, without explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Our Responsibilities
+
+Project maintainers are responsible for clarifying the standards of acceptable
+behavior and are expected to take appropriate and fair corrective action in
+response to any instances of unacceptable behavior.
+
+Project maintainers have the right and responsibility to remove, edit, or
+reject comments, commits, code, wiki edits, issues, and other contributions
+that are not aligned to this Code of Conduct, or to ban temporarily or
+permanently any contributor for other behaviors that they deem inappropriate,
+threatening, offensive, or harmful.
+
+## Scope
+
+This Code of Conduct applies both within project spaces and in public spaces
+when an individual is representing the project or its community. Examples of
+representing a project or community include using an official project e-mail
+address, posting via an official social media account, or acting as an appointed
+representative at an online or offline event. Representation of a project may be
+further defined and clarified by project maintainers.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported by contacting the project team at joseph.dayo@gmail.com. All
+complaints will be reviewed and investigated and will result in a response that
+is deemed necessary and appropriate to the circumstances. The project team is
+obligated to maintain confidentiality with regard to the reporter of an incident.
+Further details of specific enforcement policies may be posted separately.
+
+Project maintainers who do not follow or enforce the Code of Conduct in good
+faith may face temporary or permanent repercussions as determined by other
+members of the project's leadership.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,
+available at [http://contributor-covenant.org/version/1/4][version]
+
+[homepage]: http://contributor-covenant.org
+[version]: http://contributor-covenant.org/version/1/4/

data/Gemfile

@@ -0,0 +1,6 @@
+source "https://rubygems.org"
+
+git_source(:github) {|repo_name| "https://github.com/#{repo_name}" }
+
+# Specify your gem's dependencies in multi_string_replace.gemspec
+gemspec

data/Gemfile.lock

@@ -0,0 +1,48 @@
+PATH
+  remote: .
+  specs:
+    multi_string_replace (0.1.0)
+
+GEM
+  remote: https://rubygems.org/
+  specs:
+    byebug (10.0.2)
+    coderay (1.1.2)
+    diff-lcs (1.3)
+    method_source (0.9.0)
+    pry (0.11.3)
+      coderay (~> 1.1.0)
+      method_source (~> 0.9.0)
+    pry-byebug (3.6.0)
+      byebug (~> 10.0)
+      pry (~> 0.10)
+    rake (10.5.0)
+    rake-compiler (1.0.5)
+      rake
+    rspec (3.8.0)
+      rspec-core (~> 3.8.0)
+      rspec-expectations (~> 3.8.0)
+      rspec-mocks (~> 3.8.0)
+    rspec-core (3.8.0)
+      rspec-support (~> 3.8.0)
+    rspec-expectations (3.8.1)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.8.0)
+    rspec-mocks (3.8.0)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.8.0)
+    rspec-support (3.8.0)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  bundler (~> 1.16)
+  multi_string_replace!
+  pry-byebug
+  rake (~> 10.0)
+  rake-compiler
+  rspec (~> 3.0)
+
+BUNDLED WITH
+   1.16.2

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2018 Joseph Dayo
+
+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,43 @@
+# MultiStringReplace
+
+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/multi_string_replace`. 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 'multi_string_replace'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install multi_string_replace
+
+## Usage
+
+TODO: Write usage instructions here
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake spec` 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]/multi_string_replace. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [Contributor Covenant](http://contributor-covenant.org) code of conduct.
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).
+
+## Code of Conduct
+
+Everyone interacting in the MultiStringReplace project’s codebases, issue trackers, chat rooms and mailing lists is expected to follow the [code of conduct](https://github.com/[USERNAME]/multi_string_replace/blob/master/CODE_OF_CONDUCT.md).

data/Rakefile

@@ -0,0 +1,11 @@
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+require "rake/extensiontask"
+
+RSpec::Core::RakeTask.new(:spec)
+
+Rake::ExtensionTask.new "multi_string_replace" do |ext|
+  ext.lib_dir = "lib/multi_string_replace"
+end
+
+task :default => :spec

data/bin/benchmark.rb

@@ -0,0 +1,38 @@
+require "bundler/setup"
+require 'multi_string_replace'
+require 'benchmark'
+require 'pry-byebug'
+
+class String
+  def mgsub(key_value_pairs=[].freeze)
+    regexp_fragments = key_value_pairs.collect { |k,v| k }
+    gsub( 
+Regexp.union(*regexp_fragments)) do |match|
+      key_value_pairs.detect{|k,v| k =~ match}[1]
+    end
+  end
+end
+
+body = File.read(File.join('spec', 'fixtures', 'test.txt'))
+
+replace = {
+  'Lorem' => 'XXXX',
+  'ipsum' => 'yyyyy',
+  'sapien' => 'zzzzzz',
+  'sed' => 'pppppppp',
+  'Fusce' => 'wwwwwwww',
+  'non' => 'NON',
+  'sit' => 'SIT',
+  'laoreet' => 'lllll',
+  'Cras' => 'uuuuuuuu',
+  'nunc' => 'eeeeeee',
+  'cursus' => '乧乨乩乪乫乬乭乮乯买乱乲乳乴乵乶乷乸乹乺乻乼乽乾乿',
+}
+
+File.write('replaced.txt', body.gsub(/(#{replace.keys.join('|')})/, replace))
+File.write('replaced2.txt', MultiStringReplace.replace(body, replace))
+
+Benchmark.bmbm do |x|
+  x.report "multi gsub" do body.mgsub(replace.map { |k, v| [/#{k}/, v] } ) end
+  x.report "MultiStringReplace" do MultiStringReplace.replace(body, replace) end
+end

data/bin/console

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

@@ -0,0 +1,78 @@
+#include "aho_queue.h"
+#include <string.h>
+#include <stdlib.h>
+
+void aho_queue_init(struct aho_queue * restrict que)
+{
+    memset(que, 0x00, sizeof(struct aho_queue));
+}
+
+void aho_queue_destroy(struct aho_queue * restrict que)
+{
+    struct aho_queue_node* que_node = NULL;
+    while ((que_node = aho_queue_dequeue(que)) != NULL)
+    {
+        free(que_node);
+    }
+}
+
+bool aho_queue_enqueue(struct aho_queue * restrict que, struct aho_trie_node* node)
+{
+    struct aho_queue_node* que_node;
+    que_node = (struct aho_queue_node*) malloc(sizeof(struct aho_queue_node));
+
+    if (!que_node)
+    {
+        /* free memory error!! */
+        return false;
+    }
+
+    memset(que_node, 0x00, sizeof(struct aho_queue_node));
+    que_node->data = node;
+
+    if (que->count == 0)
+    {
+        que->rear = que_node;
+        que->front = que_node;
+        que->count++;
+        return true;
+    }
+
+    que_node->prev = que->rear;
+    que->rear->next = que_node;
+    que->rear = que_node;
+    que->count++;
+
+    return true;
+}
+
+inline bool aho_queue_empty(struct aho_queue * restrict que)
+{
+    return (que->count == 0);
+}
+
+struct aho_queue_node* aho_queue_dequeue(struct aho_queue * restrict que)
+{
+    struct aho_queue_node* deque_node;
+    struct aho_queue_node* after_last_node;
+    if (aho_queue_empty(que) == true)
+    {
+        return NULL;
+    }
+
+    if (que->count == 1)
+    {
+        deque_node = que->rear;
+        que->front = que->rear = NULL;
+        que->count--;
+        return deque_node;
+    }
+
+    deque_node = que->rear;
+
+    after_last_node = que->rear->prev;
+    after_last_node->next = NULL;
+    que->rear = after_last_node;
+    que->count--;
+    return deque_node;
+}

data/ext/multi_string_replace/aho_queue.h

@@ -0,0 +1,26 @@
+#pragma once
+#include <stdbool.h>
+#include "aho_trie.h"
+
+struct aho_queue_node
+{
+    struct aho_queue_node *next, *prev;
+    struct aho_trie_node *data;
+};
+
+struct aho_queue
+{
+    struct aho_queue_node *front;
+    struct aho_queue_node *rear;
+    unsigned int count;
+};
+
+
+void aho_queue_init(struct aho_queue * restrict que);
+void aho_queue_destroy(struct aho_queue * restrict que);
+
+bool aho_queue_enqueue(struct aho_queue * restrict que, struct aho_trie_node *node);
+struct aho_queue_node* aho_queue_dequeue(struct aho_queue * restrict que);
+
+/* inline */
+bool aho_queue_empty(struct aho_queue * restrict que);

data/ext/multi_string_replace/aho_text.h

@@ -0,0 +1,9 @@
+#pragma once
+
+struct aho_text_t
+{
+    int id;
+    char* text;
+    int len;
+    struct aho_text_t *prev, *next;
+};

data/ext/multi_string_replace/aho_trie.c

@@ -0,0 +1,312 @@
+#include <string.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include "aho_trie.h"
+#include "aho_text.h"
+#include "aho_queue.h"
+
+void __aho_trie_node_init(struct aho_trie_node * restrict node)
+{
+    memset(node, 0x00, sizeof(struct aho_trie_node));
+    node->text_end = false;
+    node->ref_count = 1;
+}
+
+void aho_init_trie(struct aho_trie * restrict t)
+{
+    memset(t, 0x00, sizeof(struct aho_trie));
+    __aho_trie_node_init(&(t->root));
+}
+
+void aho_destroy_trie(struct aho_trie * restrict t)
+{
+    aho_clean_trie_node(t);
+}
+
+bool aho_add_trie_node(struct aho_trie * restrict t, struct aho_text_t * restrict text)
+{
+    struct aho_trie_node* travasal_node = &(t->root);
+
+    for (int text_idx = 0; text_idx < text->len; text_idx++)
+    {
+        unsigned char node_text = text->text[text_idx];
+        bool find_node = false;
+        int child_idx = 0;
+
+        if (travasal_node->child_count == 0)
+        {
+            /* insert first node to child_list */
+            travasal_node->child_list[0] =
+                         (struct aho_trie_node*) malloc(sizeof(struct aho_trie_node));
+            travasal_node->child_count++;
+
+            __aho_trie_node_init(travasal_node->child_list[0]);
+            travasal_node->child_list[0]->text = node_text;
+            travasal_node->child_list[0]->parent = travasal_node;
+
+            travasal_node = travasal_node->child_list[0];
+            continue;
+        }
+
+        if (travasal_node->child_count == MAX_AHO_CHILD_NODE)
+        {
+            return false;
+        }
+
+        for (child_idx=0; child_idx < travasal_node->child_count; child_idx++)
+        {
+            if (travasal_node->child_list[child_idx]->text == node_text )
+            {
+                find_node = true;
+                break;
+            }
+        }
+
+        if (find_node == true)
+        {
+            travasal_node->child_list[child_idx]->ref_count++;
+            travasal_node = travasal_node->child_list[child_idx];
+        }
+        else
+        {
+            /* push_back to child_list */
+            struct aho_trie_node* child_node = NULL;
+
+            travasal_node->child_list[travasal_node->child_count] =
+                         (struct aho_trie_node*) malloc(sizeof(struct aho_trie_node));
+
+            child_node = travasal_node->child_list[travasal_node->child_count];
+            travasal_node->child_count++;
+
+            __aho_trie_node_init(child_node);
+            child_node->text = node_text;
+            child_node->parent = travasal_node;
+
+            travasal_node = child_node;
+        }
+    }
+
+    // connect output link
+    if (travasal_node)
+    {
+        travasal_node->text_end = true;
+        travasal_node->output_text = text;
+    }
+    return true;
+}
+
+bool __aho_connect_link(struct aho_trie_node* p, struct aho_trie_node* q)
+{
+    struct aho_trie_node *pf = NULL;
+    int i = 0;
+
+    /* is root node */
+    if (p->parent == NULL)
+    {
+        q->failure_link = p;
+        return true;
+    }
+
+    pf = p->failure_link;
+    for (i=0; i < pf->child_count; i++)
+    {
+        /* check child node of failure link(p) */
+        if (pf->child_list[i]->text == q->text )
+        {
+            /* connect failure link */
+            q->failure_link = pf->child_list[i];
+
+            /* connect output link */
+            if (pf->child_list[i]->text_end)
+            {
+                q->output_link = pf->child_list[i];
+            }
+            else
+            {
+                q->output_link = pf->child_list[i]->output_link;
+            }
+            return true;
+        }
+    }
+    return false;
+}
+
+void aho_connect_link(struct aho_trie * restrict t)
+{
+    struct aho_queue queue;
+    aho_queue_init(&queue);
+    aho_queue_enqueue(&queue, &(t->root));
+
+    /* BFS access
+     *  connect failure link and output link
+     */
+    while (true)
+    {
+        /* p :parent, q : child node */
+        struct aho_queue_node *queue_node = NULL;
+        struct aho_trie_node *p = NULL;
+        struct aho_trie_node *q = NULL;
+        int i = 0;
+
+        queue_node = aho_queue_dequeue(&queue);
+        if (queue_node == NULL)
+        {
+            break;
+        }
+
+        p = queue_node->data;
+        free(queue_node);
+
+        /* get child node list of p */
+        for (i=0; i < p->child_count; i++)
+        {
+            struct aho_trie_node *pf = p;
+
+            aho_queue_enqueue(&queue, p->child_list[i]);
+            q = p->child_list[i];
+
+            while (__aho_connect_link(pf, q) == false)
+            {
+                pf = pf->failure_link;
+            }
+        }
+    }
+
+    aho_queue_destroy(&queue);
+}
+
+void aho_clean_trie_node(struct aho_trie * restrict t)
+{
+    struct aho_queue queue;
+    aho_queue_init(&queue);
+    aho_queue_enqueue(&queue, &(t->root));
+
+    /* BFS */
+    while (true)
+    {
+        struct aho_queue_node *queue_node = NULL;
+        struct aho_trie_node *remove_node = NULL;
+        int i = 0;
+
+        queue_node = aho_queue_dequeue(&queue);
+        if (queue_node == NULL)
+        {
+            break;
+        }
+
+        remove_node = queue_node->data;
+        free(queue_node);
+
+        for (i=0; i < remove_node->child_count; i++)
+        {
+            aho_queue_enqueue(&queue, remove_node->child_list[i]);
+        }
+
+        /* is root node */
+        if (remove_node->parent == NULL)
+        {
+            continue;
+        }
+
+        free(remove_node);
+    }
+}
+
+bool __aho_find_trie_node(struct aho_trie_node** restrict start, const unsigned char text)
+{
+    struct aho_trie_node* search_node = NULL;
+    int i = 0;
+
+    search_node = *start;
+    for (i = 0; i < search_node->child_count; i++)
+    {
+        if (search_node->child_list[i]->text == text)
+        {
+            /* find it! move to find child node! */
+            *start = search_node->child_list[i];
+            return true;
+        }
+    }
+
+    /* not found */
+    return false;
+}
+
+struct aho_text_t* aho_find_trie_node(struct aho_trie_node** restrict start, const unsigned char text)
+{
+    while (__aho_find_trie_node(start, text) == false)
+    {
+        /* not found!
+         * when root node stop
+         */
+        if( (*start)->parent == NULL)
+        {
+            return NULL;
+        }
+
+        /* retry find. move failure link. */
+        *start = (*start)->failure_link;
+    }
+
+    /* found node... */
+    /* match case1: find text end! */
+    if ((*start)->text_end)
+    {
+        return (*start)->output_text;
+    }
+
+    /* match case2: exist output_link */
+    if ((*start)->output_link)
+    {
+        return (*start)->output_link->output_text;
+    }
+
+    /* keep going */
+    return NULL;
+}
+
+void aho_print_trie(struct aho_trie * restrict t)
+{
+    struct aho_queue queue;
+    aho_queue_init(&queue);
+    aho_queue_enqueue(&queue, &(t->root));
+
+    /* BFS */
+    while (true)
+    {
+        struct aho_queue_node *queue_node = NULL;
+        struct aho_trie_node *travasal_node = NULL;
+        int i = 0;
+
+        queue_node = aho_queue_dequeue(&queue);
+        if (queue_node == NULL)
+        {
+            break;
+        }
+
+        travasal_node = queue_node->data;
+        free(queue_node);
+
+        for (i=0; i < travasal_node->child_count; i++)
+        {
+            aho_queue_enqueue(&queue, travasal_node->child_list[i]);
+        }
+
+        /* is root node */
+        if(travasal_node->parent == NULL)
+        {
+            printf("root node %p\n", travasal_node);
+            continue;
+        }
+
+        printf("%c (textend:%d) node %p ref %u (parent %p) failure_link(%p) output_link(%p)",
+                travasal_node->text, travasal_node->text_end,
+                travasal_node, travasal_node->ref_count,
+                travasal_node->parent, travasal_node->failure_link,
+                travasal_node->output_link);
+
+        printf("\n");
+    }
+
+    aho_queue_destroy(&queue);
+}

data/ext/multi_string_replace/aho_trie.h

@@ -0,0 +1,41 @@
+#pragma once
+#include <stdbool.h>
+#include <stdbool.h>
+
+#define MAX_AHO_CHILD_NODE 256 /* Character 1 byte => 256 */
+
+struct aho_trie_node
+{
+    unsigned char text;
+    unsigned int ref_count;
+
+    struct aho_trie_node* parent;
+    struct aho_trie_node* child_list[MAX_AHO_CHILD_NODE];
+    unsigned int child_count;
+
+    bool text_end;
+    struct aho_text_t* output_text; /* when text_end is true */
+
+    struct aho_trie_node* failure_link;
+    struct aho_trie_node* output_link;
+};
+
+struct aho_trie
+{
+    struct aho_trie_node root;
+};
+
+void aho_init_trie(struct aho_trie * restrict t);
+void aho_destroy_trie(struct aho_trie * restrict t);
+
+bool aho_add_trie_node(struct aho_trie * restrict t, struct aho_text_t * restrict text);
+void aho_connect_link(struct aho_trie * restrict t);
+void aho_clean_trie_node(struct aho_trie * restrict t);
+
+struct aho_text_t* aho_find_trie_node(struct aho_trie_node** restrict start, const unsigned char text);
+
+void aho_print_trie(struct aho_trie * restrict t);
+
+/* TODO:
+ * bool aho_del_trie_node(struct aho_trie* t, struct aho_text_t* text);
+ */

data/ext/multi_string_replace/ahocorasick.c

@@ -0,0 +1,229 @@
+#include <limits.h>
+#include <string.h>
+#include <stdlib.h>
+#include <stdio.h>
+
+#include "ahocorasick.h"
+#include "aho_trie.h"
+
+extern void aho_init(struct ahocorasick * restrict aho)
+{
+    memset(aho, 0x00, sizeof(struct ahocorasick));
+}
+
+void aho_destroy(struct ahocorasick * restrict aho)
+{
+    aho_clear_match_text(aho);
+    aho_clear_trie(aho);
+}
+
+int aho_add_match_text(struct ahocorasick * restrict aho, const char* text, unsigned int len)
+{
+    struct aho_text_t* a_text = NULL;
+    if (aho->accumulate_text_id == AHO_MAX_TEXT_ID)
+    {
+        return -1;
+    }
+
+    a_text = (struct aho_text_t*) malloc(sizeof(struct aho_text_t));
+    if (!a_text)
+        goto lack_free_mem;
+
+    a_text->text = (char*) malloc(sizeof(char)*len);
+    if (!a_text->text)
+        goto lack_free_mem;
+
+    a_text->id = aho->accumulate_text_id++;
+    memcpy(a_text->text, text, len);
+    a_text->len = len;
+    a_text->prev = NULL;
+    a_text->next = NULL;
+
+    if (aho->text_list_head == NULL)
+    {
+        aho->text_list_head = a_text;
+        aho->text_list_tail = a_text;
+        aho->text_list_len++;
+        return a_text->id;
+    }
+
+    aho->text_list_tail->next = a_text;
+    a_text->prev = aho->text_list_tail;
+    aho->text_list_tail = a_text;
+    aho->text_list_len++;
+    return a_text->id;
+
+lack_free_mem:
+    return -1;
+}
+
+bool aho_del_match_text(struct ahocorasick * restrict aho, const int id)
+{
+    struct aho_text_t* iter = NULL;
+    for (iter = aho->text_list_head; iter != NULL; iter = iter->next)
+    {
+        /*if (iter->id > id)
+        {
+            return false;
+        }
+        */
+
+        if (iter->id == id)
+        {
+            if (iter == aho->text_list_head)
+            {
+                aho->text_list_head = iter->next;
+            }
+            else if (iter == aho->text_list_tail)
+            {
+                aho->text_list_tail = iter->prev;
+            }
+            else
+            {
+                iter->prev->next = iter->next;
+                iter->next->prev = iter->prev;
+            }
+            free(iter);
+            aho->text_list_len--;
+            return true;
+        }
+    }
+    return false;
+}
+
+void aho_clear_match_text(struct ahocorasick * restrict aho)
+{
+    for(int i = 0; i < aho->accumulate_text_id; i++)
+    {
+        aho_del_match_text(aho, i);
+    }
+
+    // reset id
+    aho->accumulate_text_id = 0;
+}
+
+
+void aho_create_trie(struct ahocorasick * restrict aho)
+{
+    struct aho_text_t* iter = NULL;
+    aho_init_trie(&(aho->trie));
+
+    for (iter = aho->text_list_head; iter != NULL; iter = iter->next)
+    {
+        aho_add_trie_node(&(aho->trie), iter);
+    }
+
+    aho_connect_link(&(aho->trie));
+
+    /* debugging */
+    //aho_print_trie(&(aho->trie));
+}
+
+void aho_clear_trie(struct ahocorasick * restrict aho)
+{
+    aho_destroy_trie(&aho->trie);
+}
+
+unsigned int aho_findtext(struct ahocorasick * restrict aho, const char* data, unsigned long long data_len)
+{
+    int i = 0;
+    int match_count = 0;
+    struct aho_trie_node* travasal_node = NULL;
+
+    travasal_node = &(aho->trie.root);
+
+    for (i = 0; i < data_len; i++)
+    {
+        struct aho_match_t match;
+        struct aho_text_t* result;
+
+        result = aho_find_trie_node(&travasal_node, data[i]);
+        if (result == NULL)
+        {
+            continue;
+        }
+
+        match.id = result->id;
+        match.len = result->len;
+
+        match.pos = i - result->len + 1;
+        if (result->len == 1)
+        {
+            match.pos = i;
+        }
+
+        match_count++;
+        if (aho->callback_match)
+        {
+            aho->callback_match(aho->rb_result_container, aho->callback_arg, &match);
+        }
+    }
+
+    return match_count;
+}
+
+VALUE aho_replace_text(struct ahocorasick * restrict aho, const char* data, unsigned long long data_len, char *values[], VALUE ruby_values[])
+{
+    int i = 0;
+    int match_count = 0;
+    struct aho_trie_node* travasal_node = NULL;
+
+    travasal_node = &(aho->trie.root);
+    VALUE main_result = rb_str_new("", 0);
+
+    long last_concat_pos = 0;
+
+    for (i = 0; i < data_len; i++)
+    {
+        struct aho_match_t match;
+        struct aho_text_t* result;
+
+        result = aho_find_trie_node(&travasal_node, data[i]);
+        if (result == NULL)
+        {
+            continue;
+        }
+
+        long pos = i - result->len + 1;
+        if (result->len == 1)
+        {
+            pos = i;
+        }
+
+        // concatenate from last_concat_pos
+        rb_str_cat(main_result, &data[last_concat_pos], pos - last_concat_pos);
+        // concatenate replace
+        if (values[result->id] == NULL) {
+            VALUE proc_result = rb_funcall(ruby_values[result->id], rb_intern("call"), 0);
+            values[result->id] = StringValueCStr(proc_result);
+        }
+
+        rb_str_cat2(main_result, values[result->id]); 
+        last_concat_pos = i + 1;
+    }
+
+    if (last_concat_pos < data_len - 1) {
+        rb_str_cat(main_result, &data[last_concat_pos], data_len - last_concat_pos);
+    }
+
+    return main_result;
+}
+
+inline void aho_register_match_callback(VALUE rb_result_container, struct ahocorasick * restrict aho,
+        void (*callback_match)(VALUE rb_result_container, void* arg, struct aho_match_t*),
+        void *arg)
+{
+    aho->callback_arg = arg;
+    aho->callback_match = callback_match;
+    aho->rb_result_container = rb_result_container;
+}
+
+void aho_print_match_text(struct ahocorasick * restrict aho)
+{
+    struct aho_text_t* iter = NULL;
+    for (iter = aho->text_list_head; iter != NULL; iter = iter->next)
+    {
+        printf("id:%d text:%s len:%d this:%p prev:%p next:%p\n",
+                iter->id, iter->text, iter->len, iter, iter->prev, iter->next);
+    }
+}

data/ext/multi_string_replace/ahocorasick.h

@@ -0,0 +1,48 @@
+#pragma once
+
+#include <stdbool.h>
+#include "aho_trie.h"
+#include "aho_text.h"
+#include "ruby.h"
+
+struct aho_match_t
+{
+    int id;
+    unsigned long long pos;
+    int len;
+};
+
+struct ahocorasick
+{
+#define AHO_MAX_TEXT_ID INT_MAX
+    int accumulate_text_id;
+    struct aho_text_t* text_list_head;
+    struct aho_text_t* text_list_tail;
+    int text_list_len;
+
+    struct aho_trie trie;
+
+    void (*callback_match)(VALUE rb_result_container, void* arg, struct aho_match_t*);
+    void* callback_arg;
+    VALUE rb_result_container;
+};
+
+void aho_init(struct ahocorasick * restrict aho);
+void aho_destroy(struct ahocorasick * restrict aho);
+
+int aho_add_match_text(struct ahocorasick * restrict aho, const char* text, unsigned int len);
+bool aho_del_match_text(struct ahocorasick * restrict aho, const int id);
+void aho_clear_match_text(struct ahocorasick * restrict aho);
+
+void aho_create_trie(struct ahocorasick * restrict aho);
+void aho_clear_trie(struct ahocorasick * restrict aho);
+
+unsigned int aho_findtext(struct ahocorasick * restrict aho, const char* data, unsigned long long data_len);
+VALUE aho_replace_text(struct ahocorasick * restrict aho, const char* data, unsigned long long data_len, char *values[], VALUE ruby_values[]);
+
+void aho_register_match_callback(VALUE rb_result_container, struct ahocorasick * restrict aho,
+        void (*callback_match)(VALUE rb_result_container, void* arg, struct aho_match_t*),
+        void *arg);
+
+/* for debug */
+void aho_print_match_text(struct ahocorasick * restrict aho);

data/ext/multi_string_replace/extconf.rb

@@ -0,0 +1,3 @@
+require 'mkmf'
+create_header
+create_makefile 'multi_string_replace/multi_string_replace'

data/ext/multi_string_replace/multi_string_replace.c

@@ -0,0 +1,94 @@
+#include "ruby.h"
+#include "extconf.h"
+#include <stdio.h>
+#include <string.h>
+#include <pthread.h>
+#include "ahocorasick.h"
+
+void callback_match_pos(VALUE rb_result_container, void *arg, struct aho_match_t* m)
+{
+    
+    unsigned int i = m->pos, idx = 0;
+
+    VALUE key = LONG2NUM(m->id);
+    VALUE hash_value = rb_hash_aref(rb_result_container, key);
+
+    if (NIL_P(hash_value)) {
+      hash_value = rb_ary_new();
+      rb_hash_aset(rb_result_container, key, hash_value);
+    }
+    rb_ary_push(hash_value, LONG2NUM(m->pos)) ;
+}
+
+VALUE multi_string_match(VALUE self, VALUE body, VALUE keys)
+{
+  Check_Type(keys, T_ARRAY);
+  int state;
+  VALUE result = rb_hash_new();
+  struct ahocorasick aho;
+  aho_init(&aho);
+  char *target = StringValueCStr(body);
+  long size =  RARRAY_LEN(keys);
+  
+  for(long idx = 0; idx < size; idx++) {
+    VALUE entry = rb_ary_entry(keys, idx);
+    char *key_text = StringValueCStr(entry);
+    aho_add_match_text(&aho,  key_text, strlen(key_text));
+  }
+  aho_create_trie(&aho);
+  aho_register_match_callback(result, &aho, callback_match_pos, (void*)target);
+  long count = aho_findtext(&aho, target, strlen(target));
+  aho_destroy(&aho);
+  return result;
+}
+
+VALUE multi_string_replace(VALUE self, VALUE body, VALUE replace)
+{
+  Check_Type(replace, T_HASH);
+  int state;
+
+  struct ahocorasick aho;
+  aho_init(&aho);
+
+  char *target = StringValuePtr(body);
+  VALUE keys = rb_funcall(replace, rb_intern("keys"), 0);
+  VALUE replace_values = rb_funcall(replace, rb_intern("values"), 0);
+  long size =  RARRAY_LEN(keys);
+  char *values[size];
+  VALUE ruby_val[size];
+
+  for(long idx = 0; idx < size; idx++) {
+    VALUE entry = rb_ary_entry(keys, idx);
+    VALUE value = rb_ary_entry(replace_values, idx);
+    if (RB_TYPE_P(value, T_STRING)) {
+      values[idx] = StringValueCStr(value);
+    } else {
+      values[idx] = NULL;
+      ruby_val[idx] = value;
+    }
+    
+    aho_add_match_text(&aho, StringValuePtr(entry), RSTRING_LEN(entry));
+  }
+
+  aho_create_trie(&aho);
+
+  VALUE result = aho_replace_text(&aho, target, RSTRING_LEN(body), values, ruby_val);
+  aho_destroy(&aho);
+  return result;
+}
+
+void Init_multi_string_replace()
+{
+  int state;
+  VALUE mod = rb_eval_string_protect("MultiStringReplace", &state);
+
+  if (state)
+  {
+    /* handle exception */
+  } else {
+  rb_define_singleton_method(mod, "match", multi_string_match, 2);
+  rb_define_singleton_method(mod, "replace", multi_string_replace, 2);
+  }
+
+}
+

data/lib/multi_string_replace/version.rb

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

data/lib/multi_string_replace.rb

@@ -0,0 +1,6 @@
+require "multi_string_replace/version"
+require 'pry-byebug'
+require "multi_string_replace/multi_string_replace"
+
+module MultiStringReplace
+end

data/multi_string_replace.gemspec

@@ -0,0 +1,41 @@
+
+lib = File.expand_path("../lib", __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require "multi_string_replace/version"
+
+Gem::Specification.new do |spec|
+  spec.name          = "multi_string_replace"
+  spec.version       = MultiStringReplace::VERSION
+  spec.authors       = ["Joseph Dayo"]
+  spec.email         = ["joseph.dayo@gmail.com"]
+
+  spec.summary       = %q{Efficient O(N) multiword string replace for ruby}
+  spec.description   = %q{Efficient O(N) multiword string replace for ruby}
+  spec.homepage      = "https://github.com/jedld"
+  spec.license       = "MIT"
+
+  # Prevent pushing this gem to RubyGems.org. To allow pushes either set the 'allowed_push_host'
+  # to allow pushing to a single host or delete this section to allow pushing to any host.
+  if spec.respond_to?(:metadata)
+    spec.metadata["allowed_push_host"] = "https://rubygems.org"
+  else
+    raise "RubyGems 2.0 or newer is required to protect against " \
+      "public gem pushes."
+  end
+
+  # 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 { |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.extensions = ["ext/multi_string_replace/extconf.rb"]
+
+  spec.add_development_dependency "bundler", "~> 1.16"
+  spec.add_development_dependency "pry-byebug"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "rspec", "~> 3.0"
+  spec.add_development_dependency "rake-compiler"
+end

metadata

@@ -0,0 +1,140 @@
+--- !ruby/object:Gem::Specification
+name: multi_string_replace
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Joseph Dayo
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2018-09-28 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.16'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.16'
+- !ruby/object:Gem::Dependency
+  name: pry-byebug
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !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: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+- !ruby/object:Gem::Dependency
+  name: rake-compiler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+description: Efficient O(N) multiword string replace for ruby
+email:
+- joseph.dayo@gmail.com
+executables: []
+extensions:
+- ext/multi_string_replace/extconf.rb
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- ".travis.yml"
+- CODE_OF_CONDUCT.md
+- Gemfile
+- Gemfile.lock
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/benchmark.rb
+- bin/console
+- bin/setup
+- ext/multi_string_replace/aho_queue.c
+- ext/multi_string_replace/aho_queue.h
+- ext/multi_string_replace/aho_text.h
+- ext/multi_string_replace/aho_trie.c
+- ext/multi_string_replace/aho_trie.h
+- ext/multi_string_replace/ahocorasick.c
+- ext/multi_string_replace/ahocorasick.h
+- ext/multi_string_replace/extconf.rb
+- ext/multi_string_replace/multi_string_replace.c
+- lib/multi_string_replace.rb
+- lib/multi_string_replace/version.rb
+- multi_string_replace.gemspec
+homepage: https://github.com/jedld
+licenses:
+- MIT
+metadata:
+  allowed_push_host: https://rubygems.org
+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.7.7
+signing_key: 
+specification_version: 4
+summary: Efficient O(N) multiword string replace for ruby
+test_files: []